找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Logic from Computer Science; Proceedings of a Wor Yiannis N. Moschovakis Conference proceedings 1992 Springer-Verlag New York, Inc. 1992 co

[复制链接]
查看: 35810|回复: 69
发表于 2025-3-21 18:56:58 | 显示全部楼层 |阅读模式
书目名称Logic from Computer Science
副标题Proceedings of a Wor
编辑Yiannis N. Moschovakis
视频video
丛书名称Mathematical Sciences Research Institute Publications
图书封面Titlebook: Logic from Computer Science; Proceedings of a Wor Yiannis N. Moschovakis Conference proceedings 1992 Springer-Verlag New York, Inc. 1992 co
描述The volume is the outgrowth of a workshop with the same title held at MSRI in the week of November 13-17, 1989, and for those who did not get it, Logic from Computer Science is the converse of Logic in Computer Science, the full name of the highly successful annual LICS conferences. We meant to have a conference which would bring together the LICS commu­ nity with some of the more traditional "mathematical logicians" and where the emphasis would be on the flow of ideas from computer science to logic rather than the other way around. In a LICS talk, sometimes, the speaker presents a perfectly good theorem about (say) the A-calculus or finite model theory in terms of its potential applications rather than its (often more ob­ vious) intrinsic, foundational interest and intricate proof. This is not meant to be a criticism; the LICS meetings are, after all, organized by the IEEE Computer Society. We thought, for once, it would be fun to see what we would get if we asked the speakers to emphasize the relevance of their work for logic rather than computer science and to point out what is involved in the proofs. I think, mostly, it worked. In any case, the group of people represented as br
出版日期Conference proceedings 1992
关键词complexity; forcing; grammars; logic; proof; semantics
版次1
doihttps://doi.org/10.1007/978-1-4612-2822-6
isbn_softcover978-1-4612-7685-2
isbn_ebook978-1-4612-2822-6Series ISSN 0940-4740
issn_series 0940-4740
copyrightSpringer-Verlag New York, Inc. 1992
The information of publication is updating

书目名称Logic from Computer Science影响因子(影响力)




书目名称Logic from Computer Science影响因子(影响力)学科排名




书目名称Logic from Computer Science网络公开度




书目名称Logic from Computer Science网络公开度学科排名




书目名称Logic from Computer Science被引频次




书目名称Logic from Computer Science被引频次学科排名




书目名称Logic from Computer Science年度引用




书目名称Logic from Computer Science年度引用学科排名




书目名称Logic from Computer Science读者反馈




书目名称Logic from Computer Science读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 23:45:32 | 显示全部楼层
发表于 2025-3-22 03:23:13 | 显示全部楼层
Constructively Equivalent Propositions and Isomorphisms of Objects, or Terms as Natural Transformatte and we refer the reader interested in the lengthy technical details to Bruce & DiCosmo & Longo [1990]. Our main purpose here is to hint a logical framework for the result below, in a rather preliminary and problematic form. The occasion is provided by the kind invitation to deliver a lecture at a
发表于 2025-3-22 04:57:28 | 显示全部楼层
发表于 2025-3-22 09:43:14 | 显示全部楼层
Normal Forms and Cut-Free Proofs as Natural Transformations, identifications must hold between lambda terms, thought-of as encoding appropriate natural deduction proofs ? We show that the usual syntax guarantees that certain naturality equations from category theory are necessarily provable. At the same time, our categorical approach addresses an equational
发表于 2025-3-22 15:16:14 | 显示全部楼层
发表于 2025-3-22 17:57:43 | 显示全部楼层
发表于 2025-3-22 21:55:57 | 显示全部楼层
发表于 2025-3-23 02:34:51 | 显示全部楼层
Constructive Kripke Semantics and Realizability,ntics, and conversely? These questions have received answers in Hyland’s [33], Läuchli’s [43] and in other, related or more syntactic developments cited below. Here we re-open the investigation with the aim of providing more constructive answers to both questions. A special, constructive class of so
发表于 2025-3-23 07:25:29 | 显示全部楼层
Splitting and Density for the Recursive Sets of a Fixed Time Complexity,if for all time constructible . ∈ .. (.) ⇔ . ∈ ..(.). The =.-equivalence class of . is called it .. We examine the set theoretic relationships between the sets in an arbitrary complexity type .. For example, every recursive set . can be partitioned into two sets . and . such that . =.. =... Addition
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-28 04:45
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表