From Parity Games to Circular Proofs

DOI10.1016/S1571-0661(04)80370-0zbMath1270.68197OpenAlexW2121890673MaRDI QIDQ2842563

Luigi Santocanale

Publication date: 15 August 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0661(04)80370-0

Mathematics Subject Classification ID

Games involving graphs (91A43) Abstract data types; algebraic specification (68Q65) Structure of proofs (03F07) Categories admitting limits (complete categories), functors preserving limits, completions (18A35) Categories of sets, characterizations (18B05)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An automata theoretic decision procedure for the propositional mu- calculus
• A game semantics for linear logic
• On full abstraction for PCF: I, II and III
• Matrix and matricial iteration theories. I
• Algebraic specification of data types: A synthetic approach
• Games and full completeness for multiplicative linear logic
• μ-Bicomplete Categories and Parity Games
• A Coalgebraic View of Infinite Trees and Iteration
• Deductive systems and categories
• Rudiments of \(\mu\)-calculus
• Parametric corecursion
• Free \(\mu\)-lattices

This page was built for publication: From Parity Games to Circular Proofs