Constructibility in higher order arithmetics

Archive for Mathematical Logic 32 (6):381-389 (1993)
  Copy   BIBTEX

Abstract

We define and investigate constructibility in higher order arithmetics. In particular we get an interpretation ofn-order arithmetic inn-order arithmetic without the scheme of choice such that ∈ and the property “to be a well-ordering” are absolute in it and such that this interpretation is minimal among such interpretations

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,853

External links

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

Through your library

Analytics

Added to PP
2013-12-01

Downloads
10 (#1,193,699)

6 months
1 (#1,471,470)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Interpretations of the alternative set theory.A. Sochor - 1993 - Archive for Mathematical Logic 32 (6):391-398.
Choices of Convenient Sets.Antonín Sochor - 1994 - Mathematical Logic Quarterly 40 (1):51-60.

Add more citations

References found in this work

Interpretations of the alternative set theory.A. Sochor - 1993 - Archive for Mathematical Logic 32 (6):391-398.

Add more references