Undecidability reconsidered

In A. Costa-Leite J. Y. Bezieau (ed.), Dimensions of Logical Concepts. pp. 33-68 (2007)
  Copy   BIBTEX

Abstract

In vol. 2 of Grundlagen der Mathematik Hilbert and Bernays carry out their undecid- ability proof of predicate logic basing it on their undecidability proof of the arithmeti- cal systemZ00. In this paper, the latter proof is reconstructed and summarized within a formal derivation schema. Formalizing the proof makes the presumed use of a meta language explicit by employing formal predicates as propositional functions, with ex- pressions as their arguments. In the final section of the paper, the proof is analyzed critically by applying Wittgenstein’s view on meta language, which does not lead to a questioning of the assumptions on which the proof is based but of its presumed use of meta language. Finally, it will be argued that determining if it is the undecidability proof or Wittgenstein’s analysis of meta language that is right depends on whether a decision procedure for a predicate that undecidability proofs have seemingly proven undecidable can nonetheless be defined. Thus serious attempts to define a procedure for such a predicate should not be ruled out without studying them.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Undecidable theories.Alfred Tarski - 1953 - Amsterdam,: North-Holland Pub. Co.. Edited by Andrzej Mostowski & Raphael M. Robinson.
Four Variables Suffice.Alasdair Urquhart - 2007 - Australasian Journal of Logic 5:66-73.
The undecidability of k-provability.Samuel R. Buss - 1991 - Annals of Pure and Applied Logic 53 (1):75-102.
The undecidability of k-provability.Samuel Buss - 1991 - Annals of Pure and Applied Logic 53 (1):75-102.
Rosser-Type Undecidable Sentences Based on Yablo’s Paradox.Taishi Kurahashi - 2014 - Journal of Philosophical Logic 43 (5):999-1017.
Provability logics with quantifiers on proofs.Rostislav E. Yavorsky - 2001 - Annals of Pure and Applied Logic 113 (1-3):373-387.
Wittgenstein's ab-Notation: An Iconic Proof Procedure.Timm Lampert - 2017 - History and Philosophy of Logic 38 (3):239-262.
The single-conclusion proof logic and inference rules specification.Vladimir N. Krupski - 2001 - Annals of Pure and Applied Logic 113 (1-3):181-206.
Canonical proof nets for classical logic.Richard McKinley - 2013 - Annals of Pure and Applied Logic 164 (6):702-732.
An approach to infinitary temporal proof theory.Stefano Baratella & Andrea Masini - 2004 - Archive for Mathematical Logic 43 (8):965-990.

Analytics

Added to PP
2017-09-08

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Author's Profile

Timm Lampert
Humboldt-University, Berlin

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references