1943 search results - page 134 / 389 » Ordering Default Theories |
194
Voted
DM
2008
15 years 7 months ago
2008
One of the basic results in graph theory is Dirac's theorem, that every graph of order n 3 and minimum degree n/2 is Hamiltonian. This may be restated as: if a graph of ord...
142
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
We study xpoints of operators on lattices. To this end we introduce the notion of an approximation of an operator. We order approximations by means of a precision ordering. We sho...
134
Voted
IJUFKS
2000
15 years 6 months ago
2000
Continuous archimedean t-norms are generated by automorphisms f of ([0; 1]; ), the unit interval with its usual order structure. Such strict t-norms 4 are given by x 4 y = f 1 (f(...
185
click to vote
CAP
2010
15 years 2 months ago
2010
Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimiz...
156
Voted
AML
2007
15 years 7 months ago
2007
We study the notion of weak dividing introduced by S. Shelah. In particular we prove that T is stable iff weak dividing is symmetric. In order to study simple theories Shelah orig...