Switch to: References

Add citations

You must login to add citations.
  1. Uniformly Bounded Arrays and Mutually Algebraic Structures.Michael C. Laskowski & Caroline A. Terry - 2020 - Notre Dame Journal of Formal Logic 61 (2):265-282.
    We define an easily verifiable notion of an atomic formula having uniformly bounded arrays in a structure M. We prove that if T is a complete L-theory, then T is mutually algebraic if and only if there is some model M of T for which every atomic formula has uniformly bounded arrays. Moreover, an incomplete theory T is mutually algebraic if and only if every atomic formula has uniformly bounded arrays in every model M of T.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Mutually algebraic structures and expansions by predicates.Michael C. Laskowski - 2013 - Journal of Symbolic Logic 78 (1):185-194.
    We introduce the notions of a mutually algebraic structures and theories and prove many equivalents. A theory $T$ is mutually algebraic if and only if it is weakly minimal and trivial if and only if no model $M$ of $T$ has an expansion $(M,A)$ by a unary predicate with the finite cover property. We show that every structure has a maximal mutually algebraic reduct, and give a strong structure theorem for the class of elementary extensions of a fixed mutually algebraic (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Characterizing Model Completeness Among Mutually Algebraic Structures.Michael C. Laskowski - 2015 - Notre Dame Journal of Formal Logic 56 (3):463-470.
    We characterize when the elementary diagram of a mutually algebraic structure has a model complete theory, and give an explicit description of a set of existential formulas to which every formula is equivalent. This characterization yields a new, more constructive proof that the elementary diagram of any model of a strongly minimal, trivial theory is model complete.
    Download  
     
    Export citation  
     
    Bookmark  
  • Mutual algebraicity and cellularity.Samuel Braunfeld & Michael C. Laskowski - 2022 - Archive for Mathematical Logic 61 (5):841-857.
    We prove two results intended to streamline proofs about cellularity that pass through mutual algebraicity. First, we show that a countable structure M is cellular if and only if M is \-categorical and mutually algebraic. Second, if a countable structure M in a finite relational language is mutually algebraic non-cellular, we show it admits an elementary extension adding infinitely many infinite MA-connected components. Towards these results, we introduce MA-presentations of a mutually algebraic structure, in which every atomic formula is mutually (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Counting Siblings in Universal Theories.Samuel Braunfeld & Michael C. Laskowski - 2022 - Journal of Symbolic Logic 87 (3):1130-1155.
    We show that if a countable structure M in a finite relational language is not cellular, then there is an age-preserving $N \supseteq M$ such that $2^{\aleph _0}$ many structures are bi-embeddable with N. The proof proceeds by a case division based on mutual algebraicity.
    Download  
     
    Export citation  
     
    Bookmark   1 citation