An undecidable problem in correspondence theory
Journal of Symbolic Logic 56 (4):1261-1272 (1991)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| 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,653 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesBruno Scarpellini (2003). Comments on `Two Undecidable Problems of Analysis'. Minds and Machines 13 (1):79-85.
Schick (1985). In Defense of the Correspondence Theory. Philosophy Research Archives 11:319-334.
Patricia Marino (2006). What Should a Correspondence Theory Be and Do? Philosophical Studies 127 (3):415 - 457.
J. Siekmann & P. Szabó (1989). The Undecidability of the DA-Unification Problem. Journal of Symbolic Logic 54 (2):402 - 414.
Joohee Jeong (1999). A Decidable Variety That is Finitely Undecidable. Journal of Symbolic Logic 64 (2):651-677.
D. Patterson (2003). What is a Correspondence Theory of Truth? Synthese 137 (3):421 - 444.
Roger D. Maddux (1994). Undecidable Semiassociative Relation Algebras. Journal of Symbolic Logic 59 (2):398-418.
Thomas F. Kent (2006). The Π₃-Theory of the $\Sigma _{2}^{0}$ -Enumeration Degrees Is Undecidable. Journal of Symbolic Logic 71 (4):1284 - 1302.
Klaus Ambos-Spies, André Nies & Richard A. Shore (1992). The Theory of the Recursively Enumerable Weak Truth-Table Degrees is Undecidable. Journal of Symbolic Logic 57 (3):864-874.
Panu Raatikainen (2003). Some Strongly Undecidable Natural Arithmetical Problems, with an Application to Intuitionistic Theories. Journal of Symbolic Logic 68 (1):262-266.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads4 ( #178,434 of 548,977 )Recent downloads (6 months)1 ( #63,511 of 548,977 )How can I increase my downloads? |
My notes
Discussion
