scientific article
From MaRDI portal
Publication:2753686
zbMath0973.03075MaRDI QIDQ2753686
Publication date: 3 December 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modal logic (including the logic of norms) (03B45) Logic programming (68N17) Complexity of proofs (03F20)
Related Items (20)
Probabilistic Justification Logic ⋮ NEXP-Completeness and Universal Hardness Results for Justification Logic ⋮ Derivability in certain subsystems of the logic of proofs is \(\Pi_2^p\)-complete ⋮ The logic of uncertain justifications ⋮ Conservativity for logics of justified belief: two approaches ⋮ Lower complexity bounds in justification logic ⋮ The Logic of Justification ⋮ Justification Logic ⋮ Interacting explicit evidence systems ⋮ A complexity question in justification logic ⋮ Tracking Evidence ⋮ The logic of proofs, semantically ⋮ On the complexity of the reflected logic of proofs ⋮ Referential logic of proofs ⋮ The complexity of satisfiability in non-iterated and iterated probabilistic logics ⋮ The NP-Completeness of Reflected Fragments of Justification Logics ⋮ Conservativity for Logics of Justified Belief ⋮ Symmetric Logic of Proofs ⋮ Non-circular proofs and proof realization in modal logic ⋮ Justification Logics with Probability Operators
This page was built for publication:
