835 search results - page 7 / 167 » Characterizing rosy theories |
CISS
2008
IEEE
14 years 5 months ago
2008
IEEE
—A general framework is developed for networks with flows that use all available congestion signals to regulate their rates. It is conceptually a generalization of the existing ...
CSL
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. Expansions of the natural number ordering by unary predicates are studied, using logics which in expressive power are located between first-order and monadic second-order...
TACS
2001
Springer
14 years 3 months ago
2001
Springer
Decidability of non-structural subtype entailment is a long standing open problem in programming language theory. In this paper, we apply automata theoretic methods to characterize...
EPIA
1995
Springer
14 years 2 months ago
1995
Springer
We provide a nine-valued logic to characterize the models of logic programs under a paraconsistent well-founded semantics with explicit negation WFSX p. We define a truth-function...
JSYML
2008
13 years 10 months ago
2008
In this paper we give a new proof of the characterization of the closed fragment of the provability logic of Heyting's Arithmetic. We also provide a characterization of the c...