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

上坡

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.

雄辯

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.

幼稚

,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

https://doi.org/10.1007/978-3-030-93100-1artificial intelligence; automata theory; boolean functions; computability and decidability; computer ha

IOTA

978-3-030-93099-8Springer Nature Switzerland AG 2022

conifer

漫不經(jīng)心

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/l/image/588146.jpg

實(shí)施生效

杠桿

,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.

一起