Related papers: Prenex normal form theorems in semi-classical arit…
The paper begins by exploring the various definitions of norms on semigroups and then presents a new definition of a normed semigroup. The properties of normed semigroups in the new sense are investigated. The new definition of the norm is…
We systematically study conservation theorems on theories of semi-classical arithmetic, which lie in-between classical arithmetic $\mathsf{PA}$ and intuitionistic arithmetic $\mathsf{HA}$. Using a generalized negative translation, we first…
Cut-elimination theorems constitute one of the most important classes of theorems of proof theory. Since Gentzen's proof of the cut-elimination theorem for the system $\mathbf{LK}$, several other proofs have been proposed. Even though the…
This paper examines the application of Tarski's Undefinability Theorem to first-order arithmetic. The generally accepted view is that for this case the Theorem establishes that arithmetic truth is not arithmetic. A careful examination of…
We present an alternative account of the problem of classifying and finding normal forms for arbitrary bilinear forms. Beginning from basic results developed by Riehm, our solution to this problem hinges on the classification of…
Our earlier publications showed semantic tableau admits partial exceptions to the Second Incompleteness Theorem where a formalism recognizes its self consistency and views multiplication as a 3-way relation (rather than as a total…
There are two basic ways of weakening the definition of the well-known metric regularity property by fixing one of the points involved in the definition. The first resulting property is called metric subregularity and has attracted a lot of…
The set of prime numbers has been analyzed, based on their algebraic and arithmetical structure. Here by obtaining a sort of linear formula for the set of prime numbers, they are redefined and identified; under a systematic procedure it has…
We reproduce Hilbert's axiomatic formalisation of Number Theory, and argue that his enunciation of the Law of the Excluded Middle is inconsistent with a Turing-verifiable model of the axioms under the standard interpretation.
Analytic number theorists usually seek to show that sequences which appear naturally in arithmetic are ``well-distributed'' in some appropriate sense. In various discrepancy problems, combinatorics researchers have analyzed limitations to…
We develop algebraic models of simple type theories, laying out a framework that extends universal algebra to incorporate both algebraic sorting and variable binding. Examples of simple type theories include the unityped and simply-typed…
The centrepiece of this paper is a normal form for primitive elements which facilitates the use of induction arguments to prove properties of primitive elements. The normal form arises from an elementary algorithm for constructing a…
Let $R$ be an order in an algebraic number field. If $R$ is a principal order, then many explicit results on its arithmetic are available. Among others, $R$ is half-factorial if and only if the class group of $R$ has at most two elements.…
To determine whether a number is congruent or not is an old and difficult topic and progress is slow. The paper presents a new theorem when a prime number is a congruent number or not. The proof is not necessarily any simpler or shorter…
Many theorems of mathematics have the form that for a certain problem, e.g. a differential equation or polynomial (in)equality, there exists a solution. The sequential version then states that for a sequence of problems, there is a sequence…
We obtain a criterion for the quasi-regularity of generalized (non-sectorial) Dirichlet forms, which extends the result of P.J. Fitzsimmons on the quasi-regularity of (sectorial) semi-Dirichlet forms. Given the right (Markov) process…
We show analogues of the classical Krein-Milman theorem for several ordered algebraic structures, especially in a semilattice (non-linear) framework. In that case, subsemilattices are seen as convex subsets, and for our proofs we use…
Across machine learning (ML) sub-disciplines researchers make mathematical assumptions to facilitate proof-writing. While such assumptions are necessary for providing mathematical guarantees for how algorithms behave, they also necessarily…
We develop a technique for normalization for $\infty$-type theories. The normalization property helps us to prove a coherence theorem: the initial model of a given $\infty$-type theory is $0$-truncated. The coherence theorem justifies…
This paper shows that the cyclotomic quiver Hecke algebras of type $A$, and the gradings on these algebras, are intimately related to the classical seminormal forms. We start by classifying all seminormal bases and then give an explicit…