A faithful interpretation of the intuitionistic propositional calculus by means of an initial segment of the Medvedev lattice
- 42 Downloads
KeywordsInitial Segment Propositional Calculus Intuitionistic Propositional Calculus Medvedev Lattice Faithful Interpretation
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 1.Yu. T. Medvedev, “Degrees of difficulty of mass problems,” Dokl. Akad. Nauk SSSR,104, No. 4, 501–504 (1955).Google Scholar
- 2.Yu. T. Medvedev, “Finite problems,” Dokl. Akad. Nauk SSSR,142, No. 5, 1015–1018 (1962).Google Scholar
- 3.H. J. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1969).Google Scholar
- 4.H. Rasiowa and R. sikorski, The Mathematics of Metamathematics, Nauka, Moscow (1972).Google Scholar
- 5.V. A. Yankov, “Three sequences of formulas with two variables in positive propositional logic,” Izv. Akad. Nauk SSSR, Ser. Mat.,32, No. 4, 880–883 (1968).Google Scholar
- 6.Yu. T. Medvedev, “On interpretation of logical formulas by means of finite problems,” Dokl. Akad. Nauk SSSR,169, No. 1, 20–24 (1966).Google Scholar
- 7.L. L. Maksimova, D. P. Skvortsov, and V. P. Shekhtman, “On the impossibility of finite axiomatization of the logic of finite problems,” Dokl. Akad. Nauk SSSR,245, No. 5, 1051–1054 (1979).Google Scholar
- 8.A. A. Muchnik, “On strong and weak reducibility of algorithmic problems,” Sib. Mat. Zh.,4, No. 6, 1328–1341 (1963).Google Scholar
- 9.A. N. Lachlan, “Distributive initial segments of the degrees of unsolvability,” Z. Math. Logik Grundl. Math.,14, No. 5, 457–472 (1968).Google Scholar
© Plenum Publishing Corporation 1988