Aristotelian Syntax from a Computational–Combinatorial Point of View

DOI10.1093/logcom/exi048zbMath1092.03005DBLPjournals/logcom/Glashoff05OpenAlexW2002335098WikidataQ63987745 ScholiaQ63987745MaRDI QIDQ3371150

Klaus Glashoff

Publication date: 21 February 2006

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/75babb1e308926e362ca6b74b90d69a484729370

zbMATH Keywords

syllogistic logicAristotelian logicrule-based reduction relations

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)

Related Items (2)

A novel algorithmic construction for deductions of categorical polysyllogisms by Carroll's diagrams ⋮ AN INTENSIONAL LEIBNIZ SEMANTICS FOR ARISTOTELIAN LOGIC

This page was built for publication: Aristotelian Syntax from a Computational–Combinatorial Point of View