Titlebook: Logical Foundations of Computer Science; International Sympos Sergei Artemov,Anil Nerode Conference proceedings 2013 Springer-Verlag Berlin

handle

Stuttering for Abstract Probabilistic Automata,tochastic behaviors. In a series of recent papers, we proposed Abstract Probabilistic Automata (APAs), a new abstraction framework for representing possibly infinite sets of PAs. We have developed a complete abstraction theory for APAs, and also proposed the first specification theory for them. APAs

goodwill

闲逛

Eclampsia

A Note on Extensions: Admissible Rules via Semantics,nicely to the extension property up to .. In this paper we demonstrate that the same goes even when omitting the rule ., that is, working over minimal rather than intuitionistic logic. We lay the groundwork for providing a basis of admissibility for minimal logic, and tie the admissibility of the Mi

首创精神

Scintillations

archetype

Update as Evidence: Belief Expansion,elieving it. We provide a sound and complete axiomatization for belief expansion and minimal change and explain how the minimality can be graded according to the strength of reasoning. We also provide an evidential analog of the Ramsey axiom.

新奇

Automated Support for the Investigation of Paraconsistent and Other Logics, applies to infinitely many logics, which include the family of paraconsistent C-systems, as well as to other logics for which neither analytic calculi nor suitable semantics have so far been available.

扩大

The Wadge Hierarchy of Petri Nets ,-Languages,ch turned out to be the Wadge hierarchy of the .-regular languages. Petri nets are an improvement of automata. They may be defined as partially blind multi-counter automata. We show that the whole hierarchy has height ., and give a description of the restrictions of this hierarchy to every fixed number of partially blind counters.

吸引力