Markov's Principle for Propositional Type Theory

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.

DOI: 10.1007/3-540-44802-0_40

Extracted Key Phrases

Cite this paper

@inproceedings{Kopylov2001MarkovsPF, title={Markov's Principle for Propositional Type Theory}, author={Alexei Kopylov and Aleksey Nogin}, booktitle={CSL}, year={2001} }