Related papers: Effective Prime Uniqueness
Machine learning models that predict the feasibility of chemical reactions have become central to automated synthesis planning. Despite their predictive success, these models often lack transparency and interpretability. We introduce a…
A relation algebra is called measurable when its identity is the sum of measurable atoms, and an atom is called measurable if its square is the sum of functional elements. In this paper we show that atomic measurable relation algebras have…
We give a simple example of a set that is weakly Dedekind infinite (= can be mapped onto omega) but dually Dedekind finite (=cannot be mapped noninjectively onto itself), namely, the power set of a superamorphous set. (A infinite set is…
Commutative semirings with divisible additive semigroup are studied. We show that an additively divisible commutative semiring is idempotent, provided that it is finitely generated and torsion. In case that a one-generated additively…
An infinite set is orbit-finite if, up to permutations of the underlying structure of atoms, it has only finitely many elements. We study a generalisation of linear programming where constraints are expressed by an orbit-finite system of…
Let $A$ be a commutative algebra equipped with an action of a group $G$. The so-called $G$-primes of $A$ are the equivariant analogs of prime ideals, and of central importance in equivariant commutative algebra. When $G$ is an infinite…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
This work deals with the definability problem by quantifier-free first-order formulas over a finite algebraic structure. We show the problem to be coNP-complete and present two decision algorithms based on a semantical characterization of…
Prime number multiplet classifications and patterns are extended to negative integers. The extension from prime numbers to single prime powers is also studied. Prime number septets at equal distance are given. It is also shown that each…
We call an operator algebra A {\em reversible} if A with reversed multiplication is also an abstract operator algebra (in the modern operator space sense). This class of operator algebras is intimately related to the {\em symmetric operator…
The use of effective field theory offers a systematic way to improve calculations of nuclear reactions and the properties of atomic nuclei. Its successes have led to the widespread belief that the predictions of this approach are model…
We show that the class of representable substitution algebras is characterized by a set of universal first order sentences. In addition, it is shown that a necessary and sufficient condition for a substitution algebra to be representable is…
Are minds subject to laws of physics? Are the laws of physics computable? Are conscious thought processes computable? Currently there is little agreement as to what are the right answers to these questions. Penrose goes one step further and…
Hidden-variable models aim to reproduce the results of quantum theory and to satisfy our classical intuition. Their refutation is usually based on deriving predictions that are different from those of quantum mechanics. Here instead we…
A (positive definite and integral) quadratic form is said to be $\textit{prime-universal}$ if it represents all primes. Recently, Doyle and Williams in [2] classified all prime-universal diagonal ternary quadratic forms, and all…
We consider a randomised version of Kleene's realisability interpretation of intuitionistic arithmetic in which computability is replaced with randomised computability with positive probability. In particular, we show that (i) the set of…
We study the decidability of the Skolem Problem, the Positivity Problem, and the Ultimate Positivity Problem for linear recurrences with real number initial values and real number coefficients in the bit-model of real computation. We show…
In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…
We consider the problem of determining whether a given prime p is a congruent number. We present an easily computed criterion that allows us to conclude that certain primes for which congruency was previously undecided, are in fact not…
Natural numbers can be divided in two non-overlapping infinite sets, primes and composites, with composites factorizing into primes. Despite their apparent simplicity, the elucidation of the architecture of natural numbers with primes as…