From GTC to \textsc{Reset}: generating reset proof systems from cyclic proof systems

DOI10.1016/J.APAL.2024.103485MaRDI QIDQ6584957zbMATH OpenFDO

Authors Graham E. Leigh, Dominik Wehr

Publication date 8 August 2024

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.APAL.2024.103485

zbMATH Keywords

cyclic proofsproofs with namesreset proofs

Mathematics Subject Classification ID

Abstract deductive systems (03B22) Proof theory in general (including proof-theoretic semantics) (03F03) Structure of proofs (03F07) Complexity of proofs (03F20)

Cites work

• A proof system with names for modal -calculus
• Abstract cyclic proofs
• Cyclic arithmetic is equivalent to Peano arithmetic
• Cyclic hypersequent calculi for some modal logics with the master modality
• Cyclic proofs for transfinite expressions
• From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
• Games for the -calculus
• scientific article; zbMATH DE number 1956528 (Why is no real title available?)
• scientific article; zbMATH DE number 7297836 (Why is no real title available?)
• Lyndon Interpolation for Modal $$\mu $$-Calculus
• On global induction mechanisms in aμ-calculus with explicit approximations
• Theories of Programming Languages
• Theory of computation.
• Uniform interpolation from cyclic proofs: the case of modal mu-calculus
• ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES

Cited in

(2)

• Intuitionistic -calculus with the Lewis arrow
• Demystifying

This page was built for publication: From GTC to \textsc{Reset}: generating reset proof systems from cyclic proof systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6584957)