The Ackermann approach for modal logic, correspondence theory and second-order reduction (Q420837): Difference between revisions

@@ Property / DOI @@
-.1016/j.jal.2012.01.001
@@ Property / DOI: 10.1016/j.jal.2012.01.001 / rank @@
-Normal rank
@@ Property / cites work @@
+Q2751353
@@ Property / cites work: Q2751353 / rank @@
+Normal rank
@@ Property / cites work @@
+Refutational theorem proving for hierarchic first-order theories
+Normal rank
@@ Property / cites work @@
+Q2744124
@@ Property / cites work: Q2744124 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3509049
@@ Property / cites work: Q3509049 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
+Normal rank
@@ Property / cites work @@
+Computing circumscription revisited: A reduction algorithm
+Normal rank
@@ Property / cites work @@
+Q3543581
@@ Property / cites work: Q3543581 / rank @@
+Normal rank
@@ Property / cites work @@
+Relational and Kleene-Algebraic Methods in Computer Science
+Normal rank
@@ Property / cites work @@
+Elementary canonical formulae: extending Sahlqvist's theorem
+Normal rank
@@ Property / cites work @@
+Q4250040
@@ Property / cites work: Q4250040 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4081211
@@ Property / cites work: Q4081211 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Second-Order Quantifier Elimination in Modal Logic
+Normal rank
@@ Property / cites work @@
+The Monotonous Elimination of Predicate Variables
@@ Property / cites work: The Monotonous Elimination of Predicate Variables / rank @@
+Normal rank
@@ Property / cites work @@
+On the Correspondence Between Modal and Classical Logic: an Automated Approach
+Normal rank
@@ Property / cites work @@
+Q4342096
@@ Property / cites work: Q4342096 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.JAL.2012.01.001
@@ Property / DOI: 10.1016/J.JAL.2012.01.001 / rank @@
+Normal rank