Minimal lambda-theories by ultraproducts

Autor:	Bucciarelli, Antonio, Carraro, Alberto, Salibra, Antonino
Rok vydání:	2013
Předmět:	Computer Science - Logic in Computer Science F.4.1 F.3.2
Zdroj:	EPTCS 113, 2013, pp. 61-76
Druh dokumentu:	Working Paper
DOI:	10.4204/EPTCS.113.8
Popis:	A longstanding open problem in lambda calculus is whether there exist continuous models of the untyped lambda calculus whose theory is exactly the least lambda-theory lambda-beta or the least sensible lambda-theory H (generated by equating all the unsolvable terms). A related question is whether, given a class of lambda models, there is a minimal lambda-theory represented by it. In this paper, we give a general tool to answer positively to this question and we apply it to a wide class of webbed models: the i-models. The method then applies also to graph models, Krivine models, coherent models and filter models. In particular, we build an i-model whose theory is the set of equations satisfied in all i-models. Comment: In Proceedings LSFA 2012, arXiv:1303.7136
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1303.7329 Zobrazit plný text záznamu View this record from Arxiv