Publication:4417874
From MaRDI portal
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
03B45: Modal logic (including the logic of norms)
03B70: Logic in computer science
68Q60: Specification and verification (program logics, model checking, etc.)
03F07: Structure of proofs
Related Items
On global induction mechanisms in aμ-calculus with explicit approximations, Size-based termination of higher-order rewriting, Unnamed Item, Unnamed Item, Unnamed Item, The Recursion Scheme from the Cofree Recursive Comonad, Well-founded recursion with copatterns and sized types, Interactive programming in Agda – Objects and graphical user interfaces, Compositional Coinduction with Sized Types, Automatically verifying temporal properties of pointer programs with cyclic proof, Canonical completeness of infinitary \(\mu \), On the proof theory of the modal mu-calculus, Cut elimination for a logic with induction and co-induction, Non-well-founded deduction for induction and coinduction, Uniform interpolation from cyclic proofs: the case of modal mu-calculus, Temporal refinements for guarded recursive types, Cyclic Arithmetic Is Equivalent to Peano Arithmetic