scientific article; zbMATH DE number 2087442
From MaRDI portal
Publication:4738237
zbMath1077.03515MaRDI QIDQ4738237
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2303/23030357.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Categorical logic, topoi (03G30) Structure of proofs (03F07) Categorical semantics of formal languages (18C50)
Related Items
μ-Bicomplete Categories and Parity Games ⋮ Uniform interpolation from cyclic proofs: the case of modal mu-calculus ⋮ A Categorical Setting for Lower Complexity ⋮ Unnamed Item ⋮ Monotone recursive types and recursive data representations in Cedille ⋮ Safe recursion revisited. I: Categorical semantics for lower complexity ⋮ Cut elimination for a logic with induction and co-induction ⋮ The variable hierarchy for the games \(\mu \)-calculus ⋮ Cyclic Arithmetic Is Equivalent to Peano Arithmetic ⋮ Unnamed Item ⋮ A coinductive approach to proof search through typed lambda-calculi ⋮ Coinduction in Flow: The Later Modality in Fibrations ⋮ Canonical completeness of infinitary \(\mu \) ⋮ The Recursion Scheme from the Cofree Recursive Comonad ⋮ Ambiguous classes in \(\mu\)-calculi hierarchies ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the proof theory of the modal mu-calculus ⋮ Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent ⋮ Non-well-founded deduction for induction and coinduction ⋮ From Parity Games to Circular Proofs ⋮ Integrating induction and coinduction via closure operators and proof cycles
