超积的极小可达理论
Minimal lambda-theories by ultraproducts
摘要:
λ演算中一个长期存在的问题是是否存在无类型λ演算的连续模型,其理论恰好是最小可解性理论λ-β或最小可解性理论H(通过使所有不可解项相等而产生)。一个相关的问题是,是否有一个最小的lambda模型类,它所代表的理论。在本文中,我们给出了一个通用的工具来回答这个问题,我们将其应用到广泛的一类网络模型:i模型。然后,该方法也适用于图模型,Krivine模型,相干模型和过滤器模型。特别地,我们建立了一个i模型,其理论是所有i模型都满足的方程组。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。