Some logically weak Ramseyan theorems
نویسندگان
چکیده
منابع مشابه
Extensions of Some Fixed Point Theorems for Weak-Contraction Mappings in Partially Ordered Modular Metric Spaces
The purpose of this paper is to establish fixed point results for a single mapping in a partially ordered modular metric space, and to prove a common fixed point theorem for two self-maps satisfying some weak contractive inequalities.
متن کاملWeak Lefschetz Theorems
A new approach to Nori's weak Lefschetz theorem is described. The new approach, which involves the ¯ ∂-method, avoids moving arguments and gives much stronger results. In particular, it is proved that if X and Y are connected smooth projective varieties of positive dimension and f : Y − → X is a holomorphic immersion with ample normal bundle, then the image of π 1 (Y) in π 1 (X) is of finite in...
متن کاملRamseyan Properties of Graphs
Every graph of chromatic number k with more than k(r − 1)(b − 1) vertices has a b-element independent set of vertices such that if any two of them are joined by an edge then the chromatic number stays the same or a r-element independent set of vertices such that joining any two of them by an edge increases the chromatic number. 0. Introduction. Let P be a class of graphs and let x and y be a pa...
متن کاملWEAK AND STRONG DUALITY THEOREMS FOR FUZZY CONIC OPTIMIZATION PROBLEMS
The objective of this paper is to deal with the fuzzy conic program- ming problems. The aim here is to derive weak and strong duality theorems for a general fuzzy conic programming. Toward this end, The convexity-like concept of fuzzy mappings is introduced and then a speci c ordering cone is established based on the parameterized representation of fuzzy numbers. Un- der this setting, duality t...
متن کاملOn the Ramseyan Factorization Theorem
We study, in the context of reverse mathematics, the strength of Ramseyan factorization theorem (RFk), a Ramsey-type theorem used in automata theory. We prove that RFk is equivalent to RT 2 2 for all s, k ≥ 2, k ∈ ω over RCA0. We also consider a weak version of Ramseyan factorization theorem and prove that it is in between ADS and CAC.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2014
ISSN: 0001-8708
DOI: 10.1016/j.aim.2014.05.003