Related papers: Arithmetical conservation results
The paper is a contribution both to the theoretical foundations and to the actual construction of efficient automatizable proof procedures for non-classical logics. We focus here on the case of finite-valued logics, and exhibit: (i) a…
We prove a generalization of Gotzmann's persistence theorem in the case of modules with constant Hilbert polynomial. As a consequence, we show that the defining equations that give the embedding of a Quot scheme of points into a…
We prove an arithmetic regularity lemma for stable subsets of finite abelian groups, generalising our previous result for high-dimensional vector spaces over finite fields of prime order. A qualitative version of this generalisation was…
The celebrated Green-Tao theorem states that the prime numbers contain arbitrarily long arithmetic progressions. We give an exposition of the proof, incorporating several simplifications that have been discovered since the original paper.
Formal proofs are challenging to write even for experienced experts. Recent progress in Neural Theorem Proving (NTP) shows promise in expediting this process. However, the formal corpora available on the Internet are limited compared to the…
This paper is intended to provide an introduction to cut elimination which is accessible to a broad mathematical audience. Gentzen's cut elimination theorem is not as well known as it deserves to be, and it is tied to a lot of interesting…
We investigate Hindman- and Owings-type Ramsey-theoretic statements in Zermelo-Fraenkel set theory without the Axiom of Choice, with some occasional extra assumptions (such as the Axiom of Dependent Choice and/or the Axiom of Determinacy).…
The famous G\"odel incompleteness theorem states that for every consistent sufficiently rich formal theory T there exist true statements that are unprovable in T. Such statements would be natural candidates for being added as axioms, but…
We consider the following property of a first order theory T with a distinguished unary predicate P: every model of the theory of P occurs as the P-part of some model of T. We call this property the Gaifman property. Gaifman conjectured…
This paper studies axioms for nonmonotonic consequences from a semantics-based point of view, focusing on a class of mathematical structures for reasoning about partial information without a predefined syntax/logic. This structure is called…
A theorem of alternatives provides a reduction of validity in a substructural logic to validity in its multiplicative fragment. Notable examples include a theorem of Arnon Avron that reduces the validity of a disjunction of multiplicative…
We propose a novel construction for the well-known prefer-max De Bruijn sequence, based on the cycle joining technique. We further show that the construction implies known results from the literature in a straightforward manner. First, it…
Building on ideas of Gurevich and Shelah for the G\"odel Class, we present a new probabilistic proof of the finite model property for the Guarded Fragment of First-Order Logic. Our proof is conceptually simple and yields the optimal…
Using a theorem of partial differential equations, we present a general way of deriving the conserved quantities associated with a given classical point mechanical system, denoted by its Hamiltonian. Some simple examples are given to…
All constructive methods employed in modern mathematics produce only countable sets, even when designed to transcend countability. We show that any constructive argument for uncountability -- excluding diagonalization techniques --…
When given a class of functions and a finite collection of sets, one might be interested whether the class in question contains any function whose domain is a subset of the union of the sets of the given collection and whose restrictions to…
Building on the concept of pretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions.
Based upon the axiom of choice it is proved that the cardinality of the rational numbers is not less than the cardinality of the irrational numbers. This contradicts a main result of transfinite set theory and shows that the axiom of choice…
For a linear non-Hermitian system, I demonstrate that a Hamiltonian can be constructed such that the non-Hermitian equations can be expressed exactly in the form of Hamilton's canonical equations. This is first shown for discrete systems…
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…