English
Related papers

Related papers: Complete quotient Boolean algebras

200 papers

We investigate the quotient algebra $\mathfrak{A}_X^{\mathcal I}:=\mathcal I(X)/\overline{\mathcal F(X)}^{||\cdot||_{\mathcal I}}$ for Banach operator ideals $\mathcal I$ contained in the ideal of the compact operators, where $X$ is a…

Functional Analysis · Mathematics 2023-01-26 Henrik Wirzenius

We try to build, provably in ZFC, for a first order T a model in which any isomorphism between two Boolean algebras is definable. The problem, compared to [Sh:384], is with pseudo-finite Boolean algebras. A side benefit is that we do not…

Logic · Mathematics 2016-01-15 Saharon Shelah

For any set $X$, ${\mathcal P}(X)$ denotes the collection of all subsets of $X$, ordered by inclusion. A {\it cutset} in ${\mathcal P}(X)$ is a subset of ${\mathcal P}(X)$ which meets every maximal chain of ${\mathcal P}(X)$. A cutset is…

Combinatorics · Mathematics 2025-08-15 John Ginsburg , Bill Sands

Let $\mu$ be a Borel measure on a compactum $X$. The main objects in this paper are $\sigma$-ideals $I(dim)$, $J_0(\mu)$, $J_f(\mu)$ of Borel sets in $X$ that can be covered by countably many compacta which are finite-dimensional, or of…

Logic · Mathematics 2017-06-16 Roman Pol , Piotr Zakrzewski

We investigate completions of partial combinatory algebras (pcas), in particular of Kleene's second model $\mathcal{K}_2$ and generalizations thereof. We consider weak and strong notions of embeddability and completion that have been…

Logic in Computer Science · Computer Science 2025-06-11 Sebastiaan A. Terwijn

We prove that integer programming with three quantifier alternations is $NP$-complete, even for a fixed number of variables. This complements earlier results by Lenstra and Kannan, which together say that integer programming with at most…

Combinatorics · Mathematics 2017-05-04 Danny Nguyen , Igor Pak

This paper deals with variety of problems in pcf theory and infinitary combinatorics. We look at normal filters and prc, measures of the size of [lambda]^{<kappa}, pcf-inaccessibility, entangled orders (and narrow Boolean Algebras),…

Logic · Mathematics 2007-05-23 Saharon Shelah

In this note we derive a property of maximal ideal-independent subsets of boolean algebras which has corollaries regarding the continuum cardinals p and s_mm(P(omega)/fin).

Logic · Mathematics 2012-08-09 Corey Thomas Bruns

We prove a number of elementary facts about computability in partial combinatory algebras (pca's). We disprove a suggestion made by Kreisel about using Friedberg numberings to construct extensional pca's. We then discuss separability and…

Logic · Mathematics 2020-02-06 S. A. Terwijn

We prove the following completeness result about classical realizability: given any Boolean algebra with at least two elements, there exists a Krivine-style classical realizability model whose characteristic Boolean algebra is elementarily…

Logic in Computer Science · Computer Science 2022-09-20 Guillaume Geoffroy

Let $\hat{R}$ be the $I$-adic completion of a commutative ring $R$ with respect to a finitely generated ideal $I$. We give a necessary and sufficient criterion for the category of perfect complexes over $\hat{R}$ to be equivalent to the…

Commutative Algebra · Mathematics 2024-11-25 Paul Balmer , Beren Sanders

We prove that it is consistent that the covering of the ideal of measure zero sets has countable cofinality.

Logic · Mathematics 2016-09-07 Saharon Shelah

A charge (finitely additive measure) defined on a Boolean algebra of sets taking values in a group $G$ is called a strictly nonzero (SNZ) charge if it takes the identity value in $G$ only for the zero element of the Boolean algebra. A study…

Logic · Mathematics 2016-08-04 Swastik Kopparty , K. P. S. Bhaskara Rao

We investigate the provability of classical combinatorial theorems in ZF. Using combinatorial arguments, we establish the following results for each infinite cardinal ${\kappa}\in On$, (1) ${\kappa}^+\to ({\kappa},{\omega}+1)$, (2) any…

Logic · Mathematics 2023-06-13 Tamás Csernák , Lajos Soukup

Vardanyan's Theorems state that $\mathsf{QPL}(\mathsf{PA})$ - the quantified provability logic of Peano Arithmetic - is $\Pi^0_2$ complete, and in particular that this already holds when the language is restricted to a single unary…

Logic · Mathematics 2023-12-20 Ana de Almeida Borges , Joost J. Joosten

In \cite{Chaber}, Chaber has proved that countably compact spaces with a quasi $G_{\delta }$-diagonal are compact. We prove that initially $\kappa $% -compact spaces with a quasi $G_{\kappa }$-diagonal are compact, for any infinite cardinal…

General Topology · Mathematics 2017-05-02 Çetin Vural

Generalizing Keisler's notion of regularity for ultrafilters, Taylor introduced degrees of regularity for ideals and showed that a countably complete nonregular ideal on $\omega_1$ must be somewhere $\omega_1$-dense. We prove a dichotomy…

Logic · Mathematics 2020-09-04 Monroe Eskew

In this paper we prove that the set of countable bqos (viewed as a subset of the Cantor space) is Pi^1_2-complete. The notion of bqo or better quasi-ordering arises from combinatorics and is a generalization of the canonical example of a…

Logic · Mathematics 2010-03-26 Alberto Marcone

We study the Onsager algebra from the ideal theoretic point of view. A complete classification of closed ideals and the structure of quotient algebras are obtained. We also discuss the solvable algebra aspect of the Onsager algebra through…

Quantum Algebra · Mathematics 2009-10-31 Etsuro Date , Shi-shyr Roan

We develop a version of Cichon's diagram for cardinal invariants on the generalized Cantor space 2^kappa or the generalized Baire space kappa^kappa where kappa is an uncountable regular cardinal. For strongly inaccessible kappa, many of the…

Logic · Mathematics 2016-11-28 Joerg Brendle , Andrew Brooke-Taylor , Sy-David Friedman , Diana Montoya
‹ Prev 1 3 4 5 6 7 10 Next ›