A continuum of theories of lambda calculus without semantics

A. Salibra
{"title":"A continuum of theories of lambda calculus without semantics","authors":"A. Salibra","doi":"10.1109/LICS.2001.932509","DOIUrl":null,"url":null,"abstract":"In this paper, we give a topological proof of the following result: there exist 2¿(/spl aleph//sub 0/) lambda theories of the untyped lambda calculus without a model in any semantics based on D.S. Scott's (1972, 1981) view of models as partially ordered sets and of functions as monotonic functions. As a consequence of this result, we positively solve the conjecture, stated by O. Bastonero and X. Gouy (1999) and by C. Berline (2000), that the strongly stable semantics is incomplete.","PeriodicalId":366313,"journal":{"name":"Proceedings 16th Annual IEEE Symposium on Logic in Computer Science","volume":"279 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 16th Annual IEEE Symposium on Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.2001.932509","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 22

Abstract

In this paper, we give a topological proof of the following result: there exist 2¿(/spl aleph//sub 0/) lambda theories of the untyped lambda calculus without a model in any semantics based on D.S. Scott's (1972, 1981) view of models as partially ordered sets and of functions as monotonic functions. As a consequence of this result, we positively solve the conjecture, stated by O. Bastonero and X. Gouy (1999) and by C. Berline (2000), that the strongly stable semantics is incomplete.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
没有语义的微积分理论的连续体
本文基于D.S. Scott(1972, 1981)关于模型为偏序集和函数为单调函数的观点,给出了以下结果的拓扑证明:存在2¿(/spl aleph//sub 0/)无模型的无类型λ演算的2¿(/spl aleph//sub 0/)理论。作为这一结果的结果,我们正解了O. Bastonero和X. Gouy(1999)和C. Berline(2000)提出的强稳定语义不完备的猜想。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A model-theoretic approach to regular string relations On the decision problem for the guarded fragment with transitivity A second-order system for polytime reasoning using Gradel's theorem Synthesizing distributed systems Relating levels of the mu-calculus hierarchy and levels of the monadic hierarchy
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1