A Rewriting Decision Procedure for Dijkstra-Scholten's Syllogistic Logic with Complements

We present an equational decision procedure a la Dijkstra & Scholten for the 'Syllogistic Logic with Complements'. Keywords: Syllogistic Logic with Complements, Decision Procedure, Equational Logic, Rewriting Logic, Maude.

[1]  S. Griffis.  EDITOR , 1997, Journal of Navigation.

[2]  Edsger W. Dijkstra,et al.  Predicate Calculus and Program Semantics , 1989, Texts and Monographs in Computer Science.

[3]  José Meseguer,et al.  Conditioned Rewriting Logic as a United Model of Concurrency , 1992, Theor. Comput. Sci..

[4]  Klaus Glashoff,et al.  Aristotelian Syntax from a Computational-Combinatorial Point of View , 2005, J. Log. Comput..

[5]  Fred B. Schneider,et al.  Equational Propositional Logic , 1995, Inf. Process. Lett..

[6]  José Meseguer,et al.  Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic , 2007, Theor. Comput. Sci..

[7]  Fred B. Schneider,et al.  A Logical Approach to Discrete Math , 1993, Texts and Monographs in Computer Science.

[8]  E. D. Giorgi.  Selected Papers , 2006 .

[9]  George Boolos,et al.  Computability and logic , 1974 .

[10]  Joseph T. Clark,et al.  Aristotle's Syllogistic from the Standpoint of Modern Formal Logic. , 1952 .

[11]  George Finlay Simmons,et al.  Introduction to Topology and Modern Analysis , 1963 .

[12]  Francesco Parisi Presicce.  Recent trends in algebraic development techniques : 12th International Workshop, WADT '97, Tarquinia, Italy, June 3-7, 1997 : selected papers , 1998 .

[13]  Narciso Martí-Oliet,et al.  All About Maude - A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic , 2007, All About Maude.

[14]  Lynn E. Rose,et al.  Aristotle's syllogistic , 1968 .

[15]  José Meseguer,et al.  Rewriting Logic as a Metalogical Framework , 2000, FSTTCS.

[16]  Lee C. Rice.  Aristotle's Syllogistic. By L. E. Rose. , 1969 .

[17]  Jieh Hsiang,et al.  Topics in Automated Theorem Proving and Program Generation , 1983 .

[18]  Philotheus Boehner.  Review: Jan Lukasiewicz, Aristotle's Syllogistic from the Standpoint of Modern Formal Logic , 1952 .

[19]  Vladimir Lifschitz.  On calculational proofs , 2001, Ann. Pure Appl. Log..

[20]  Joseph A. Goguen,et al.  Institutions: abstract model theory for specification and programming , 1992, JACM.

[21]  José Meseguer,et al.  Specification and proof in membership equational logic , 2000, Theor. Comput. Sci..

[22]  José Meseguer,et al.  Five Isomorphic Boolean Theories and Four Equational Decision Procedures , 2007 .

[23]  Jan Łukasiewicz.  Aristotle's Syllogistic From the Standpoint of Modern Formal Logic , 1957 .

[24]  Ephrem MacCarthy,et al.  Aristotle’s Syllogistic: From the Standpoint of Modern Formal Logic , 1952 .

[25]  José Meseguer,et al.  Sufficient Completeness Checking with Propositional Tree Automata , 2005 .

[26]  José Meseguer,et al.  Reflection in Membership Equational Logic, Many-Sorted Equational Logic, Horn Logic with Equality, and Rewriting Logic , 2004, WRLA.

[27]  Narciso Martí-Oliet,et al.  Maude: specification and programming in rewriting logic , 2002, Theor. Comput. Sci..

[28]  Nachum Dershowitz,et al.  Inference Rules for Rewrite-Based First-Order Theorem Proving , 1987, LICS.

[29]  John Corcoran,et al.  Completeness of an ancient logic , 1972, Journal of Symbolic Logic.

[30]  公庄 庸三.  Basic Algebra = 代数学入門 , 2002 .

[31]  Annie Foret,et al.  Rewrite Rule Systems for Modal Propositional Logic , 1988, J. Log. Program..