Graduate studies at Western
Journal of Philosophical Logic 42 (2):391-407 (2013)
|Abstract||We extend the language of the classical syllogisms with the sentence-forms “At most 1 p is a q” and “More than 1 p is a q”. We show that the resulting logic does not admit a finite set of syllogism-like rules whose associated derivation relation is sound and complete, even when reductio ad absurdum is allowed|
|Keywords||Syllogisms Proof theory Logic and natural language Computational complexity|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Ian Pratt-Hartmann (2008). On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics. Bulletin of Symbolic Logic 14 (1):1-28.
Phil Corkum (forthcoming). Is Aristotle's Syllogistic a Logic? History and Philosophy of Logic.
Ian Pratt-Hartmann (2011). The Hamiltonian Syllogistic. Journal of Logic, Language and Information 20 (4):445-474.
Ian Pratt-Hartmann (2004). Fragments of Language. Journal of Logic, Language and Information 13 (2):207-223.
Fred Johnson (1994). Syllogisms with Fractional Quantifiers. Journal of Philosophical Logic 23 (4):401 - 422.
Colwyn Williamson (1988). How Many Syllogisms Are There? History and Philosophy of Logic 9 (1):77-85.
Enrique Alvarez & Manuel Correia (2012). Syllogistic with Indefinite Terms. History and Philosophy of Logic 33 (4):297-306.
Marcin Mostowski & Jakub Szymanik (2007). Computational Complexity of Some Ramsey Quantifiers in Finite Models. The Bulletin of Symbolic Logic 13:281--282.
Don Emil Herget (1987). Non-Standard Categorical Syllogisms: Four That Leibniz Forgot. History and Philosophy of Logic 8 (1):1-13.
Ruggero Pagnan (2012). A Diagrammatic Calculus of Syllogisms. Journal of Logic, Language and Information 21 (3):347-364.
Philip L. Peterson (1991). Complexly Fractionated Syllogistic Quantifiers. Journal of Philosophical Logic 20 (3):287 - 313.
Nikolay Ivanov & Dimiter Vakarelov (2012). A System of Relational Syllogistic Incorporating Full Boolean Reasoning. Journal of Logic, Language and Information 21 (4):433-459.
Guy Politzer & Hugo Mercier (2008). Solving Categorical Syllogisms with Singular Premises. Thinking and Reasoning 14 (4):434 – 454.
Hugo Mercier & Guy Politzer (2011). Solving Categorical Syllogisms with Singular Premises. Thinking and Reasoning 14 (4):434-454.
Jakub Szymanik (2010). Computational Complexity of Polyadic Lifts of Generalized Quantifiers in Natural Language. Linguistics and Philosophy 33 (3):215-250.
Added to index2012-04-21
Total downloads25 ( #55,784 of 740,404 )
Recent downloads (6 months)1 ( #61,960 of 740,404 )
How can I increase my downloads?