Automated Deduction in Classical and Non-Classical Logics

Invited Papers.- Automated Theorem Proving in First-Order Logic Modulo: On the Difference between Type Theory and Set Theory.- Higher-Order Modal Logic-A Sketch.- Proving Associative-Commutative Termination Using RPO-Compatible Orderings.- Decision Procedures and Model Building or How to Improve Logical Information in Automated Deduction.- Replacement Rules with Definition Detection.- Contributed Papers.- On the Complexity of Finite Sorted Algebras.- A Further and Effective Liberalization of the ?-Rule in Free Variable Semantic Tableaux.- A New Fast Tableau-Based Decision Procedure for an Unquantified Fragment of Set Theory.- Interpretation of a Mizar-Like Logic in First Order Logic.- An ((n * log n)3)-Time Transformation from Grz into Decidable Fragments of Classical First-Order Logic.- Implicational Completeness of Signed Resolution.- An Equational Re-engineering of Set Theories.- Issues of Decidability for Description Logics in the Framework of Resolution.- Extending Decidable Clause Classes via Constraints.- Completeness and Redundancy in Constrained Clause Logic.- Effective Properties of Some First Order Intuitionistic Modal Logics.- Hidden Congruent Deduction.- Resolution-Based Theorem Proving for SH n-Logics.- Full First-Order Sequent and Tableau Calculi With Preservation of Solutions and the Liberalized ?-Rule but Without Skolemization.

[1]  P. J. Cohen.  Set Theory and the Continuum Hypothesis , 1966 .

[2]  J. Krivine,et al.  Introduction to Axiomatic Set Theory , 1971 .

[3]  P. A. J. Noel,et al.  Experimenting with Isabelle in ZF set theory , 1993, Journal of Automated Reasoning.

[4]  William McCune,et al.  OTTER 3.0 Reference Manual and Guide , 1994 .

[5]  Larry Wos.  The problem of finding an inference rule for set theory , 2004, Journal of Automated Reasoning.

[6]  Larry Wos,et al.  Automated reasoning - 33 basic research problems , 1988 .

[7]  Ewa Orlowska,et al.  Relational Semantics for Nonclassical Logics: Formulas are Relations , 1994 .

[8]  Domenico Cantone,et al.  What Is Computable Set Theory , 1990 .

[9]  Andrea Formisano,et al.  Plan of Activities on the Map Calculus , 1998, APPIA-GULP-PRODE.

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

[11]  C PaulsonLawrence.  Set theory for verification. I , 1993 .

[12]  Steven R. Givant.  The structure of relation algebras generated by relativizations , 1994 .

[13]  Gunther Schmidt,et al.  Relation algebras: Concept of points and representability , 1985, Discret. Math..

[14]  A. Tarski,et al.  A Formalization Of Set Theory Without Variables , 1987 .

[15]  Gunther Schmidt,et al.  On the Smooth Calculation of Relational Recursive Expressions out of First-Order Non-Constructive Specifications Involving Quantifiers , 1993, Formal Methods in Programming and Their Applications.

[16]  J. W. Addison,et al.  Automated development of fundamental mathematical theories , 1992 .

[17]  A. Tarski,et al.  Sur les ensembles finis , 1924 .

[18]  Art Quaife,et al.  Automated deduction in von Neumann-Bernays-Gödel set theory , 1992, Journal of Automated Reasoning.

[19]  Alessandra Cavarra.  On Existentially Quantified Conjunctions of Atomic Formulae of L , 1997 .

[20]  Marcelo F. Frias,et al.  A Finite Axiomatization for Fork Algebras , 1997, Log. J. IGPL.

[21]  Alberto Policriti,et al.  Expressing infinity without foundation , 1991, Journal of Symbolic Logic.

[22]  Ivo Düntsch.  Rough Relation Algebras , 1994, Fundam. Informaticae.

[23]  W. Quine,et al.  Set Theory and Its Logic. , 1965 .

[24]  Joseph R. Shoenfield,et al.  Mathematical logic , 1967 .

[25]  Dave Barker-Plummer,et al.  −-match: An inference rule for incrementally elaborating set instantiations , 2004, Journal of Automated Reasoning.

[26]  C. J. Everett.  Review: Roger C. Lyndon, The Representation of Relational Algebras , 1951 .

[27]  Johan G. F. Belinfante.  Gödel's Algorithm for Class Formation , 2000, CADE.

[28]  Alfred Tarski,et al.  Relational selves as self-affirmational resources , 2008 .

[29]  Eugenio G. Omodeo.  Solvable set/hyperset context , 1995, JFPLC.