Pages that link to "Item:Q2988375"
From MaRDI portal
The following pages link to Classical System of Martin-Löf’s Inductive Definitions Is Not Equivalent to Cyclic Proof System (Q2988375):
Displaying 9 items.
- Intuitionistic Podelski-Rybalchenko theorem and equivalence between inductive definitions and cyclic proofs (Q1798782) (← links)
- Non-well-founded deduction for induction and coinduction (Q2055840) (← links)
- Induction and Skolemization in saturation theorem proving (Q2084957) (← links)
- Cyclic proofs, hypersequents, and transitive closure logic (Q2104539) (← links)
- Cyclic Arithmetic Is Equivalent to Peano Arithmetic (Q2988374) (← links)
- Classical System of Martin-Löf’s Inductive Definitions Is Not Equivalent to Cyclic Proof System (Q2988375) (← links)
- Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent (Q5079741) (← links)
- (Q5079760) (← links)
- Cyclic hypersequent system for transitive closure logic (Q6050767) (← links)
