16 search results - page 1 / 4 » lfcs 2009 |
77
Voted
LFCS
2009
Springer
15 years 4 months ago
2009
Springer
117
Voted
LFCS
2009
Springer
15 years 4 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 ...
74
Voted
LFCS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We address the problem of quantitative comparison of classical and intuitionistic logics within the language of the full propositional system. We apply two different app...
81
Voted
LFCS
2009
Springer
15 years 4 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...
93
Voted
LFCS
2009
Springer
15 years 4 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 ...