Lower complexity bounds in justification logic (Q408543): Difference between revisions

@@ Property / DOI @@
-.1016/j.apal.2011.09.010
@@ Property / DOI: 10.1016/j.apal.2011.09.010 / rank @@
-Normal rank
@@ Property / review text @@
+Exact lower complexity bounds are established for several justification logics.
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B45
@@ Property / Mathematics Subject Classification ID: 03B45 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6022772
@@ Property / zbMATH DE Number: 6022772 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+justification logic
@@ Property / zbMATH Keywords: justification logic / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+logic of proofs
@@ Property / zbMATH Keywords: logic of proofs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+computational complexity
@@ Property / zbMATH Keywords: computational complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+\(\Pi^p_2\)-completeness
@@ Property / zbMATH Keywords: \(\Pi^p_2\)-completeness / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+derivability problem
@@ Property / zbMATH Keywords: derivability problem / rank @@
+Normal rank
@@ Property / reviewed by @@
+Grigori Mints
@@ Property / reviewed by: Grigori Mints / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.apal.2011.09.010
+Normal rank
@@ Property / OpenAlex ID @@
+W2138829493
@@ Property / OpenAlex ID: W2138829493 / rank @@
+Normal rank
@@ Property / cites work @@
+A Complexity Question in Justification Logic
@@ Property / cites work: A Complexity Question in Justification Logic / rank @@
+Normal rank
@@ Property / cites work @@
+Q3007238
@@ Property / cites work: Q3007238 / rank @@
+Normal rank
@@ Property / cites work @@
+Explicit Provability and Constructive Semantics
@@ Property / cites work: Explicit Provability and Constructive Semantics / rank @@
+Normal rank
@@ Property / cites work @@
+Justified common knowledge
@@ Property / cites work: Justified common knowledge / rank @@
+Normal rank
@@ Property / cites work @@
+THE LOGIC OF JUSTIFICATION
@@ Property / cites work: THE LOGIC OF JUSTIFICATION / rank @@
+Normal rank
@@ Property / cites work @@
+Why Do We Need Justification Logic?
@@ Property / cites work: Why Do We Need Justification Logic? / rank @@
+Normal rank
@@ Property / cites work @@
+Logical Omniscience Via Proof Complexity
@@ Property / cites work: Logical Omniscience Via Proof Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Introducing Justification into Epistemic Logic
@@ Property / cites work: Introducing Justification into Epistemic Logic / rank @@
+Normal rank
@@ Property / cites work @@
+The deduction rule and linear and near-linear proof simulations
+Normal rank
@@ Property / cites work @@
+Justifications for common knowledge
@@ Property / cites work: Justifications for common knowledge / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Reflected Fragments of Justification Logics
+Normal rank
@@ Property / cites work @@
+Q3128959
@@ Property / cites work: Q3128959 / rank @@
+Normal rank
@@ Property / cites work @@
+The logic of proofs, semantically
@@ Property / cites work: The logic of proofs, semantically / rank @@
+Normal rank
@@ Property / cites work @@
+Justification logics and hybrid logics
@@ Property / cites work: Justification logics and hybrid logics / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of the reflected logic of proofs
+Normal rank
@@ Property / cites work @@
+Q2753686
@@ Property / cites work: Q2753686 / rank @@
+Normal rank
@@ Property / cites work @@
+Annual Meeting of the Association for Symbolic Logic
+Normal rank
@@ Property / cites work @@
+Self-referential justifications in epistemic logic
+Normal rank
@@ Property / cites work @@
+The Computational Complexity of Provability in Systems of Modal Propositional Logic
+Normal rank
@@ Property / cites work @@
+Derivability in certain subsystems of the logic of proofs is \(\Pi_2^p\)-complete
+Normal rank
@@ Property / cites work @@
+Q4376067
@@ Property / cites work: Q4376067 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4822945
@@ Property / cites work: Q4822945 / rank @@
+Normal rank
@@ Property / cites work @@
+The polynomial-time hierarchy
@@ Property / cites work: The polynomial-time hierarchy / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.APAL.2011.09.010
@@ Property / DOI: 10.1016/J.APAL.2011.09.010 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:408543