18 found
Order:
Disambiguations
Charles Steinhorn [20]Charles I. Steinhorn [2]
  1.  32
    Expansions of o-minimal structures by dense independent sets.Alfred Dolich, Chris Miller & Charles Steinhorn - 2016 - Annals of Pure and Applied Logic 167 (8):684-706.
  2.  16
    On variants of o-minimality.Dugald Macpherson & Charles Steinhorn - 1996 - Annals of Pure and Applied Logic 79 (2):165-209.
  3.  66
    Pseudofinite structures and simplicity.Darío García, Dugald Macpherson & Charles Steinhorn - 2015 - Journal of Mathematical Logic 15 (1):1550002.
    We explore a notion of pseudofinite dimension, introduced by Hrushovski and Wagner, on an infinite ultraproduct of finite structures. Certain conditions on pseudofinite dimension are identified that guarantee simplicity or supersimplicity of the underlying theory, and that a drop in pseudofinite dimension is equivalent to forking. Under a suitable assumption, a measure-theoretic condition is shown to be equivalent to local stability. Many examples are explored, including vector spaces over finite fields viewed as 2-sorted finite structures, and homocyclic groups. Connections are (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  4.  48
    (1 other version)Definable types in o-minimal theories.David Marker & Charles I. Steinhorn - 1994 - Journal of Symbolic Logic 59 (1):185-198.
  5.  27
    Extensions of ordered theories by generic predicates.Alfred Dolich, Chris Miller & Charles Steinhorn - 2013 - Journal of Symbolic Logic 78 (2):369-387.
    Given a theoryTextending that of dense linear orders without endpoints, in a language ℒ ⊇ {<}, we are interested in extensionsT′ ofTin languages extending ℒ by unary relation symbols that are each interpreted in models ofT′ as sets that are both dense and codense in the underlying sets of the models.There is a canonically “wild” example, namelyT= Th andT′ = Th. Recall thatTis o-minimal, and so every open set definable in any model ofThas only finitely many definably connected components. But (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  6.  13
    Discrete o-minimal structures.Anand Pillay & Charles Steinhorn - 1987 - Annals of Pure and Applied Logic 34 (3):275-289.
  7.  32
    On linearly ordered structures of finite rank.Alf Onshuus & Charles Steinhorn - 2009 - Journal of Mathematical Logic 9 (2):201-239.
    O-minimal structures have long been thought to occupy the base of a hierarchy of ordered structures, in analogy with the role that strongly minimal structures play with respect to stable theories. This is the first in an anticipated series of papers whose aim is the development of model theory for ordered structures of rank greater than one. A class of ordered structures to which a notion of finite rank can be assigned, the decomposable structures, is introduced here. These include all (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  8.  49
    On o-minimal expansions of archimedean ordered groups.Michael C. Laskowski & Charles Steinhorn - 1995 - Journal of Symbolic Logic 60 (3):817-831.
    We 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 R. We then show that a definable function in an o-minimal expansion of R enjoys good differentiability properties and use this to prove that an Archimedean real closed field is definable in any nonsemilinear expansion of R. (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  9.  17
    Uncountable real closed fields with pa integer parts.David Marker, James H. Schmerl & Charles Steinhorn - 2015 - Journal of Symbolic Logic 80 (2):490-502.
  10.  29
    A note on nonmultidimensional superstable theories.Anand Pillay & Charles Steinhorn - 1985 - Journal of Symbolic Logic 50 (4):1020-1024.
  11.  22
    Definably extending partial orders in totally ordered structures.Janak Ramakrishnan & Charles Steinhorn - 2014 - Mathematical Logic Quarterly 60 (3):205-210.
    We show, for various classes of totally ordered structures, including o‐minimal and weakly o‐minimal structures, that every definable partial order on a subset of extends definably in to a total order. This extends the result proved in for and o‐minimal.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  12.  36
    1995–1996 annual meeting of the association for symbolic logic.Tomek Bartoszynski, Harvey Friedman, Geoffrey Hellman, Bakhadyr Khoussainov, Phokion G. Kolaitis, Richard Shore, Charles Steinhorn, Mirna Dzamonja, Itay Neeman & Slawomir Solecki - 1996 - Bulletin of Symbolic Logic 2 (4):448-472.
  13.  27
    The Boolean spectrum of an $o$-minimal theory.Charles Steinhorn & Carlo Toffalori - 1989 - Notre Dame Journal of Formal Logic 30 (2):197-206.
  14.  44
    Extending Partial Orders on o‐Minimal Structures to Definable Total Orders.Dugald Macpherson & Charles Steinhorn - 1997 - Mathematical Logic Quarterly 43 (4):456-464.
    It is shown that if is an o-minimal structure such that is a dense total order and ≾ is a parameter-definable partial order on M, then ≾ has an extension to a definable total order.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  15.  51
    On dedekind complete o-minimal structures.Anand Pillay & Charles Steinhorn - 1987 - Journal of Symbolic Logic 52 (1):156-164.
    For a countable complete o-minimal theory T, we introduce the notion of a sequentially complete model of T. We show that a model M of T is sequentially complete if and only if $\mathscr{M} \prec \mathscr{N}$ for some Dedekind complete model N. We also prove that if T has a Dedekind complete model of power greater than 2 ℵ 0 , then T has Dedekind complete models of arbitrarily large powers. Lastly, we show that a dyadic theory--namely, a theory relative (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  16.  16
    On the nonaxiomatizability of some logics by finitely many schemas.Saharon Shelah & Charles Steinhorn - 1986 - Notre Dame Journal of Formal Logic 27 (1):1-11.
  17.  13
    (1 other version)The nonaxiomatizability of $L(Q^2{\aleph1})$ by finitely many schemata.Saharon Shelah & Charles Steinhorn - 1989 - Notre Dame Journal of Formal Logic 31 (1):1-13.
  18.  16
    (1 other version)Review: A. J. Wilkie, Model Completeness Results for Expansions of the Ordered Field of Real Numbers by Restricted Pfaffian Functions and the Exponential Function. [REVIEW]Charles Steinhorn - 1999 - Journal of Symbolic Logic 64 (2):910-913.