首页    期刊浏览 2024年11月25日 星期一
登录注册

文章基本信息

  • 标题:Minimal lambda-theories by ultraproducts
  • 本地全文:下载
  • 作者:Antonio Bucciarelli ; Alberto Carraro ; Antonino Salibra
  • 期刊名称:Electronic Proceedings in Theoretical Computer Science
  • 电子版ISSN:2075-2180
  • 出版年度:2013
  • 卷号:113
  • 页码:61-76
  • DOI:10.4204/EPTCS.113.8
  • 出版社:Open Publishing Association
  • 摘要: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.
国家哲学社会科学文献中心版权所有