Representing the knowledge of Turing machines

DOI10.1007/BF01079208zbMath0799.03028MaRDI QIDQ1330015

Timothy Williamson, Hyun Song Shin

Publication date: 16 August 1994

Published in: Theory and Decision (Search for Journal in Brave)

zbMATH Keywords

consistencyknowledgeTuring machinecomputabilityignoranceepistemic logic S4

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Other nonclassical logic (03B60) Turing machines and related notions (03D10)

Related Items

On the logic of common belief and common knowledge, Logical omniscience as infeasibility, Some Computational Constraints in Epistemic Logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite automata play the repeated prisoner's dilemma
• Epistemic theories and the interpretation of Gödel's incompleteness theorems
• Agreeing to disagree
• On the logic of common belief and common knowledge
• Correlated Equilibrium as an Expression of Bayesian Rationality
• The Structure of Nash Equilibrium in Repeated Games with Finite Automata
• Transitivity follows from Dummett's axiom
• Rationality, Computability, and Nash Equilibrium
• Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
• Games with Incomplete Information Played by “Bayesian” Players, I–III Part I. The Basic Model
• Extensions of some theorems of Gödel and Church