The role of quantifier alternations in cut elimination (Q2565988): Difference between revisions

@@ Property / DOI @@
-.1305/ndjfl/1117755147
@@ Property / DOI: 10.1305/ndjfl/1117755147 / 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.1305/ndjfl/1117755147
+Normal rank
@@ Property / OpenAlex ID @@
+W2078269136
@@ Property / OpenAlex ID: W2078269136 / rank @@
+Normal rank
@@ Property / cites work @@
+Computer Science Logic
@@ Property / cites work: Computer Science Logic / rank @@
+Normal rank
@@ Property / cites work @@
+The unprovability of small inconsistency. A study of local and global interpretability
+Normal rank
@@ Property / cites work @@
+Cut elimination and automatic proof procedures
@@ Property / cites work: Cut elimination and automatic proof procedures / rank @@
+Normal rank
@@ Property / cites work @@
+Depth of proofs, depth of cut-formulas and complexity of cut formulas
+Normal rank
@@ Property / DOI @@
+.1305/NDJFL/1117755147
@@ Property / DOI: 10.1305/NDJFL/1117755147 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2565988