Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent
From MaRDI portal
Publication:5079741
DOI10.4230/LIPIcs.CSL.2018.17OpenAlexW2888803631MaRDI QIDQ5079741
Liron Cohen, Reuben N. S. Rowe
Publication date: 28 May 2022
Full work available at URL: https://dblp.uni-trier.de/db/conf/csl/csl2018.html#0001R18
completenessinductiontransitive closuresoundnessstandard semanticsinfinitary proof systemscyclic proof systemshenkin semantics
Related Items (5)
Cyclic hypersequent system for transitive closure logic ⋮ Non-well-founded deduction for induction and coinduction ⋮ Integrating induction and coinduction via closure operators and proof cycles ⋮ Cyclic proofs, hypersequents, and transitive closure logic ⋮ Geometric Rules in Infinitary Logic
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamental properties of infinite trees
- Proof theory. 2nd ed
- Handbook of proof theory
- Completeness for ancestral logic via a computationally-meaningful semantics
- A cut-free cyclic proof system for Kleene algebra
- Untersuchungen über das logische Schliessen. I
- Beweistheoretische Erfassung der unendlichen Induktion in der Zahlentheorie
- Ancestral Logic: A Proof Theoretical Study
- Cyclic Arithmetic Is Equivalent to Peano Arithmetic
- Classical System of Martin-Löf’s Inductive Definitions Is Not Equivalent to Cyclic Proof System
- Sequent calculi for induction and infinite descent
- Cyclic proofs of program termination in separation logic
- General Models and Completeness of First-Order Modal -calculus
- Formalised Inductive Reasoning in the Logic of Bunched Implications
- Accessible Independence Results for Peano Arithmetic
- The relative efficiency of propositional proof systems
- Completeness in the theory of types
- Automatically verifying temporal properties of pointer programs with cyclic proof
This page was built for publication: Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent
