Markov's Rule revisited

Archive for Mathematical Logic 30 (2):125-127 (1990)
  Copy   BIBTEX

Abstract

We consider HA*, that is Heyting's Arithmetic extended with transfinite induction over all recursive well orderings, which may be viewed as defining constructive truth, since PA* agrees with classical truth. We prove that Markov's Principle, as a schema, is not provable in HA*, but that HA* is closed under Markov's Rule.

Other Versions

No versions found

Links

PhilArchive

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2013-12-01

Downloads
75 (#776,095)

6 months
13 (#935,850)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Daniel M. Leivant
Indiana University, Bloomington

Citations of this work

Reverse Mathematics.Benedict Eastaugh - 2024 - The Stanford Encyclopedia of Philosophy.

Add more citations

References found in this work

Proof theory and constructive mathematics.Anne S. Troelstra - 1977 - In Jon Barwise, Handbook of mathematical logic. New York: North-Holland. pp. 973--1052.
On the Consistency of Certain Logical Calculus.P. S. Novikoff - 1946 - Journal of Symbolic Logic 11 (4):129-131.

Add more references