definable function
Recently Published Documents


TOTAL DOCUMENTS

12
(FIVE YEARS 0)

H-INDEX

4
(FIVE YEARS 0)

2018 ◽  
Vol 61 (03) ◽  
pp. 629-635
Author(s):  
ISAAC GOLDBRING ◽  
THOMAS SINCLAIR

AbstractWe show that the class of unital C*-algebras is an elementary class in the language of operator systems and that the algebra multiplication is a definable function in this language. Moreover, we prove a general model theoretic fact which implies that the aforementioned class is ∀∃∀-axiomatizable. We conclude by showing that this class is, however, neither ∀∃-axiomatizable nor ∃∀-axiomatizable.



Author(s):  
Ehud Hrushovski ◽  
François Loeser

This chapter introduces the space unit vector V of stably dominated types on a definable set V. It first endows unit vector V with a canonical structure of a (strict) pro-definable set before providing some examples of stably dominated types. It then endows unit vector V with the structure of a definable topological space, and the properties of this definable topology are discussed. It also examines the canonical embedding of V in unit vector V as the set of simple points. An essential feature in the approach used in this chapter is the existence of a canonical extension for a definable function on V to unit vector V. This is considered in the next section where continuity criteria are given. The chapter concludes by describing basic notions of (generalized) paths and homotopies, along with good metrics, Zariski topology, and schematic distance.



2017 ◽  
Vol 82 (1) ◽  
pp. 347-358 ◽  
Author(s):  
PABLO CUBIDES KOVACSICS ◽  
LUCK DARNIÈRE ◽  
EVA LEENKNEGT

AbstractThis paper addresses some questions about dimension theory for P-minimal structures. We show that, for any definable set A, the dimension of $\bar A\backslash A$ is strictly smaller than the dimension of A itself, and that A has a decomposition into definable, pure-dimensional components. This is then used to show that the intersection of finitely many definable dense subsets of A is still dense in A. As an application, we obtain that any definable function $f:D \subseteq {K^m} \to {K^n}$ is continuous on a dense, relatively open subset of its domain D, thereby answering a question that was originally posed by Haskell and Macpherson.In order to obtain these results, we show that P-minimal structures admit a type of cell decomposition, using a topological notion of cells inspired by real algebraic geometry.



2011 ◽  
Vol 76 (4) ◽  
pp. 1240-1260 ◽  
Author(s):  
Joseph Flenner

AbstractLet (K, v) be a henselian valued field of characteristic 0. Then K admits a definable partition on each piece of which the leading term of a polynomial in one variable can be computed as a definable function of the leading term of a linear map. The main step in obtaining this partition is an answer to the question, given a polynomial f(x) ∈ K[x], what is v(f(x))?Two applications are given: first, a constructive quantifier elimination relative to the leading terms, suggesting a relative decision procedure; second, a presentation of every definable subset of K as the pullback of a definable set in the leading terms subjected to a linear translation.



2003 ◽  
Vol 03 (01) ◽  
pp. 1-35 ◽  
Author(s):  
YA'ACOV PETERZIL ◽  
SERGEI STARCHENKO

Let ℛ be an o-minimal expansion of a real closed field R. We continue here the investigation we began in [11] of differentiability with respect to the algebraically closed field [Formula: see text]. We develop the basic theory of such K-differentiability for definable functions of several variables, proving theorems on removable singularities as well as analogues of the Weierstrass preparation and division theorems for definable functions. We consider also definably meromorphic functions and prove that every definable function which is meromorphic on Kn is necessarily a rational function. We finally discuss definable analogues of complex analytic manifolds, with possible connections to the model theoretic work on compact complex manifolds, and present two examples of "nonstandard manifolds" in our setting.



2001 ◽  
Vol 66 (4) ◽  
pp. 1783-1790 ◽  
Author(s):  
Chris Miller

Let ℜ be an expansion of a dense linear order (R, <) without endpoints having the intermediate value property, that is, for all a, b ∈ R, every continuous (parametrically) definable function f: [a, b] → R takes on all values in R between f(a) and f(b). Every expansion of the real line (ℝ, <), as well as every o-minimal expansion of (R, <), has the intermediate value property. Conversely, some nice properties, often associated with expansions of (ℝ, <) or with o-minimal structures, hold for sets and functions definable in ℜ. For example, images of closed bounded definable sets under continuous definable maps are closed and bounded (Proposition 1.10).Of particular interest is the case that ℜ expands an ordered group, that is, ℜ defines a binary operation * such that (R, <, *) is an ordered group. Then (R, *) is abelian and divisible (Proposition 2.2). Continuous nontrivial definable endo-morphisms of (R, *) are surjective and strictly monotone, and monotone nontrivial definable endomorphisms of (R, *) are strictly monotone, continuous and surjective (Proposition 2.4). There is a generalization of the familiar result that every proper noncyclic subgroup of (ℝ, +) is dense and codense in ℝ: If G is a proper nontrivial subgroup of (R, *) definable in ℜ, then either G is dense and codense in R, or G contains an element u such that (R, <, *, e, u, G) is elementarily equivalent to (ℚ, <, +, 0, 1, ℤ), where e denotes the identity element of (R, *) (Theorem 2.3).Here is an outline of this paper. First, we deal with some basic topological results. We then assume that ℜ expands an ordered group and establish the results mentioned in the preceding paragraph. Some examples are then given, followed by a brief discussion of analytic results and possible limitations. In an appendix, an explicit axiomatization (used in the proof of Theorem 2.3) is given for the complete theory of the structure (ℚ, <, +, 0, 1, ℤ).



