Related papers: Effective Prime Uniqueness
Motivated by bubble nucleation in first order phase transitions, we question the validity of the effective potential for inhomogeneous configurations. In an attempt to get some insight into the importance of derivative terms, we analyze a…
The \emph{Entscheidungsproblem}, or the classical decision problem, asks whether a given formula of first-order logic is satisfiable. In this work, we consider an extension of this problem to regular first-order \emph{theories}, i.e.,…
Undoing computations of a concurrent system is beneficial in many situations, e.g., in reversible debugging of multi-threaded programs and in recovery from errors due to optimistic execution in parallel discrete event simulation. A number…
On a finite structure, the polymorphism invariant relations are exactly the primitively positively definable relations. On infinite structures, these two sets of relations are different in general. Infinitary primitively positively…
Let $n$ be a positive integer, and let $R$ be a (possibly infinite dimensional) finitely presented algebra over a computable field of characteristic zero. We describe an algorithm for deciding (in principle) whether $R$ has at most finitely…
In this note, we use integral binary cubic forms to study the rational cube sum problem. We prove (unconditionally) that for any positive integer $d$, infinitely many primes in each of the residue classes $ 1 \pmod {9d}$ as well as $ -1…
A relationship between nilpotency and primeness in a module is investigated. Reduced modules are expressed as sums of prime modules. It is shown that presence of nilpotent module elements inhibits a module from possessing good structural…
We use high girth, high chromatic number hypergraphs to show that there are finite models of the equational theory of the semiring of nonnegative integers whose equational theory has no finite axiomatisation, and show this also holds if…
This article presents a formal model demonstrating that genuine autonomy, the ability of a system to self-regulate and pursue objectives, fundamentally implies computational unpredictability from an external perspective. we establish…
It is well-known that a Hilbert-style deduction system for first-order classical logic is sound and complete for a model theory built using all Boolean algebras as truth-value algebras if and only if it is sound and complete for a model…
In the same sense as classical logic is a formal theory of truth, the recently initiated approach called computability logic is a formal theory of computability. It understands (interactive) computational problems as games played by a…
We give two examples of categorical axioms asserting that a canonically defined natural transformation is invertible where the invertibility of any natural transformation implies that the canonical one is invertible. The first example is…
This work is meant to be a step towards the formal definition of the notion of algorithm, in the sense of an equivalence class of programs working "in a similar way". But instead of defining equivalence transformations directly on programs,…
In this paper we consider the set of mu-types, an extension of the set of simple types freely generated from a set of atomic types and the type constructor ->, by a new operator mu, to explicitly denote solutions of recursive equations like…
Experimental science usually relies on laboratory procedures that, after finitely many steps, terminate with numerical reports on physical quantities. This paper argues that such procedures can be understood as algorithmic once the…
Large series of prime numbers can be superposed on a single quantum register and then analyzed in full parallelism. The construction of this Prime state is efficient, as it hinges on the use of a quantum version of any efficient primality…
We prove that for a given deterministic top-down transducer with look-ahead it is decidable whether or not its translation is definable (1)~by a linear top-down tree transducer or (2)~by a tree homomorphism. We present algorithms that…
Evidently, physical experiments are practically reproducible even though the fully identical preparation of initial state wave functions is often far beyond experimental possibilities. It is thus natural to explore if and in which sense…
We axiomatize and generalize Markov's approach to the continuity problem for Type 1 computable functions, i.e. the problem of finding sufficient conditions on a computable topological space to obtain a theorem of the form "computable…
We show that including degrees of a particular kind of provability in the search target for any theorem-prover in sufficiently powerful formal systems over finite-sized statements preserves well-definition and a sufficient consistency while…