An \(\mathsf{AC}^{1}\)-complete model checking problem for intuitionistic logic (Q475340): Difference between revisions

@@ Property / DOI @@
-.1007/s00037-013-0062-z
@@ Property / DOI: 10.1007/s00037-013-0062-z / rank @@
-Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B20
@@ Property / Mathematics Subject Classification ID: 03B20 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+D20
@@ Property / Mathematics Subject Classification ID: 06D20 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6374277
@@ Property / zbMATH DE Number: 6374277 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+complexity
@@ Property / zbMATH Keywords: complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+intuitionistic logic
@@ Property / zbMATH Keywords: intuitionistic logic / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+model checking
@@ Property / zbMATH Keywords: model checking / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+\(\mathsf{AC}^{1}\)
@@ Property / zbMATH Keywords: \(\mathsf{AC}^{1}\) / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Heyting algebra
@@ Property / zbMATH Keywords: Heyting algebra / 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.1007/s00037-013-0062-z
+Normal rank
@@ Property / OpenAlex ID @@
+W2072923153
@@ Property / OpenAlex ID: W2072923153 / rank @@
+Normal rank
@@ Property / cites work @@
+Circuits, matrices, and nonassociative computation
+Normal rank
@@ Property / cites work @@
+An Optimal Parallel Algorithm for Formula Evaluation
+Normal rank
@@ Property / cites work @@
+Alternation
@@ Property / cites work: Alternation / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
+Normal rank
@@ Property / cites work @@
+On formulas of one variable in intuitionistic propositional calculus
+Normal rank
@@ Property / cites work @@
+A taxonomy of problems with fast parallel algorithms
+Normal rank
@@ Property / cites work @@
+Logic and structure
@@ Property / cites work: Logic and structure / rank @@
+Normal rank
@@ Property / cites work @@
+Modal Logics Between S 4 and S 5
@@ Property / cites work: Modal Logics Between S 4 and S 5 / rank @@
+Normal rank
@@ Property / cites work @@
+Semantical investigations in Heyting's intuitionistic logic
+Normal rank
@@ Property / cites work @@
+Intuitionism. An introduction. 3rd revised ed
@@ Property / cites work: Intuitionism. An introduction. 3rd revised ed / rank @@
+Normal rank
@@ Property / cites work @@
+Q3965241
@@ Property / cites work: Q3965241 / rank @@
+Normal rank
@@ Property / cites work @@
+Intuitionistic implication without disjunction
@@ Property / cites work: Intuitionistic implication without disjunction / rank @@
+Normal rank
@@ Property / cites work @@
+There are infinitely many Diodorean modal functions
+Normal rank
@@ Property / cites work @@
+On closed elements in closure algebras
@@ Property / cites work: On closed elements in closure algebras / rank @@
+Normal rank
@@ Property / cites work @@
+Q2703802
@@ Property / cites work: Q2703802 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions
+Normal rank
@@ Property / cites work @@
+The model checking problem for propositional intuitionistic logic with one variable is AC 1 -complete
+Normal rank
@@ Property / cites work @@
+Intuitionistic implication makes model checking hard
+Normal rank
@@ Property / cites work @@
+On uniform circuit complexity
@@ Property / cites work: On uniform circuit complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q3509064
@@ Property / cites work: Q3509064 / rank @@
+Normal rank
@@ Property / cites work @@
+Intuitionistic propositional logic is polynomial-space complete
+Normal rank
@@ Property / cites work @@
+On the Tape Complexity of Deterministic Context-Free Languages
+Normal rank
@@ Property / cites work @@
+Implicational formulas in intuitionistic logic
@@ Property / cites work: Implicational formulas in intuitionistic logic / rank @@
+Normal rank
@@ Property / cites work @@
+On the polynomial-space completeness of intuitionistic propositional logic
+Normal rank
@@ Property / DOI @@
+.1007/S00037-013-0062-Z
@@ Property / DOI: 10.1007/S00037-013-0062-Z / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:475340