For a free filter F on $$\omega $$ ω, endow the space $$N_F=\omega \cup \{p_F\}$$ N F = ω ∪ { p F }, where $$p_F\not \in \omega $$ p F ∉ ω, with the topology in which every element of $$\omega $$ ω is isolated whereas all open neighborhoods of $$p_F$$ p F are of the form $$A\cup \{p_F\}$$ A ∪ { p F } for $$A\in F$$ A ∈ F. Spaces of the form $$N_F$$ N F constitute the (...) class of the simplest non-discrete Tychonoff spaces. The aim of this paper is to study them in the context of the celebrated Josefson–Nissenzweig theorem from Banach space theory. We prove, e.g., that, for a filter F, the space $$N_F$$ N F carries a sequence $$\langle \mu _n:n\in \omega \rangle $$ ⟨ μ n : n ∈ ω ⟩ of normalized finitely supported signed measures such that $$\mu _n(f)\rightarrow 0$$ μ n ( f ) → 0 for every bounded continuous real-valued function f on $$N_F$$ N F if and only if $$F^*\le _K{\mathcal {Z}}$$ F ∗ ≤ K Z, that is, the dual ideal $$F^*$$ F ∗ is Katětov below the asymptotic density ideal $${\mathcal {Z}}$$ Z. Consequently, we get that if $$F^*\le _K{\mathcal {Z}}$$ F ∗ ≤ K Z, then: (1) if X is a Tychonoff space and $$N_F$$ N F is homeomorphic to a subspace of X, then the space $$C_p^*(X)$$ C p ∗ ( X ) of bounded continuous real-valued functions on X contains a complemented copy of the space $$c_0$$ c 0 endowed with the pointwise topology, (2) if K is a compact Hausdorff space and $$N_F$$ N F is homeomorphic to a subspace of K, then the Banach space C(K) of continuous real-valued functions on K is not a Grothendieck space. The latter result generalizes the well-known fact stating that if a compact Hausdorff space K contains a non-trivial convergent sequence, then the space C(K) is not Grothendieck. (shrink)

We investigate club guessing sequences and filters. We prove that assuming V=L, there exists a strong club guessing sequence on μ if and only if μ is not ineffable for every uncountable regular cardinal μ. We also prove that for every uncountable regular cardinal μ, relative to the existence of a Woodin cardinal above μ, it is consistent that every tail club guessing ideal on μ is precipitous.

It is a theorem of Prikry [7] that ifκcarries a uniformη-descendingly complete ultrafilter then the stationary reflection propertyfails. In this paper we will derive similar results, but here from properties of filters rather than ultrafilters.Throughoutκandηwill denote regular cardinals withη<κ, andIwill denote an ideal onκ, by which we mean a setI⊆P such that Iis closed under taking subsets and finite unions and αЄIfor eachα<κ, butκ∉I.Iis said to beμ-complete if it is closed under taking unions of size <μ,I* = {X⊆κ∣κ−XЄI} is (...) the filter dual toIand ifAЄI+ −I), thenI∣Ais the ideal onκgiven byI∣A= {X⊆κ∣X∩AЄI}. Ifh: A→κthenhis said to be unbounded modIif for eachα<κ,h−1 = {ξЄA∣h<α} ЄIand a least function forIifhis unbounded modIand wheneverg: A→κis a function, unbounded modI, then {ξЄA∣g{ξ) shrink)

Let $\mathfrak{M}$ be the Medvedev lattice: this paper investigates some filters and ideals (most of them already introduced by Dyment, [4]) of $\mathfrak{M}$ . If $\mathfrak{G}$ is any of the filters or ideals considered, the questions concerning $\mathfrak{G}$ which we try to answer are: (1) is $\mathfrak{G}$ prime? What is the cardinality of ${\mathfrak{M} \mathord{\left/ {\vphantom {\mathfrak{M} \mathfrak{G}}} \right. \kern-0em} \mathfrak{G}}$ ? Occasionally, we point out some general facts on theT-degrees or the partial degrees, by which (...) these questions can be answered. (shrink)

§1. Introduction. Ideals and filters of subsets of natural numbers have been studied by set theorists and topologists for a long time. There is a vast literature concerning various kinds of ultrafilters. There is also a substantial interest in nicely definable ideals—these by old results of Sierpiński are very far from being maximal— and the structure of such ideals will concern us in this announcement. In addition to being interesting in their own right, Borel and analytic (...) ideals occur naturally in the investigations of compact subsets of the space of all Baire class 1 functions on a Polish space, see [12, 18]. Also, certain objects associated with such ideals are of considerable interest and were quite extensively studied by several authors. Let us list here three examples; in all three of them I stands for an analytic or Borel ideal.1. The partial order induced by I on P: X ≥I Y iff X \ Y ϵ I and the partial order.2. Boolean algebras of the form P/I and their automorphisms.3. The equivalence relation associated with I: XEI Y iff X Δ ϵ I.In Section 4, we will have an opportunity to state some consequences of our results for equivalence relations as in 3. (shrink)

If $\mathcal{F}$ is a filter on $\omega$, we say that $\mathcal{F}$ is Canjar if the corresponding Mathias forcing does not add a dominating real. We prove that any Borel Canjar filter is $F_{\sigma}$, solving a problem of Hrušák and Minami. We give several examples of Canjar and non-Canjar filters; in particular, we construct a $\mathsf{MAD}$ family such that the corresponding Mathias forcing adds a dominating real. This answers a question of Brendle. Then we prove that in all the “classical” (...) models of $\mathsf{ZFC}$ there are $\mathsf{MAD}$ families whose Mathias forcing does not add a dominating real. We also study ideals generated by branches, and we uncover a close relation between Canjar ideals and the selection principle $S_{\mathrm{fin}}$ on subsets of the Cantor space. (shrink)

