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

Other Versions

No versions found

Links

PhilArchive



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

External links

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

Through your library

Similar books and articles

Constructive Order Theory.Marcel Erné - 2001 - Mathematical Logic Quarterly 47 (2):211-222.
On the minimal cover property and certain notions of finite.Eleftherios Tachtsis - 2018 - Archive for Mathematical Logic 57 (5-6):665-686.
Unions and the axiom of choice.Omar de la Cruz, Eric Hall, Paul Howard, Kyriakos Keremedis & Jean Rubin - 2008 - Mathematical Logic Quarterly 54 (6):652-665.
Partition Principles and Infinite Sums of Cardinal Numbers.Masasi Higasikawa - 1995 - Notre Dame Journal of Formal Logic 36 (3):425-434.

Analytics

Added to PP
2010-08-24

Downloads
45 (#496,766)

6 months
12 (#307,302)

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.

Add more references