Abstract
The most reliable method for how the validity of a logical syllogism can be verified is to formalize it and show that there is either a formal proof or it is true in any model. A specific method for proving validity is to use special rules that have been used by logicians. However, we cannot be sure that they indeed verify the validity of syllogisms. The goal of this paper is to show that the rules indeed work. In his book [15], Peterson studied syllogisms with intermediate quantifiers and suggested extension of the rules also to them. In this paper, we formalize them and prove that a logical syllogism of Figure I with intermediate quantifiers is valid iff it satisfies four extended Peterson’s rules.
OP PIK CZ.01.1.02/0.0/0.0/17147/0020575 AI-Met4Laser: Consortium for industrial research and development of new applications of laser technologies using artificial intelligence methods (10/2020–6/2023), of the Ministry of Industry and Trade of the Czech Republic.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
We write this interval as a union of two intervals to emphasize the role of the central point \(v_S\) which represents “typical medium”.
- 2.
- 3.
Recall that the quantifiers \(\forall \) and \(\exists \) are in fuzzy logic interpreted by \(\bigwedge \) and \(\bigvee \), respectively.
- 4.
Many authors speak about terms instead of formulas. We call S, P, M formulas as is common in logic.
References
Cignoli, R.L.O., D’Ottaviano, I.M.L., Mundici, D.: Algebraic Foundations of Many-valued Reasoning. Kluwer, Dordrecht (2000)
Gainor, J.: What is distribution in categorical syllogisms (2011). https://www.youtube.com/watch?v=7_Y-Bxr4apQ
Hájek, P.: Metamathematics of Fuzzy Logic. Kluwer, Dordrecht (1998)
Keenan, E.L., Westerståhl, D.: Generalized quantifiers in linguistics and logic. In: Benthem, J.V., Meulen, A.T. (eds.), Handbook of Logic and Language, Elsevier Ch. 15, pp. 837–893 (1997)
Mostowski, A.: On a generalization of quantifiers. Fundam. Math. 44, 12–36 (1957)
Murinová, P.: Graded structures of opposition in fuzzy natural logic. Log. Univers. 265, 495–522 (2020)
Murinová, P., Novák, V.: A formal theory of generalized intermediate syllogisms. Fuzzy Sets Syst. 186, 47–80 (2013)
Murinová, P., Novák, V.: The structure of generalized intermediate syllogisms. Fuzzy Sets Syst. 247, 18–37 (2014)
Murinová, P., Novák, V.: The theory of intermediate quantifiers in fuzzy natural logic revisited and the model of “many.” Fuzzy Sets Syst. 388, 56–89 (2020)
Novák, V.: A comprehensive theory of trichotomous evaluative linguistic expressions. Fuzzy Sets Syst. 159(22), 2939–2969 (2008)
Novák, V.: A formal theory of intermediate quantifiers. Fuzzy Sets Syst. 159(10), 1229–1246 (2008)
Novák, V., Murinová, P., Ferbas, P.: Formal analysis of Peterson’s rules for checking validity of syllogisms with intermediate quantifiers. Int. J. Approx. Reason. 150, 122–138 (2022)
Novák, V., Perfilieva, I., Dvořák, A.: Insight into Fuzzy Modeling. Wiley & Sons, Hoboken, New Jersey (2016)
Novák, V., Perfilieva, I., Močkoř, J.: Mathematical Principles of Fuzzy Logic. Kluwer, Boston (1999)
Peterson, P.: Intermediate Quantifiers. Logic, linguistics, and Aristotelian semantics. Ashgate, Aldershot (2000)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Murinová, P., Novák, V. (2023). Verifying Validity of Selected Forms of Syllogisms with Intermediate Quantifiers Using Peterson’s Rules. In: Massanet, S., Montes, S., Ruiz-Aguilera, D., González-Hidalgo, M. (eds) Fuzzy Logic and Technology, and Aggregation Operators. EUSFLAT AGOP 2023 2023. Lecture Notes in Computer Science, vol 14069. Springer, Cham. https://doi.org/10.1007/978-3-031-39965-7_30
Download citation
DOI: https://doi.org/10.1007/978-3-031-39965-7_30
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-39964-0
Online ISBN: 978-3-031-39965-7
eBook Packages: Computer ScienceComputer Science (R0)