We introduce the property “F-linked” of subsets of posets for a given free filter F on the natural numbers, and define the properties “μ-F-linked” and “θ-F-Knaster” for posets in a natural way. We show that θ-F-Knaster posets preserve strong types of unbounded families and of maximal almost disjoint families. Concerning iterations of such posets, we develop a general technique to construct θ-Fr-Knaster posets (where Fr is the Frechet ideal) via matrix iterations of <θ-ultrafilter-linked posets (restricted to some level of the (...) matrix). This is applied to prove consistency results about Cichoń's diagram (without using large cardinals) and to prove the consistency of the fact that, for each Yorioka ideal, the four cardinal invariants associated with it are pairwise different. At the end, we show that three strongly compact cardinals are enough to force that Cichoń's diagram can be separated into 10 different values. (shrink)

Suppose that λ is the successor of a singular cardinal μ whose cofinality is an uncountable cardinal κ. We give a sufficient condition that the club filter of λ concentrating on the points of cofinality κ is not λ+-saturated.1 The condition is phrased in terms of a notion that we call weak reflection. We discuss various properties of weak reflection. We introduce a weak version of the ♣-principle, which we call ♣*−, and show that if it holds on a stationary (...) subset S of λ, then no normal filter on S is λ+-saturated. Under the above assumptions, ♣*− is true for any stationary subset S of λ which does not contain points of cofinality κ. For stationary sets S which concentrate on points of cofinality κ, we show that ♣*− holds modulo an ideal obtained through the weak reflection. (shrink)

We propose a reformulation of the ideal $\mathcal {N}$ of Lebesgue measure zero sets of reals modulo an ideal J on $\omega $, which we denote by $\mathcal {N}_J$. In the same way, we reformulate the ideal $\mathcal {E}$ generated by $F_\sigma $ measure zero sets of reals modulo J, which we denote by $\mathcal {N}^*_J$. We show that these are $\sigma $ -ideals and that $\mathcal {N}_J=\mathcal {N}$ iff J has the Baire property, which in turn is equivalent (...) to $\mathcal {N}^*_J=\mathcal {E}$. Moreover, we prove that $\mathcal {N}_J$ does not contain co-meager sets and $\mathcal {N}^*_J$ contains non-meager sets when J does not have the Baire property. We also prove a deep connection between these ideals modulo J and the notion of nearly coherence of filters (or ideals). We also study the cardinal characteristics associated with $\mathcal {N}_J$ and $\mathcal {N}^*_J$. We show their position with respect to Cichoń’s diagram and prove consistency results in connection with other very classical cardinal characteristics of the continuum, leaving just very few open questions. To achieve this, we discovered a new characterization of $\mathrm {add}(\mathcal {N})$ and $\mathrm {cof}(\mathcal {N})$. We also show that, in Cohen model, we can obtain many different values to the cardinal characteristics associated with our new ideals. (shrink)

Rough sets are used in numerous knowledge representation contexts and are then empowered with varied ontologies. These may be intrinsically associated with ideas of rationality under certain conditions. In recent papers, specific granular generalisations of graded and variable precision rough sets are investigated by the present author from the perspective of rationality of approximations (and the associated semantics of rationality in approximate reasoning). The studies are extended to ideal-based approximations (sometimes referred to as subsethood-based approximations). It is additionally shown that (...) co-granular or point-wise approximations defined by σ-ideals/filters (for an arbitrary relation σ) fit easily into the entire scheme. Concepts of the rationality of objects (vague or crisp) and their types are introduced and are shown to be applicable to most general rough sets by the present author. Surprising results on these are proved on these by her in this part of the research paper. The present paper is the first of a three part study on the topic. (shrink)

We recall some notions introduced and developed by António Aniceto Monteiro, and show how these notions have been used and generalised, thus establishing a direct and indirect influence of Monteiro’s work that extends to this day.

We find some characterizations of the Axiom of Choice in terms of certain families of open sets in T1 spaces.

This report brings out a simple observation on the close connection of lters with algebraic closure systems. In [1], Orrin Frink gave a general denition of ideals in ordered sets. Here, we use the dual notion of lter and apply it to preordered sets. When referring to nite sets fc1; : : : ; ckg we often omit the brackets. The symbol ; denotes the empty set and, X f Y means that X is a nite subset of Y.

We show that many large cardinal notions up to measurability can be characterized through the existence of certain filters for small models of set theory. This correspondence will allow us to obtain a canonical way in which to assign ideals to many large cardinal notions. This assignment coincides with classical large cardinal ideals whenever such ideals had been defined before. Moreover, in many important cases, relations between these ideals reflect the ordering of the corresponding large (...) cardinal properties both under direct implication and consistency strength. (shrink)

Our main result states that a finite iteration of Universal Meager forcing notions adds generic filters for many forcing notions determined by universality parameters. We also give some results concerning cardinal characteristics of the σ-ideals determined by those universality parameters.

This paper has two parts. The first is concerned with a variant of a family of games introduced by Holy and Schlicht, that we call Welch games. Player II having a winning strategy in the Welch game of length [Formula: see text] on [Formula: see text] is equivalent to weak compactness. Winning the game of length [Formula: see text] is equivalent to [Formula: see text] being measurable. We show that for games of intermediate length [Formula: see text], II winning implies (...) the existence of precipitous ideals with [Formula: see text]-closed, [Formula: see text]-dense trees. The second part shows the first is not vacuous. For each [Formula: see text] between [Formula: see text] and [Formula: see text], it gives a model where II wins the games of length [Formula: see text], but not [Formula: see text]. The technique also gives models where for all [Formula: see text] there are [Formula: see text]-complete, normal, [Formula: see text]-distributive ideals having dense sets that are [Formula: see text]-closed, but not [Formula: see text]-closed. (shrink)

