Abstract
We prove that the strong Markov's rule with only set parameters is admissible in the full set theory with intuitionistic logic mis|The work was supported by Reseach Scientific Foundation of Russian Ministry of Transport
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Troelstra A. Metamathematical investigations of intuitionistic arithmetic and analysis. Lecture Notes in Mathematics, 344, (1973), chapter Y.
Friedman H. Classically and intuitionistically provably recursive functions. Lecture Notes in Mathematics, 669, (1977), 21–27. New kinds of realizability and Markov's Rule. Soviet Mathematical Dokl.,v.251, 3, (1980), 534–537
Powell W. Extending Gödel's negative interpretation to ZF. The journal of Symbolic Logic, v.40, 2, (1975), 221–229.
Myhill J. Some properties of intuitionistic Zermelo-Fraenkel set theory. Lecture Notes in Mathematics, 337, (1973), 206–231.
Khakhanian V. The independence of collection from DCS-principle in the intuitionistic set theory. Proceedings of the Higher Academic Establishments, series Mathematics, 2, (1993), 81–83 (in Russian).
Gavrilenko Y. About admissibility of Markov's rule in the intuitionistic arithmetic. In book: II Soviet-Finnish colloquium, (1979), 12–15 (in Russin).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Khakhanian, V.K. (1997). Markov's rule is admissible in the set theory with intuitionistic logic. In: Gottlob, G., Leitsch, A., Mundici, D. (eds) Computational Logic and Proof Theory. KGC 1997. Lecture Notes in Computer Science, vol 1289. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63385-5_41
Download citation
DOI: https://doi.org/10.1007/3-540-63385-5_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63385-3
Online ISBN: 978-3-540-69806-7
eBook Packages: Springer Book Archive