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

Categories

Keywords

Reprint years

DOI

10.2307/421149

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,063

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Model theoretic stability and definability of types, after A. grothendieck.Itaï Ben Yaacov - 2014 - Bulletin of Symbolic Logic 20 (4):491-496,.
Linear model theory for Lipschitz structures.Seyed-Mohammad Bagheri - 2014 - Archive for Mathematical Logic 53 (7-8):897-927.
Simulating polyadic modal logics by monadic ones.George Goguadze, Carla Piazza & Yde Venema - 2003 - Journal of Symbolic Logic 68 (2):419-462.
Logic in Finite Structures: Definability, Complexity, and Randomness.Scott Weinstein - 2002 - In Dale Jacquette (ed.), A Companion to Philosophical Logic. Malden, MA, USA: Wiley-Blackwell. pp. 332–348.
On uniform definability of types over finite sets.Vincent Guingona - 2012 - Journal of Symbolic Logic 77 (2):499-514.
A new spectrum of recursive models using an amalgamation construction.Uri Andrews - 2011 - Journal of Symbolic Logic 76 (3):883 - 896.
Is a spectrum of a non-disintegrated flat strongly minimal model complete theory in a language with finite signature.Uri Andrews & Omer Mermelstein - 2021 - Journal of Symbolic Logic 86 (4):1632-1656.
On definability of types of finite Cantor-Bendixson rank.Predrag Tanovic - 2011 - Mathematical Logic Quarterly 57 (3):256-260.
Polarized games.Olivier Laurent - 2004 - Annals of Pure and Applied Logic 130 (1-3):79-123.
Logics that define their own semantics.H. Imhof - 1999 - Archive for Mathematical Logic 38 (8):491-513.

Analytics

Added to PP
2009-01-28

Downloads
271 (#98,105)

6 months
19 (#148,073)

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.[author unknown] - 1949 - Revista Portuguesa de Filosofia 5 (3):357-357.

Add more references