Related papers: Introducing a nontrivial square_omega

We introduce an iteration of forcing notions satisfying the countable chain condition with minimal damage to a strong coloring. Applying this method, we prove that Martin's axiom is strictly stronger than its restriction to forcing notions…

We suggest necessary conditions of soficness of multidimensional shifts formulated in termsof resource-bounded Kolmogorov complexity. Using this technique we provide examples ofeffective and non-sofic shifts on $\mathbb{Z}^2$ with very low…

Defeasible conditionals are a form of non-monotonic inference which enable the expression of statements like "if $\phi$ then normally $\psi$". The KLM framework defines a semantics for the propositional case of defeasible conditionals by…

We develop a new setting for the exponential principle in the context of multisort species, where indecomposable objects are generated intrinsically instead of being given in advance. Our approach uses the language of functors and natural…

In this paper we derive a necessary condition for finite element method (FEM) convergence in $H^1(\Omega)$ as well as generalize known sufficient conditions. We deal with the piecewise linear conforming FEM on triangular meshes for…

It is shown that the action for Hamiltonian equations of motion can be brought into invariant symplectic form. In other words, it can be formulated directly in terms of the symplectic structure $\omega$ without any need to choose some…

Capture calculus has recently been proposed as a solution to effect checking, achieved by tracking the captured references of terms in the types. Boxes, along with the box and unbox operations, are a crucial construct in capture calculus,…

In this small note, we provide an elementary proof of the fact that infinitely many odd zeta values are irrational. For the first time, this celebrated theorem been proven by Rivoal and Ball--Rivoal. The original proof uses highly…

We give arguments for and prove the consistency of some internal forcing axioms.

We prove that every finite partition of $\omega$ admit an infinite subset that does not compute a Schnorr random real. We use this result to answer two questions of Brendle, Brooke-Taylor, Ng and Nies and strength a result of Khan and…

We prove that if the associated fourth order tensor of a quadratic form has a linear elastic cubic symmetry then it is quasiconvex if and only if it is polyconvex, i.e. a sum of convex and null-Lagrangian quadratic forms. We prove that…

A structural analysis of construction schemes is developed. That analysis is used to give simple and new constructions of combinatorial objects which have been of interest to set theorists and topologists. We then continue the study of…

Let $\mathcal{C}:=\mathcal{C}(G,\omega,H,\psi)$ be a finite group scheme-theoretical category over an algebraically closed field of characteristic $p\ge 0$ as defined by the first author. For any indecomposable exact module category over…

One of the main difficulty concerning the nature of the continuum is to do justice, inside the set theoretical Cantorian framework, to the classical conception (from Aristotle to Thom, via Kant, Peirce, Brentano, Husserl and Weyl) according…

We deal with relatives of GCH which are provable. In particular we deal with rank version of the revised GCH. Our motivation was to find such results when only weak versions of the axiom of choice are assumed but some of the results gives…

Partial descriptions of the Universe are presented in the form of linear equations considered in the free (full, super) Fock space. The universal properties of these equations are discussed. The closure problem caused by computational and…

The paper has been withdrawn

In this paper we examine an alternative formulation of the gauge principle in which the emphasis is shifted from the symmetry transformations to their generators. We show that the gauge principle can be entirely reformulated in terms of…

We significantly strengthen results on the structure of matrix rings over finite fields and apply them to describe the structure of the so-called weakly $n$-torsion clean rings. Specifically, we establish that, for any field $F$ with either…

We describe a formalization of forcing using Boolean-valued models in the Lean 3 theorem prover, including the fundamental theorem of forcing and a deep embedding of first-order logic with a Boolean-valued soundness theorem. As an…