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

dissent

https://doi.org/10.1007/978-3-540-92687-0Automat; automated deduction; complexity; game theory; interactive theorem proving; logic; theorem proving

Prosaic

Carbon-Monoxide

Logical Foundations of Computer Science978-3-540-92687-0Series ISSN 0302-9743 Series E-ISSN 1611-3349

forbid

, with Strategy Contexts and Bounded Memory,milar formalisms (., .*, Game Logic, Strategy Logic, ...). We then address the problem of model-checking for our logics, especially we provide a . algorithm for the sublogics involving only memoryless strategies and an . algorithm for the bounded-memory case.

天然热喷泉

展览

neolith

松果

The Logic of Proofs as a Foundation for Certifying Mobile Computation,nstructed out of code components and extant type systems track local resource usage to ensure the mobile nature of these components, our system . ensures correct . out of certificate components. We present proofs of type safety and strong normalization for a run-time system based on an abstract machine.

战胜

Games on Strings with a Limited Order Relation,r relation and the usual (linear) order relation, and a finite number of unary predicates. On the basis of such conditions, we outline a polynomial (in the size of the input strings) algorithm to compute the “remoteness” of a game and to determine the optimal strategies/moves for both players.

发誓放弃

Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics, objects of the systems are sequent rules. Here, the framework is extended to cover derivability of the admissible rules of intermediate logics and a wider class of modal logics, in this case, by taking hypersequent rules as the basic objects.