Switch to: References

Add citations

You must login to add citations.
  1. Tame properties of sets and functions definable in weakly o-minimal structures.Jafar S. Eivazloo & Somayyeh Tari - 2014 - Archive for Mathematical Logic 53 (3-4):433-447.
    Let M=\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathcal{M}}=}$$\end{document} be a weakly o-minimal expansion of a dense linear order without endpoints. Some tame properties of sets and functions definable in M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathcal{M}}}$$\end{document} which hold in o-minimal structures, are examined. One of them is the intermediate value property, say IVP. It is shown that strongly continuous definable functions in M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathcal{M}}}$$\end{document} satisfy an extended (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Is Classical Mathematics Appropriate for Theory of Computation?Farzad Didehvar - manuscript
    Throughout this paper, we are trying to show how and why our Mathematical frame-work seems inappropriate to solve problems in Theory of Computation. More exactly, the concept of turning back in time in paradoxes causes inconsistency in modeling of the concept of Time in some semantic situations. As we see in the first chapter, by introducing a version of “Unexpected Hanging Paradox”,first we attempt to open a new explanation for some paradoxes. In the second step, by applying this paradox, it (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Vaught's conjecture for quite o-minimal theories.B. Sh Kulpeshov & S. V. Sudoplatov - 2017 - Annals of Pure and Applied Logic 168 (1):129-149.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Generic pairs of SU-rank 1 structures.Evgueni Vassiliev - 2003 - Annals of Pure and Applied Logic 120 (1-3):103-149.
    For a supersimple SU-rank 1 theory T we introduce the notion of a generic elementary pair of models of T . We show that the theory T* of all generic T-pairs is complete and supersimple. In the strongly minimal case, T* coincides with the theory of infinite dimensional pairs, which was used in 1184–1194) to study the geometric properties of T. In our SU-rank 1 setting, we use T* for the same purpose. In particular, we obtain a characterization of linearity (...)
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • Vaught's conjecture for weakly o-minimal theories of convexity rank 1.A. Alibek, B. S. Baizhanov, B. Sh Kulpeshov & T. S. Zambarnaya - 2018 - Annals of Pure and Applied Logic 169 (11):1190-1209.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Criterion for binarity of ℵ 0 -categorical weakly o-minimal theories.B. Sh Kulpeshov - 2007 - Annals of Pure and Applied Logic 145 (3):354-367.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Minimality conditions on circularly ordered structures.Beibut Sh Kulpeshov & H. Dugald Macpherson - 2005 - Mathematical Logic Quarterly 51 (4):377-399.
    We explore analogues of o-minimality and weak o-minimality for circularly ordered sets. Much of the theory goes through almost unchanged, since over a parameter the circular order yields a definable linear order. Working over ∅ there are differences. Our main result is a structure theory for ℵ0-categorical weakly circularly minimal structures. There is a 5-homogeneous example which is not 6-homogeneous, but any example which is k-homogeneous for some k ≥ 6 is k-homogeneous for all k.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Binary types in ℵ0‐categorical weakly o‐minimal theories.Beibut Sh Kulpeshov - 2011 - Mathematical Logic Quarterly 57 (3):246-255.
    Orthogonality of all families of pairwise weakly orthogonal 1-types for ℵ0-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 ℵ0-categorical weakly o-minimal theory and give an extended criterion for binarity of ℵ0-categorical weakly o-minimal theories . © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Weakly o-minimal nonvaluational structures.Roman Wencel - 2008 - Annals of Pure and Applied Logic 154 (3):139-162.
    A weakly o-minimal structure image expanding an ordered group is called nonvaluational iff for every cut left angle bracketC,Dright-pointing angle bracket of definable in image, we have that inf{y−x:xset membership, variantC,yset membership, variantD}=0. The study of nonvaluational weakly o-minimal expansions of real closed fields carried out in [D. Macpherson, D. Marker, C. Steinhorn,Weakly o-minimal structures and real closed fields, Trans. Amer. Math. Soc. 352 5435–5483. MR1781273 (2001i:03079] suggests that this class is very close to the class of o-minimal expansions of (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • On the strong cell decomposition property for weakly o‐minimal structures.Roman Wencel - 2013 - Mathematical Logic Quarterly 59 (6):452-470.
    Download  
     
    Export citation  
     
    Bookmark   6 citations