Mathematical Text Processing in EA-style: a Sequent Aspect

The paper is devoted to the study of one of the aspects of the so-called Evidence Algorithm programme advanced by Academician V.M.~Glushkov and connected with the problem of automated theorem-proving search in the signature of first-order theories that can use different logics, such as classical, intuitionistic, and modal ones. An approach to the construction of such sequent logics (with or without equality) is described. It exploits the original notions of admissibility and compatibility, which permits to avoid preliminary skolemization being a forbidden operation for a number of non-classical logics in general. Following the approach, the cut-free sequent (modal) calculi avoiding the dependence of inference search on different orders of quantifier rules applications are described. Results on the coextensivity of sequent calculi are given. The research gives a way to the construction of computer-oriented quantifier-rule-free calculi for classical and intuitionistic logics and their modal extensions.

[1]  Arild Waaler,et al.  A Free Variable Sequent Calculus with Uniform Variable Splitting , 2003, TABLEAUX.

[2]  K. P. Vershinin,et al.  System for processing mathematical texts , 1979 .

[3]  Albert Rubio,et al.  Paramodulation-Based Theorem Proving , 2001, Handbook of Automated Reasoning.

[4]  Jacques Herbrand.  Recherches sur la théorie de la démonstration , 1930 .

[5]  Christoph Kreitz,et al.  A Uniform Proof Procedure for Classical and Non-Classical Logics , 1996, KI.

[6]  Jean H. Gallier,et al.  Logic for Computer Science: Foundations of Automatic Theorem Proving , 1985 .

[7]  V. V. Fedyurko,et al.  An algorithm for proving theorems in group theory , 1966 .

[8]  Jens Otten,et al.  A Connection Based Proof Method for Intuitionistic Logic , 1995, TABLEAUX.

[9]  Arild Waaler,et al.  Tableaux for Intuitionistic Logics , 1999 .

[10]  V. M. Glushkov,et al.  Some problems in the theories of automata and artificial intelligence , 1970 .

[11]  Reiner Hähnle,et al.  Tableaux and Related Methods , 2001, Handbook of Automated Reasoning.

[12]  Matthias Baaz,et al.  The Skolemization of existential quantifiers in intuitionistic logic , 2006, Ann. Pure Appl. Log..

[13]  Wolfgang Bibel,et al.  Automated Theorem Proving , 1987, Artificial Intelligence / Künstliche Intelligenz.

[14]  G. Gentzen.  Untersuchungen über das logische Schließen. I , 1935 .

[15]  K. P. Vershinin,et al.  Construction of a practical formal language for mathematical theories , 1972 .

[16]  Heiko Mantel,et al.  Simultaneous Quantifier Elimination , 1998, KI.

[17]  Alexander V. Lyaletski.  On Some Problems of Efficient Inference Search in First-Order Cut-Free Modal Sequent Calculi , 2008, 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing.

[18]  Stig Kanger,et al.  A Simplified Proof Method for Elementary Logic , 1959 .

[19]  Alexander V. Lyaletski,et al.  Evidence Algorithm and Sequent Logical Inference Search , 1999, LPAR.

[20]  Reinhold Letz,et al.  Model Elimination and Connection Tableau Procedures , 2001, Handbook of Automated Reasoning.

[21]  Konstantin Verchinine,et al.  System for Automated Deduction (SAD): Linguistic and Deductive Peculiarities , 2002, Intelligent Information Systems.

[22]  Christoph Kreitz,et al.  Connection-based Theorem Proving in Classical and Non-classical Logics , 1999, J. Univers. Comput. Sci..

[23]  Alexander V. Lyaletski.  Sequent forms of Herbrand theorem and their applications , 2005, Annals of Mathematics and Artificial Intelligence.