A fixed point theorem for o‐minimal structures

We prove a definable analogue to Brouwer's Fixed Point Theorem for o‐minimal structures of real closed field expansions: A continuous definable function mapping from the unit simplex into itself admits a fixed point, even though the underlying space is not necessarily topologically complete. Our proof is direct and elementary; it uses a triangulation technique for o‐minimal functions, with an application of Sperner's Lemma. (© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Definability and nondefinability results for certain o‐minimal structures

The main goal of this note is to study for certain o‐minimal structures the following propriety: for each definable C^∞ function g₀: [0, 1] → ? there is a definable C^∞ function g: [–ε, 1] → ?, for some ε > 0, such that g (x) = g₀(x) for all x ∈ [0, 1] (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Dirichlet regularity in arbitrary o‐minimal structures on the field ℝ up to dimension 4

In this article we show that the set of Dirichlet regular boundary points of a bounded domain of dimension up to 4, definable in an arbitrary o‐minimal structure on the field ?, is definable in the same structure. Moreover we give estimates for the dimension of the set of non‐regular boundary points, depending on whether the structure is polynomially bounded or not. This paper extends the results from the author's Ph.D. thesis [6, 7] where the problem was solved for polynomially bounded o‐minimal structures expanding the real field. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Maximal small extensions of o‐minimal structures

A proper elementary extension of a model is called small if it realizes no new types over any finite set in the base model. We answer a question of Marker, and show that it is possible to have an o‐minimal structure with a maximal small extension. Our construction yields such a structure for any cardinality. We show that in some cases, notably when the base structure is countable, the maximal small extension has maximal possible cardinality (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Filling certain cuts in discrete weakly o‐minimal structures

Discrete weakly o‐minimal structures, although not so stimulating as their dense counterparts, do exhibit a certain wealth of examples and pathologies. For instance they lack prime models and monotonicity for definable functions, and are not preserved by elementary equivalence. First we exhibit these features. Then we consider a countable theory of weakly o‐minimal structures with infinite definable discrete (convex) subsets and we study the Boolean algebra of definable sets of its countable models. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Substructure lattices and almost minimal end extensions of models of Peano arithmetic

This paper concerns intermediate structure lattices Lt(??/??), where ?? is an almost minimal elementary end extension of the model ?? of Peano Arithmetic. For the purposes of this abstract only, let us say that ?? attains L if L ? Lt(??/??) for some almost minimal elementary end extension of ??. If T is a completion of PA and L is a finite lattice, then: (A) If some model of T attains L, then every countable model of T does. (B) If some rather classless, ?₁‐saturated model of T attains L, then every model of T does. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Weakly o‐Minimal Expansions of Boolean Algebras

We propose a definition of weak o‐minimality for structures expanding a Boolean algebra. We study this notion, in particular we show that there exist weakly o‐minimal non o‐minimal examples in this setting.     

ω‐categorical weakly o‐minimal expansions of Boolean lattices

We study ω‐categorical weakly o‐minimal expansions of Boolean lattices. We show that a structure ?? = (A,≤, ?) expanding a Boolean lattice (A,≤) by a finite sequence I of ideals of A closed under the usual Heyting algebra operations is weakly o‐minimal if and only if it is ω‐categorical, and hence if and only if A/I has only finitely many atoms for every I ∈ ?. We propose other related examples of weakly o‐minimal ω‐categorical models in this framework, and we examine the internal structure of these models.     

Definable group extensions in semi‐bounded o‐minimal structures

In this note we show: Let R = 〈R, <, +, 0, …〉 be a semi‐bounded (respectively, linear) o‐minimal expansion of an ordered group, and G a group definable in R of linear dimension m ([2]). Then G is a definable extension of a bounded (respectively, definably compact) definable group B by 〈R^m, +〉 (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On the Boolean algebras of definable sets in weakly o‐minimal theories

We consider the sets definable in the countable models of a weakly o‐minimal theory T of totally ordered structures. We investigate under which conditions their Boolean algebras are isomorphic (hence T is p‐ω‐categorical), in other words when each of these definable sets admits, if infinite, an infinite coinfinite definable subset. We show that this is true if and only if T has no infinite definable discrete (convex) subset. We examine the same problem among arbitrary theories of mere linear orders. Finally we prove that, within expansions of Boolean lattices, every weakly o‐minimal theory is p‐ω‐categorical. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Uniform bounds on growth in o‐minimal structures

We prove that a function definable with parameters in an o‐minimal structure is bounded away from ∞ as its argument goes to ∞ by a function definable without parameters, and that this new function can be chosen independently of the parameters in the original function. This generalizes a result in [1]. Moreover, this remains true if the argument is taken to approach any element of the structure (or ±∞), and the function has limit any element of the structure (or ±∞) (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

The universal covering homomorphism in o‐minimal expansions of groups

Suppose G is a definably connected, definable group in an o‐minimal expansion of an ordered group. We show that the o‐minimal universal covering homomorphism : → G is a locally definable covering homomorphism and π₁(G) is isomorphic to the o‐minimal fundamental group π (G) of G defined using locally definable covering homomorphisms. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On the strong cell decomposition property for weakly o‐minimal structures

We consider a class of weakly o‐minimal structures admitting an o‐minimal style cell decomposition, for which one can construct certain canonical o‐minimal extension. The paper contains several fundamental facts concerning the structures in question. Among other things, it is proved that the strong cell decomposition property is preserved under elementary equivalences. We also investigate fiberwise properties (of definable sets and definable functions), definable equivalence relations, and conditions implying elimination of imaginaries.     

The shortest definition of a number in Peano arithmetic

The shortest definition of a number by a first order formula with one free variable, where the notion of a formula defining a number extends a notion used by Boolos in a proof of the Incompleteness Theorem, is shown to be non computable. This is followed by an examination of the complexity of sets associated with this function.     

Binary types in ℵ0‐categorical weakly o‐minimal theories

Orthogonality of all families of pairwise weakly orthogonal 1‐types for ?₀‐categorical weakly o‐minimal theories of finite convexity rank has been proved in 6 . Here we prove orthogonality of all such families for binary 1‐types in an arbitrary ?₀‐categorical weakly o‐minimal theory and give an extended criterion for binarity of ?₀‐categorical weakly o‐minimal theories (additionally in terms of binarity of 1‐types). © 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim     

Notes on local o‐minimality

We introduce and study some local versions of o‐minimality, requiring that every definable set decomposes as the union of finitely many isolated points and intervals in a suitable neighbourhood of every point. Motivating examples are the expansions of the ordered reals by sine, cosine and other periodic functions (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Almost continuous images of Peano continua

We give a necessary and sufficient condition that a 2nd countable space be the almost continuous image of a Peano continuum.     

Euler characteristic of imaginaries in o‐minimal structures

We define the notion of Euler characteristic for definable quotients in an arbitrary o‐minimal structure and prove some fundamental properties.     

The minimum degree of Ramsey‐minimal graphs

We write H → G if every 2‐coloring of the edges of graph H contains a monochromatic copy of graph G. A graph H is G‐minimal if H → G, but for every proper subgraph H′ of H, H′ ? G. We define s(G) to be the minimum s such that there exists a G‐minimal graph with a vertex of degree s. We prove that s(K_k) = (k ? 1)² and s(K_a,b) = 2 min(a,b) ? 1. We also pose several related open problems. © 2006 Wiley Periodicals, Inc. J Graph Theory 54: 167–177, 2007     

二元函数四条性质之间的关系

二元函数的连续性,偏导数存在性,偏导数连续性以及可微性是二元函数的四条经典性质,它们之间的关系一直是学生的疑惑点,本文结合严格的证明和典型的反例给出四条性质之间关系的详尽阐释.