Simple monadic theories and indiscernibles

Mathematical Logic Quarterly 57 (1):65-86 (2011)
  Copy   BIBTEX

Abstract

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

Categories

Keywords

Reprint years

DOI

10.1002/malq.200910121

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,505

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Simple monadic theories and partition width.Achim Blumensath - 2011 - Mathematical Logic Quarterly 57 (4):409-431.
On countable chains having decidable monadic theory.Alexis Bés & Alexander Rabinovich - 2012 - Journal of Symbolic Logic 77 (2):593-608.
Interpreting the weak monadic second order theory of the ordered rationals.John K. Truss - 2022 - Mathematical Logic Quarterly 68 (1):74-78.
Interpreting second-order logic in the monadic theory of order.Yuri Gurevich & Saharon Shelah - 1983 - Journal of Symbolic Logic 48 (3):816-828.
Pairs, sets and sequences in first-order theories.Albert Visser - 2008 - Archive for Mathematical Logic 47 (4):299-326.
Model theory of monadic predicate logic with the infinity quantifier.Facundo Carreiro, Alessandro Facchini, Yde Venema & Fabio Zanasi - 2022 - Archive for Mathematical Logic 61 (3):465-502.
Decidability and undecidability of theories with a predicate for the primes.P. T. Bateman, C. G. Jockusch & A. R. Woods - 1993 - Journal of Symbolic Logic 58 (2):672-687.
Random graphs in the monadic theory of order.Shmuel Lifsches & Saharon Shelah - 1999 - Archive for Mathematical Logic 38 (4-5):273-312.
The complexity of first-order and monadic second-order logic revisited.Markus Frick & Martin Grohe - 2004 - Annals of Pure and Applied Logic 130 (1-3):3-31.
The complete extensions of the monadic second order theory of countable ordinals.J. Richard Büchi & Dirk Siefkes - 1983 - Mathematical Logic Quarterly 29 (5):289-312.

Analytics

Added to PP
2013-12-01

Downloads
12 (#1,373,211)

6 months
3 (#1,475,474)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Simple monadic theories and partition width.Achim Blumensath - 2011 - Mathematical Logic Quarterly 57 (4):409-431.

Add more citations

References found in this work

Second-order quantifiers and the complexity of theories.J. T. Baldwin & S. Shelah - 1985 - Notre Dame Journal of Formal Logic 26 (3):229-303.
The structure of the models of decidable monadic theories of graphs.D. Seese - 1991 - Annals of Pure and Applied Logic 53 (2):169-195.
A model-theoretic characterisation of clique width.Achim Blumensath - 2006 - Annals of Pure and Applied Logic 142 (1):321-350.

Add more references