Kreisel's analysis shows undecidability results like the halting problem can be established relative only to the formal system itself, without invoking Church's Thesis as a bridge principle to informal effectivity.
?Rate how convincing each reason is below to see the overall strength.
No one has weighed in yet. Be the first to share reasons for or against this statement.
Sign in or register to share your perspective on this statement.
Kreisel(as a historical figure in logic and philosophy of mathematics)
Georg Kreisel (1923–2015), a mathematical logician who studied how mathematical reasoning works and whether we can be certain about mathematical truths.
The halting problem(as a theoretical problem that seemed pointless but became foundational to computer science)
A famous question Turing asked: 'Can you write a set of instructions that can tell whether any other set of instructions will eventually finish running or keep going forever?' The answer turns out to be no—it's impossible.
Undecidability(Wittgenstein's usage in PR §174, alluding to algorithmic decidability)
The condition in which a bridge (connection) between symbols cannot be made with symbols.