Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Can proofs be animated by games?

From MaRDI portal
Publication:3593497
Jump to:navigation, search

zbMATH Open1182.03067MaRDI QIDQ3593497FDOQ3593497


Authors: Susumu Hayashi Edit this on Wikidata


Publication date: 20 July 2007





Recommendations

  • Typed Lambda Calculi and Applications
  • Towards the animation of proofs -- testing proofs by examples
  • Some remarks on relations between proofs and games
  • Towards a dialogic interpretation of dynamic proofs
  • scientific article; zbMATH DE number 2086734


Mathematics Subject Classification ID

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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3593497&oldid=17006389"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 5 February 2024, at 03:25. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki