Journal of Symbolic Logic 65 (4):1785-1812 (2000)

Authors
Jeremy Avigad
Carnegie Mellon University
Abstract
A number of classical theories are interpreted in analogous theories that are based on intuitionistic logic. The classical theories considered include subsystems of first- and second-order arithmetic, bounded arithmetic, and admissible set theory.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI http://projecteuclid.org/euclid.jsl/1183746263
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 50,447
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Mathematical Method and Proof.Jeremy Avigad - 2006 - Synthese 153 (1):105-159.
Saturated Models of Universal Theories.Jeremy Avigad - 2002 - Annals of Pure and Applied Logic 118 (3):219-234.
The Metamathematics of Ergodic Theory.Jeremy Avigad - 2009 - Annals of Pure and Applied Logic 157 (2-3):64-76.

View all 7 citations / Add more citations

Similar books and articles

Interpreting Classical Theories in Constructive Ones.Jeremy Avigad - 2000 - Journal of Symbolic Logic 65 (4):1785-1812.
Forcing in Proof Theory.Jeremy Avigad - 2004 - Bulletin of Symbolic Logic 10 (3):305-333.
The Strength of Some Martin-Löf Type Theories.Edward Griffor & Michael Rathjen - 1994 - Archive for Mathematical Logic 33 (5):347-385.
On Skolemization in Constructive Theories.Matthias Baaz & Rosalie Iemhoff - 2008 - Journal of Symbolic Logic 73 (3):969-998.
Rules and Arithmetics.Albert Visser - 1999 - Notre Dame Journal of Formal Logic 40 (1):116-140.
Towards Applied Theories Based on Computability Logic.Giorgi Japaridze - 2010 - Journal of Symbolic Logic 75 (2):565-601.
Intuitionistic Completeness for First Order Classical Logic.Stefano Berardi - 1999 - Journal of Symbolic Logic 64 (1):304-312.
A Realizability Interpretation for Classical Arithmetic.Jeremy Avigad - 2002 - Bulletin of Symbolic Logic 8 (3):439-440.

Analytics

Added to PP index
2017-02-21

Total views
9 ( #848,948 of 2,326,341 )

Recent downloads (6 months)
1 ( #644,397 of 2,326,341 )

How can I increase my downloads?

Downloads

My notes