The lindenbaum fixed point algebra is undecidable
Studia Logica 50 (1):143 - 147 (1991)
| Abstract | We prove that the first order theory of the fixed point algebra corresponding to an r.e. consistent theory containing arithmetic is hereditarily 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,709 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesKatalin Bimbó (2007). $LE^{T}{Rightarrow}$ , $LR^{Circ}{Wedgesim}$ , LK and Cutfree Proofs. Journal of Philosophical Logic 36 (5):557 - 570.
J. L. Schellenberg (2005). The Hiddenness Argument Revisited (II). Religious Studies 41 (3):287 - 303.
V. Yu Shavrukov (1997). Undecidability in Diagonalizable Algebras. Journal of Symbolic Logic 62 (1):79-116.
H. E. Baber (1987). How Bad Is Rape? Hypatia 2 (2):125 - 138.
I. Janioka-Żuk (1980). Finite Axiomatization for Some Intermediate Logics. Studia Logica 39 (4):415 - 423.
P. X. Monaghan (2010). A Novel Interpretation of Plato's Theory of Forms. Metaphysica 11 (1):63-78.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads2 ( #232,684 of 551,007 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
