Idealization, mechanism, and knowability

DOI10.1093/ACPROF:OSO/9780198759591.003.0008MaRDI QIDQ5221595zbMATH OpenOpenAlexFDO

Authors Stewart Shapiro

Publication date 2 April 2020

Published in Gödel's Disjunction (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/acprof:oso/9780198759591.003.0008

zbMATH Keywords

absolute provabilityabsolute undecidabilityLucasmechanismPenrose

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Turing machines and related notions (03D10) Undecidability and degrees of sets of sentences (03D35) Gödel numberings and issues of incompleteness (03F40) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

Recommendations

• Incompleteness, Mechanism, and Optimism
• Intuitionists Are Not (Turing) Machines
• Knowledge, machines, and the consistency of Reinhardt's strong mechanistic thesis
• scientific article; zbMATH DE number 3853029
• Réalisme et antimécanisme chez K. Gödel

Cited in

(6)

• Absolute knowledge and scientific knowledge: A computational view
• Idealizations, Intertheory Explanations and Conditionals
• A machine that knows its own code
• Labelling ideality and subideality
• scientific article; zbMATH DE number 1870126 (Why is no real title available?)
• The explanatory dispensability of idealizations

This page was built for publication: Idealization, mechanism, and knowability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5221595)