Can proofs be animated by games?
From MaRDI portal
Publication:3593497
zbMATH Open1182.03067MaRDI QIDQ3593497FDOQ3593497
Authors: Susumu Hayashi
Publication date: 20 July 2007
Recommendations
Computational learning theory (68Q32) Applications of game theory (91A80) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Mechanization of proofs and logical operations (03B35) Logic in computer science (03B70)
Cited In (6)
- Typed Lambda Calculi and Applications
- Games with 1-backtracking
- Interactive Learning-Based Realizability Interpretation for Heyting Arithmetic with EM 1
- Positive Arithmetic Without Exchange Is a Subclassical Logic
- A New Translation for Semi-classical Theories — Backtracking without CPS
- Erratum to: ``Between proof and truth
This page was built for publication: Can proofs be animated by games?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3593497)