Premium
Free sets for set‐mappings relative to a family of sets
Author(s) -
Avilés Antonio,
Piña Claribet
Publication year - 2017
Publication title -
mathematical logic quarterly
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.473
H-Index - 28
eISSN - 1521-3870
pISSN - 0942-5616
DOI - 10.1002/malq.201600100
Subject(s) - bijection , mathematics , set (abstract data type) , combinatorics , existential quantification , function (biology) , natural number , discrete mathematics , computer science , programming language , evolutionary biology , biology
Given a family F of subsets of { 1 , … , m } , we try to compute the least natural number n such that for every function S : [ ℵ n ] < ω ⟶ [ ℵ n ] < ωthere exists a bijection u : { 1 , … , m } ⟶ Y ⊂ ℵ nsuch that S ( u ( A ) ) ∩ Y ⊂ u ( A ) for all A ∈ F .
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom