On Kueker Simple Theories

Journal of Symbolic Logic 70 (1):216 - 222 (2005)
Abstract We show that a Kueker simple theory eliminates Ǝ∞ and densely interprets weakly minimal formulas. As part of the proof we generalize Hrushovski's dichotomy for almost complete formulas to simple theories. We conclude that in a unidimensional simple theory an almost-complete formula is either weakly minimal or trivially-almost-complete. We also observe that a small unidimensional simple theory is supersimple of finite SU-rank
Keywords No keywords specified (fix it)
Categories
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 5,882
External links
  •   Try with proxy.
  • Through your library Configure

    Similar books and articles
    Anand Pillay (2003). On Countable Simple Unidimensional Theories. Journal of Symbolic Logic 68 (4):1377-1384.
    Ziv Shami (2000). Definability in Low Simple Theories. Journal of Symbolic Logic 65 (4):1481-1490.

    Analytics

    Monthly downloads

    Sorry, there are not enough data points to plot this chart.

    Added to index

    2010-08-24

    Total downloads

    0

    Recent downloads (6 months)

    0

    How can I increase my downloads?


    My notes
    Sign in to use this feature


    Discussion
    Start a new thread
    Order:
    There  are no threads in this forum
    Nothing in this forum yet.

    Other forums