This research was partially supported by Grant-in-Aid for Scientific Research (No. 06640178 and No. 06640336), Ministry of Education, Science and Culture of Japan Mathematics Subject Classification: 03E05 --> Abstract. Following Carr's study on diagonal operations and normal filters on \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} ${\cal P}_{\kappa}\lambda$\end{document} in [2], several weakenings of normality have been investigated. One of them is to consider normal filters without \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} (...) $\kappa$\end{document}-completeness, for example, see DiPrisco-Uzcategui [3]. The other is weakening normality itself while keeping \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $\kappa$\end{document}-completeness such as in Mignone [10] and Shioya [11]. We take the second one so that all filters are assumed to be \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $\kappa$\end{document}-complete. In Sect. 1 a hierarchy of filters on \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} ${\cal P}_{\kappa}\lambda$\end{document} is presented which corresponds to the length of diagonal intersections under which the filters are closed. It turns out that many ranks exist between \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $FSF_{\kappa\lambda}$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $CF_{\kappa\lambda}$\end{document}. We consider seminormal ideals in Sect. 2 and determine the minimal seminormal ideal extending Johnson's result in [6]. Its precise descripti on changes according to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $cf(\lambda )$\end{document} although we can write it in a single form as well. We also prove that a nonnormal seminormal ideal \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $I\supset NS_{\kappa\lambda}$\end{document} exists if and only if \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $\lambda$\end{document} is regular. (shrink)

The main topics of this thesis are cardinal invariants, P -points and MAD families. Cardinal invariants of the continuum are cardinal numbers that are bigger than $\aleph _{0}$ and smaller or equal than $\mathfrak {c}.$ Of course, they are only interesting when they have some combinatorial or topological definition. An almost disjoint family is a family of infinite subsets of $\omega $ such that the intersection of any two of its elements is finite. A MAD family is a maximal almost (...) disjoint family. An ultrafilter $\mathcal {U}$ on $\omega $ is called a P-point if every countable $\mathcal {B\subseteq U}$ there is $X\in $ $\mathcal {U}$ such that $X\setminus B$ is finite for every $B\in \mathcal {B}.$ This kind of ultrafilters has been extensively studied, however there is still a large number of open questions about them.In the preliminaries we recall the principal properties of filters, ultrafilters, ideals, MAD families and cardinal invariants of the continuum. We present the construction of Shelah, Mildenberger, Raghavan, and Steprāns of a completely separable MAD family under $\mathfrak {s\leq a}.$ None of the results in this chapter are due to the author.The second chapter is dedicated to a principle of Sierpiński. The principle $\left $ of Sierpiński is the following statement: There is a family of functions $\left \{ \varphi _{n}:\omega _{1}\longrightarrow \omega _{1}\mid n\in \omega \right \} $ such that for every $I\in \left [ \omega _{1}\right ] ^{\omega _{1}}$ there is $n\in \omega $ for which $\varphi _{n}\left [ I\right ] =\omega _{1}.$ This principle was recently studied by Arnie Miller. He showed that this principle is equivalent to the following statement: There is a set $X=\left \{ f_{\alpha }\mid \alpha \alpha $ then $f_{\beta }\cap g$ is infinite. Miller showed that the principle of Sierpiński implies that non $\left =\omega _{1}.$ He asked if the converse was true, i.e., does non $\left =\omega _{1}$ imply the principle $\left $ of Sierpiński? We answer his question affirmatively. In other words, we show that non $\left =\omega _{1}$ is enough to construct an $\mathcal {IE}$ -Luzin set. It is not hard to see that the $\mathcal {IE}$ -Luzin set we constructed is meager. This is no coincidence, because with the aid of an inaccessible cardinal, we construct a model where non $\left =\omega _{1}$ and every $\mathcal {IE}$ -Luzin set is meager.The third chapter is dedicated to a conjecture of Hrušák. Michael Hrušák conjectured the following: Every Borel cardinal invariant is either at most non $\left $ or at least cov $\left $. Although the veracity of this conjecture is still an open problem, we were able to obtain some partial results: The conjecture is false for “Borel invariants of $\omega _{1}^{\omega }$ ” nevertheless, it is true for a large class of definable invariants. This is part of a joint work with Michael Hrušák and Jindřich Zapletal.In the fourth chapter we present a survey on destructibility of ideals and MAD families. We prove several classic theorems, but we also prove some new results. For example, we show that every almost disjoint family of size less than $\mathfrak {c}$ can be extended to a Cohen indestructible MAD family is equivalent to $\mathfrak {b=c}$. A MAD family $\mathcal {A}$ is Shelah–Steprāns if for every $X\subseteq \left [ \omega \right ] ^{<\omega }\setminus \left \{ \emptyset \right \} $ either there is $A\in \mathcal {I}\left $ such that $s\cap A\neq \emptyset $ for every $s\in X$ or there is $B\in \mathcal {I}\left $ that contains infinitely many elements of X $ denotes the ideal generated by $\mathcal {A}$ ). This concept was introduced by Raghavan which is connected to the notion of “strongly separable” introduced by Shelah and Steprāns. We prove that Shelah–Steprāns MAD families have very strong indestructibility properties: Shelah–Steprāns MAD families are indestructible for “many” definable forcings that does not add dominating reals. According to the author’s best knowledge, this is the strongest notion that has been considered in the literature so far. In spite of their strong indestructibility, Shelah–Steprāns MAD families can be destroyed by a ccc forcing that does not add unsplit or dominating reals. We also consider some strong combinatorial properties of MAD families and show the relationships between them.The fifth chapter is one of the most important chapters in the thesis. A MAD family $\mathcal {A}$ is called $+$ -Ramsey if every tree that branches into $\mathcal {I}\left $ -positive sets has an $\mathcal {I}\left $ -positive branch. Michael Hrušák’s first published question is the following: Is there a $+$ -Ramsey MAD family? It was previously known that such families can consistently exist. However, there was no construction of such families using only the axioms of ZFC. We solve this problem by constructing such a family without any extra assumptions.In the fourth and fifth chapters, we introduce several notions of MAD families, in the sixth chapter we prove several implications and non implications between them. We construct several MAD families with different properties.In the seventh chapter we build models without P -points. We show that there are no P -points after adding Silver reals either iteratively or by the side by side product. These results have some important consequences: The first one is that is its possible to get rid of P -points using only definable forcings. This answers a question of Michael Hrušák. We can also use our results to build models with no P -points and with arbitrarily large continuum, which was also an open question. These results were obtained with David Chodounský.prepared by Osvaldo Guzmán GonzálezE-mail : [email protected] : https://arxiv.org/abs/1810.09680. (shrink)

