Projective mad families

15 years 3 months ago

Download www.logic.univie.ac.at

Using almost disjoint coding we prove the consistency of the existence of a 1 2 definable -mad family of infinite subsets of (resp. functions from to ) together with b = 2 = 2.

Sy-David Friedman, Lyubomyr Zdomskyy

Real-time Traffic

APAL 2010 | Definable -mad Family | Infinite Subsets |

claim paper

» Forcing indestructibility of MAD families

» Defect Prediction using Combined Product and Project Metrics A Case Study from the Open S...

» A Multimedia System for Authoring Motion Pictures

» In search of mathematical primitives for deriving universal projective hash families

» A reinforced merging methodology for mapping unique peptide motifs in members of protein f...

» A Family of Complete Caps in PGn 2

» A Tool for Transforming Conceptual Schemas of SpatioTemporal Databases with Multiple Repre...

» Creating an adaptive network of hubs using Schellings model

Post Info
More Details (n/a)

Added	08 Dec 2010
Updated	08 Dec 2010
Type	Journal
Year	2010
Where	APAL
Authors	Sy-David Friedman, Lyubomyr Zdomskyy

Comments (0)

Sciweavers

Projective mad families

APAL 2010 | Definable -mad Family | Infinite Subsets |

Explore & Download

Productivity Tools

Sciweavers