From GTC to \textsc{Reset}: generating reset proof systems from cyclic proof systems
From MaRDI portal
Publication:6584957
DOI10.1016/J.APAL.2024.103485MaRDI QIDQ6584957
Publication date: 8 August 2024
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Structure of proofs (03F07) Proof theory in general (including proof-theoretic semantics) (03F03) Abstract deductive systems (03B22) Complexity of proofs (03F20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Games for the \(\mu\)-calculus
- Uniform interpolation from cyclic proofs: the case of modal mu-calculus
- Cyclic hypersequent calculi for some modal logics with the master modality
- Theory of computation.
- Cyclic Arithmetic Is Equivalent to Peano Arithmetic
- ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
- Theories of Programming Languages
- On global induction mechanisms in aμ-calculus with explicit approximations
- From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
- Cyclic proofs for transfinite expressions
- Abstract cyclic proofs
- Lyndon Interpolation for Modal $$\mu $$-Calculus
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)
