Ullian Joseph S.. A theorem on maximal sets. Notre Dame journal of formal logic, vol. 2 pp. 222–223

Journal of Symbolic Logic 27 (2):244-244 (1962)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2964156

Links

PhilArchive



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

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

A theorem on maximal sets.Joseph S. Ullian - 1961 - Notre Dame Journal of Formal Logic 2 (4):222-223.
Review: Joseph S. Ullian, A Theorem on Maximal Sets. [REVIEW]Steven Orey - 1962 - Journal of Symbolic Logic 27 (2):244-244.
On the Degrees of Diagonal Sets and the Failure of the Analogue of a Theorem of Martin.Keng Meng Ng - 2009 - Notre Dame Journal of Formal Logic 50 (4):469-493.
There Are No Maximal Low D.C.E. Degrees.Liang Yu & Rod Downey - 2004 - Notre Dame Journal of Formal Logic 45 (3):147-159.
Cresswell M. J.. A Henkin completeness theorem for T. Notre Dame journal of formal logic, vol. 8 no. 3 , pp. 186–190.Cresswell M. J.. Alternative completeness theorems for modal systems. Notre Dame journal of formal logic, vol. 8 no. 4 , pp. 339–345.Cresswell M. J.. Some proofs of relative completeness in modal logic. Notre Dame journal of formal logic, vol. 9 no. 1 , pp. 62–66. [REVIEW]David Makinson - 1970 - Journal of Symbolic Logic 35 (4):581-582.
Around Silver's Theorem.Moti Gitik - 2005 - Notre Dame Journal of Formal Logic 46 (3):323-325.
A stronger theorem concerning the non-existence of combinatorial designs on infinite sets.William J. Frascella - 1973 - Notre Dame Journal of Formal Logic 14 (4):554-558.
Maximal full matrices.Biswambhar Pahi - 1972 - Notre Dame Journal of Formal Logic 13 (1):142-144.
The axiom of choice for countable collections of countable sets does not imply the countable union theorem.Paul E. Howard - 1992 - Notre Dame Journal of Formal Logic 33 (2):236-243.
Extensions of Gödel's completeness theorem and the Löwenheim-Skolem theorem.Stephen L. Bloom - 1973 - Notre Dame Journal of Formal Logic 14 (3):408-410.
Repairing proofs of Arrow's general impossibility theorem and enlarging the scope of the theorem.R. Routley - 1979 - Notre Dame Journal of Formal Logic 20 (4):879-890.
Maximal $p$-subgroups and the axiom of choice.Paul E. Howard & Mary Yorke - 1987 - Notre Dame Journal of Formal Logic 28 (2):276-283.
A theorem on ${\rm S}4.2$ and ${\rm S}4.4$.Ivo Thomas - 1967 - Notre Dame Journal of Formal Logic 8 (4):335-336.
A theorem on S4.2 and S4.4.Ivo Thomas - 1967 - Notre Dame Journal of Formal Logic 8:335.
Continuum Many Maximal Consistent Normal Bimodal Logics with Inverses.Timothy Williamson - 1998 - Notre Dame Journal of Formal Logic 39 (1):128-134.

Analytics

Added to PP
2016-06-30

Downloads
8 (#1,249,165)

6 months
2 (#1,157,335)

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

No references found.

Add more references