A novel algorithmic construction for deductions of categorical polysyllogisms by Carroll's diagrams

DOI10.1016/j.ins.2021.07.029OpenAlexW3178184849MaRDI QIDQ6089954

Necla Kircali Gursoy, Ibrahim Senturk, Arif Gursoy, Tahsin Oner

Publication date: 15 December 2023

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2021.07.029

zbMATH Keywords

validitydeductiondecision algorithmpolysyllogismCarroll's diagrammatic system

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Logic in computer science (03B70) Categorical logic, topoi (03G30) Applications of computability and recursion theory (03D80)

Cites Work

• Unnamed Item
• Finite axiomatizability in Łukasiewicz logic
• An algebraic study of Peterson's intermediate syllogisms
• Traffic signal control on similarity logic reasoning.
• A new algorithmic decision for categorical syllogisms via Carroll's diagrams
• Contradiction separation based dynamic multi-clause synergized automated deduction
• An implication based study on Łukasiewicz (Monteiro) 3-valued algebra and pre-rough algebra
• Beyond Syllogisms: Carroll’s (Marked) Quadriliteral Diagram
• Aristotelian Syntax from a Computational–Combinatorial Point of View
• Lewis Carroll's visual logic
• Syllogistic Logics with Verbs
• Lewis Carroll's Formal Logic
• An algebraic analysis of categorical syllogisms by using Carroll’s diagrams
• On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics

This page was built for publication: A novel algorithmic construction for deductions of categorical polysyllogisms by Carroll's diagrams