Incompleteness, Mechanism, and Optimism

DOI10.2307/421032zbMath0921.03005OpenAlexW2060700159MaRDI QIDQ4227855

Stewart Shapiro

Publication date: 29 September 1999

Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: http://www.math.ucla.edu/~asl/bsl/0403-toc.htm

zbMATH Keywords

Church's thesisTuring machineincompletenessGödel's theoremsmechanistrecursively ensumerable

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) First-order arithmetic and fragments (03F30) General topics in artificial intelligence (68T01) Turing machines and related notions (03D10)

Related Items (5)

Penrose's new argument ⋮ Paraconsistent Computation and Dialetheic Machines ⋮ A metasemantic challenge for mathematical determinacy ⋮ Mathematical and Technological Computability ⋮ Mechanism, truth, and Penrose's new argument

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Turing projectability
• Which number theoretic problems can be solved in recursive progressions on Π₁¹-paths through O?
• Transfinite recursive progressions of axiomatic theories

This page was built for publication: Incompleteness, Mechanism, and Optimism