Displaying 261 – 280 of 2134

Showing per page

Analyse relative

Yves Peraire (1992)

Annales scientifiques de l'Université de Clermont. Mathématiques

Analytic determinacy and 0# A forcing-free proof of Harrington’s theorem

Ramez Sami (1999)

Fundamenta Mathematicae

We prove the following theorem: Given a⊆ω and 1 α < ω 1 C K , if for some η < 1 and all u ∈ WO of length η, a is Σ α 0 ( u ) , then a is Σ α 0 . We use this result to give a new, forcing-free, proof of Leo Harrington’s theorem: Σ 1 1 -Turing-determinacy implies the existence of 0 .

Analytic gaps

Stevo Todorčević (1996)

Fundamenta Mathematicae

We investigate when two orthogonal families of sets of integers can be separated if one of them is analytic.

Analytic partial orders and oriented graphs

Alain Louveau (2006)

Fundamenta Mathematicae

We prove that there is no maximum element, under Borel reducibility, in the class of analytic partial orders and in the class of analytic oriented graphs. We also provide a natural jump operator for these two classes.

Another ⋄-like principle

Michael Hrušák (2001)

Fundamenta Mathematicae

A new ⋄-like principle consistent with the negation of the Continuum Hypothesis is introduced and studied. It is shown that ¬ is consistent with CH and that in many models of = ω₁ the principle holds. As implies that there is a MAD family of size ℵ₁ this provides a partial answer to a question of J. Roitman who asked whether = ω₁ implies = ω₁. It is proved that holds in any model obtained by adding a single Laver real, answering a question of J. Brendle who asked whether = ω₁ in such models....

Another ordering of the ten cardinal characteristics in Cichoń's diagram

Jakob Kellner, Saharon Shelah, Anda R. Tănasie (2019)

Commentationes Mathematicae Universitatis Carolinae

It is consistent that 1 < add ( 𝒩 ) < add ( ) = 𝔟 < cov ( 𝒩 ) < non ( ) < cov ( ) = 2 0 . Assuming four strongly compact cardinals, it is consistent that 1 < add ( 𝒩 ) < add ( ) = 𝔟 < cov ( 𝒩 ) < non ( ) < cov ( ) < non ( 𝒩 ) < cof ( ) = 𝔡 < cof ( 𝒩 ) < 2 0 .

Another proof of a result of Jech and Shelah

Péter Komjáth (2013)

Czechoslovak Mathematical Journal

Shelah’s pcf theory describes a certain structure which must exist if ω is strong limit and 2 ω > ω 1 holds. Jech and Shelah proved the surprising result that this structure exists in ZFC. They first give a forcing extension in which the structure exists then argue that by some absoluteness results it must exist anyway. We reformulate the statement to the existence of a certain partially ordered set, and then we show by a straightforward, elementary (i.e., non-metamathematical) argument that such partially...

Applications of limited information strategies in Menger's game

Steven Clontz (2017)

Commentationes Mathematicae Universitatis Carolinae

As shown by Telgársky and Scheepers, winning strategies in the Menger game characterize σ -compactness amongst metrizable spaces. This is improved by showing that winning Markov strategies in the Menger game characterize σ -compactness amongst regular spaces, and that winning strategies may be improved to winning Markov strategies in second-countable spaces. An investigation of 2-Markov strategies introduces a new topological property between σ -compact and Menger spaces.

Applications of some strong set-theoretic axioms to locally compact T₅ and hereditarily scwH spaces

Peter J. Nyikos (2003)

Fundamenta Mathematicae

Under some very strong set-theoretic hypotheses, hereditarily normal spaces (also referred to as T₅ spaces) that are locally compact and hereditarily collectionwise Hausdorff can have a highly simplified structure. This paper gives a structure theorem (Theorem 1) that applies to all such ω₁-compact spaces and another (Theorem 4) to all such spaces of Lindelöf number ≤ ℵ₁. It also introduces an axiom (Axiom F) on crowding of functions, with consequences (Theorem 3) for the crowding of countably compact...

Approximations of lattice-valued possibilistic measures

Ivan Kramosil (2005)

Kybernetika

Lattice-valued possibilistic measures, conceived and developed in more detail by G. De Cooman in 1997 [2], enabled to apply the main ideas on which the real-valued possibilistic measures are founded also to the situations often occurring in the real world around, when the degrees of possibility, ascribed to various events charged by uncertainty, are comparable only quantitatively by the relations like “greater than” or “not smaller than”, including the particular cases when such degrees are not...

Currently displaying 261 – 280 of 2134