The undecidability of grisin's set theory
Studia Logica 74 (3):345 - 368 (2003)
| Abstract | We investigate a contractionless naive set theory, due to Grisin [11]. We prove that the theory is undecidable. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,701 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesF. A. Muller (2005). Deflating Skolem. Synthese 143 (3):223--53.
Leon Horsten & Philip Welch (2007). The Undecidability of Propositional Adaptive Logic. Synthese 158 (1):41 - 60.
F. A. Muller (2005). Deflating Skolem. Synthese 143 (3):223 - 253.
Andrzej Grzegorczyk (2005). Undecidability Without Arithmetization. Studia Logica 79 (2):163 - 230.
Kazushige Terui (2004). Light Affine Set Theory: A Naive Set Theory of Polynomial Time. Studia Logica 77 (1):9 - 40.
Craig Smoryński (1982). The Finite Inseparability of the First-Order Theory of Diagonalisable Algebras. Studia Logica 41 (4):347 - 349.
Zach Weber (2010). Extensionality and Restriction in Naive Set Theory. Studia Logica 94 (1).
A. Weir (1998). Naïve Set Theory is Innocent! Mind 107 (428):763-798.
Alfred Tarski (1968/2010). Undecidable Theories. Amsterdam, North-Holland Pub. Co..
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads21 ( #58,767 of 549,113 )Recent downloads (6 months)1 ( #63,361 of 549,113 )How can I increase my downloads? |
My notes
Discussion
