On the degree of complexity of sentential logics. A couple of examples (Q1163542): Difference between revisions

@@ Property / cites work @@
+Constructing denumerable matrices strongly adequate for pre-finite logics
+Normal rank
@@ Property / cites work @@
+Q3909027
@@ Property / cites work: Q3909027 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4124817
@@ Property / cites work: Q4124817 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3268305
@@ Property / cites work: Q3268305 / rank @@
+Normal rank
@@ Property / cites work @@
+Deducibility and many-valuedness
@@ Property / cites work: Deducibility and many-valuedness / rank @@
+Normal rank
@@ Property / cites work @@
+The existence of matrices strongly adequate for E, R and their fragments
+Normal rank
@@ Property / cites work @@
+Some remarks on the consequence operation in sentential logics
+Normal rank
@@ Property / cites work @@
+Q4109644
@@ Property / cites work: Q4109644 / rank @@
+Normal rank
@@ Property / cites work @@
+Proof of a conjecture of Roman Suszko
@@ Property / cites work: Proof of a conjecture of Roman Suszko / rank @@
+Normal rank