In this paper we develop a point-free approach to the study of topological spaces and functions on them, establish platforms for both and present some findings on recursive points. In the first sections of the paper, we obtain conditions under which our approach leads to the generation of ideal objects with which mathematicians work. Next, we apply the effective version of our approach to the real numbers, and make exact connections to the classical approach to recursive reals. In the succeeding (...) sections of the paper, we introduce machinery to produce functions on topological spaces and find succinct conditions which will be effectivized in our sequel. (shrink)

This book traces the profound impact of technical media on the sound of music, asking: how do media technologies shape sound? How does this affect music? And how did it change what we listen for in music? Based on the information theoretical proposition that all transmission channels introduce noise and distortion, the argument accounts for the fact that technologically reproduced music is inherently shaped by the technologies that enable its reproduction. The media archaeological assessment of this noise of sound media (...) developed in the book draws from a wide range of sources, both theoretical and historical, conceptual and technical. Together, they show that noise should not be understood as unwanted by-effect but instead plays a foundational role in shaping the sonic contours of technologically reproduced music. Over the course of five chapters, the book sketches a broad history of the problem of noise in sound recording, looks at specific analog and digital noise-related technologies, traces the ideal of sonic purity back to key developments in nineteenth century acoustics, and develops an analysis of the close interrelation between noise and the temporality of sound. This relation, it argues, is central to the way in which recorded sound and music resonate with listeners. Ultimately, this media specific analysis of the noise of sound media thereby greatly enriches our understanding of the way in which they changed and continue to change the sonorous qualities of music, thus offering a new perspective on the interaction between music, media and listeners. (shrink)

This article discusses the topic of algorithmic personalization and the creation of the so-called “filter bubble” effect, which is often understood as one of the most problematic influences of artificial intelligence on democratic social order. The author suggests that focusing on the issue of information diversity, which had far-reaching effect on the empirical research that tried to quantitatively measure and systematically prove the existence of the filter bubbles, was the wrong starting point for the discussion on the application of algorithmic (...) personalization. It has drawn our attention away from the deeper issue: habit. Habitual adaptation of algorithmic personalization, namely, stands in essential contradiction to the ideal image of a non-adaptive public sphere, upon which democratic societies should be based. Focusing on habitual adaptation could also explain why users addictively stick to certain kinds of information, even if they are not caught in an isolated chamber. (shrink)

We show that for every uncountable regular κ and every κ-complete Boolean algebra B of density ≤ κ there is a filter F ⊆ B such that the number of partitions of length < modulo κF is ≤2<κ. We apply this to Boolean algebras of the form P/I, where I is a κ-complete κ-dense ideal on X.

Let X be an infinite set and let and denote the propositions “every filter on X can be extended to an ultrafilter” and “X has a free ultrafilter”, respectively. We denote by the Stone space of the Boolean algebra of all subsets of X. We show: For every well‐ordered cardinal number ℵ, (ℵ) iff (2ℵ). iff “ is a continuous image of ” iff “ has a free open ultrafilter ” iff “every countably infinite subset of has a limit point”. (...) implies “every open filter on extends to an open ultrafilter” implies “has an open ultrafilter” implies It is relatively consistent with that (ω) holds, whereas (ω) fails. In particular, none of the statements given in (2) implies (ω). (shrink)

Burke proved that the generalized nonstationary ideal, denoted by NS, is universal in the following sense: every normal ideal, and every tower of normal ideals of inaccessible height, is a canonical Rudin‐Keisler projection of the restriction of NS to some stationary set. We investigate how far Burke's theorem can be pushed, by analyzing the universality properties of NS with respect to the wider class of ‐systems of filters introduced by Audrito and Steila. First we answer a question of (...) Audrito and Steila, by proving that ‐systems of filters do not capture all kinds of set‐generic embeddings. We provide a characterization of supercompactness in terms of short extenders and canonical projections of NS, without any reference to the strength of the extenders; as a corollary, NS can consistently fail to canonically project to arbitrarily strong short extenders. We prove that ω‐cofinal towers of normal ultrafilters, e.g., the kind used to characterize I2 and I3 embeddings, are well‐founded if and only if they are canonical projections of NS. Finally, we provide a characterization of “ is Jónsson” in terms of canonical projections of NS. (shrink)

