Switch to: References

Add citations

You must login to add citations.
  1. 2000 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium 2000.Carol Wood - 2001 - Bulletin of Symbolic Logic 7 (1):82-163.
  • 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 (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • 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.
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  • On ℵ0‐Categorical Weakly Circularly Minimal Structures.Beibut Sh Kulpeshov - 2006 - Mathematical Logic Quarterly 52 (6):555-574.
    We continue exploring analogues of o-minimality and weak o-minimality for circularly ordered sets. The main result is a description of ℵ0-categorical 1-transitive non-primitive weakly circularly minimal structures of convexity rank 1 up to binarity.
    Direct download  
     
    Export citation  
     
    Bookmark  
  • 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.
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  • On Definability of Types and Relative Stability.Viktor Verbovskiy - 2019 - Mathematical Logic Quarterly 65 (3):332-346.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  • 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.
    Direct download (2 more)  
     
    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.
  • 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.