Games and definability for FPC

Bulletin of Symbolic Logic 3 (3):347-362 (1997)
  Copy   BIBTEX

Abstract

A new games model of the language FPC, a type theory with products, sums, function spaces and recursive types, is described. A definability result is proved, showing that every finite element of the model is the interpretation of some term of the language

Other Versions

No versions found

Analytics

Added to PP
2009-01-28

Downloads
341 (#133,776)

6 months
16 (#740,463)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Totality in arena games.Pierre Clairambault & Russ Harmer - 2010 - Annals of Pure and Applied Logic 161 (5):673-689.

Add more citations

References found in this work

A game semantics for linear logic.Andreas Blass - 1992 - Annals of Pure and Applied Logic 56 (1-3):183-220.
Atti del Congresso Internazionale di Filosofia. - 1949 - Revista Portuguesa de Filosofia 5 (3):357-357.

Add more references