Related papers: Effective Prime Uniqueness
This survey paper examines the effective model theory obtained with the BSS model of real number computation. It treats the following topics: computable ordinals, satisfaction of computable infinitary formulas, forcing as a construction…
This article is a fundamental study in computable analysis. In the framework of Type-2 effectivity, TTE, we investigate computability aspects on finite and infinite products of effective topological spaces. For obtaining uniform results we…
The algebras considered in this paper are commutative rings of which the additive group is a finite-dimensional vector space over the field of rational numbers. We present deterministic polynomial-time algorithms that, given such an…
Classical evaluations of configurations of intertwined quantum contexts induce relations, such as true-implies-false, true-implies-true, but also nonseparability among the input and output terminals. When combined, these exploitable…
Propositional temporal logic over the real number time flow is finitely axiomatisable, but its first-order counterpart is not recursively axiomatisable. We study the logic that combines the propositional axiomatisation with the usual axioms…
We recast Euclid's proof of the infinitude of prime numbers as a Euclidean Criterion for a domain to have infinitely many atoms. We make connections with Furstenberg's "topological" proof of the infinitude of prime numbers and show that our…
We prove the following propositions. Theorem 1: Let $M$ be a subfield of a fixed algebraic closure $\tilde \Q$ of $\Q$ whose existential elementary theory is decidable (resp. primitively decidable). Then, M is conjugate to a recursive…
We show that every strongly jump-traceable set obeys every benign cost function. Moreover, we show that every strongly jump-traceable set is computable from a computably enumerable strongly jump-traceable set. This allows us to generalise…
Our main result is the equivalence of two notions of reducibility between structures. One is a syntactical notion which is an effective version of interpretability as in model theory, and the other one is a computational notion which is a…
In the monograph arXiv:2108.03453, we define the notion of a unipotent representation of a complex reductive group. The representations we define include, as a proper subset, all special unipotent representations in the sense of…
The question whether indeterminism in quantum measurement outcomes is fundamental or is there a possibility of constructing a finer theory underlying quantum mechanics that allows no such indeterminism, has been debated for a long time. We…
We indicate a way of distinguishing between structures, for which, we call two structures distinguishable. Roughly, being distinguishable means that they differ in the number of realizations each gives for some formula. Being…
By operations on models we show how to relate completeness with respect to permissive-nominal models to completeness with respect to nominal models with finite support. Models with finite support are a special case of permissive-nominal…
A group is called capable if it is a central factor group. We consider the capability of finite groups of class two and exponent $p$, $p$ an odd prime. We restate the problem of capability as a problem about linear transformations, which…
In this work we show that the prime distribution is deterministic. Indeed the set of prime numbers P can be expressed in terms of two subsets of N using three specific selection rules, acting on two sets of prime candidates. The prime…
Predictions for measurement outcomes in physical theories are usually computed by combining two distinct notions: a state, describing the physical system, and an observable, describing the measurement which is performed. In quantum theory,…
In this vision paper, we explore the challenges and opportunities of a form of computation that employs an empirical (rather than a formal) approach, where the solution of a computational problem is returned as empirically most likely…
The mathematical rules used to handle systems of identical quantum particles bring into question whether the elementary constituents of matter, such as electrons, have the fundamental characteristics of persistence and reidentifiability…
We prove the following theorems: Theorem 1: For any E-field with cyclic kernel, in particular $\mathbb C$ or the Zilber fields, all real abelian algebraic numbers are pointwise definable. Theorem 2: For the Zilber fields, the only pointwise…
We discuss the isomorphism problem of projective schemes; given two projective schemes, can we algorithmically decide whether they are isomorphic? We give affirmative answers in the case of one-dimensional projective schemes, the case of…