Related papers: Non-principal ultrafilters, program extraction and…
Craig interpolation has emerged as an effective means of generating candidate program invariants. We present interpolation procedures for the theories of Presburger arithmetic combined with (i) uninterpreted predicates (QPA+UP), (ii)…
We give several topological/combinatorial conditions that, for a filter on $\omega$, are equivalent to being a non-meager $\mathsf{P}$-filter. In particular, we show that a filter is countable dense homogeneous if and only if it is a…
Of particular interest is to discover useful representations solely from observations in an unsupervised generative manner. However, the question of whether existing normalizing flows provide effective representations for downstream tasks…
We investigate the power of non-determinism in purely functional programming languages with higher-order types. Specifically, we consider cons-free programs of varying data orders, equipped with explicit non-deterministic choice.…
In recent decades, a growing number of discoveries in fields of mathematics have been assisted by computer algorithms, primarily for exploring large parameter spaces that humans would take too long to investigate. As computers and…
We exhibit a forcing for producing a model with no nowhere dense ultrafilters that satisfies the full Sacks Property. By interleaving this forcing with other forcing notions, a model containing a $(2, {\aleph}_{0})$-selective ultrafilter,…
We further investigate a divisibility relation on the set $\beta N$ of ultrafilters on the set of natural numbers. We single out prime ultrafilters (divisible only by 1 and themselves) and establish a hierarchy in which a position of every…
Proving program termination is typically done by finding a well-founded ranking function for the program states. Existing termination provers typically find ranking functions using either linear algebra or templates. As such they are often…
In this note we show that unsatisfiable systems of linear equations with a constant number of variables per equation over prime finite fields have polynomial-size constant-degree semi-algebraic proofs of unsatisfiability. These are proofs…
Let A be a unital separable simple C*-algebra with a unique tracial state. We prove that if A is nuclear and quasidiagonal, then A tensored with the universal UHF-algebra has decomposition rank at most one. Then it is proved that A is…
Recently the second author introduced combinatorial principles that characterize supercompactness for inaccessible cardinals but can also hold true for small cardinals. We prove that the proper forcing axiom PFA implies these principles…
In this paper, we study solvability and qualitative properties of nonnegative solutions for a sublinear nonlocal problem with fully nonlinear structure in the form $$ \mathcal{M}^{\pm}[u]+a(x)u^{q}(x)=0 \; \text{ in }\Omega,\qquad u\geq 0…
Let $A$ be a semiprime 2 and 3-torsion free non-commutative associative algebra. We show that the Lie algebra $\der(A)$ of (associative) derivations of $A$ is strongly non-degenerate, which is a strong form of semiprimeness for Lie…
We answer Blass' question from 1989 of whether the inequality $\gu < \gro$ is strictly stronger than the filter dichotomy principle affirmatively. We show that there is a forcing extension in which every non-meagre filter on $\omega$ is…
Extended Affine (EA) equivalence is the equivalence relation between two vectorial Boolean functions $F$ and $G$ such that there exist two affine permutations $A$, $B$, and an affine function $C$ satisfying $G = A \circ F \circ B + C$.…
We develop the theory of cofinal types of ultrafilters over measurable cardinals and establish its connections to Galvin's property. We generalize fundamental results from the countable to the uncountable, but often in surprisingly…
We introduce $\textit{Laver ultrafilters}$, namely ultrafilters $\mathcal{U}$ for which the associated Laver forcing $\mathbb{L}_{\mathcal{U}}$ has the Laver property. We give simple combinatorial characterisations of these ultrafilters,…
Fix a finite ordinal n>2. We show that there exists an atomic, simple and countable representable CA_n, such that its minimal completion is outside SNr_nCA_{n+3}. Hence, for any finite k\geq 3, the variety SNr_nCA_{n+k} is not…
We incorporate strong negation in the theory of computable functionals TCF, a common extension of Plotkin's PCF and G\"{o}del's system $\mathbf{T}$, by defining simultaneously strong negation $A^{\mathbf{N}}$ of a formula $A$ and strong…
We study the question which Boolean algebras have the property that for every generating set there is an ultrafilter selecting maximal number of its elements. We call it the ultrafilter selection property. For cardinality aleph-one the…