scientific article; zbMATH DE number 1956528
From MaRDI portal
Publication:4417874
zbMath1029.03016MaRDI QIDQ4417874
Publication date: 30 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2620/26200425.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Structure of proofs (03F07)
Related Items (19)
Uniform interpolation from cyclic proofs: the case of modal mu-calculus ⋮ Unnamed Item ⋮ Size-based termination of higher-order rewriting ⋮ Cut elimination for a logic with induction and co-induction ⋮ Well-founded recursion with copatterns and sized types ⋮ Interactive programming in Agda – Objects and graphical user interfaces ⋮ Unnamed Item ⋮ Cyclic Arithmetic Is Equivalent to Peano Arithmetic ⋮ Temporal refinements for guarded recursive types ⋮ Canonical completeness of infinitary \(\mu \) ⋮ The Recursion Scheme from the Cofree Recursive Comonad ⋮ Compositional Coinduction with Sized Types ⋮ Unnamed Item ⋮ On the proof theory of the modal mu-calculus ⋮ Automatically verifying temporal properties of pointer programs with cyclic proof ⋮ Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent ⋮ Non-well-founded deduction for induction and coinduction ⋮ On global induction mechanisms in aμ-calculus with explicit approximations ⋮ Integrating induction and coinduction via closure operators and proof cycles
This page was built for publication:
