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

@@ Property / review text @@
+Exact lower complexity bounds are established for several justification logics.
+Normal rank
@@ Property / reviewed by @@
+Grigori Mints
@@ Property / reviewed by: Grigori Mints / rank @@
+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

Revision as of 18:02, 29 June 2023