The following pages link to (Q5144634):
Displaying 32 items.
- Effective cut-elimination for a fragment of modal mu-calculus (Q454366) (← links)
- Duality and the completeness of the modal \(\mu\)-calculus (Q671986) (← links)
- Syntactic cut-elimination for a fragment of the modal mu-calculus (Q714717) (← links)
- Canonical completeness of infinitary \(\mu \) (Q941442) (← links)
- Completeness for \(\mu\)-calculi: a coalgebraic approach (Q1731842) (← links)
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017 (Q1731963) (← links)
- Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics (Q1749477) (← links)
- Intuitionistic Podelski-Rybalchenko theorem and equivalence between inductive definitions and cyclic proofs (Q1798782) (← links)
- Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus. (Q1854336) (← links)
- A Buchholz rule for modal fixed point logics (Q1942334) (← links)
- Non-well-founded deduction for induction and coinduction (Q2055840) (← links)
- Integrating induction and coinduction via closure operators and proof cycles (Q2096458) (← links)
- Loop-check specification for a sequent calculus of temporal logic (Q2106881) (← links)
- Uniform interpolation from cyclic proofs: the case of modal mu-calculus (Q2142087) (← links)
- Cyclic hypersequent calculi for some modal logics with the master modality (Q2142089) (← links)
- A focus system for the alternation-free \(\mu \)-calculus (Q2142090) (← links)
- Loop-type sequent calculi for temporal logic (Q2228437) (← links)
- General Models and Completeness of First-Order Modal -calculus (Q3520232) (← links)
- An Easy Completeness Proof for the Modal μ-Calculus on Finite Trees (Q3557849) (← links)
- Sequent Calculi for the Modal -Calculus over S5 (Q3656762) (← links)
- A Note on Negative Tagging for Least Fixed-Point Formulae (Q4943549) (← links)
- NON-WELL-FOUNDED PROOFS FOR THE GRZEGORCZYK MODAL LOGIC (Q5001550) (← links)
- (Q5079760) (← links)
- Semirings of Evidence (Q5098741) (← links)
- (Q5129949) (← links)
- Coinduction in Flow: The Later Modality in Fibrations (Q5875348) (← links)
- Fixed point logics and definable topological properties (Q6149964) (← links)
- Proof systems for the modal \(\mu \)-calculus obtained by determinizing automata (Q6541156) (← links)
- Infinitary logic with infinite sequents: syntactic investigations (Q6561653) (← links)
- From GTC to \textsc{Reset}: generating reset proof systems from cyclic proof systems (Q6584957) (← links)
- Abstract cyclic proofs (Q6646012) (← links)
- Size measures and alphabetic equivalence in the \(\mu \)-calculus (Q6649448) (← links)
