Switch to: References

Add citations

You must login to add citations.
  1. Simple monadic theories and partition width.Achim Blumensath - 2011 - Mathematical Logic Quarterly 57 (4):409-431.
    We study tree-like decompositions of models of a theory and a related complexity measure called partition width. We prove a dichotomy concerning partition width and definable pairing functions: either the partition width of models is bounded, or the theory admits definable pairing functions. Our proof rests on structure results concerning indiscernible sequences and finitely satisfiable types for theories without definable pairing functions. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
    Direct download  
     
    Export citation  
     
    Bookmark  
  • Simple monadic theories and indiscernibles.Achim Blumensath - 2011 - Mathematical Logic Quarterly 57 (1):65-86.
    Aiming for applications in monadic second-order model theory, we study first-order theories without definable pairing functions. Our main results concern forking-properties of sequences of indiscernibles. These turn out to be very well-behaved for the theories under consideration.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Locality and modular Ehrenfeucht–Fraïssé games.Achim Blumensath - 2012 - Journal of Applied Logic 10 (1):144-162.