Let $\mathcal {I}$ be an ideal on $\omega $. For $f,\,g\in \omega ^{\omega }$ we write $f \leq _{\mathcal {I}} g$ if $f(n) \leq g(n)$ for all $n\in \omega \setminus A$ with some $A\in \mathcal {I}$. Moreover, we denote $\mathcal {D}_{\mathcal {I}}=\{f\in \omega ^{\omega }: f^{-1}[\{n\}]\in \mathcal {I} \text { for every } n\in \omega \}$ (in particular, $\mathcal {D}_{\mathrm {Fin}}$ denotes the family of all finite-to-one functions).We examine cardinal numbers $\mathfrak {b}(\geq _{\mathcal {I}}\cap (\mathcal {D}_{\mathcal {I}} \times \mathcal {D}_{\mathcal (...) {I}}))$ and $\mathfrak {b}(\geq _{\mathcal {I}}\cap (\mathcal {D}_{\mathrm {Fin}}\times \mathcal {D}_{\mathrm {Fin}}))$ describing the smallest sizes of unbounded from below with respect to the order $\leq _{\mathcal {I}}$ sets in $\mathcal {D}_{\mathrm {Fin}}$ and $\mathcal {D}_{\mathcal {I}}$, respectively. For a maximal ideal $\mathcal {I}$, these cardinals were investigated by M. Canjar in connection with coinitial and cofinal subsets of the ultrapowers.We show that $\mathfrak {b}(\geq _{\mathcal {I}}\cap (\mathcal {D}_{\mathrm {Fin}} \times \mathcal {D}_{\mathrm {Fin}})) =\mathfrak {b}$ for all ideals $\mathcal {I}$ with the Baire property and that $\aleph _1 \leq \mathfrak {b}(\geq _{\mathcal {I}}\cap (\mathcal {D}_{\mathcal {I}} \times \mathcal {D}_{\mathcal {I}})) \leq \mathfrak {b}$ for all coanalytic weak P-ideals (this class contains all $\bf {\Pi ^0_4}$ ideals). What is more, we give examples of Borel (even $\bf {\Sigma ^0_2}$ ) ideals $\mathcal {I}$ with $\mathfrak {b}(\geq _{\mathcal {I}}\cap (\mathcal {D}_{\mathcal {I}} \times \mathcal {D}_{\mathcal {I}}))=\mathfrak {b}$ as well as with $\mathfrak {b}(\geq _{\mathcal {I}}\cap (\mathcal {D}_{\mathcal {I}} \times \mathcal {D}_{\mathcal {I}})) =\aleph _1$.We also study cardinals $\mathfrak {b}(\geq _{\mathcal {I}}\cap (\mathcal {D}_{\mathcal {J}} \times \mathcal {D}_{\mathcal {K}}))$ describing the smallest sizes of sets in $\mathcal {D}_{\mathcal {K}}$ not bounded from below with respect to the preorder $\leq _{\mathcal {I}}$ by any member of $\mathcal {D}_{\mathcal {J}}\!$. Our research is partially motivated by the study of ideal-QN-spaces: those cardinals describe the smallest size of a space which is not ideal-QN. (shrink)

The main purpose of this dissertation is to apply and develop new forcing techniques to obtain models where several cardinal characteristics are pairwise different as well as force many (even more, continuum many) different values of cardinal characteristics that are parametrized by reals. In particular, we look at cardinal characteristics associated with strong measure zero, Yorioka ideals, and localization and anti-localization cardinals.In this thesis we introduce the property “F-linked” of subsets of posets for a given free filter F on (...) the natural numbers, and define the properties “ $\mu $ -F-linked” and “ $\theta $ -F-Knaster” for posets in a natural way. We show that $\theta $ -F-Knaster posets preserve strong types of unbounded families and of maximal almost disjoint families. These kinds of posets led to the development of a general technique to construct $\theta $ - $\textrm {Fr}$ -Knaster posets (where $\textrm {Fr}$ is the Frechet ideal) via matrix iterations of ${<}\theta $ -ultrafilter-linked posets (restricted to some level of the matrix). The latter technique allows proving consistency results about Cichoń’s diagram (without using large cardinals) and to prove the consistency of the fact that, for each Yorioka ideal, the four cardinal characteristics associated with it are pairwise different. Another important application is to show that three strongly compact cardinals are enough to force that Cichoń’s diagram can be separated into 10 different values. Later on, it was shown by Goldstern, Kellner, Mejía, and Shelah that no large cardinals are needed for Cichoń’s maximum (J. Eur. Math. Soc. 24 (2022), no. 11, p. 3951–3967).On the other hand, we deal with certain types of tree forcings including Sacks forcing, and show that these increase the covering of the strong measure zero ideal $\mathcal {SN}$. As a consequence, in Sacks model, such covering number is equal to the size of the continuum, which indicates that this covering number is consistently larger than any other classical cardinal characteristics of the continuum. Even more, Sacks forcing can be used to force that $\operatorname {\mathrm{non}}(\mathcal {SN})<\operatorname {\mathrm{cov}}(\mathcal {SN})<\operatorname {\mathrm{cof}}(\mathcal {SN})$, which is the first consistency result where more than two cardinal characteristics associated with $\mathcal {SN}$ are pairwise different. To obtain another result in this direction, we provide bounds for $\operatorname {\mathrm{cof}}(\mathcal {SN})$, which generalizes Yorioka’s characterization of $\mathcal {SN}$ (J. Symbolic Logic 67.4 (2002), p. 1373–1384). As a consequence, we get the consistency of $\operatorname {\mathrm{add}}(\mathcal {SN})=\operatorname {\mathrm{cov}}(\mathcal {SN})<\operatorname {\mathrm{non}}(\mathcal {SN})<\operatorname {\mathrm{cof}}(\mathcal {SN})$ with ZFC (via a matrix iteration forcing construction).We conclude this thesis by combining creature forcing approaches by Kellner and Shelah (Arch. Math. Logic 51.1–2 (2012), p. 49–70) and by Fischer, Goldstern, Kellner, and Shelah (Arch. Math. Logic 56.7–8 (2017), p. 1045–1103) to show that, under CH, there is a proper $\omega ^\omega $ -bounding poset with $\aleph _2$ -cc that forces continuum many pairwise different cardinal characteristics, parametrized by reals, for each one of the following six types: uniformity and covering numbers of Yorioka ideals as well as both kinds of localization and anti-localization cardinals, respectively. This answers several open questions from Klausner and Mejía (Arch. Math. Logic 61 (2022), pp. 653–683).Abstract prepared by Miguel Antonio Cardona-MontoyaE-mail: [email protected]: https://repositum.tuwien.at/handle/20.500.12708/19629. (shrink)

We consider a question of T. Jech and K. Prikry that asks if the existence of a precipitous filter implies the existence of a normal precipitous filter. The aim of this paper is to improve a result of Gitik (Israel J Math, 175:191–219, 2010) and to show that measurable cardinals of a higher order rather than just measurable cardinals are necessary in order to have a model with a precipitous filter but without a normal one.

