Knowledge, machines, and the consistency of Reinhardt's strong mechanistic thesis

DOI10.1016/S0168-0072(99)00048-2MaRDI QIDQ1591373zbMATH OpenFDO

Authors Timothy J. Carlson

Publication date 23 November 2001

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0168-0072(99)00048-2

zbMATH Keywords

epistemic arithmeticmodal logic S4theory of knowledgeTuring machine

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42) Modal logic (including the logic of norms) (03B45) Turing machines and related notions (03D10) First-order arithmetic and fragments (03F30)

Review text

William Reinhardt developed a modal theory of arithmetic called EA (Epistemic Arithmetic) in order to establish an axiomatic setting to carry out his analysis on the philosophical ramifications of Gödel's incompleteness theorems. He showed in this context that one cannot expect a formalization of ``I am a Turing machine, and I know which one to be consistent with EA, and conjectured instead the consistency of its weaker version called SMT (Strong Mechanistic Thesis) which is a formalization of ``I know I am a Turing machine. The main result of this paper, dedicated to his memory, is the affirmative answer to the conjecture. The author first shows how the intuitive notions of a knowing entity and a knowing machine are formalized in the language of EA, and then proves that EA and EA+SMT are indeed knowing machines by the method of ``stratification and ``collapsing of knowledge. The paper refers also to some closely related topics such as a general theory of knowledge, the theory of knowledge by means of Kripke semantics, and a relationship to Kleene's slash modified with modality by Shapiro.

Recommendations

• On computable beliefs of rational machines
• Consistency, mechanicalness, and the logic of the mind
• Mechanical intelligence and Godelian Arguments
• Mechanized metatheory revisited
• Wright on the Non-mechanizability of Intuitionist Reasoning
• scientific article; zbMATH DE number 2084820
• scientific article; zbMATH DE number 2080647

Cites work

• Absolute Versions of Incompleteness Theorems
• Disjunction and existence under implication in elementary intuitionistic formalisms
• Epistemic theories and the interpretation of Gödel's incompleteness theorems
• scientific article; zbMATH DE number 3891353 (Why is no real title available?)
• scientific article; zbMATH DE number 3970744 (Why is no real title available?)
• scientific article; zbMATH DE number 3995667 (Why is no real title available?)
• scientific article; zbMATH DE number 3190337 (Why is no real title available?)
• Necessity predicates and operators
• Ordinal arithmetic and \(\Sigma_1\)-elementarity
• The disjunction property implies the numerical existence property

Cited in

(19)

• Patterns of resemblance of order 2
• Pure patterns of order 2
• Pure \(\Sigma_2\)-elementarity beyond the core
• Patterns of resemblance and Bachmann-Howard fixed points
• Short-circuiting the definition of mathematical knowledge for an artificial general intelligence
• Arithmetical algorithms for elementary patterns
• Fast-collapsing theories
• An axiomatic version of Fitch's paradox
• A machine that knows its own code
• 2003 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquim '03
• A Glimpse of $$ \sum_{3} $$-elementarity
• Collapsing knowledge and epistemic Church's thesis
• Idealization, mechanism, and knowability
• scientific article; zbMATH DE number 7085039 (Why is no real title available?)
• Self-referential theories
• Elementary patterns of resemblance
• Strengthening Consistency Results in Modal Logic
• Nondeterministic first-order T-BAT logic
• The Bachmann-Howard structure in terms of _1-elementarity

This page was built for publication: Knowledge, machines, and the consistency of Reinhardt's strong mechanistic thesis

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