Related papers: Hindman's Theorem: An Ultrafilter Argument in Seco…

Representing a proof tree by a combinator term that reduces to the tree lets subtle forms of duplication within the tree materialize as duplicated subterms of the combinator term. In a DAG representation of the combinator term these…

In recent years, G\"odel's ontological proof and variations of it were formalized and analyzed with automated tools in various ways. We supplement these analyses with a modeling in an automated environment based on first-order logic…

Filter convergence of vector lattice-valued measures is considered, in order to deduce theorems of convergence for their decompositions. First the $\sigma$-additive case is studied, without particular assumptions on the filter; later the…

We define a filtration of a standard Whittaker module over a complex semisimple Lie algebra and and establish its fundamental properties. Our filtration specialises to the Jantzen filtration of a Verma module for a certain choice of…

We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results. Finally, we prove a number of decidability and undecidability results.

We study the Hamiltonian truncation for the two-dimensional $\lambda\phi^4$ theory within the framework of Hamiltonian truncation effective theory, where truncation artifacts are mitigated through a systematic inclusion of corrective terms…

We introduce and investigate a novel notion of transversely affine foliation, comparing and contrasting it to the previous ones in the literature. We then use it to give an extension of the classic Hadamard's theorem from Riemannian…

The concepts of a conditional set, a conditional inclusion relation and a conditional Cartesian product are introduced. The resulting conditional set theory is sufficiently rich in order to construct a conditional topology, a conditional…

Traditional approaches to combination tones based on Helmholtz theory encounter essential interpreting difficulties, which the most known example is the anomalous behaviour of the combination tone 2f1-f2. Without doubt the phenomenon of…

We develop a method that we call \emph{omission of intervals}, for establishing topological properties of subsets of the real line based on their combinatorial structure. Using this method, we obtain conceptual proofs of the fundamental…

We introduce a homotopy-theoretic interpretation of intuitionistic first-order logic based on ideas from Homotopy Type Theory. We provide a categorical formulation of this interpretation using the framework of Grothendieck fibrations. We…

H. Furstenberg introduced the notion of central set in terms of topological dynamics and established the central set theorem. The essence of central set theorem is that it is the simultaneous extension of van der Waerden's theorem and…

For the system of second order quasilinear parabolic equations the problem of reducing them to the equations of diffusion type is considered. In non-degenerate case an effective algorithm for solving this problem is suggested.

We present a new combinatorial and conjectural algorithm for computing the Mullineux involution for the symmetric group and its Hecke algebra. This algorithm is built on a conjectural property of crystal isomorphisms which can be rephrased…

Many applications of automated deduction require reasoning in first-order logic modulo background theories, in particular some form of integer arithmetic. A major unsolved research challenge is to design theorem provers that are "reasonably…

It is conjectured that the dual variety of every smooth nonlinear subvariety of dimension $> \frac{2N}{3}$ in projective $N$-space is a hypersurface, an expectation known as the duality defect conjecture. This would follow from the truth of…

The entropy accumulation theorem states that the smooth min-entropy of an $n$-partite system $A = (A_1, \ldots, A_n)$ is lower-bounded by the sum of the von Neumann entropies of suitably chosen conditional states up to corrections that are…

The two squares theorem of Fermat is a gem in number theory, with a spectacular one-sentence "proof from the Book". Here is a formalisation of this proof, with an interpretation using windmill patterns. The theory behind involves…

This article presents simple and easy proofs of the Implicit Function Theorem and the Inverse Function Theorem, in this order, both of them on a finite-dimensional Euclidean space, that employ only the Intermediate Value Theorem and the…

The higher order matching problem is the problem of determining whether a term is an instance of another in the simply typed $\lambda$-calculus, i.e. to solve the equation a = b where a and b are simply typed $\lambda$-terms and b is…