Decidability of the class E by Maslov's inverse method

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6300 LNCS, Issue , 2010, Pages 529-537

  Mints, Grigori ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

automated deduction; decidable classes; inverse method

Indexed keywords

ARBITRARY FUNCTIONS; AUTOMATED DEDUCTION; CLASS E; DECIDABLE CLASSES; EXISTENTIAL QUANTIFIERS; FIRST ORDER; INVERSE METHODS; PREDICATE LOGIC; PROOF SEARCH;

COMPUTER SCIENCE; INVERSE PROBLEMS; TECHNICAL PRESENTATIONS;

COMPUTABILITY AND DECIDABILITY;

EID: 77956592291     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15025-8_26     Document Type: Conference Paper

References (14)

1. Chang, C., Lee, R.: Symbolic Logic and Mechanical Theorem Proving. Academic Press, New York (1973)
2. Andreka, H., van Benthem, J., Nemeti, I.: Modal Logics and Bounded Fragments of Predicate Logic. J. Philos. Log. 27, 217-230 (1998)
3. Davydov, G., Maslov, S., Mints, G., Orevkov, V., Slisenko, A.: A Computer Algorithm for Establishing Deducibility Based on Inverse Method. In: Seminars in Math., V.A. Steklov Math. Inst., vol.16, pp. 1-16 (1971)
4. Degtyarev, A., Voronkov, A.: The Inverse Method. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 179-272. Elsevier, Amsterdam (2001)
5. Dowek, G., Jiang, Y.: Eigenvariables, Bracketing and the Decidability of Positive Minimal Predicate Logic. Theor. Comput. Sci. 360, 193-208 (2006)
6. Gurevich, Y.: Decision Problem for the Logic of Predicates and Operations. Algebra and Log. 8(3), 284-308 (1968)
7. Maslov, S.: The Inverse Method for Logical Calculi. Trudy Mat. Inst. Steklov 98, 26-87 (1968)
8. Maslov, S., Mints, G.: Proof Search Theory and the Inverse Method (Russian). Supplement to the Russian Translation of the book by Chang and Lee [1], Nauka, Moscow, pp. 310-340 (1983)
9. Maslov, S., Orevkov, V.: Decidable Classes Reducible to the One-quantifier Class. Trudy Inst. Steklov 121, 57-66 (1972)
10. Maslov, S.: Connection between the Strategies of the Inverse Method and the Resolution Method Seminars in Math., vol.16, pp. 48-54. Plenum Press, New York (1971)
11. Mints, G.: Gentzen-type Systems and Resolution Rules. Part I. Propositional Logic. In: Martin-Löf, P., Mints, G. (eds.) COLOG 1988. LNCS, vol.417, pp. 198-231. Springer, Heidelberg (1990)
12. Mints, G.: Gentzen-type Systems and Resolution Rule. Part II. In: Logic Colloquium 1990. Lecture Notes in Logic, vol.2, pp. 163-190 (1994)
13. Mints, G.: Solvability of the Problem of Deducibility in LJ for the Class of Formulas not Containing Negative Occurrences of Quantifiers. Proc. Steklov Inst. of Mathematics 98, 135-145 (1971)
14. Orevkov, V.: One Decidable Class of Formulas of the Predicate Calculus with Function Symbols. In: Proceedings of the II-nd Symposium in Cybernetics, Tbilisi, p. 176 (1965)