Pages that link to "Item:Q2988374"
From MaRDI portal
The following pages link to Cyclic Arithmetic Is Equivalent to Peano Arithmetic (Q2988374):
Displaying 17 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)
- Integrating induction and coinduction via closure operators and proof cycles (Q2096458) (← links)
- Uniform interpolation from cyclic proofs: the case of modal mu-calculus (Q2142087) (← links)
- Classical System of Martin-Löf’s Inductive Definitions Is Not Equivalent to Cyclic Proof System (Q2988375) (← links)
- NON-WELL-FOUNDED PROOFS FOR THE GRZEGORCZYK MODAL LOGIC (Q5001550) (← links)
- Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent (Q5079741) (← links)
- (Q5079760) (← links)
- (Q5208872) (← links)
- (Q5227521) (← links)
- Coinduction in Flow: The Later Modality in Fibrations (Q5875348) (← links)
- Cyclic hypersequent system for transitive closure logic (Q6050767) (← links)
- Completeness of cyclic proofs for symbolic heaps with inductive definitions (Q6536318) (← links)
- Proof systems for the modal \(\mu \)-calculus obtained by determinizing automata (Q6541156) (← links)
- From GTC to \textsc{Reset}: generating reset proof systems from cyclic proof systems (Q6584957) (← links)
- Abstract cyclic proofs (Q6646012) (← links)
- Cyclic implicit complexity (Q6649449) (← links)
