SearcharxivSearch

arXiv · 1602.03580

Fermat's Last Theorem and Catalan's Conjecture in Weak Exponential Arithmetics

Abstract

We study Fermat's Last Theorem and Catalan's conjecture in the context of weak arithmetics with exponentiation. We deal with expansions (B,e) of models of arithmetical theories (in the language L=(0,1,+,x,<)) by a binary (partial or total) function e intended as an exponential. We provide a general construction of such expansions and prove that it is universal for the class of all exponentials e which satisfy a certain natural set of axioms Exp. We construct a model (B,e) of Th(N) + Exp and a substructure (A,e) with e total and A model of Pr (Presburger arithmetic) such that in both (B,e) and (A,e) Fermat's Last Theorem for e is violated by cofinally many exponents n and (in all coordinates) cofinally many pairwise linearly independent triples a,b,c. On the other hand, under the assumption of ABC conjecture (in the standard model), we show that Catalan's conjecture for e is provable in Th(N)+Exp (even in a weaker theory) and thus holds in (B,e) and (A,e). Finally, we also show that Fermat's Last Theorem for e is provable (again, under the assumption of ABC in N) in Th(N)+Exp+"coprimality for e".

Explore related subjects

Keep this discovery

BibTeXRIS

Petr Glivický, Vítězslav Kala. 2016-11-14. Fermat's Last Theorem and Catalan's Conjecture in Weak Exponential Arithmetics. https://doi.org/10.1002/malq.201500069

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO