The syllogistic with unity

DOI10.1007/s10992-012-9229-3zbMath1272.03134arXiv1110.2317OpenAlexW2119305898MaRDI QIDQ2377188

Ian Pratt-Hartmann

Publication date: 28 June 2013

Published in: Journal of Philosophical Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1110.2317

zbMATH Keywords

computational complexityproof theorysyllogismslogic and natural language

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Logic of natural languages (03B65)

Cites Work

• Unnamed Item
• Unnamed Item
• The Hamiltonian syllogistic
• Carathéodory bounds for integer cones
• Pure numerical Boolean syllogisms
• What is a syllogism?
• No Syllogisms for the Numerical Syllogistic
• On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics
• Completeness of an ancient logic
• LOGICS FOR THE RELATIONAL SYLLOGISTIC
• Numerical term logic

This page was built for publication: The syllogistic with unity