Review: A. S. Troelstra, J. E. Fenstad, Notions of Realizability for Intuitionistic Arithmetic and Intuitionistic Arithmetic in all Finite Types [Book Review]

Journal of Symbolic Logic 40 (4):625-625 (1975)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



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

External links

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

Through your library

My notes

Similar books and articles

Finite Sets and Natural Numbers in Intuitionistic TT.Daniel Dzierzgowski - 1996 - Notre Dame Journal of Formal Logic 37 (4):585-601.
Relativized realizability in intuitionistic arithmetic of all finite types.Nicolas D. Goodman - 1978 - Journal of Symbolic Logic 43 (1):23-44.
Minimal realizability of intuitionistic arithmetic and elementary analysis.Zlatan Damnjanovic - 1995 - Journal of Symbolic Logic 60 (4):1208-1241.
A note on Goodman's theorem.Ulrich Kohlenbach - 1999 - Studia Logica 63 (1):1-5.
Models of intuitionistic TT and N.Daniel Dzierzgowski - 1995 - Journal of Symbolic Logic 60 (2):640-653.
Classical arithmetic as part of intuitionistic arithmetic.Michael Potter - 1998 - Grazer Philosophische Studien 55 (1):127-41.
Some models for intuitionistic finite type arithmetic with Fan functional.A. S. Troelstra - 1977 - Journal of Symbolic Logic 42 (2):194-202.
Metamathematical investigation of intuitionistic arithmetic and analysis.Anne S. Troelstra - 1973 - New York,: Springer.
Finite sets and natural numbers in intuitionistic TT without extensionality.Daniel Dzierzgowski - 1998 - Studia Logica 61 (3):417-428.
The logic of first order intuitionistic type theory with weak sigma- elimination.M. D. G. Swaen - 1991 - Journal of Symbolic Logic 56 (2):467-483.
Provably recursive functions of constructive and relatively constructive theories.Morteza Moniri - 2010 - Archive for Mathematical Logic 49 (3):291-300.
A generalization of conservativity theorem for classical versus intuitionistic arithmetic.Stefano Berardi - 2004 - Mathematical Logic Quarterly 50 (1):41.
A negationless interpretation of intuitionistic theories. I.Victor N. Krivtsov - 2000 - Studia Logica 64 (1-2):323-344.
In defense of epistemic arithmetic.Leon Horsten - 1998 - Synthese 116 (1):1-25.
A negationless interpretation of intuitionistic theories.Victor N. Krivtsov - 2000 - Erkenntnis 53 (1-2):155-179.

Analytics

Added to PP
2013-11-22

Downloads
7 (#1,379,768)

6 months
1 (#1,469,469)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references