Studia Logica 79 (2):163 - 230 (2005)
|Abstract||In the present paper the well-known Gödels – Churchs argument concerning the undecidability of logic (of the first order functional calculus) is exhibited in a way which seems to be philosophically interestingfi The natural numbers are not used. (Neither Chinese Theorem nor other specifically mathematical tricks are applied.) Only elementary logic and very simple set-theoretical constructions are put into the proof. Instead of the arithmetization I use the theory of concatenation (formalized by Alfred Tarski). This theory proves to be an appropriate tool. The decidability is defined directly as the property of graphical discernibility of formulas.|
|Keywords||No keywords specified (fix it)|
|Through your library||Configure|
Similar books and articles
Calvin C. Elgot & Michael O. Rabin (1966). Decidability and Undecidability of Extensions of Second (First) Order Theory of (Generalized) Successor. Journal of Symbolic Logic 31 (2):169-181.
Paul C. Rosenbloom (1950/2005). The Elements of Mathematical Logic. New York]Dover Publications.
Alfred B. Manaster (1975). Completeness, Compactness, and Undecidability: An Introduction to Mathematical Logic. Prentice-Hall.
Karen Crawley, Limited Ink : Interpreting and Misinterpreting GÜdel's Incompleteness Theorem in Legal Theory.
Miklós Erdélyi-Szabó (2000). Undecidability of the Real-Algebraic Structure of Models of Intuitionistic Elementary Analysis. Journal of Symbolic Logic 65 (3):1014-1030.
Solomon Feferman (2008). My Route to Arithmetization. Theoria 63 (3):168-181.
Alfred Tarski (1968/2010). Undecidable Theories. Amsterdam, North-Holland Pub. Co..
Added to index2009-01-28
Total downloads39 ( #29,813 of 549,074 )
Recent downloads (6 months)3 ( #25,722 of 549,074 )
How can I increase my downloads?