Article contents
Games and Definability For FPC
Published online by Cambridge University Press: 15 January 2014
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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1997
References
REFERENCES
- 7
- Cited by