用户名  找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Logical Foundations of Computer Science; International Sympos Sergei Artemov,Anil Nerode Conference proceedings 2022 Springer Nature Switze

[复制链接]
楼主: eternal
发表于 2025-3-23 11:31:58 | 显示全部楼层
Soundness and Completeness Results for LEA and Probability Semantics, a class of basic models called deductive basic models. We show . is sound and complete with respect to the class of deductive basic models. We also define an axiomatic system . extending . and show it is sound and complete with respect to probability semantics.
发表于 2025-3-23 15:38:32 | 显示全部楼层
On Inverse Operators in Dynamic Epistemic Logic,, we give several soundness/completeness correspondences, which lead to modular proofs of completeness of public announcement logic and epistemic action logic of Baltag-Moss-Solecki extended with inverse operators with respect to suitable classes of MTSs.
发表于 2025-3-23 20:03:16 | 显示全部楼层
,Between Turing and Kleene, Choice involving . choice functions, going back to Kreisel-Troelstra and intuitionistic analysis. Put another way, we formulate a relation ‘is computationally stronger than’ involving . objects that overcomes (many of) the pitfalls of the Turing and Kleene frameworks.
发表于 2025-3-24 01:35:00 | 显示全部楼层
https://doi.org/10.1007/978-3-030-93100-1artificial intelligence; automata theory; boolean functions; computability and decidability; computer ha
发表于 2025-3-24 04:53:07 | 显示全部楼层
978-3-030-93099-8Springer Nature Switzerland AG 2022
发表于 2025-3-24 07:00:52 | 显示全部楼层
发表于 2025-3-24 11:07:22 | 显示全部楼层
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/l/image/588146.jpg
发表于 2025-3-24 17:21:39 | 显示全部楼层
发表于 2025-3-24 20:49:58 | 显示全部楼层
,A Logic of Interactive Proofs,We introduce the probabilistic two-agent justification logic ., a logic in which we can reason about agents that perform interactive proofs. In order to study the growth rate of the probabilities in ., we present a new method of parametrizing . over certain negligible functions. Further, our approach leads to a new notion of zero-knowledge proofs.
发表于 2025-3-25 02:06:46 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 吾爱论文网 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
QQ|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-7-19 18:12
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表