3229 search results - page 18 / 646 » Theories with the Independence Property |
93
Voted
DMTCS
2003
15 years 3 months ago
2003
Two philosophical applications of the concept of program-size complexity are discussed. First, we consider the light program-size complexity sheds on whether mathematics is invent...
115
click to vote
CORR
1998
Springer
15 years 1 months ago
1998
Springer
In this paper we consider the problem of theory patching, in which we are given a domain theory, some of whose components are indicated to be possibly awed, and a set of labeled t...
103
Voted
JSYML
2008
15 years 1 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...
124
click to vote
ECCC
2011
14 years 5 months ago
2011
The last two decades have seen enormous progress in the development of sublinear-time algorithms — i.e., algorithms that examine/reveal properties of “data” in less time tha...
184
click to vote
SIGMOD
2005
ACM
16 years 2 months ago
2005
ACM
We review the notion of hypertree width, a measure of the degree of cyclicity of hypergraphs that is useful for identifying and solving efficiently easy instances of hard problems...