The dense simple sets are orbit complete with respect to the simple sets

Annals of Pure and Applied Logic 94 (1-3):37-44 (1998)
  Copy   BIBTEX

Abstract

We prove conjectures of Herrmann and Stob by showing that the dense simple sets are orbit complete w.r.t. the simple sets

Categories

Keywords

Reprint years

DOI

10.1016/s0168-0072(97)00065-1

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,937

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

On Some Complexity Characteristics of Immune Sets.Valeriy K. Bulitko - 1995 - Mathematical Logic Quarterly 41 (3):307-313.
Strongly minimal fusions of vector spaces.Kitty L. Holland - 1997 - Annals of Pure and Applied Logic 83 (1):1-22.
The ibT degrees of computably enumerable sets are not dense.George Barmpalias & Andrew E. M. Lewis - 2006 - Annals of Pure and Applied Logic 141 (1):51-60.
Cuppability of Simple and Hypersimple Sets.Martin Kummer & Marcus Schaefer - 2007 - Notre Dame Journal of Formal Logic 48 (3):349-369.
Effectively and Noneffectively Nowhere Simple Sets.Valentina S. Harizanov - 1996 - Mathematical Logic Quarterly 42 (1):241-248.
We provide a simple and transparent construction of Hrushovski's strongly minimal fusions in the case where the fused strongly minimal sets are vector spaces. We strengthen Hrushovski's result by showing that the strongly minimal fusions are model complete.Jonathan P. Seldin - 1997 - Annals of Pure and Applied Logic 83 (1):23-101.
Simple characterization of functionally complete one‐element sets of propositional connectives.Petar Maksimović & Predrag Janičić - 2006 - Mathematical Logic Quarterly 52 (5):498-504.
Dense non-reflection for stationary collections of countable sets.David Asperó, John Krueger & Yasuo Yoshinobu - 2010 - Annals of Pure and Applied Logic 161 (1):94-108.
Expansions of o-minimal structures by dense independent sets.Alfred Dolich, Chris Miller & Charles Steinhorn - 2016 - Annals of Pure and Applied Logic 167 (8):684-706.
Van Douwen’s diagram for dense sets of rationals.Jörg Brendle - 2006 - Annals of Pure and Applied Logic 143 (1-3):54-69.

Analytics

Added to PP
2014-01-16

Downloads
52 (#418,263)

6 months
6 (#858,075)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On orbits, of prompt and low computably enumerable sets.Kevin Wald - 2002 - Journal of Symbolic Logic 67 (2):649-678.

Add more citations

References found in this work

Automorphisms of the lattice of recursively enumerable sets.Peter Cholak - 1995 - Providence, RI: American Mathematical Society.

Add more references