Incompleteness of a formal system for infinitary finite-quantifier formulas
Journal of Symbolic Logic 36 (3):445-455 (1971)
| 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,711 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesH. Jerome Keisler (1998). Quantifier Elimination for Neocompact Sets. Journal of Symbolic Logic 63 (4):1442-1472.
Panu Raatikainen (2005). On the Philosophical Relevance of Gödel's Incompleteness Theorems. Revue Internationale de Philosophie 59 (4):513-534.
Carlo Cellucci (1993). From Closed to Open Systems. In J. Czermak (ed.), Philosophy of Mathematics, pp. 206-220. Hölder-Pichler-Tempsky.
Stål O. Aanderaa, Egon Börger & Harry R. Lewis (1982). Conservative Reduction Classes of Krom Formulas. Journal of Symbolic Logic 47 (1):110-130.
David Booth (1991). Logical Feedback. Studia Logica 50 (2):225 - 239.
Yoshihito Tanaka (2007). An Infinitary Extension of Jankov's Theorem. Studia Logica 86 (1):111 - 131.
John L. Bell, Infinitary Logic. Stanford Encyclopedia of Philosophy.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads3 ( #202,107 of 551,007 )Recent downloads (6 months)1 ( #63,425 of 551,007 )How can I increase my downloads? |
My notes
Discussion
