Cites work
- A focus system for the alternation-free \(\mu \)-calculus
- A proof system with names for modal -calculus
- Abstract cyclic proofs
- Automated cyclic entailment proofs in separation logic
- Automated reasoning with analytic tableaux and related methods. 18th international conference, TABLEAUX 2009, Oslo, Norway, July 6--10, 2009. Proceedings
- Automatically verifying temporal properties of pointer programs with cyclic proof
- Cyclic arithmetic is equivalent to Peano arithmetic
- Cyclic proofs for transfinite expressions
- Cyclic proofs, hypersequents, and transitive closure logic
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Equivalence of inductive definitions and cyclic proofs under arithmetic
- Games for the -calculus
- scientific article; zbMATH DE number 6680140 (Why is no real title available?)
- scientific article; zbMATH DE number 7297836 (Why is no real title available?)
- scientific article; zbMATH DE number 7155168 (Why is no real title available?)
- Infinitary proof theory: the multiplicative additive case
- NON-WELL-FOUNDED PROOFS FOR THE GRZEGORCZYK MODAL LOGIC
- On a problem of formal logic.
- On global induction mechanisms in aμ-calculus with explicit approximations
- On the Logical Strength of Confluence and Normalisation for Cyclic Proofs.
- PSPACE-completeness of a thread criterion for circular proofs in linear logic with least and greatest fixed points
- Results on the propositional \(\mu\)-calculus
- Testing and generating infinite sequences by a finite automaton
- The size-change principle for program termination
- Traced monoidal categories
- Uniform interpolation from cyclic proofs: the case of modal mu-calculus
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 Q6646012)
