English
Related papers

Related papers: An analytic proof of Fermat-Wiles theorem !

200 papers

We define a class of formal systems inspired by Prawitz's theory of grounds. The latter is a semantics that aims at accounting for epistemic grounding, namely, at explaining why and how deductively valid inferences have the power to…

Logic · Mathematics 2025-01-22 Antonio Piccolomini d'Aragona

Based on M. Hall's theorem we prove a simple result dealing with real numbers which admit exact approximations by rationals.

Number Theory · Mathematics 2026-03-30 Dmitry Gayfulin , Sergei Pitcyn

We consider measures supported on sets of irrational numbers possessing many consecutive partial quotients satisfying a condition based on the previous partial quotients. We show that under mild assumptions, such sets will always support…

Classical Analysis and ODEs · Mathematics 2025-03-24 Robert Fraser

The Fermat numbers have many notable properties, including order universality, coprimality, and definition by a recurrence relation. We use arbitrary elliptic curves and rational points of infinite order to generate sequences that are…

Number Theory · Mathematics 2019-02-06 Skye Binegar , Randy Dominick , Meagan Kenney , Jeremy Rouse , Alex Walsh

We investigate non-wellfounded proof systems based on parsimonious logic, a weaker variant of linear logic where the exponential modality ! is interpreted as a constructor for streams over finite data. Logical consistency is maintained at a…

Logic in Computer Science · Computer Science 2025-09-03 Matteo Acclavio , Gianluca Curzi , Giulio Guerrieri

We give a new proof of Tietze Theorem on the convergence of infinite semi-regular continued fractions.

Number Theory · Mathematics 2022-03-11 Daniel Duverney , Iekata Shiokawa

We introduce a non-wellfounded proof system for intuitionistic logic extended with inductive and co-inductive definitions, based on a syntax in which fixpoint formulas are annotated with explicit variables for ordinals. We explore the…

Logic in Computer Science · Computer Science 2026-05-13 Sebastian Enqvist

In this paper we obtain bounds for integer solutions of quadratic polynomials in two variables that represent a natural number. Also we get some results on twin prime numbers. In addition, we use linear functionals to prove some results of…

General Mathematics · Mathematics 2021-02-25 B. M. Cerna Maguiña , Victor H. López Solís , Dik D. Lujerio Garcia

Applying Baaz's Generalization Method and a new technique to, respectively, proofs and denumerable simple graphs, diverse arithmetical patterns are observed. In particular, sufficient conditions for a number to be a divisor of a Fermat…

Number Theory · Mathematics 2020-02-11 Lorenzo Sauras-Altuzarra

The numerical analysis for the small amplitude motion of an elastic beam with internal damping is investigated in domain with moving ends. An efficient numerical method is constructed to solve this moving boundary problem. The stability and…

Numerical Analysis · Mathematics 2019-07-05 Natanael Quintino , Mauro Rincon

Let k be a perfect field of characteristic p>0 and W the ring of Witt vectors of k. In this article, we give a new proof of the Frobenius descent for convergent isocrystals on a variety over k relative to W. This proof allows us to deduce…

Algebraic Geometry · Mathematics 2019-10-02 Daxin Xu

We give a simple proof that the first-order theory of well orders is axiomatized by transfinite induction, and that it is decidable.

Logic · Mathematics 2025-03-26 Emil Jeřábek

Proofs of the fundamental theorem of algebra can be divided up into three groups according to the techniques involved: proofs that rely on real or complex analysis, algebraic proofs, and topological proofs. Algebraic proofs make use of the…

History and Overview · Mathematics 2015-04-23 Piotr Błaszczyk

In his proof of Fermat's Last Theorem, Wiles deployed a commutative algebra technique, namely a numerical criterion for detecting isomorphisms of rings. In our recent work we pick up on Wiles' work and generalize the numerical criterion to…

Number Theory · Mathematics 2026-03-30 Srikanth B. Iyengar , Chandrashekhar B. Khare , Jeffrey Manning

We present a categorical theory of the composition methods in finite model theory -- a key technique enabling modular reasoning about complex structures by building them out of simpler components. The crucial results required by the…

Logic in Computer Science · Computer Science 2023-04-26 Tomáš Jakl , Dan Marsden , Nihil Shah

In this work, we present a logical formalism for reasoning about quantum systems in finite dimension. Contrary to the usual approach in quantum logic, our formalism is based classical first-order logic, which allows us to use the tools of…

Quantum Physics · Physics 2026-02-19 Olivier Brunet

Mathematical proofs are often said to justify their conclusions by indicating the existence of a corresponding formal derivation. We argue that this widespread view relies on an under-examined notion of correspondence, or what it means for…

History and Overview · Mathematics 2026-03-20 Simon DeDeo , Eamon Duede

We present intersection type systems in the style of sequent calculus, modifying the systems that Valentini introduced to prove normalisation properties without using the reducibility method. Our systems are more natural than Valentini's…

Logic in Computer Science · Computer Science 2015-03-18 Kentaro Kikuchi

We present a categorical theory of the composition methods in finite model theory -- a key technique enabling modular reasoning about complex structures by building them out of simpler components. The crucial results required by the…

Logic in Computer Science · Computer Science 2025-10-22 Tomáš Jakl , Dan Marsden , Nihil Shah

Quantum mechanics is an extremely successful theory of nature and yet it lacks an intuitive axiomatization. In contrast, the special theory of relativity is well understood and is rooted into natural or experimentally justified postulates.…

Quantum Physics · Physics 2015-10-27 Florin Moldoveanu