Loop-free calculus for modal logic S4. I (Q392988): 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/s10986-012-9151-y
+Normal rank
@@ Property / OpenAlex ID @@
+W4250632685
@@ Property / OpenAlex ID: W4250632685 / rank @@
+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 @@
+Q3241192
@@ Property / cites work: Q3241192 / rank @@
+Normal rank
@@ Property / cites work @@
+The Computational Complexity of Provability in Systems of Modal Propositional Logic
+Normal rank
@@ Property / cites work @@
+A loop-free decision procedure for modal propositional logics K4, S4 and S5
+Normal rank
@@ Property / cites work @@
+Q3247119
@@ Property / cites work: Q3247119 / rank @@
+Normal rank
@@ Property / cites work @@
+A New Method to Obtain Termination in Backward Proof Search For Modal Logic S4
+Normal rank
@@ Property / cites work @@
+A New Method to Obtain Termination in Backward Proof Search for Modal Logic S4
+Normal rank
@@ Property / cites work @@
+Q4716271
@@ Property / cites work: Q4716271 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:392988