A note on Goodman's theorem

Studia Logica 63 (1):1-5 (1999)
  Copy   BIBTEX

Abstract

Goodman's theorem states that intuitionistic arithmetic in all finite types plus full choice, HA + AC, is conservative over first-order intuitionistic arithmetic HA. We show that this result does not extend to various subsystems of HA, HA with restricted induction.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,593

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
2009-01-28

Downloads
43 (#324,761)

6 months
2 (#668,348)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On Goodman Realizability.Emanuele Frittaion - 2019 - Notre Dame Journal of Formal Logic 60 (3):523-550.

Add more citations

References found in this work

The theory of the gödel functionals.Nicolas D. Goodman - 1976 - Journal of Symbolic Logic 41 (3):574-582.

Add more references