Well Ordered Subsets of Linearly Ordered Sets

&
Notre Dame Journal of Formal Logic 35 (3):413-425 (1994)
  Copy   BIBTEX

Abstract

The deductive relationships between six statements are examined in set theory without the axiom of choice. Each of these statements follows from the axiom of choice and involves linear orderings in some way

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1040511347

Links

PhilArchive



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

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

Partially ordered sets and the independence property.James H. Schmerl - 1989 - Journal of Symbolic Logic 54 (2):396-401.
Definable sets in Boolean-ordered o-minimal structures. I.Ludomir Newelski & Roman Wencel - 2001 - Journal of Symbolic Logic 66 (4):1821-1836.
Reconsidering ordered pairs.Dana Scott & Dominic McCarty - 2008 - Bulletin of Symbolic Logic 14 (3):379-397.
Ordered preference differences without ordered preferences.Peter C. Fishburn - 1986 - Synthese 67 (2):361 - 368.
Real functions on the family of all well-ordered subsets of a partially ordered set.Stevo Todorčević - 1983 - Journal of Symbolic Logic 48 (1):91-96.
Quasi-o-minimal structures.Oleg Belegradek, Ya'acov Peterzil & Frank Wagner - 2000 - Journal of Symbolic Logic 65 (3):1115-1132.
Decidability and ℵ0-categoricity of theories of partially ordered sets.James H. Schmerl - 1980 - Journal of Symbolic Logic 45 (3):585 - 611.
Decidability and finite axiomatizability of theories of ℵ0-categorical partially ordered sets.James H. Schmerl - 1981 - Journal of Symbolic Logic 46 (1):101 - 120.
Ordered sets R and Q as bases of Kripke models.Mitio Takano - 1987 - Studia Logica 46 (2):137 - 148.
The axiom of choice for well-ordered families and for families of well- orderable sets.Paul Howard & Jean E. Rubin - 1995 - Journal of Symbolic Logic 60 (4):1115-1117.
Existentially closed models via constructible sets: There are 2ℵ0 existentially closed pairwise non elementarily equivalent existentially closed ordered groups. [REVIEW]Anatole Khelif - 1996 - Journal of Symbolic Logic 61 (1):277 - 284.
A special class of almost disjoint families.Thomas E. Leathrum - 1995 - Journal of Symbolic Logic 60 (3):879-891.
Monotone reducibility and the family of infinite sets.Douglas Cenzer - 1984 - Journal of Symbolic Logic 49 (3):774-782.
The variety of lattice-ordered monoids generated by the natural numbers.Annika M. Wille - 2004 - Studia Logica 76 (2):275 - 290.

Analytics

Added to PP
2010-08-24

Downloads
32 (#496,853)

6 months
9 (#300,433)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On the minimal cover property and certain notions of finite.Eleftherios Tachtsis - 2018 - Archive for Mathematical Logic 57 (5-6):665-686.

Add more citations

References found in this work

A Class of 'Near‐Finite' Order‐Types.John L. Hickman - 1979 - Mathematical Logic Quarterly 25 (3‐6):79-92.
A Class of ‘Near‐Finite’ Order‐Types.John L. Hickman - 1979 - Mathematical Logic Quarterly 25 (3-6):79-92.

Add more references