Skip to Main content Skip to Navigation
Journal articles

Finiteness spaces

Abstract : We investigate a new denotational model of linear logic based on the purely relational model. In this semantics, webs are equipped with a notion of "finitary" subsets satisfying a closure condition and proofs are interpreted as finitary sets. In spite of a formal similarity, this model is quite different from the usual models of linear logic (coherence semantics, hypercoherence semantics, the various existing game semantics...). In particular, the standard fix-point operators used for defining the general recursive functions are not finitary, although the primitive recursion operators are. This model can be considered as a discrete version of the Koethe space semantics introduced in a previous paper: we show how, given a field, each finiteness space gives rise to a vector space endowed with a linear topology, a notion introduced by Lefschetz in 1942, and we study the corresponding model where morphisms are linear continuous maps (a version of Girard's quantitative semantics with coefficients in the field). We obtain in that way a new model of the recently introduced differential lambda-calculus.
Document type :
Journal articles
Complete list of metadatas
Contributor : Thomas Ehrhard <>
Submitted on : Wednesday, May 30, 2007 - 12:22:55 AM
Last modification on : Tuesday, December 22, 2020 - 5:46:03 PM

Links full text




Thomas Ehrhard. Finiteness spaces. Mathematical Structures in Computer Science, Cambridge University Press (CUP), 2005, 15 (4), pp.615-646. ⟨10.1017/S0960129504004645⟩. ⟨hal-00150276⟩



Record views