Related papers: Cohesive Powers of Structures
We extend the classical Feferman-Vaught theorem to logic for metric structures. This implies that the reduced powers of elementarily equivalent structures are elementarily equivalent, and therefore they are isomorphic under the Continuum…
The deterministic quantum computing with one qubit (DQC1) is a mixed-state quantum computation algorithm that evaluates the normalized trace of a unitary matrix and is more powerful than the classical counterpart. We find that the…
Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and…
CZF is a system of set theory which, over classical logic, is equivalent to ZF, while over intuitionistic logic, it has a well-known constructive type-theoretic interpretation. This article introduces a simpler, intuitive family of…
We present a novel, perspicuous framework for building iterated ultrapowers. Furthermore, our framework naturally lends itself to the construction of a certain type of order indiscernibles, here dubbed tight indiscernibles, which are shown…
We continue the investigation of analytic spaces from the perspective of computable structure theory. We show that if $p \geq 1$ is a computable real, and if $\Omega$ is a nonzero, non-atomic, and separable measure space, then every…
Commability is the finest equivalence relation between locally compact groups such that $G$ and $H$ are equivalent whenever there is a continuous proper homomorphism $G \to H$ with cocompact image. Answering a question of Cornulier, we show…
Path integrals represent a powerful route to quantization: they calculate probabilities by summing over classical configurations of variables such as fields, assigning each configuration a phase equal to the action of that configuration.…
We characterize the strong metric dimension of the power graph of a finite group. As applications, we compute the strong metric dimension of the power graph of a cyclic group, an abelian group, a dihedral group or a generalized quaternion…
The quantal algebra combines classical and quantum mechanics into an abstract structurally unified structure. The structure uses two products: one symmetric and one anti-symmetric. The local structure of spacetime is contained in the…
We argue that computation is an abstract algebraic concept, and a computer is a result of a morphism (a structure preserving map) from a finite universal semigroup.
The correspondence between the integrability of classical mechanical systems and their quantum counterparts is not a 1-1, although some close correspondencies exist. If a classical mechanical system is integrable with invariants that are…
The present note considers a certain family of sums indexed by the set of fixed length compositions of a given number. The sums in question cannot be realized as weighted compositions. However they can be be related to the hypergeometric…
An uninterpreted program (UP) is a program whose semantics is defined over the theory of uninterpreted functions. This is a common abstraction used in equivalence checking, compiler optimization, and program verification. While simple, the…
Quantum contextuality is a source of quantum computational power and a theoretical delimiter between classical and quantum structures. It has been substantiated by numerous experiments and prompted generation of state independent contextual…
We regard Forcing Notions P adding real numbers and the algebras of P-measurable sets. As for Cohen- and Random-Forcing we can show that each analytic set is P-measurable using Solovay's Unfolding Trick for infinite games. To show this we…
An \emph{automorphic loop} (or \emph{A-loop}) is a loop whose inner mappings are automorphisms. Every element of a commutative A-loop generates a group, and $(xy)^{-1} = x^{-1}y^{-1}$ holds. Let $Q$ be a finite commutative A-loop and $p$ a…
We construct a fully faithful functor from the category of graphs to the category of fields. Using this functor, we resolve a longstanding open problem in computable model theory, by showing that for every nontrivial countable structure S,…
A quotient construction defines an abstract type from a concrete type, using an equivalence relation to identify elements of the concrete type that are to be regarded as indistinguishable. The elements of a quotient type are…
The paper puts into discussion the concept of universality, in particular for structures not of the power of Turing computability. The question arises if for such structures a universal structure of the same kind exists or not. For that the…