Results 211 to 220 of about 609,806 (243)
Some of the next articles are maybe not open access.
An Approach to Homotopy and Degree Theory
Mathematics of Operations Research, 1979Spawned by Scarf's pioneering work on the calculation of fixed points, an entire new field in mathematical programming has emerged. A wide array of problems that can be posed as fixed point problems, such as problems involving equilibria, games, systems of equations, global optimization, and structural mechanics, have come into the purview of these ...
C. B. García, Willard I. Zangwill
openaire +3 more sources
THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES
Journal of Mathematical Logic, 2006Sacks [23] asks if the metarecursively enumerable degrees are elementarily equivalent to the r.e. degrees. In unpublished work, Slaman and Shore proved that they are not. This paper provides a simpler proof of that result and characterizes the degree of the theory as [Formula: see text] or, equivalently, that of the truth set of [Formula: see text].
Noam Greenberg +2 more
openaire +1 more source
On Hesitation Degrees in IF-Set Theory
2004In this paper, we propose a generalization of the definition of an IF-set, an intuitionistic fuzzy set, and related hesitation degrees. We flexibilize the original method of computing these values by the use of triangular norms. Next, we present its application to group decision making problems.
Anna Pankowska, Maciej Wygralak
openaire +1 more source
LCP Degree Theory and Oriented Matroids
SIAM Journal on Matrix Analysis and Applications, 1994Summary: It is shown that the degree of a square-oriented matroid \(\mathcal M\) can be defined in terms of the number of solutions to the oriented matroid complementarity problem defined by a point extension of \(\mathcal M\), and that this definition is independent of the point extension. If \(\mathcal M\) is represented by a matrix \([I, -M]\), then
openaire +2 more sources
THE FIRST‐ORDER THEORY OF THE c‐DEGREES
Mathematical Logic Quarterly, 1984The c-degrees are the equivalence classes of reals under the relation \(a=_ cb\leftrightarrow L(a)=L(b)\), where L(a) denotes the universe of sets constructible from a. Ordered by the relation \(a\leq_ cb\leftrightarrow a\in L(b)\), the c-degrees form an upper-semilattice, \(\). In this paper it is shown that under certain set- theoretical assumptions (
openaire +2 more sources
Decidability of the “almost all” theory of degrees
Journal of Symbolic Logic, 1972Ever since Spector's brilliant application of measure theory to recursion theory in 1958 [6] it has been realized that measure theory promotes sweeping simplifications in the theory of degrees. Results previously thought to be pathological were shown by Spector, and later Sacks [4], [5], to hold for almost all degrees (“almost all” in the sense of ...
openaire +3 more sources