From GTC to \textsc{Reset}: generating reset proof systems from cyclic proof systems
type: Item
instance of: scholarly article
title: From GTC to \textsc{Reset}: generating reset proof systems from cyclic proof systems
author: Graham E. Leigh
author: Dominik Wehr
published in: Annals of Pure and Applied Logic
publication date: 2024-08-08T00:00:00Z
Mathematics Subject Classification ID: 03F03
Mathematics Subject Classification ID: 03F07
Mathematics Subject Classification ID: 03B22
Mathematics Subject Classification ID: 03F20
zbMATH DE Number: 7894018
zbMATH Keywords: cyclic proofs
zbMATH Keywords: reset proofs
zbMATH Keywords: proofs with names
MaRDI profile type: Publication
cites work: Q5144634
cites work: Lyndon Interpolation for Modal $$\mu $$-Calculus
cites work: Abstract cyclic proofs
cites work: Uniform interpolation from cyclic proofs: the case of modal mu-calculus
cites work: ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
cites work: Cyclic proofs for transfinite expressions
cites work: Theory of computation.
cites work: Games for the \(\mu\)-calculus
cites work: From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
cites work: Theories of Programming Languages
cites work: Cyclic hypersequent calculi for some modal logics with the master modality
cites work: Cyclic Arithmetic Is Equivalent to Peano Arithmetic
cites work: On global induction mechanisms in aμ-calculus with explicit approximations
cites work: Q4417874
cites work: Q4994684
DOI: 10.1016/J.APAL.2024.103485
description: scientific article; zbMATH DE number 7894018