Related papers: Formal Proof of the Weak Goodstein Theorem
The concept of a weak factorization system has been studied extensively in homotopy theory and has recently found an application in one of the proofs of the celebrated flat cover conjecture, categorical versions of which have been presented…
In this paper we demonstrate that the class of basic feasible functionals has recursion theoretic properties which naturally generalize the corresponding properties of the class of feasible functions. We also improve the Kapron - Cook…
In this article, the weakest possible theorem providing a foundation for the Hilbert space formalism of quantum theory is stated. The necessary postulates are formulated, and the mathematics is spelt out in detail. It is argued that, from…
While proof is a central component of postsecondary mathematical study, proof construction has historically posed significant difficulties for students who intend to earn mathematics degrees at the undergraduate level. This work is…
We present a lecture note on Thouvenot's proof of the Roth-Furstenberg theorem and joining proofs of Furstenberg's theorems on multiple progression average mixing for weakly mixing transformations.
Well-founded fixed points have been used in several areas of knowledge representation and reasoning and to give semantics to logic programs involving negation. They are an important ingredient of approximation fixed point theory. We study…
In this paper, we prove the weak positivity theorem in positive characteristic when the canonical ring of the geometric generic fiber $F$ is finitely generated and the Frobenius stable canonical ring of $F$ is large enough. As its…
Agentic theorem provers combine a reasoning model, retrieval, search, and a proof assistant verifier, yet it remains unclear which components actually improve finite-budget proof success and why they help on real mathematical workloads. We…
In this article, we consider the structure of graded rings, not necessarily commutative nor with unity, and study the graded weakly prime ideals. We investigate the graded rings in which all graded ideals are graded weakly prime. Several…
In the context of $\mathsf{ZF}$, we analyze a version of Hindman's finite unions theorem on infinite sets, which normally requires the Axiom of Choice to be proved. We establish the implication relations between this statement and various…
We investigate the power of weak measurements in the framework of quantum state discrimination. First, we define and analyze the notion of weak consecutive measurements. Our main result is a convergence theorem whereby we demonstrate when…
We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…
A formalisation of G\"odel's incompleteness theorems using the Isabelle proof assistant is described. This is apparently the first mechanical verification of the second incompleteness theorem. The work closely follows {\'S}wierczkowski…
We compute the associated prime ideals of the normalization modulo the ring, and establish connections between different types of generalizations (resp. specializations) of the normalization. This has some applications. For example, we…
In this chapter we offer an introduction to weak values from a three-fold perspective: first, outlining the protocols that enable their experimental determination; next, deriving their correlates in the quantum formalism and, finally,…
Although Zermelo-Fraenkel set theory (ZFC) is generally accepted as the appropriate foundation for modern mathematics, proof theorists have known for decades that virtually all mainstream mathematics can actually be formalized in much…
We consider the weak field limit of gravity in the vierbein-Einstein-Palatini formalism, find the action and the equations for perturbations around an arbitrary background, and compare them with the usual metric perturbation equations. We…
For certain weak versions of the Axiom of Choice (most notably, the Boolean Prime Ideal theorem), we obtain equivalent formulations in terms of partial orders, and filter-like objects within them intersecting certain dense sets or…
G\"odel's first and second incompleteness theorems are corner stones of modern mathematics. In this article we present a new proof of these theorems for ZFC and theories containing ZFC, using Chaitin's incompleteness theorem and a very…
In this paper we are concerned with a Gordan-type theorem involving an arbitrary number of inequality functions. We not only state its validity under a weak convexity assumption on the functions, but also show it is an optimal result. We…