Undecidability of the Real-Algebraic Structure of Models of Intuitionistic Elementary Analysis

Journal of Symbolic Logic 65 (3):1014-1030 (2000)
  Copy   BIBTEX

Abstract

We show that true first-order arithmetic is interpretable over the real-algebraic structure of models of intuitionistic analysis built upon a certain class of complete Heyting algebras. From this the undecidability of the structures follows. We also show that Scott's model is equivalent to true second-order arithmetic. In the appendix we argue that undecidability on the language of ordered rings follows from intuitionistically plausible properties of the real numbers.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,045

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

Basic Predicate Calculus.Wim Ruitenburg - 1998 - Notre Dame Journal of Formal Logic 39 (1):18-46.
Classical and Intuitionistic Models of Arithmetic.Kai F. Wehmeier - 1996 - Notre Dame Journal of Formal Logic 37 (3):452-461.

Analytics

Added to PP
2009-01-28

Downloads
22 (#700,182)

6 months
12 (#304,552)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

References found in this work

Mathematical Intuitionism. Introduction to Proof Theory.A. G. Dragalin & E. Mendelson - 1990 - Journal of Symbolic Logic 55 (3):1308-1309.
A Topological Model for Intuitionistic Analysis with Kripke's Scheme.M. D. Krol - 1978 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 24 (25-30):427-436.
A new model for intuitionistic analysis.Philip Scowcroft - 1990 - Annals of Pure and Applied Logic 47 (2):145-165.

View all 6 references / Add more references