Computational modelling for combinatorial game strategies

DOI10.1016/J.JLAMP.2025.101097MaRDI QIDQ6847676zbMATH OpenFDO

Authors Răzvan Diaconescu

Publication date 9 March 2026

Published in Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JLAMP.2025.101097

zbMATH Keywords

algebraic computational modellingalgebraic specificationfinite combinatorial games

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• Algebraic specifications of computable and semicomputable data types
• All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
• An Oxford survey of order sorted algebra
• Bisimulation, modal logic and model checking games
• CafeOBJ Report. The language, proof techniques, and methodologies for object-oriented algebraicspecification
• Formal verification of parallel programs
• Foundations of algebraic specification and formal software development.
• Game theory
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 1216133 (Why is no real title available?)
• scientific article; zbMATH DE number 1099349 (Why is no real title available?)
• scientific article; zbMATH DE number 1889386 (Why is no real title available?)
• Institution-independent model theory (to appear)
• Institutions: abstract model theory for specification and programming
• Logical foundations of CafeOBJ
• On the algebra of structured specifications
• Specifications in an arbitrary institution
• SpeX: a rewriting-based formal specification environment
• Zermelo and the early history of game theory
• Über eine Anwendung der Mengenlehre auf die Theorie des Schachspiels.

This page was built for publication: Computational modelling for combinatorial game strategies

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