1995 ◽  
Vol 60 (3) ◽  
pp. 817-831 ◽  
Author(s):  
Michael C. Laskowski ◽  
Charles Steinhorn

AbstractWe study o-minimal expansions of Archimedean totally ordered groups. We first prove that any such expansion must be elementarily embeddable via a unique (provided some nonzero element is 0-definable) elementary embedding into a unique o-minimal expansion of the additive ordered group of real numbers . We then show that a definable function in an o-minimal expansion of enjoys good differentiability properties and use this to prove that an Archimedean real closed field is definable in any nonsemilinear expansion of . Combining these results, we obtain several restrictions on possible o-minimal expansions of arbitrary Archimedean ordered groups and in particular of the rational ordered group.



1995 ◽  
Vol 60 (3) ◽  
pp. 797-816 ◽  
Author(s):  
Robert J. Poston

This paper considers o-minimal expansions of the structure —the ordered additive reals. More particularly we consider the case when the expansions are “eventually nonlinear” (see below), and find that multiplication is actually definable in all cases except when the structure is “eventually almost linear”, which is a rare special case in which multiplication is obviously not definable. Thus the main theorem established is:Theorem 1.1. For an o-minimal expansion of , if is eventually non-almost-linear then multiplication is definable in.(A structure is eventually almost linear iff every definable function f is of the form f(x) = λx + c + ε(x) on some interval (K, ∞), where λ, c Є ℝ and ε is a function of x which tends to 0 faster than any negative power of x as x → +∞. Otherwise, i.e. if there is a definable function which is not of this form, it is eventually non-almost-linear.)This is proved in §4.1, after §§2 and 3 have established technology concerning the rate of growth of functions and approximating derivatives.In §4.2 an analogy is made with the result of exponentiation being definable in a polynomially unbounded o-minimal expansion of ℝ as an ordered field (see [Mi]). In fact, by means of the isomorphism x ↦ ln(x) we see that Theorem 1.1 also implies this latter result.Unless otherwise stated, all structures considered in the paper have ℝ as their universe and all functions are real functions.



1992 ◽  
Vol 17 (3) ◽  
pp. 253-270
Author(s):  
Małgorzata Madry

Six λ-languages over function-types between algebras B, N and Υ are considered. Type N = ( 0 → 0 ) → ( 0 → 0 ) is called a non-negative integers type; B = ( 0 → 0 ) → ( ( 0 → 0 ) → ( 0 → 0 ) ) is called a binary words type; Υ = ( 0 → ( 0 → 0 ) ) → ( 0 → 0 ) is called a binary trees type. These associations come from the isomorphism between the types and corresponding algebraic structures. Closed terms whose types are the above mentioned function-types represent unary functions of appropriate types. The problem is: what class of functions is represented by the closed terms of the examined type. It is proved that for B → N, N → B, Υ → N, Υ → B there exists a finite base of functions such that any λ-definable function is some combination of the base functions. The algorithm which, for every closed term, returns the function in the form of a combination of the base functions is given. For two other types, B → Υ and N → Υ, a method of constructing λ-representable functions using primitive recursion is shown.



1988 ◽  
Vol 53 (3) ◽  
pp. 905-911 ◽  
Author(s):  
Philip Scowcroft

This note arose out of my efforts to understand results of van den Dries, Denef, and Weispfenning on definable Skolem functions in the elementary theory of Qp. The first person to prove their existence was van den Dries, who devised and applied a model-theoretic criterion for theories, admitting elimination of quantifiers, which also admit definable Skolem functions [3]. The proof, though elegant, does not describe how one defines the Skolem functions. In the particular case of Qp, Denef found an ingenious, easily described method for writing out the definitions [2, pp. 14–15]. Unfortunately, his argument directly applies only in the following special case: ifand there is a fixed m ≥ 1 such thatfor all , then can be given as a definable function of . While this special case includes many of interest, van den Dries' theorem seems more general. Weispfenning suggested how his results on primitive-recursive quantifier elimination could produce algorithms yielding definitions of Skolem functions in the specific theories van den Dries considered [10, pp. 470–471]. Though these algorithms provide a more concrete version of van den Dries' theorem, and do not suffer the lack of generality of Denef's result, Weispfenning's argument is extremely subtle and applies only to certain theories of valued fields.



Sign in / Sign up

Export Citation Format

Share Document