Tree proofs for syllogistic
Studia Logica 48 (4):539 - 554 (1989)
| Abstract | This paper presents a tree method for testing the validity of inferences, including syllogisms, in a simple term logic. The method is given in the form of an algorithm and is shown to be sound and complete with respect to the obvious denotational semantics. The primitive logical constants of the system, which is indebted to the logical works of Jevons, Brentano and Lewis Carroll, are term negation, polyadic term conjunction, and functors affirming and denying existence, and use is also made of a metalinguistic concept of formal synonymy. It is indicated briefly how the method may be extended to other systems. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,653 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesDavid E. Copeland (2006). Theories of Categorical Reasoning and Extended Syllogisms. Thinking and Reasoning 12 (4):379 – 412.
Stephan Kepser & Jim Rogers (2011). The Equivalence of Tree Adjoining Grammars and Monadic Linear Context-Free Tree Grammars. Journal of Logic, Language and Information 20 (3):361-384.
Philip L. Peterson (1991). Complexly Fractionated Syllogistic Quantifiers. Journal of Philosophical Logic 20 (3):287 - 313.
Susanne Bobzien (1996). Stoic Syllogistic. Oxford Studies in Ancient Philosophy 14:133-92.
Edgar Andrade-Lotero & Catarina Dutilh Novaes (2012). Validity, the Squeezing Argument and Alternative Semantic Systems: The Case of Aristotelian Syllogistic. Journal of Philosophical Logic 41 (2):387-418.
Fred Johnson (1994). Syllogisms with Fractional Quantifiers. Journal of Philosophical Logic 23 (4):401 - 422.
Phil Corkum (forthcoming). Is Aristotle's Syllogistic a Logic? History and Philosophy of Logic.
John N. Martin (2001). Proclus and the Neoplatonic Syllogistic. Journal of Philosophical Logic 30 (3):187-240.
Maria Bonet, Toniann Pitassi & Ran Raz (1997). Lower Bounds for Cutting Planes Proofs with Small Coefficients. Journal of Symbolic Logic 62 (3):708-728.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads11 ( #99,396 of 548,977 )Recent downloads (6 months)1 ( #63,511 of 548,977 )How can I increase my downloads? |
My notes
Discussion
