On non-axiomatizability of superintuitionistic predicate logics of some classes of well-founded and dually well-founded Kripke frames

Journal of Logic and Computation

Volumn 16, Issue 5, 2006, Pages 685-695

  Skvortsov, Dmitrij ^a  

^a All Russian Institute for Scientific and Technical Information   (Russian Federation)

Author keywords

11 hardness; Kripke semantics; Recursive axiomatizability; Superintuitionistic predicate logics

Indexed keywords

COMPUTATIONAL METHODS; DIGITAL ARITHMETIC; LOGIC PROGRAMMING; SEMANTICS;

CONSTANT DOMAINS; KRIPKE SEMANTICS; RECURSIVE AXIOMATIZABILITY; SUPERINTUITIONISTIC PREDICATE LOGICS;

FORMAL LOGIC;

EID: 33750708870     PISSN: 0955792X     EISSN: 1465363X     Source Type: Journal    
DOI: 10.1093/logcom/exl031     Document Type: Conference Paper

References (13)

1. D. M. Gabbay. Decidability of some intuitionistic predicate theories. J. Symb. Logic, 30, 579-587, 1972.
2. H. Ono. Model extension theorem and Craig's interpolation theorem for intermediate predicate logics. Rep. Math. Logic, 15, 41-58, 1983.
3. H. Ono. Some problems in intermediate predicate logics. Rep. on Math. Logic, 21, 55-67, 1987.
4. H. Ono. On finite linear intermediate predicate logics. Studia Logica, 47, 391 399, 1988.
5. H. Rogers. Theory of recursive functions and effective computability. MIT Press, Cambridge, MA, 1987.
6. D. Skvortsov. On axiomatizability of some intermediate predicate logics (summary). Rep. Math. Logic, 22, 115-116, 1988.
7. D. Skvortsov. The predicate logic of finite Kripke frames is not recursively axiomatizable. J. Symb. Logic, 70, 451-459, 2005.
8. D. Skvortsov. On non-axiomatizability of superintuitionistic predicate logics of dually well-founded Kripke frames. In International Conference 'Computer Science Applications of Modal. Logic', Moscow, September 5-9, 2005, Abstracts, pp. 41-42, Poncelet Lab. UMI 2615 of CNRS and Independent Univ. of Moscow, 2005.
9. D. Skvortsov. On non-axiomatizability of some superintuitionistic predicate logics. I. Predicate logics of well-ordered and dually well-ordered Kripke frames. II. Predicate logics of dually well-founded Kripke frames, in preparation.
10. C. A. Smoryński. Applications of Kripke models, In Metamathematical Investigations of Intuitionistic Arithmetic and Analysis, A. S. Troelstra, ed., Lecture Notes in Mathematics, Volume 344, pp. 324 391, Springer-Verlag, Berlin, Heidelberg, New York, 1973.
11. B. A. Trachtenbrot. Impossibility of an algorithm for the decision problem in finite classes. Doklady Akademii Nauk SSSR, 70, 569-572, 1950 (in Russian);
12. English translation: American Mathematical Society Translations, Series 2, 23, 1-5, 1963.
13. S. Yokota. Axiomatization of the first-order intermediate logics of bounded Kripkean heights, I. Zeitschr. für math. Logik und Grundl. der Math., 35, 415-421, 1989.