CONCATENATION AS A BASIS FOR Q AND THE INTUITIONISTIC VARIANT OF NELSON’S CLASSIC RESULT

CONCATENATION AS A BASIS FOR Q AND THE INTUITIONISTIC VARIANT OF NELSON’S CLASSIC RESULT (2008)

Cached

Download Links

by Rachel Sterken

BibTeX

@MISC{Sterken08concatenationas,
    author = {Rachel Sterken},
    title = {CONCATENATION AS A BASIS FOR Q AND THE INTUITIONISTIC VARIANT OF NELSON’S CLASSIC RESULT },
    year = {2008}
}

Bookmark

OpenURL

Abstract

Citations

106	Bounded Arithmetic. Bibliopolis - Buss - 1986
58	Undecidable Theories - Tarski, Mostowski, et al. - 1953
32	Predicative Arithmetic - Nelson - 1986
30	Concatenation as a basis for arithmetic - Quine - 1946
15	Some prime elements in the lattice of interpretability types - Pudlak - 1983
12	A lattice of chapters of mathematics (interpretations between theorems), volume 426 - Mycielski, Pudlak, et al. - 1990
11	Fixing Frege - Burgess - 2005
8	Mutual Interpretability of some essentially undecidable theories - Szmielew, Tarski - 1950
6	Faith & Falsity: a study of faithful interpretations and false Σ0 1-sentences - Visser
5	On the interpretability of Arithmetic in Set Theory. The Notre Dame - Collins, Halpern - 1970
4	Undecidability without arithmetization - Grzegorczyk - 2005
2	Nelson’s Work on Logic and Foundations and Other Reflections on the Foundations of Mathematics - Buss - 2006
2	A minimal predicative set theory - Montagna, Mancini
2	Growing commas: A study of sequentiality and concatenation. forthcoming - Visser - 2007
2	Pairs, sets and sequences in first order theories - Visser
1	An interpretation of robinson arithmetic in its grzegorczyk’s weaker variant. forthcoming - Svejdar - 2007
1	Cardinal arithmetic in weak theories. forthcoming - Visser - 2008