Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

JSYML
2000

favoriteEmaildiscussreport

48views more JSYML 2000»

Two Consistency Results on Set Mappings

13 years 4 months ago

Two Consistency Results on Set Mappings

Download shelah.logic.at

It is consistent that there is a set mapping from the four-tuples of n into the finite subsets with no free subsets of size tn for some natural number tn. For any n < it is consistent that there is a set mapping from the pairs of n into the finite subsets with no infinite free sets. For any n < it is consistent that there is a set mapping from the pairs of n into n with no uncountable free sets. In this paper we consider some problems on set mappings, that is, for our current purposes, functions of the type f : []k []<

Péter Komjáth, Saharon Shelah

Real-time Traffic

Finite Subsets | Free Sets | JSYML 2000 | Set Mapping |

claim paper

Related Content

» XSOM Results for OAEI 2007

» New results on optimizing rooted triplets consistency

» Surface matching using consistent pants decomposition

» Handling the Inconsistency of Relative Map Filter

» Improving the Consistency of Relative Map

» Interpretation of multiple probe sets mapping to the same gene in Affymetrix GeneChips

» PiecewiseConsistent Color Mappings of Images Acquired Under Various Conditions

» Canonical structure in the universe of set theory part two

» On the Assessment of Generalisation Consistency

Post Info
More Details (n/a)

Added	19 Dec 2010
Updated	19 Dec 2010
Type	Journal
Year	2000
Where	JSYML
Authors	Péter Komjáth, Saharon Shelah

Comments (0)