Thick Subtrees, Games and Experiments

DOI10.1007/978-3-642-02273-9_7zbMath1246.03077OpenAlexW1566715239MaRDI QIDQ3637187

Pierre Boudes

Publication date: 7 July 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-02273-9_7

Mathematics Subject Classification ID

Logic in computer science (03B70) Structure of proofs (03F07) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items

Understanding Game Semantics Through Coherence Spaces, Realizability for Peano arithmetic with winning conditions in HON games, Jump from parallel to sequential proofs: exponentials, A Truly Concurrent Game Model of the Asynchronous $$\pi $$-Calculus, Unnamed Item, Interactive observability in Ludics: the geometry of tests

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• Polarized games
• Projecting sequential algorithms on strongly stable functions
• Syntax vs. semantics: A polarized approach
• Sequential algorithms and strongly stable functions
• Non-Uniform Hypercoherences
• Abstract Böhm trees
• Automata, Languages and Programming