On ordering of the system of all subsets of a given set

Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 10 (18):283-301 (1964)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19640101804

Links

PhilArchive



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

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

Possible behaviours of the reflection ordering of stationary sets.Jiří Witzany - 1995 - Journal of Symbolic Logic 60 (2):534-547.
Notes and Comments.Brian Mcneil - 1938 - New Scholasticism 12 (2):197-198.
Cause and counterfactual.Herbert A. Simon & Nicholas Rescher - 1966 - Philosophy of Science 33 (4):323-340.
Some new natural α-RE-Degrees.Colin G. Bailey - 1987 - Journal of Symbolic Logic 52 (1):227-231.
On ordering and multiplication of natural numbers.Kamila Bendová - 2001 - Archive for Mathematical Logic 40 (1):19-23.
$\Pi _{1}^{0}$ Classes and Strong Degree Spectra of Relations.John Chisholm, Jennifer Chubb, Valentina S. Harizanov, Denis R. Hirschfeldt, Carl G. Jockusch, Timothy McNicholl & Sarah Pingrey - 2007 - Journal of Symbolic Logic 72 (3):1003 - 1018.
The problem of properties in quantum mechanics.Jeffrey Bub - 1991 - Topoi 10 (1):27-34.
The Settling-Time Reducibility Ordering.Barbara F. Csima & Richard A. Shore - 2007 - Journal of Symbolic Logic 72 (3):1055 - 1071.
A general theorem on termination of rewriting.Jeremy E. Dawson - unknown
Some New Natural $alpha$-RE-Degrees.Colin G. Bailey - 1987 - Journal of Symbolic Logic 52 (1):227-231.
Ein Wohlordnungsbeweis für das OrdinalzahlensystemT(J).K. Schütte - 1988 - Archive for Mathematical Logic 27 (1):5-20.
Order extensions, budget correspondences, and rational choice.Susanne Fuchs-Seliger - 2012 - Theory and Decision 72 (4):431-444.
is a set B with Boolean operations a∨ b (join), a∧ b (meet) and− a (complement), partial ordering a≤ b defined by a∧ b= a and the smallest and greatest element, 0 and 1. By Stone's Representation Theorem, every Boolean algebra is isomorphic to an algebra of subsets of some nonempty set S, under operations a∪ b, a∩ b, S− a, ordered by inclusion, with 0=∅. [REVIEW]Mystery Of Measurability - 2006 - Bulletin of Symbolic Logic 12 (2).

Analytics

Added to PP
2014-01-16

Downloads
20 (#749,846)

6 months
1 (#1,516,429)

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

Transfinite Zahlen.Heinz Bachmann - 1959 - Journal of Symbolic Logic 24 (3):223-224.

Add more references