Classical System of Martin-Löf’s Inductive Definitions Is Not Equivalent to Cyclic Proof System (Q2988375): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-662-54458-7_18
+Normal rank
@@ Property / OpenAlex ID @@
+W2611853323
@@ Property / OpenAlex ID: W2611853323 / rank @@
+Normal rank
@@ Property / cites work @@
+Classical System of Martin-Löf’s Inductive Definitions Is Not Equivalent to Cyclic Proof System
+Normal rank
@@ Property / cites work @@
+Automated Reasoning with Analytic Tableaux and Related Methods
+Normal rank
@@ Property / cites work @@
+Cyclic proofs of program termination in separation logic
+Normal rank
@@ Property / cites work @@
+Automated Cyclic Entailment Proofs in Separation Logic
+Normal rank
@@ Property / cites work @@
+Sequent calculi for induction and infinite descent
+Normal rank
@@ Property / cites work @@
+Q4052071
@@ Property / cites work: Q4052071 / rank @@
+Normal rank
@@ Property / cites work @@
+Accessible Independence Results for Peano Arithmetic
+Normal rank
@@ Property / cites work @@
+Cyclic Arithmetic Is Equivalent to Peano Arithmetic
+Normal rank