(Mechanical) Reasoning on Infinite Extensive Games

Simple item page
dc.creatorLescanne, Pierre
dc.date2008-05-13
dc.date2008-05-28
dc.date.accessioned2026-07-07T12:18:50Z
dc.date.available2026-07-07T12:18:50Z
dc.descriptionIn order to better understand reasoning involved in analyzing infinite games in extensive form, we performed experiments in the proof assistant Coq that are reported here.
dc.description11 p
dc.identifierhttps://arxiv.org/abs/0805.1798
dc.identifierhttp://arxiv.org/abs/0805.1798
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/212547
dc.subjectComputer Science and Game Theory
dc.subjectLogic in Computer Science
dc.title(Mechanical) Reasoning on Infinite Extensive Games
dc.typetext

Files

Collections

arXiv