上坡
发表于 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.
Misgiving
发表于 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
IOTA
发表于 2025-3-24 04:53:07
978-3-030-93099-8Springer Nature Switzerland AG 2022
conifer
发表于 2025-3-24 07:00:52
http://reply.papertrans.cn/59/5882/588146/588146_16.png
漫不经心
发表于 2025-3-24 11:07:22
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/l/image/588146.jpg
实施生效
发表于 2025-3-24 17:21:39
http://reply.papertrans.cn/59/5882/588146/588146_18.png
杠杆
发表于 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
http://reply.papertrans.cn/59/5882/588146/588146_20.png