Remark added 2004

Abstract

Theorem 3.1. can be strengthened. Let S be a (well-termed) local set theory and (E, ≤) a partially ordered S-set. An element m of E is internally maximal if it satisfies S ∀x∈E [m ≤ x → m = x]. We can then prove the..

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,127

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Similar books and articles

A cardinality version of biegel's nonspeedup theorem.James C. Owings - 1989 - Journal of Symbolic Logic 54 (3):761-767.
The Definability of the Extender Sequence From In.Farmer Schlutzenberg - 2024 - Journal of Symbolic Logic 89 (2):427-459.
Splitting stationary sets in.Toshimichi Usuba - 2012 - Journal of Symbolic Logic 77 (1):49-62.
Les automorphismes d'un ensemble fortement minimal.Daniel Lascar - 1992 - Journal of Symbolic Logic 57 (1):238-251.
A note on standard systems and ultrafilters.Fredrik Engström - 2008 - Journal of Symbolic Logic 73 (3):824-830.
Vectorial composition of velocities in relativity.Boris Leaf - 1955 - Philosophy of Science 22 (4):321-324.
One theorem of Zil′ber's on strongly minimal sets.Steven Buechler - 1985 - Journal of Symbolic Logic 50 (4):1054-1061.
A dichotomy result for a pointwise summable sequence of operators.V. Gregoriades - 2009 - Annals of Pure and Applied Logic 160 (2):154-162.

Analytics

Added to PP
2009-01-28

Downloads
21 (#762,792)

6 months
21 (#133,716)

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