Springer Nature OA
open access
Timed Reachability in Logic
We discuss some recent approaches to game-theoretic semantics (GTS), a useful alternative to the traditional Tarski-style compositional semantics of logic. One attractive feature of GTS is that model-checking upper bounds for logical systems can often be obtained directly by considering the correspo
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The Path Not Taken: Duality in Reasoning about Program Execution#126599
- Reaching as Cheap as Possible in 1-clock Robust Weighted Timed Games#793755
- Reaching as Cheap as Possible in 1-clock Robust Weighted Timed Games#789750
- Possible Worlds Semantics#757252
- The Non-Categoricity of Logic (II). Multiple-Conclusions and Bilateralist Logics (In Romanian)#731845
Record · ID 1334995
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive