相关论文: Goldbach Conjecture and First-Order Arithmetic

We consider an extension of first-order logic with a recursion operator that corresponds to allowing formulas to refer to themselves. We investigate the obtained language under two different systems of semantics, thereby obtaining two…

We discuss analogues of the prime number theorem for a hyperbolic rational map f of degree at least two on the Riemann sphere. More precisely, we provide counting estimates for the number of primitive periodic orbits of f ordered by their…

We consider the immediate consequence of an arguable addition to the standard Deduction Theorems of first order theories.

All sieve methods for the Goldbach problem sift out all the composite numbers; even though, strictly speaking, it is not necessary to do so and which is, in general, very difficult. Some new methods introduced in this paper show that the…

We establish pointwise ergodic theorems for a large class of natural averages on simple Lie groups of real-rank-one, going well beyond the radial case considered previously. The proof is based on a new approach to pointwise ergodic…

The celebrated Trakhtenbrot's theorem states that the set of finitely valid sentences of first-order logic is not computably enumerable. In this note we will extend this theorem by proving that the finite satisfiability problem of any…

Using algebraic geometry methods, the third author proved that the group ring of a surjunctive group with coefficients in a field is always stably finite. In other words, every group satisfying Gottschalk's conjecture also satisfies…

A celebrated conjecture of Hardy and Littlewood provides with an asymptotic formula for the counting function of the twin primes. We give an unconditional proof of such a formula by means of a finite Ramanujan expansion of the counting…

We prove that for any integers $\alpha, \beta > 1$, the existential fragment of the first-order theory of the structure $\langle \mathbb{Z}; 0,1,<, +, \alpha^{\mathbb{N}}, \beta^{\mathbb{N}}\rangle$ is decidable (where $\alpha^{\mathbb{N}}$…

This paper studies a first-order expansion of a combination C+J of intuitionistic and classical propositional logic, which was studied by Humberstone (1979) and del Cerro and Herzig (1996), from a proof-theoretic viewpoint. While C+J has…

Any intermediate propositional logic (i.e., a logic including intuitionistic logic and contained in classical logic) can be extended to a calculus with epsilon- and tau-operators and critical formulas. For classical logic, this results in…

First order algebraic differential equations are considered. An necessary condition for a first order algebraic differential equation to have a rational general solution is given: the algebraic genus of the equation should be zero.…

We provided in \cite{BaldwinBrincusI} extensions of first order logic by modified inferential definitions of the classical $\omega$-rule in $1$ or $2$ sorts. These logics are categorical in the inferential sense. Arithmetic has a unique…

Hilbert's first problem is of importance in relation to work being done in computational systems. It is the question of equipollence of natural and real numbers. By construction equipollence is established for real numbers in open interval…

Improving earlier estimates of several authors we show that the number E(X) of Goldbach exceptional even integers (that is, even integers which cannot be written as the sum of two primesw) below X satisfies tho bound E(X) < X^0.72 for…

Proofs are traditionally syntactic, inductively generated objects. This paper reformulates first-order logic (predicate calculus) with proofs which are graph-theoretic rather than syntactic. It defines a combinatorial proof of a formula…

In this paper, using an algebraic approach, it is intended to show that the Goldbach's and Twin primes conjectures are true, building, for each $m>2$, an isomorphism between posets. One of the posets is the set of coprimes less than $m$,…

We prove Los conjecture = Morley theorem in ZF, with the same characterization (of first order countable theories categorical in aleph_alpha for some (equivalently for every) ordinal alpha>0. Another central result here is, in this context:…

In the paper, there are new found methods to determine the range of every exceptional element in exceptional set, we can solve Twin primes problem and Goldbach Conjecture problem basically.

The Collatz hypothesis is a theorem of the algorithmic theory of natural numbers. We prove the (algorithmic) formula that expresses the halting property of Collatz algorithm. The observation that Collatz's theorem cannot be proved in any…