A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf
.
Infinitary Completeness in Ludics
2010
2010 25th Annual IEEE Symposium on Logic in Computer Science
Traditional Gödel completeness holds between finite proofs and infinite models over formulas of finite depth, where proofs and models are heterogeneous. Our purpose is to provide an interactive form of completeness between infinite proofs and infinite models over formulas of infinite depth (that include recursive types), where proofs and models are homogenous. We work on a nonlinear extension of ludics, a monistic variant of game semantics which has the same expressive power as the
doi:10.1109/lics.2010.47
dblp:conf/lics/BasaldellaT10
fatcat:vcnjuqapwvbybgv5zo46sf4gki