A Remark on Ascending Chain Conditions, the Countable Axiom of Choice and the Principle of Dependent Choices

Mathematical Logic Quarterly 40 (3):415-421 (1994)
  Copy   BIBTEX

Abstract

It is easy to prove in ZF− that a relation R satisfies the maximal condition if and only if its transitive hull R* does; equivalently: R is well-founded if and only if R* is. We will show in the following that, if the maximal condition is replaced by the chain condition, as is often the case in Algebra, the resulting statement is not provable in ZF− anymore . More precisely, we will prove that this statement is equivalent in ZF− to the countable axiom of choice ACω. Moreover, applying this result we will prove that the axiom of dependent choices, restricted to partial orders as used in Algebra, already implies the general form for arbitrary relations as formulated first by Teichmüller and, independently, some time later by Bernays and Tarski

Other Versions

No versions found

Links

PhilArchive



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

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

Analytics

Added to PP
2013-12-01

Downloads
49 (#441,488)

6 months
4 (#1,232,162)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Cylindric algebras.Leon Henkin - 1971 - Amsterdam,: North-Holland Pub. Co.. Edited by J. Donald Monk & Alfred Tarski.
Universal Algebra.George Grätzer - 1982 - Studia Logica 41 (4):430-431.

View all 7 references / Add more references