Interactive observability in Ludics: the geometry of tests
From MaRDI portal
Publication:817844
DOI10.1016/J.TCS.2005.10.042zbMATH Open1086.03049OpenAlexW2059515205MaRDI QIDQ817844FDOQ817844
Authors: Claudia Faggian
Publication date: 20 March 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.10.042
Recommendations
- Automata, Languages and Programming
- Towards Ludics Programming: Interactive Proof Search
- Game semantics and the geometry of backtracking: a new complexity analysis of interaction
- Geometry of interaction and the dynamics of proof reduction: a tutorial
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- scientific article; zbMATH DE number 6027053
- Interactive and probabilistic proof-checking
- Ludics with repetitions (Exponentials, Interactive types and Completeness)
- Model checking games for the quantitative \(\mu \)-calculus
- Model checking games for the quantitative \(\mu\)-calculus
Logic in artificial intelligence (68T27) Logic in computer science (03B70) Proof-theoretic aspects of linear logic and other substructural logics (03F52)
Cites Work
Cited In (5)
This page was built for publication: Interactive observability in Ludics: the geometry of tests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817844)