We show that Miller partition forcing preserves selective independent families and P-points, which implies the consistency of $\mbox {cof}(\mathcal {N})=\mathfrak {a}=\mathfrak {u}=\mathfrak {i}<\mathfrak {a}_T=\omega _2$. In addition, we show that Shelah’s poset for destroying the maximality of a given maximal ideal preserves tight mad families and so we establish the consistency of $\mbox {cof}(\mathcal {N})=\mathfrak {a}=\mathfrak {i}=\omega _1<\mathfrak {u}=\mathfrak {a}_T=\omega _2$.

The property on the filter in Definition 1, a kind of large cardinal property, suffices for the proof in Liu Shelah [LiSh484] and is proved consistent as required there (see Conclusion 6). A natural property which looks better, not only is not obtained here, but is shown to be false (in Claim 7). On earlier related theorems see Gitik Shelah [GiSh310]. On such games see e.g. [Je], [Sh-b], [Sh-f].

This dissertation sets out to answer the question ''What fixes the semantic values of context-sensitive referential terms—like names, demonstratives, and pronouns—in context?'' I argue that it is the speaker's intentions that play this role, as constrained by the conventions governing the use of particular sorts of referential terms. These conventions serve to filter the speaker's intentions for just those which meet these constraints on use, leaving only these filtered-for intentions as semantically relevant. By considering a wide range of cases, including (...) many involving confused and deceptive speakers, I argue that this 'constraint theory' provides a better account of linguistic reference than does any extant alternative, whether intentionalist or non-intentionalist. Along the way, I argue that semantics cannot depend on the reactions of idealized listeners, that speaker meaning is far less clear, and helpful, a notion than it is standardly taken to be, and that speakers needn't aim to be cooperative in order to fix the meaning of their terms in context. (shrink)

Starting with a measurable cardinal κ of the Mitchell order κ++ we construct a model with a precipitous ideal on ℵ1 but without normal precipitous ideals. This answers a question by T. Jech and K. Prikry. In the constructed model there are no Q-point precipitous filters on ℵ1, i. e. those isomorphic to extensions of Cubℵ1.

Some aspects of the theory of Boolean algebras and distributive lattices–in particular, the Stone Representation Theorems and the properties of filters and ideals–are analyzed in a constructive setting.

One of the predominant debates in AI Ethics is the worry and necessity to create fair, transparent and accountable algorithms that do not perpetuate current social inequities. I offer a critical analysis of Reuben Binns’s argument in which he suggests using public reason to address the potential bias of the outcomes of machine learning algorithms. In contrast to him, I argue that ultimately what is needed is not public reason per se, but an audit of the implicit moral assumptions of (...) societies within which algorithms are built and applied. Public justification is appealing since it offers us the possibility to align the decision-making outcomes of the algorithm with the core moral values of stakeholders within a constitutional democratic society. My concern is that the common moral principles that form the foundation of public reason are not necessarily neutral, as they still express specific moral ideals and normative standards even if there is moral agreement by society as a whole, or among different stakeholders within society. Appealing to such normative standards may thus still lead to algorithmic outcomes being biased as common moral values may very well still be discriminatory even though they are formed from a consensus, and even if public reason is applied as a kind of filter for potential algorithmic outcomes. Hence, I argue that these implicit moral norms within society that we take as a given in public reasoning, need to be audited from generation to generation in order to effectively mitigate potential algorithmic bias. (shrink)

This bold and unabashedly utopian book advances the thesis that Marx's notion of communism is a defensible, normative ideal. However, unlike many others who have written in this area, Levine applies the tools and techniques of analytic philosophy to formulate and defend his radical, political programme. The argument proceeds by filtering the ideals and institutions of Marxism through Rousseau's notion of the 'general will'. Once Rousseau's ideas are properly understood it is possible to construct a community of equals who (...) share some vision of a common good that can be achieved and maintained through cooperation or coordination that is at once both voluntary and authoritative. The book engages with liberal theory in order to establish its differences from Rousseauean-Marxian political theory. This provocative book will be of particular interest to political philosophers and political scientists concerned with Marxism, socialist theory and democratic theory. (shrink)

A process of idea filtration in two distinct streams of physics i.e., 1) The dimensionality perspective of spacetime, and 2) The quantum perspective leads us to an understanding of what might be a true reality of all that we perceive. The conclusions arrived at in this paper are a bit perplexing in the sense that our perceived reality could be a manifestation of a combination of 4D + n (n > 0) flat space-time, universal wave function, and cognizance. The work (...) is based on a review and analysis of the main concepts in quantum theory, relativistic physics, and cosmology. Key ideas and conclusions are filtered and logically connected to arrive at what might be a view of the true reality. A significant part of the paper is dedicated to the concept of the “observer” and the “ability of cognizance” that should accompany the “observer”. Though the “observer” is central to modern physics, it is not known what constitutes observation, and the term observer, often open to interpretations, does not have a standard definition and hence, is lacking in clarity. In our analysis, we have argued that the environment, in which the observer-observed system is embedded, emerges as an all-knowing, cognizant, and ideal observer that has the knowledge of the observer-observed system. At a philosophical level, we link to the fundamentals of physics, “consciousness” or “ability of cognizance” as an unavoidable and key element in not only carrying out the observation but perhaps, as believed by many, having a role in shaping the reality perceived. In the review and analysis of another stream of physics, that of General Theory of Relativity (GTR) and cosmology, we examine the question of reality from a cosmological and dimensionality perspective. Research on the 4D and 5D constructs of the universe indicates that the “reality” perceived in 4D spacetime as matter, distance, time, etc., is a manifestation of a higher dimensional 4D + n (n > 0) reality. Theoretical research on this front points towards a 4D-spacetime embedded in a 5D or higher dimensional flat space with matter and energy being a manifestation of the higher dimensions. The flow of logic in this paper leans towards a view of an ultimate true reality that is flat 4D + n (n > 0) space combined with cognizance, universal wave function, and the environment. (shrink)

