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

DOI10.1016/S0168-0072(99)00048-2zbMath0973.03019MaRDI QIDQ1591373

Timothy J. Carlson

Publication date: 23 November 2001

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

zbMATH Keywords

Turing machineepistemic arithmeticmodal logic S4theory of knowledge

Mathematics Subject Classification ID

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

Related Items

The Bachmann-Howard structure in terms of \(\Sigma_1\)-elementarity ⋮ Pure patterns of order 2 ⋮ Strengthening Consistency Results in Modal Logic ⋮ An axiomatic version of Fitch's paradox ⋮ A machine that knows its own code ⋮ Short-circuiting the definition of mathematical knowledge for an artificial general intelligence ⋮ Arithmetical algorithms for elementary patterns ⋮ Elementary patterns of resemblance ⋮ 2003 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquim '03 ⋮ Pure \(\Sigma_2\)-elementarity beyond the core ⋮ Patterns of resemblance of order 2 ⋮ Patterns of resemblance and Bachmann-Howard fixed points ⋮ SELF-REFERENTIAL THEORIES ⋮ A Glimpse of $$ \sum_{3} $$-elementarity ⋮ Fast-collapsing theories

Cites Work

• Epistemic theories and the interpretation of Gödel's incompleteness theorems
• Necessity predicates and operators
• Ordinal arithmetic and \(\Sigma_1\)-elementarity
• Disjunction and existence under implication in elementary intuitionistic formalisms
• The disjunction property implies the numerical existence property
• Absolute Versions of Incompleteness Theorems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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