English
Related papers

Related papers: Well-founded Boolean ultrapowers as large cardinal…

200 papers

We isolate a new large cardinal concept, "remarkability." Consistencywise, remarkable cardinals are between ineffable and omega-Erdos cardinals. They are characterized by the existence of "0^sharp-like" embeddings; however, they relativize…

Logic · Mathematics 2007-05-23 Ralf Schindler

Our original aim was, in Abelian group theory to prove the consistency of: lambda is strong limit singular and for some properties of abelian groups which are relatives of being free, the compactness in singular fails. In fact this should…

Logic · Mathematics 2013-06-25 Saharon Shelah

We investigate the structure of the lattice of clones on an infinite set X. We first observe that ultrafilters naturally induce clones; this yields a simple proof of Rosenberg's theorem: "there are 2^2^kappa many maximal (=precomplete)…

Rings and Algebras · Mathematics 2016-09-07 Martin Goldstern , Saharon Shelah

A theoretical development is carried to establish fundamental results about rank-initial embeddings and automorphisms of countable non-standard models of set theory, with a keen eye for their sets of fixed points. These results are then…

Logic · Mathematics 2021-06-17 Paul K. Gorbow

We give a definition of some classes of boolean algebras generalizing free boolean algebras; they satisfy a universal property that certain functions extend to homomorphisms. We give a combinatorial property of generating sets of these…

Logic · Mathematics 2011-10-04 Corey Thomas Bruns

This work is a part of my upcoming thesis [7]. We establish an equiconsistency between (1) weak indestructibility for all $\kappa +2$-degrees of strength for cardinals $\kappa $ in the presence of a proper class of strong cardinals, and (2)…

Logic · Mathematics 2024-11-20 James Holland

We introduce a new class of ultrafilters which generalizes the well-known class of simple $P$-point ultrafilters. We prove that for any well-founded $\sigma$-directed partial order $\mathbb{D}$ there is a mild forcing extension where there…

Logic · Mathematics 2026-04-02 Tom Benhamou , James Cummings , Gabriel Goldberg , Yair Hayut , Alejandro Poveda

In recent years, several problems regarding the partition regularity of exponential configurations have been studied in the literature, in some cases using the properties of specific ultrafilters. In this paper, we start to lay down the…

Combinatorics · Mathematics 2025-04-02 Lorenzo Luperi Baglini

Cohesive powers of computable structures are effective analogs of ultrapowers, where cohesive sets play the role of ultrafilters. Let $\omega$, $\zeta$, and $\eta$ denote the respective order-types of the natural numbers, the integers, and…

We study the class of structures that, in a way, generalize various approaches to the contact relation on Boolean algebras.

Logic · Mathematics 2026-04-21 Luca Carai , Ivo Düntsch , Rafał Gruszczyński , Anna Laura Suarez

Boolean network models have gained popularity in computational systems biology over the last dozen years. Many of these networks use canalizing Boolean functions, which has led to increased interest in the study of these functions. The…

Discrete Mathematics · Computer Science 2015-04-29 Qijun He , Matthew Macauley

An embedding theorem for algebraic systems is presented, basing on a certain old ultrafilter construction. As an application, we outline alternative proofs of some results from the theory of PI algebras, and establish some properties of…

Rings and Algebras · Mathematics 2016-08-23 Pasha Zusmanovich

We consider a large family of theories of equivalence relations, each with finitely many classes, and assuming the existence of an $\omega$-Erdos cardinal, we determine which of these theories are Borel complete. We develop machinery,…

Logic · Mathematics 2024-07-16 Michael C. Laskowski , Danielle S. Ulrich

We prove a number of results motivated by global questions of uniformity in computability theory, and universality of countable Borel equivalence relations. Our main technical tool is a game for constructing functions on free products of…

Logic · Mathematics 2020-01-20 Andrew S Marks

Backdoors and backbones of Boolean formulas are hidden structural properties. A natural goal, already in part realized, is that solver algorithms seek to obtain substantially better performance by exploiting these structures. However, the…

Artificial Intelligence · Computer Science 2018-11-05 Lane A. Hemaspaandra , David E. Narváez

We determine all composition-closed equational classes of Boolean functions. These classes provide a natural generalization of clones and iterative algebras: they are closed under composition, permutation and identification…

Rings and Algebras · Mathematics 2011-02-23 Tamás Waldhauser

How many endomorphisms does a Boolean algebra have? Can we find Boolean algebras with as few endomorphisms as possible? Of course from any ultrafilter of the Boolean algebra we can define an endomorphism, and we can combine finitely many…

Logic · Mathematics 2011-05-20 Saharon Shelah

Wavelet families arise by scaling and translations of a prototype function, called the {\em {mother wavelet}}. The construction of wavelet bases for cardinal spline spaces is generally carried out within the multi-resolution analysis…

Functional Analysis · Mathematics 2009-11-13 Miroslav Andrle , Laura Rebollo-Neira

This dissertation aims to provide a comprehensive account of set theory with urelements. In Chapter 1, I present mathematical and philosophical motivations for studying urelement set theory and lay out the necessary technical preliminaries.…

Logic · Mathematics 2023-06-21 Bokai Yao

We consider strong expansions of the theory of ordered abelian groups. We show that the assumption of strength has a multitude of desirable consequences for the structure of definable sets in such theories, in particular as relates to…

Logic · Mathematics 2016-05-12 Alfred Dolich , John Goodrick