In the following pages we discuss three historical cases of moral economies in science: Drosophila genetics, late twentieth century American astronomy, and collaborations between American drug companies and medical scientists in the interwar years. An examination of the most striking differences and similarities between these examples, and the conflicts internal to them, reveals constitutive features of moral economies, and the ways in which they are formed, negotiated, and altered. We critically evaluate these three examples through the filters of rational (...) choice, utility, and American pragmatism, using the latter to support the conclusion that there is no single vision of moral economies in science and no single theory—moral, political, social—that will explain them. These filters may not be the only means through which to evaluate the moral economies examined, but aspects of each appear prominent in all three cases. In addition, explanations for decisions are often given in the language of these theories, both at the macro (policy) level and at the local level of the moral economies we discuss. In light of such factors, the use of these frameworks seems justified. We begin with an attempt to define the nature of moral economies, then move to a consideration of scientific communities as moral communities operating within material and other constraints which we relate to wider questions of political economy and societal accountabilities. (shrink)

In this paper, I explore Bach’s idea (Bach, 2000) that null appositives, intended as expanded qua-clauses, can resolve the puzzles of belief reports. These puzzles are crucial in understanding the semantics and pragmatics of belief reports and are presented in a section. I propose that Bach’s strategy is not only a way of dealing with puzzles, but also an ideal way of dealing with belief reports. I argue that even simple unproblematic cases of belief reports are cases of pragmatic intrusion, (...) involving null appositives, or to use the words of Bach, ‘qua-clauses’. The main difference between my pragmatic approach and the one by Salmon (1986) is that this author uses the notion of conversational implicature, whereas I use the notion of pragmatic intrusion and explicature. From my point of view, statements such as ‘‘John believes that Cicero is clever’’ and ‘‘John believes that Tully is clever’’ have got distinct truth-values. In other words, I claim that belief reports in the default case illuminate the hearer on the mental life of the believer, that includes specific modes of presentation of the referents talked about. Furthermore, while in the other pragmatic approaches, it is mysterious how a mode of presentation is assumed to be the main filter of the believer’s mental life, here I provide an explanatory account in terms of relevance, cognitive effects, and processing efforts. The most important part of the paper is devoted to showing that null appositives are required, in the case of belief reports, to explain certain anaphoric effects, which would otherwise be mysterious. My examples show that null appositives are not necessitated at logical form, but only at the level of the explicature, in line with the standard assumptions by Carston and Recanati on pragmatic intrusion. I develop a potentially useful analysis of belief reports by exploiting syntactic and semantic considerations on presuppositional clitics in Romance. (shrink)

This article addresses keep-fit culture not as a collection of commercial images or as the product of broader cultural values, but as a set of situated body practices, that is practices taking place within specific institutions where these images and values are reinterpreted in locally prescribed ways and, to some extent, filtered. Relying on fieldwork, fitness gyms are revealed to be experienced as places with their own rules, pleasures and identity games. The ideal of the fit body is shown to (...) be filtered from its wider, typically gender- and class-specific charges, transformed into a pure instrument of training, a machine which does not bear resemblance to the organic body of the changing rooms, an objectified utility which is beyond any social role specification. Social roles and their body requirements are both important for individual clients' structural chances to join the gym and locally neutralized or reduced to tension-release mechanisms. Similarly, the cultural ideals of a fit and toned body contribute to the legitimation of the gym; yet the actual capacity to train is less the result of the direct grip of culture, than the outcome of clients' adjustment to playing a particular game of involvement with and detachment from the mechanistic and abstract exercise body. Body definitions are not simply imposed on clients, but continuously negotiated and transformed. (shrink)

Catharine Macaulay, an 18th century English historian, published her educational philosophy in Letters on Education with Observations on Religious and Metaphysical Subjects in 1790. The ultimate goal of her educational process, to ‘bring the human mind to such a height of perfection as shall induce the practice of the best morals’, (, p. 173) is examined in this paper. Her ideas about the interactions among benevolence, sympathy, reason and the public voice with regard to the education of the moral, virtuous (...) person are considered. Macaulay's suggestions regarding the benefits of a specific curriculum and pedagogy in developing students capable of filtering the limiting dictates of society and aspiring toward virtue are analyzed. Particular attention is paid to the tensions her suggestions embody for the ideal, co‐educational classroom. (shrink)

Idealization and abstraction are central concepts in the philosophy of science and in science itself. My goal in this paper is suggest an account of these concepts, building on and refining an existing view due to Jones Idealization XII: correcting the model. Idealization and abstraction in the sciences, vol 86. Rodopi, Amsterdam, pp 173–217, 2005) and Godfrey-Smith Mapping the future of biology: evolving concepts and theories. Springer, Berlin, 2009). On this line of thought, abstraction—which I call, for reasons to be (...) explained, abstractness—involves the omission of detail, whereas idealization consists in a deliberate mismatch between a description and the world. I will suggest that while the core idea underlying these authors’ view is correct, they make several assumptions and stipulations that are best avoided. For one thing, they tie abstractness too close to truth. For another, they do not allow sufficient room to the difference between idealization and error. Taking these points into account leads to a refined account of the distinction, in which abstractness is seen in terms of relative richness of detail, and idealization is seen as closely connected with the knowledge and intentions of idealizers. I lay out these accounts in turn, and then discuss the relationship between the two concepts, and several other upshots of the present way of construing the distinction. (shrink)

Over the last decade, Robert Talisse has developed a devastating argument against reviving John Dewey’s democratic ideal. In his book, A Pragmatist Philosophy of Democracy, and in other essays, Talisse has argued that Deweyan democracy fails to accommodate Rawls’ conception of “the fact of reasonable pluralism” because it is committed to a perfectionist conception of the good. In response, this article offers a Rawlsian rebuttal to Talisse by drawing on Rawls’ own characterisation of perfectionism to show that Dewey’s conception of (...) the good is not perfectionist on Rawls’ account and thus can reasonably accommodate the fact of reasonable pluralism. is article thus begins by exposing and explaining Talisse’s argument, before articulating Shane Ralston’s rejection of the Berlinian and Rawlsian fillters presupposed by Talisse’s argument. Then, it develops its central argument by showing that, even if we accept the Rawlsian filter, Deweyan democracy does not fail to accommodate the fact of reasonable pluralism, because it only relies on a thin (not a full) theory of the good, before considering some foreseeable Talissean objections. Ultimately, the article concludes by showing that these objections fail because Deweyan democracy does not rely on a ‘full’ theory of the good. (shrink)

