Markov’s principle for propositional type theory (2001)
Cached
Download Links
| Venue: | Computer Science Logic, Proceedings of the 10 th Annual Conference of the EACSL |
| Citations: | 7 - 5 self |
BibTeX
@INPROCEEDINGS{Kopylov01markov’sprinciple,
author = {Alexei Kopylov and Aleksey Nogin},
title = {Markov’s principle for propositional type theory},
booktitle = {Computer Science Logic, Proceedings of the 10 th Annual Conference of the EACSL},
year = {2001},
pages = {570--584},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. In this paper we show how to extend a constructive type theory with a principle that captures the spirit of Markov’s principle from constructive recursive mathematics. Markov’s principle is especially useful for proving termination of specific computations. Allowing a limited form of classical reasoning we get more powerful resulting system which remains constructive and valid in the standard constructive semantics of a type theory. We also show that this principle can be formulated and used in a propositional fragment of a type theory.
