LFCS
2009
Springer
14 years 5 months ago
2009
Springer
We extend the alternating-time temporal logics ATL and ATL with strategy contexts and memory constraints: the first extension makes strategy quantifiers to not “forget” the s...
LFCS
2009
Springer
14 years 5 months ago
2009
Springer
A bialgebra is a structure which is simultaneously an algebra and a coalgebra, such that the algebraic and coalgebraic parts are compatible. Bialgebras are usually studied over a ...
LFCS
2009
Springer
14 years 7 months ago
2009
Springer
LFCS
2009
Springer
14 years 7 months ago
2009
Springer
In this paper we consider languages of labelled N-free posets over countable and scattered linear orderings. We prove that a language of such posets is series-rational if and only ...
LFCS
2009
Springer
14 years 7 months ago
2009
Springer
We study computational aspects of a probabilistic logic based on a well-known model of induction by Valiant. We prove that for this paraconsistent logic the set of valid formulas ...
LFCS
2009
Springer
14 years 7 months ago
2009
Springer
We introduce and illustrate a graph calculus for proving and deciding the positive identities and inclusions of fork algebras, i.e., those without occurrences of complementation. ...
LFCS
2009
Springer
14 years 7 months ago
2009
Springer
In this paper we prove that the derivability problems for productfree Lambek calculus and product-free Lambek calculus allowing empty premises are NP-complete. Also we introduce a...
LFCS
2009
Springer
14 years 7 months ago
2009
Springer
We explore an intuitionistic fragment of Art¨emov’s Logic of Proofs as a type system for a programming language for mobile units. Such units consist of both a code and certific...
LFCS
2009
Springer
14 years 7 months ago
2009
Springer
In this paper we study several properties of the Exogenous Probabilistic Propositional Logic (EPPL), a logic for reasoning about probabilities, with the purpose of introducing a t...
LFCS
2009
Springer
14 years 7 months ago
2009
Springer
This work defines an extension CERES2 of the first-order cut-elimination method CERES to the subclass of sequent calculus proofs in second-order logic using quantifier-free comp...