The dissertation deals with problems in "logic", more precisely, it deals with particular formal systems aiming at capturing patterns of valid reasoning. Sequent calculi were proposed to characterize logical connectives via introduction rules. These systems customarily also have structural rules which allow one to rearrange the set of premises and conclusions. In the "structurally free logic" of Dunn and Meyer the structural rules are replaced by combinatory rules which allow the same reshuffling of formulae, and additionally introduce an explicit marker (...) for the application of the rule---the combinator. The dissertation gives syntactic extensions of such systems introducing conjunction and disjunction . Cut elimination is proved for these systems. ;Syntactic systems as a rule are accompanied by a semantics which interprets them. The extended systems are supplied with semantics using algebraic methods. First, the Lindenbaum algebras are formed, and then these algebras are represented in an algebra of sets. This gives a so called Kripke-style semantics for the systems. The representation for the distributive extension utilizes well-known techniques; it uses sets of prime filters and set theoretical operations on them to deal with conjunction and disjunction, plus a ternary accessibility relation to accommodate the intensional operators as fusion and implication. The representation theorem is proven generally, i.e., for arbitrary sets of combinators using the "squeeze lemma" of Routley and Meyer. ;The non-distributive calculi require a different representation since union and intersection are distributive. Two previous representations for lattices are overviewed, and a modification of the Hartonas-Dunn representation is successfully augmented with the intensional operations. Instead of sets of filters, sets of pairs of minimally inconsistent filters and ideals are used and the representation theorem is proven. The representation results provide soundness and completeness for the systems. The dissertation also investigates properties of dual combinators , proving a series of lemmas about dual combinatory systems not being Church-Rosser and being inconsistent. Combinatorially definable classes of lambda-terms are considered as well. (shrink)

Scholars have remained undecided how much the British Idealists owe to Hegel, how much to Kant, and how much they may be credited with minting a new intellectual coinage of their own. By way of a detailed examination of T. H. Green’s metaphysics of free will and how it stands to both its Kantian and its Hegelian predecessors, this paper attempts to make some headway on that longstanding question of pedigree. It is argued that by translating previously naturalistic considerations about (...) free will into Kantian or atemporalist terms, Green makes some useful and important advances. But he still remains subject to the tension between libertarian and autonomous approaches to the issue. It might be wondered whether any theory could ever reconcile these two approaches, but it is argued that by filtering his Kantianism through a more Hegelian lens, Green manages somewhat to reduce the friction between these two perspectives and to get closer to his ideal of a unified theory of human free will. (shrink)

Catharine Macaulay, an 18th century English historian, published her educational philosophy in Letters on Education with Observations on Religious and Metaphysical Subjects in 1790. The ultimate goal of her educational process, to ‘bring the human mind to such a height of perfection as shall induce the practice of the best morals’, is examined in this paper. Her ideas about the interactions among benevolence, sympathy, reason and the public voice with regard to the education of the moral, virtuous person are considered. (...) Macaulay's suggestions regarding the benefits of a specific curriculum and pedagogy in developing students capable of filtering the limiting dictates of society and aspiring toward virtue are analyzed. Particular attention is paid to the tensions her suggestions embody for the ideal, co‐educational classroom. (shrink)

Spam electronic mails (emails) refer to harmful and unwanted commercial emails sent to corporate bodies or individuals to cause harm. Even though such mails are often used for advertising services and products, they sometimes contain links to malware or phishing hosting websites through which private information can be stolen. This study shows how the adaptive intelligent learning approach, based on the visual anti-spam model for multi-natural language, can be used to detect abnormal situations effectively. The application of this approach is (...) for spam filtering. With adaptive intelligent learning, high performance is achieved alongside a low false detection rate. There are three main phases through which the approach functions intelligently to ascertain if an email is legitimate based on the knowledge that has been gathered previously during the course of training. The proposed approach includes two models to identify the phishing emails. The first model has proposed to identify the type of the language. New trainable model based on Naive Bayes classifier has also been proposed. The proposed model is trained on three types of languages (Arabic, English and Chinese) and the trained model has used to identify the language type and use the label for the next model. The second model has been built by using two classes (phishing and normal email for each language) as a training data. The second trained model (Naive Bayes classifier) has been applied to identify the phishing emails as a final decision for the proposed approach. The proposed strategy is implemented using the Java environments and JADE agent platform. The testing of the performance of the AIA learning model involved the use of a dataset that is made up of 2,000 emails, and the results proved the efficiency of the model in accurately detecting and filtering a wide range of spam emails. The results of our study suggest that the Naive Bayes classifier performed ideally when tested on a database that has the biggest estimate (having a general accuracy of 98.4%, false positive rate of 0.08%, and false negative rate of 2.90%). This indicates that our Naive Bayes classifier algorithm will work viably on the off chance, connected to a real-world database, which is more common but not the largest. (shrink)

Khutoretskii's Theorem states that the Rogers semilattice of any family of c.e. sets has either at most one or infinitely many elements. A lemma in the inductive step of the proof shows that no Rogers semilattice can be partitioned into a principal ideal and a principal filter. We show that such a partitioning is possible for some family of d.c.e. sets. In fact, we construct a family of c.e. sets which, when viewed as a family of d.c.e. sets, has (up (...) to equivalence) exactly two computable Friedberg numberings ¼ and ν, and ¼ reduces to any computable numbering not equivalent to ν. The question of whether the full statement of Khutoretskii's Theorem fails for families of d.c.e. sets remains open. (shrink)