3122 search results - page 31 / 625 » A Theory of Network Equivalence |
161
click to vote
BSL
2006
15 years 6 months ago
2006
We show that each of the five basic theories of second order arithmetic that play a central role in reverse mathematics has a natural counterpart in the language of nonstandard ari...
155
click to vote
JSYML
2008
15 years 6 months ago
2008
In 2004 Csima, Hirschfeldt, Knight, and Soare [1] showed that a set A T 0 is nonlow2 if and only if A is prime bounding, i.e. for every complete atomic decidable theory T , there i...
139
click to vote
ATAL
2005
Springer
15 years 11 months ago
2005
Springer
There is a growing need for a theory of “local to global” in distributed multi-agent systems, one which is able systematically to describe and analyze a variety of problems. T...
146
click to vote
TPLP
2008
15 years 6 months ago
2008
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and ...
172
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
The paper applies modal logic to formalize fragments of argumentation theory. Such formalization allows to import, for free, a wealth of new notions (e.g., argument equivalence), ...