Journal of Symbolic Logic 73 (3):861-884 (2008)

This article aims to classify those reducts of expansions of (Q, <) by unary predicates which eliminate quantifiers, and in particular to show that, up to interdefinability, there are only finitely many for a given language. Equivalently, we wish to classify the closed subgroups of Sym(Q) containing the group of all automorphisms of (Q, <) fixing setwise certain subsets. This goal is achieved for expansions by convex predicates, yielding expansions by constants as a special case, and for the expansion by a dense, co-dense predicate. Partial results are obtained in the general setting of several dense predicates
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/jsl/1230396752
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 58,777
Through your library

References found in this work BETA

Reducts of Random Hypergraphs.Simon Thomas - 1996 - Annals of Pure and Applied Logic 80 (2):165-193.

Add more references

Citations of this work BETA

Reducts of the Generic Digraph.Lovkush Agarwal - 2016 - Annals of Pure and Applied Logic 167 (3):370-391.
Reducts of the Henson Graphs with a Constant.András Pongrácz - 2017 - Annals of Pure and Applied Logic 168 (7):1472-1489.
Reducts of the Random Bipartite Graph.Yun Lu - 2013 - Notre Dame Journal of Formal Logic 54 (1):33-46.

Add more citations

Similar books and articles

Saturated Models of Peano Arithmetic.J. F. Pabion - 1982 - Journal of Symbolic Logic 47 (3):625-637.
Reducts of Some Structures Over the Reals.Ya′Acov Peterzil - 1993 - Journal of Symbolic Logic 58 (3):955-966.
Reducts of (C, +, ⋅) Which Contain +.D. Marker & A. Pillay - 1990 - Journal of Symbolic Logic 55 (3):1243-1251.
Definability in Reducts of Algebraically Closed Fields.Gary A. Martin - 1988 - Journal of Symbolic Logic 53 (1):188-199.
Reducts of the Random Graph.Simon Thomas - 1991 - Journal of Symbolic Logic 56 (1):176-181.
Reducts of the Random Bipartite Graph.Yun Lu - 2013 - Notre Dame Journal of Formal Logic 54 (1):33-46.
Linear Reducts of the Complex Field.James Loveys - 2004 - Notre Dame Journal of Formal Logic 45 (3):161-190.
Additive Reducts of Real Closed Fields.David Marker, Ya'acov Peterzil & Anand Pillay - 1992 - Journal of Symbolic Logic 57 (1):109-117.


Added to PP index

Total views
28 ( #377,590 of 2,425,450 )

Recent downloads (6 months)
1 ( #547,144 of 2,425,450 )

How can I increase my downloads?


My notes