Logical Omniscience Via Proof Complexity
From MaRDI portal
Publication:3613333
DOI10.1007/11874683_9zbMath1225.03016OpenAlexW1494449308MaRDI QIDQ3613333
Roman Kuznets, Sergej N. Artemov
Publication date: 12 March 2009
Published in: Computer Science Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11874683_9
Logic in artificial intelligence (68T27) Logics of knowledge and belief (including belief change) (03B42) Complexity of proofs (03F20)
Related Items (13)
The Logic of Uncertain Justifications ⋮ Semirings of Evidence ⋮ Logical omniscience as infeasibility ⋮ The logic of justified belief, explicit knowledge, and conclusive evidence ⋮ The logic of uncertain justifications ⋮ Lower complexity bounds in justification logic ⋮ The Logic of Justification ⋮ Justification Logic ⋮ Feasible operations on proofs: the logic of proofs for bounded arithmetic ⋮ Reasoning with Justifications ⋮ The NP-Completeness of Reflected Fragments of Justification Logics ⋮ Knowledge, Time, and Logical Omniscience ⋮ On Definitive Solutions of Strategic Games
This page was built for publication: Logical Omniscience Via Proof Complexity
