1,084 research outputs found
Efficient Solving of Quantified Inequality Constraints over the Real Numbers
Let a quantified inequality constraint over the reals be a formula in the
first-order predicate language over the structure of the real numbers, where
the allowed predicate symbols are and . Solving such constraints is
an undecidable problem when allowing function symbols such or . In
the paper we give an algorithm that terminates with a solution for all, except
for very special, pathological inputs. We ensure the practical efficiency of
this algorithm by employing constraint programming techniques
Tarski's influence on computer science
The influence of Alfred Tarski on computer science was indirect but
significant in a number of directions and was in certain respects fundamental.
Here surveyed is the work of Tarski on the decision procedure for algebra and
geometry, the method of elimination of quantifiers, the semantics of formal
languages, modeltheoretic preservation theorems, and algebraic logic; various
connections of each with computer science are taken up
Stable domination and independence in algebraically closed valued fields
We seek to create tools for a model-theoretic analysis of types in
algebraically closed valued fields (ACVF). We give evidence to show that a
notion of 'domination by stable part' plays a key role. In Part A, we develop a
general theory of stably dominated types, showing they enjoy an excellent
independence theory, as well as a theory of definable types and germs of
definable functions. In Part B, we show that the general theory applies to
ACVF. Over a sufficiently rich base, we show that every type is stably
dominated over its image in the value group. For invariant types over any base,
stable domination coincides with a natural notion of `orthogonality to the
value group'. We also investigate other notions of independence, and show that
they all agree, and are well-behaved, for stably dominated types. One of these
is used to show that every type extends to an invariant type; definable types
are dense. Much of this work requires the use of imaginary elements. We also
show existence of prime models over reasonable bases, possibly including
imaginaries
The prospects for mathematical logic in the twenty-first century
The four authors present their speculations about the future developments of
mathematical logic in the twenty-first century. The areas of recursion theory,
proof theory and logic for computer science, model theory, and set theory are
discussed independently.Comment: Association for Symbolic Logi
- …