Related papers: Transfinite Recursion in Higher Reverse Mathematic…
For substructural logics with contraction or weakening admitting cut-free sequent calculi, proof search was analyzed using well-quasi-orders on $\mathbb{N}^d$ (Dickson's lemma), yielding Ackermannian upper bounds via controlled bad-sequence…
The Axiom of Choice (AC for short) is the most (in)famous axiom of the usual foundations of mathematics, ZFC set theory. The (non-)essential use of AC in mathematics has been well-studied and thoroughly classified. Now, fragments of…
This paper explores special conditions on the starting value of a Collatz sequence which imply that the Collatz conjecture is true. This is the result of the collaboration of a retired mathematics professor (Koelzer) and a retired physics…
Set out here are some fundamental theories that may be regarded as newly discovered metamathematics of the odd integers in relation to the Collatz conjecture (also called the 3x+1 problem). Originally motivated by the requirement to invent…
Given a row-finite, source-free, graph of rank k, we extend the definition of reduction introduced by Eckhardt et al. This constitutes a large step forward in the extension of the geometric classification of finite directed graph…
We present a novel approach for the inverse problem in electrical impedance tomography based on regularized quadratic regression. Our contribution introduces a new formulation for the forward model in the form of a nonlinear integral…
We study Polynomial Lawvere logic PL, a logic defined over the Lawvere quantale of extended positive reals with sum as tensor, to which we add multiplication, thereby obtaining a semiring structure. PL is designed for complex quantitative…
The so-called Takahashi's \emph{Inversion Theorem}, the reconstruction of a given spinor based on its bilinear covariants, are re-examined, considering alternative dual structures. In contrast to the classical results, where the Dirac dual…
We verify new cases of the Arithmetic Fundamental Lemma (AFL) of Wei Zhang. This relies on a recursive algorithm which allows, under certain conditions, to reduce the AFL identity in question to an AFL identity in lower dimension. The main…
The Toeplitz determinants (of increasing size) associated with the symbols $exp{t(z+z^{-1})}$ or $(1-{\xi}{z})^{\alpha} (1-{\xi}{z^{-1}})^{\beta}$ satisfy recursion relations, thus expressing all the Toeplitz determinants as a rational…
In this article, we define relative resolutions and coresolutions in extriangulated categories. By studying this relative resolutions and coresolutions, we get a generalization of the Auslander-Buchweitz approximation theory. Finally, we…
We introduce two-sorted theories in the style of [CN10] for the complexity classes \oplusL and DET, whose complete problems include determinants over Z2 and Z, respectively. We then describe interpretations of Soltys' linear algebra theory…
Recursive algebraic data types (term algebras, ADTs) are one of the most well-studied theories in logic, and find application in contexts including functional programming, modelling languages, proof assistants, and verification. At this…
Non-wellfounded material sets have been modelled in Martin-L\"of type theory by Lindstr\"om using setoids. In this paper we construct models of non-wellfounded material sets in Homotopy Type Theory (HoTT) where equality is interpreted as…
We give a detailed description of the torsors that correspond to multiloop algebras. These algebras are twisted forms of simple Lie algebras extended over Laurent polynomial rings. They play a crucial role in the construction of Extended…
We show that the Poincar\'e lemma we proved elsewhere in the context of crystalline cohomology of higher level behaves well with regard to the Hodge filtration. This allows us to prove the Poincar\'e lemma for transversal crystals of level…
Satisfiability problems play a central role in computer science and engineering as a general framework for studying the complexity of various problems. Schaefer proved in 1978 that truth satisfaction of propositional formulas given a…
This paper is about randomized iterative algorithms for solving a linear system of equations $X \beta = y$ in different settings. Recent interest in the topic was reignited when Strohmer and Vershynin (2009) proved the linear convergence…
We carry out a proof theoretic analysis of the wellfoundedness of recursive path orders in an abstract setting. We outline a very general termination principle and extract from its wellfoundedness proof subrecursive bounds on the size of…
In this paper we try to find a computational interpretation for a strong form of extensionality, which we call "converse extensionality". Converse extensionality principles, which arise as the Dialectica interpretation of the axiom of…