On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics

DOI10.2178/bsl/1208358842zbMath1166.03011OpenAlexW2080313050MaRDI QIDQ5387294

Ian Pratt-Hartmann

Publication date: 8 May 2008

Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/bsl/1208358842

zbMATH Keywords

computational complexitysatisfiability problemincompletenessnumerically definite relational syllogismnumerically definite syllogism

Mathematics Subject Classification ID

Logic of natural languages (03B65) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (9)

The syllogistic with unity ⋮ Completing the Picture: Complexity of Graded Modal Logics with Converse ⋮ A novel algorithmic construction for deductions of categorical polysyllogisms by Carroll's diagrams ⋮ INTERLEAVING LOGIC AND COUNTING ⋮ Quantitative Logic Reasoning ⋮ Fuzzy Syllogisms, Numerical Square, Triangle of Contraries, Inter-bivalence ⋮ A system of relational syllogistic incorporating full Boolean reasoning ⋮ Easy solutions for a hard problem? The computational complexity of reciprocals with quantificational antecedents ⋮ One-variable logic meets Presburger arithmetic

Cites Work

• Unnamed Item
• Complexly fractionated syllogistic quantifiers
• More fragments of language.
• Probabilistic satisfiability
• On the logic of few, many, and most
• The numerical syllogism and existential presupposition
• Carathéodory bounds for integer cones
• Pure numerical Boolean syllogisms
• Complexity of the two-variable fragment with counting quantifiers
• PSPACE Reasoning for Graded Modal Logics
• The Uncertain Reasoner's Companion
• Numerical term logic

This page was built for publication: On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics