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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

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.
Peano arithmetic may not be interpretable in the monadic theory of linear orders.Shmuel Lifsches & Saharon Shelah - 1997 - Journal of Symbolic Logic 62 (3):848-872.
Interpreting second-order logic in the monadic theory of order.Yuri Gurevich & Saharon Shelah - 1983 - Journal of Symbolic Logic 48 (3):816-828.
Random graphs in the monadic theory of order.Shmuel Lifsches & Saharon Shelah - 1999 - Archive for Mathematical Logic 38 (4-5):273-312.
Modest theory of short chains. II.Yuri Gurevich & Saharon Shelah - 1979 - Journal of Symbolic Logic 44 (4):491-502.
Exclusion principle and the identity of indiscernibles: A response to Margenau's argument.Michela Massimi - 2001 - British Journal for the Philosophy of Science 52 (2):303--30.
Regular Subgraphs in Graphs and Rooted Graphs and Definability in Monadic Second‐Order Logic.Iain A. Stewart - 1997 - Mathematical Logic Quarterly 43 (1):1-21.
The monadic second order theory of all countable ordinals.J. Richard Büchi - 1973 - New York,: Springer. Edited by Dirk Siefkes.
Hierarchies of monadic generalized quantifiers.Kerkko Luosto - 2000 - Journal of Symbolic Logic 65 (3):1241-1263.
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.
Monadic MV-algebras are Equivalent to Monadic ℓ-groups with Strong Unit.C. Cimadamore & J. P. Díaz Varela - 2011 - Studia Logica 98 (1-2):175-201.

Analytics

Added to PP
2013-12-01

Downloads
8 (#1,249,165)

6 months
1 (#1,459,555)

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