Abstract cyclic proofs
From MaRDI portal
Publication:6160752
DOI10.1007/978-3-031-15298-6_20OpenAlexW4297809295MaRDI QIDQ6160752FDOQ6160752
Authors: Bahareh Afshari, Dominik Wehr 
Publication date: 2 June 2023
Published in: Logic, Language, Information, and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-15298-6_20
Recommendations
Cites Work
- The size-change principle for program termination
- A focus system for the alternation-free \(\mu \)-calculus
- Title not available (Why is that?)
- Games for the \(\mu\)-calculus
- A proof system with names for modal \(\mu\)-calculus
- Uniform interpolation from cyclic proofs: the case of modal mu-calculus
- A tableau system for the modal \(\mu \)-calculus
- Title not available (Why is that?)
- Cyclic arithmetic is equivalent to Peano arithmetic
- Equivalence of inductive definitions and cyclic proofs under arithmetic
- Automated cyclic entailment proofs in separation logic
- PSPACE-completeness of a thread criterion for circular proofs in linear logic with least and greatest fixed points
- Title not available (Why is that?)
- Automatically verifying temporal properties of pointer programs with cyclic proof
- NON-WELL-FOUNDED PROOFS FOR THE GRZEGORCZYK MODAL LOGIC
Cited In (7)
- Cyclic proofs with ordering constraints
- From GTC to \textsc{Reset}: generating reset proof systems from cyclic proof systems
- Procedural representation of CIC proof terms
- Cyclic formality and index theorem
- Abstract cyclic proofs
- Title not available (Why is that?)
- Asymptotic cyclic expansion and bridge groups of formal proofs
This page was built for publication: Abstract cyclic proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6160752)
