Terminal notions in set theory

Annals of Pure and Applied Logic 109 (1-2):89-116 (2001)
  Copy   BIBTEX

Abstract

In mathematical practice certain formulas φ are believed to essentially decide all other natural properties of the object x. The purpose of this paper is to exactly quantify such a belief for four formulas φ, namely “x is a Ramsey ultrafilter”, “x is a free Souslin tree”, “x is an extendible strong Lusin set” and “x is a good diamond sequence”

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,923

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

Terminal notions.Jindřich Zapletal - 1999 - Bulletin of Symbolic Logic 5 (4):470-478.
The terminal, the futile, and the psychiatrically disordered.Michael Cholbi - 2013 - International Journal of Law and Psychiatry 36.
A Unified Tenseless Theory of Time.Cheng-Chih Tsai - 2011 - Prolegomena 10 (1):5-37.
End-of-life ethics: a case study approach.Kenneth J. Doka (ed.) - 2012 - Washington, D.C.: Hospice Foundation of America.
Intuitionism and proof theory.A. Kino, John Myhill & Richard Eugene Vesley (eds.) - 1970 - Amsterdam,: North-Holland Pub. Co..
On Existence in Set Theory.Rodrigo A. Freire - 2012 - Notre Dame Journal of Formal Logic 53 (4):525-547.
Virilio, Stelarc and Terminal Technoculture.Nicholas Zurbrugg - 1999 - Theory, Culture and Society 16 (5-6):177-199.

Analytics

Added to PP
2014-01-16

Downloads
16 (#930,647)

6 months
3 (#1,037,581)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Ideals and Their Generic Ultrafilters.David Chodounský & Jindřich Zapletal - 2020 - Notre Dame Journal of Formal Logic 61 (3):403-408.

Add more citations

References found in this work

A Δ22 well-order of the reals and incompactness of L.Uri Abraham & Saharon Shelah - 1993 - Annals of Pure and Applied Logic 59 (1):1-32.
Forcing with filters and complete combinatorics.Claude Laflamme - 1989 - Annals of Pure and Applied Logic 42 (2):125-163.
Games played on Boolean algebras.Matthew Foreman - 1983 - Journal of Symbolic Logic 48 (3):714-723.
Canonical models for ℵ1-combinatorics.Saharon Shelah & Jindr̆ich Zapletal - 1999 - Annals of Pure and Applied Logic 98 (1-3):217-259.

View all 8 references / Add more references