Can Proofs Be Animated By Games?

Proof animation is a way of executing proofs to find errors in the formalization of proofs. It is intended to be “testing in proof engineering”. Although the realizability interpretation as well as the functional interpretation based on limit-computations were introduced as means for proof animation...

Full description

Saved in:
Bibliographic Details
Published inLecture notes in computer science pp. 11 - 22
Main Author Hayashi, Susumu
Format Book Chapter Conference Proceeding
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2005
Springer
SeriesLecture Notes in Computer Science
Subjects
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
Theoretical computing
Type theory
Artificial life
Game semantics
Lambda calculus
Program verification
Realizability
Online AccessGet full text

Cover

More Information
Summary:Proof animation is a way of executing proofs to find errors in the formalization of proofs. It is intended to be “testing in proof engineering”. Although the realizability interpretation as well as the functional interpretation based on limit-computations were introduced as means for proof animation, they were unrealistic as an architectural basis for actual proof animation tools. We have found game theoretical semantics corresponding to these interpretations, which is likely to be the right architectural basis for proof animation.
ISBN:3540255931
9783540255932
ISSN:0302-9743
1611-3349
DOI:10.1007/11417170_3