DOIAbstract
We introduce the notion of additive filter and present a new proof of the existence of idempotent ultrafilters on N without using Zorn’s Lemma in its entire power, and where one only assumes the Ultrafilter Theorem for the continuum
We introduce the notion of additive filter and present a new proof of the existence of idempotent ultrafilters on N without using Zorn’s Lemma in its entire power, and where one only assumes the Ultrafilter Theorem for the continuum
summary:We introduce the notion of a {coherent $P$-ultrafilter} on a complete ccc Boolean algebra, s...
AbstractSuperfilters are generalizations of ultrafilters, and capture the underlying concept in Rams...
AbstractWe develop a game-theoretic approach to partition theorems, like those of Mathias, Taylor, a...
We introduce the notion of additive filter and present a new proof of the existence of idempotent ul...
This dissertation focuses on strongly summable ultrafilters, which are ultrafilters that are related...
summary:We show that given infinite sets $X,Y$ and a function $f:X\rightarrow Y$ which is onto and $...
Ultrafilters are very important mathematical objects in mathematical research [6, 22, 23]. There are...
The topics of this thesis are properties that distinguish between the 22Xo isomorphism-classes (call...
This dissertation makes contributions to the areas of combinatorial set theory, the model theory of ...
In this paper we study a notion of preorder that arises in combinatorial number theory, namely the f...
We show in the Zermelo-Fraenkel set theory ZF without the axiom of choice: Given an infinite set X, ...
AbstractWe show that it is consistent that the reaping number ris less than u, the size of the small...
In this paper we present a use of nonstandard methods in the theory of ultrafilters and in related a...
Given a set X, ultrafilters determine which subsets of X should be considered as large. We illustrat...
We study some limitations and possible occurrences of uniform ultrafilters on ordinals without the a...
summary:We introduce the notion of a {coherent $P$-ultrafilter} on a complete ccc Boolean algebra, s...
AbstractSuperfilters are generalizations of ultrafilters, and capture the underlying concept in Rams...
AbstractWe develop a game-theoretic approach to partition theorems, like those of Mathias, Taylor, a...
We introduce the notion of additive filter and present a new proof of the existence of idempotent ul...
This dissertation focuses on strongly summable ultrafilters, which are ultrafilters that are related...
summary:We show that given infinite sets $X,Y$ and a function $f:X\rightarrow Y$ which is onto and $...
Ultrafilters are very important mathematical objects in mathematical research [6, 22, 23]. There are...
The topics of this thesis are properties that distinguish between the 22Xo isomorphism-classes (call...
This dissertation makes contributions to the areas of combinatorial set theory, the model theory of ...
In this paper we study a notion of preorder that arises in combinatorial number theory, namely the f...
We show in the Zermelo-Fraenkel set theory ZF without the axiom of choice: Given an infinite set X, ...
AbstractWe show that it is consistent that the reaping number ris less than u, the size of the small...
In this paper we present a use of nonstandard methods in the theory of ultrafilters and in related a...
Given a set X, ultrafilters determine which subsets of X should be considered as large. We illustrat...
We study some limitations and possible occurrences of uniform ultrafilters on ordinals without the a...
summary:We introduce the notion of a {coherent $P$-ultrafilter} on a complete ccc Boolean algebra, s...
AbstractSuperfilters are generalizations of ultrafilters, and capture the underlying concept in Rams...
AbstractWe develop a game-theoretic approach to partition theorems, like those of Mathias, Taylor, a...
Add to ORKG