Some Results on a Game-Semantic Approach to Verifying Finitely-Presentable Infinite Structures (Extended Abstract)

DOI10.1007/11874683_2MaRDI QIDQ3613327zbMATH OpenOpenAlexFDO

Authors

Publication date 12 March 2009

Published in Computer Science Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11874683_2

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 1903345
• A game semantics for proof search (preliminary results)
• On Game Semantics of the Affine and Intuitionistic Logics
• scientific article; zbMATH DE number 1231521
• scientific article; zbMATH DE number 1163933
• Game-theoretic semantics for \(\mathrm{ATL}^+\) with applications to model checking
• scientific article; zbMATH DE number 1472846
• Contraction-free proofs and finitary games for linear logic
• Verification of Higher-Order Computation: A Game-Semantic Approach

Cited in

(3)

• Handshake games
• Payoffs, intensionality and abstraction in games
• Verification of Higher-Order Computation: A Game-Semantic Approach

This page was built for publication: Some Results on a Game-Semantic Approach to Verifying Finitely-Presentable Infinite Structures (Extended Abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3613327)