Related papers: Diophantine Correct Open Induction
In this paper we discourse basises of representable algebras. This question lead to arithmetic problems. We prove algorithmical solvability of exponential-Diophantine equations in rings represented by matrices over fields of positive…
We present a universal construction of Diophantine equations with bounded complexity in Isabelle/HOL. This is a formalization of our own work in number theory. Hilbert's Tenth Problem was answered negatively by Yuri Matiyasevich, who showed…
We introduce a class of group endomorphisms -- those of finite combinatorial rank -- exhibiting slow orbit growth. An associated Dirichlet series is used to obtain an exact orbit counting formula, and in the connected case this series is…
This paper is concerned with the extent to which the Skolem-Bang theorems in Diophantine approximations generalise from the standard setting of $<R,Z>$ to structures of the form $<F,I>$, where $F$ is an ordered field and $I$ is an integer…
Based on the MRDP theorem, we introduce the ideas of the proof equation of a formula and universal proof equation of Peano Arithmetic (PA); and then, combining universal proof equation and G\"odel's Second Incompleteness Theorem, it is…
We show how to get explicit induction formulae for finite group representations, and more generally for rational Green functors, by summing a divergent series over Dwyer's subgroup and centralizer decomposition spaces. This results in…
Many a concrete theorem of abstract algebra admits a short and elegant proof by contradiction but with Zorn's Lemma (ZL). A few of these theorems have recently turned out to follow in a direct and elementary way from the Principle of Open…
Let $D$ be an integrally closed domain with quotient field $K$. Let $A$ be a torsion-free $D$-algebra that is finitely generated as a $D$-module. For every $a$ in $A$ we consider its minimal polynomial $\mu_a(X)\in D[X]$, i.e. the monic…
In a paper from 2010, Budarina, Dickinson and Levesley studied the rational approximation properties of curves parametrized by polynomials with integral coefficients in Euclidean space of arbitrary dimension. Assuming the dimension is at…
As mathematical induction is applied to prove statements on natural numbers, {\it continuous induction} (or, {\it real induction}) is a tool to prove some statements in real analysis.(Although, this comparison is somehow an overstatement.)…
We reduce the principal problem of Additive Number Theory of whether an infinite sequence of integers constitutes a finite basis for the integers to a Diophantine problem involving the difference set of the sequence, by proving a formula…
Let k be a global field and \pp any nonarchimedean prime of k. We give a new and uniform proof of the well known fact that the set of all elements of k which are integral at \pp is diophantine over k. Let k^{perf} be the perfect closure of…
We show that the universally axiomatized, induction-free theory PA^- is a sequential theory in the sense of Pudl\'ak [5], in contrast to the closely related Robinson's arithmetic.
Let $D$ be an integrally closed domain with quotient field $K$ and $A$ a torsion-free $D$-algebra that is finitely generated as a $D$-module and such that $A\cap K=D$. We give a complete classification of those $D$ and $A$ for which the…
Exponential Puiseux semirings are additive submonoids of $\qq_{\geq 0}$ generated by almost all of the nonnegative powers of a positive rational number, and they are natural generalizations of rational cyclic semirings. In this paper, we…
We consider the average-case complexity of some otherwise undecidable or open Diophantine problems. More precisely, consider the following: (I) Given a polynomial f in Z[v,x,y], decide the sentence \exists v \forall x \exists y f(v,x,y)=0,…
We introduce real induction, a proof technique analogous to mathematical induction but applicable to statements indexed by an interval on the real line. More generally we give an inductive principle applicable in any Dedekind complete…
We consider the semiring of abstract finite dynamical systems up to isomorphism, with the operations of alternative and synchronous execution. We continue searching for efficient algorithms for solving polynomial equations of the form $P(X)…
We consider the problem of Diophantine approximation on semisimple algebraic groups by rational points with restricted numerators and denominators and establish a quantitative approximation result for all real points in the group by…
Myasnikov, Ushakov, and Won introduced power circuits in 2012 to construct a polynomial-time algorithm for the word problem in the Baumslag group, which has a non-elementary Dehn function. Power circuits are computational structures that…