Free sets for set‐mappings relative to a family of sets

Mathematical Logic Quarterly 63 (6):605-613 (2017)
  Copy   BIBTEX

Abstract

Given a family of subsets of, we try to compute the least natural number n such that for every function there exists a bijection such that for all.

Other Versions

No versions found

Links

PhilArchive



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

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

Two consistency results on set mappings.Peter Komjath & Saharon Shelah - 2000 - Journal of Symbolic Logic 65 (1):333-338.
More canonical forms and dense free subsets.Heike Mildenberger - 2004 - Annals of Pure and Applied Logic 125 (1-3):75-99.
Computability in structures representing a Scott set.Alex M. McAllister - 2001 - Archive for Mathematical Logic 40 (3):147-165.
Isols and maximal intersecting classes.Jacob C. E. Dekker - 1993 - Mathematical Logic Quarterly 39 (1):67-78.
Monotone reducibility and the family of infinite sets.Douglas Cenzer - 1984 - Journal of Symbolic Logic 49 (3):774-782.
Why Numbers Are Sets.Eric Steinhart - 2002 - Synthese 133 (3):343-361.
Odd-sized partitions of Russell-sets.Horst Herrlich & Eleftherios Tachtsis - 2010 - Mathematical Logic Quarterly 56 (2):185-190.
Finite sets and infinite sets in weak intuitionistic arithmetic.Takako Nemoto - 2020 - Archive for Mathematical Logic 59 (5-6):607-657.

Analytics

Added to PP
2017-12-24

Downloads
26 (#852,250)

6 months
4 (#1,247,585)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

Two consistency results on set mappings.Peter Komjath & Saharon Shelah - 2000 - Journal of Symbolic Logic 65 (1):333-338.

Add more references