A cut-free cyclic proof system for Kleene algebra
From MaRDI portal
(Redirected from Publication:1694471)
Recommendations
Cited in
(24)- Non-well-founded deduction for induction and coinduction
- Cyclic proofs, hypersequents, and transitive closure logic
- Loop-check specification for a sequent calculus of temporal logic
- Uniform interpolation from cyclic proofs: the case of modal mu-calculus
- On regular expression proof complexity
- Automatic Proof Generation in Kleene Algebra
- scientific article; zbMATH DE number 515726 (Why is no real title available?)
- Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent
- Non-wellfounded proof theory for (Kleene+action)(algebras+lattices)
- scientific article; zbMATH DE number 7561320 (Why is no real title available?)
- scientific article; zbMATH DE number 7155168 (Why is no real title available?)
- Left-Handed Completeness for Kleene algebra, via Cyclic Proofs
- Cyclic hypersequent system for transitive closure logic
- Cyclic proofs for transfinite expressions
- A complete inference system for skip-free guarded Kleene algebra with tests
- Cyclic implicit complexity
- Cyclic system for an algebraic theory of alternating parity automata
- Herbrand schemes for cyclic proofs
- The failure of cut-elimination in cyclic proof for first-order logic with inductive definitions
- A proof theory of right-linear ( -)grammars via cyclic proofs
- A cyclic proof system for guarded Kleene algebra with tests
- A proof theory of ( -)context-free languages, via non-wellfounded proofs
- Cyclic implicit complexity
- Cyclic proofs in Hoare logic and its reverse
This page was built for publication: A cut-free cyclic proof system for Kleene algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1694471)
