Matteo Casarosa
Matteo Casarosa
The derived functors lim n of the inverse limit are widely studied for their topological applications, among which are some repercussions on the additivity of strong homology. Set theory has proven useful in dealing with these functors, fo...
Serhii Bardyla,Jaroslav Šupina,Lyubomyr Zdomskyy
Serhii Bardyla
In this paper, we investigate the poset OF ( X ) of free open filters on a given space X. In particular, we characterize spaces for which OF ( X ) is a lattice. For each n ∈ N we construct a scattered space X such that OF ( X ) is...
The Josefson-Nissenzweig theorem and filters on [Formula: see text] [0.03%]
Josefson-Nissenzweig定理与集合上的滤子[公式:请见原文]
Witold Marciszewski,Damian Sobota
Witold Marciszewski
For a free filter F on ω , endow the space N F = ω ∪ { p F } , where p F ∉ ω , with the topology in which every element of ω is isolated whereas all open neighborhoods of p F are of the form A ∪ {...
Damian Sobota,Lyubomyr Zdomskyy
Damian Sobota
We prove that if A is an infinite Boolean algebra in the ground model V and P is a notion of forcing adding any of the following reals: a Cohen real, an unsplit real, or a random real, then, in any P-generic extension V[G], A has neither th...
Vera Fischer,Marlene Koelbing,Wolfgang Wohofsky
Vera Fischer
We show that Hechler's forcings for adding a tower and for adding a mad family can be represented as finite support iterations of Mathias forcings with respect to filters and that these filters are B-Canjar for any countably directed unboun...
Vera Fischer,Corey Bacal Switzer
Vera Fischer
We study κ-maximal cofinitary groups for κ regular uncountable, κ=κ
Positive logics [0.03%]
积极逻辑
Saharon Shelah,Jouko Väänänen
Saharon Shelah
Lindström's Theorem characterizes first order logic as the maximal logic satisfying the Compactness Theorem and the Downward Löwenheim-Skolem Theorem. If we do not assume that logics are closed under negation, there is an obvious extensio...
Corey Bacal Switzer
Corey Bacal Switzer
A Kaufmann model is an ω 1 -like, recursively saturated, rather classless model of P A (or Z F ). Such models were constructed by Kaufmann under the combinatorial principle ♢ ω 1 and Shelah showed they exist in ZFC by a...
Martin Goldstern,Lukas Daniel Klausner
Martin Goldstern
We reimplement the creature forcing construction used by Fischer et al. (Arch Math Log 56(7-8):1045-1103, 2017. 10.1007/S00153-017-0553-8. arXiv:1402.0367 [math.LO]) to separate Cichoń's diagram into five cardinals as a countable support p...
24th Workshop on Logic, Language, Information and Computation-WoLLIC 2017 [0.03%]
第24届逻辑、语言、信息与计算研讨会(WOLLIC 2017)
Juliette Kennedy,Ruy de Queiroz
Juliette Kennedy