Undecidability in diagonalizable algebras

Journal of Symbolic Logic

Volumn 62, Issue 1, 1997, Pages 79-116

  Shavrukov, V Yu ^a,b  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031285566     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2307/2275733     Document Type: Article

References (34)

1. M. A. AEAUIM.H3E, O HeKomopbix ceoücmeax ajizeôp Mazapu, JIoruKO-ceMaHTMMec-KVLe nccjie,noBaHM.H, MeuHnepeSa, T6njincn, 1981, pp. 111-127.
2. S. N. ARTEMOV and L. D. BEKLEMISHEV, On propositional quantifiers in probability logic, Notre Dame Journal of Formal Logic, vol. 34 (1993), pp. 401-419.
3. C. H. APTËMOB, O ModajibHbix MOZUK
4. C. H. APTËMOB, O ModajibHbix MOZUK
5. 0 + EXP, Logic and algebra (A. Ursini and P. Aglianò, editors), Marcel Dekker, New York, 1996, pp. 317-325.
6. L. D. BEKLEMISHEV, On bimodal logics of probability, Annals of Pure and Applied Logic, vol. 68 (1994), pp. 115-159.
7. Jl. Zl-BEKJIEMHUIEB, O Kjiaccuif>uKav,uu npono3uv,uonajibHbix JIOZUK doKasyeMocmu, Haeecmvjr A-KadeMuu Hay-K CCCP. Cepwr MameMamunecKcur, vol. 53 (1989), pp. 915-943, English translation: L. D. BEKLEMISHEV, On the classification of propositional provability logics, Mathematics of the USSR - Izvestiya, vol. 35 (1990), pp. 247-275.
8. Jl. Zl-BEKJIEMHUIEB, O Kjiaccuif>uKav,uu npono3uv,uonajibHbix JIOZUK doKasyeMocmu, Haeecmvjr A-KadeMuu Hay-K CCCP. Cepwr MameMamunecKcur, vol. 53 (1989), pp. 915-943, English translation: L. D. BEKLEMISHEV, On the classification of propositional provability logics, Mathematics of the USSR - Izvestiya, vol. 35 (1990), pp. 247-275.
9. A. BERARDUCCI, The interpretability logic of Peano arithmetic, this JOURNAL, vol. 55 (1990), pp. 1059-1089.
10. J. COCKE and M. MINSKY, Universality of Tag systems with P = 2, Journal of the Association for Computing Machinery, vol. 11 (1964), pp. 15-20.
11. G. DZHAPARIDZE, The logic of linear tolerance, Studia Logica, vol. 51 (1992), pp. 249-277.
12. _, A generalized notion of weak interpretability and the corresponding modal logic, Annals of Pure and Applied Logic, vol. 61 (1993), pp. 113-160.
13. S. FEFERMAN, Arithmetization of metamathematics in a general setting, Fundamenta Mathematicae, vol. 49 (1960), pp. 35-92.
14. P. HÁJEK and P. PUDLÁK, Metamathematics of first-order arithmetic, Springer-Verlag, Berlin, 1993.
15. E. HERRMANN, The undecidability of the elementary theory of the lattice of recursively enumerable sets (abstract), Frege Conference 1984 (G. Wechsung, editor), Akademie-Verlag, Berlin, 1984, pp. 66-72.
16. D. DE JONGH and F. VELTMAN, Provability logics for relative interpretability, Mathematical logic (P. P. Petkov. editor), Plenum Press, New York, 1990, pp. 31-42.
17. P. LINDSTRÖM, On partially conservative sentences and interpretability, Proceedings of the American Mathematical Society, vol. 91 (1984), pp. 436-443.
18. R. MAGARI, The diagonalizable algebras (the algebraization of the theories which express Theor.: II), Bollettino della Unione Matematica Italiana. Serie IV, vol. 12 (1975), pp. 117-125, Supplemento al fasc. 3.
19. _, Representation and duality theory for diagonalizable algebras (the algebraization of theories which express Theor; IV), Studia Logica, vol. 34 (1975), pp. 305-313.
20. M. L. MINSKY, Recursive unsolvability of Post's problem of "Tag" and other topics in theory of Turing machines, Annals of Mathematics. Second Series, vol. 74 (1961), pp. 437-455.
21. _, Computation: Finite and infinite machines, Prentice-Hall, Englewood Cliffs, 1967.
22. F. MONTAGNA, On the diagonalizable algebra of Peano arithmetic, Bollettino della Unione Matematica Italiana. Serie V, vol. 16-B (1979), pp. 795-812.
23. _, Interpretations of the first-order theory of diagonalizable algebras in Peano arithmetic, Studia Logica, vol. 39 (1980), pp. 347-354.
24. _, The undecidability of the first-order theory of diagonalizable algebras, Studia Logica, vol. 39 (1980), pp. 355-359.
25. V. Yu. SHAVRUKOV, A note on the diagonalizable algebras of PA and ZF, Annals of Pure and Applied Logic, vol. 61 (1993), pp. 161-173.
26. _, Subalgebras of diagonalizable algebras of theories containing arithmetic, Dissertationes Mathematicae, vol. 323 (1993).
27. C. SMORYŃSKI, The finite inseparability of the first-order theory of diagonalisable algebras, Studia Logica, vol. 41 (1982), pp. 347-349.
28. _, Fixed point algebras, Bulletin (New Series) of the American Mathematical Society, vol. 6 (1982), pp. 317-356.
29. _. Self-reference and modal logic, Springer-Verlag, New York, 1985.
30. R. I. SOARE, Recursively enumerable sets and degrees. A study of computable functions and computably generated sets, Springer-Verlag, Berlin, 1987.
31. R. M. SOLOVAY, Provability interpretations of modal logic, Israel Journal of Mathematics, vol. 25 (1976), pp. 287-304.
32. A. VISSER, The provability logics of recursively enumerable theories extending Peano Arithmetic at arbitrary theories extending Peano Arithmetic, Journal of Philosophical Logic, vol. 13 (1984), pp. 97-113.
33. D. ZAMBELLA, On the proofs of arithmetical completeness for interpretability logic, Notre Dame Journal of Formal Logic, vol. 33 (1992), pp. 542-551.
34. 0 + exp, Notre Dame Journal of Formal Logic, vol. 35 (1994), pp. 147-157.