Efficient loop-check for backward proof search in some non-classical propositional logics (Q4645239): Difference between revisions

@@ 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/3-540-61208-4_14
+Normal rank
@@ Property / OpenAlex ID @@
+W1497109150
@@ Property / OpenAlex ID: W1497109150 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3867808
@@ Property / cites work: Q3867808 / rank @@
+Normal rank
@@ Property / cites work @@
+Contraction-free sequent calculi for intuitionistic logic
+Normal rank
@@ Property / cites work @@
+Proof methods for modal and intuitionistic logics
@@ Property / cites work: Proof methods for modal and intuitionistic logics / rank @@
+Normal rank
@@ Property / cites work @@
+Q4281686
@@ Property / cites work: Q4281686 / rank @@
+Normal rank
@@ Property / cites work @@
+Relations between propositional normal modal logics: an overview
+Normal rank
@@ Property / cites work @@
+An <b><i>O</i>(<i>n</i> log <i>n</i>)</b>-Space Decision Procedure for Intuitionistic Propositional Logic
+Normal rank
@@ Property / cites work @@
+Q5812175
@@ Property / cites work: Q5812175 / rank @@
+Normal rank
@@ Property / cites work @@
+The Computational Complexity of Provability in Systems of Modal Propositional Logic
+Normal rank
@@ Property / cites work @@
+Q5636857
@@ Property / cites work: Q5636857 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:4645239