Related papers: Effective Prime Uniqueness
We give several new examples of computable structures of high Scott rank. For earlier known computable structures of Scott rank $\omega_1^{CK}$, the computable infinitary theory is $\aleph_0$-categorical. Millar and Sacks asked whether this…
We combine several folklore observations to provide a working framework for iterating constructions which contradict the axiom of choice. We use this to define a model in which any kind of structural failure must fail with a proper class of…
For a countable, complete, first-order theory $T$, we study $At$, the class of atomic models of $T$. We develop an analogue of $U$-rank and prove two results. On one hand, if some tp(d/a) is not ranked, then there are $2^{\aleph_1}$…
A relatively new topic in computability theory is the study of notions of computation that are robust against mistakes on some kind of small set. However, despite the recent popularity of this topic relatively foundational questions about…
We generalize the classical definition of effectively closed subshift to finitely generated groups. We study classical stability properties of this class and then extend this notion by allowing the usage of an oracle to the word problem of…
Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree $\textbf{d}$ is the degree of categoricity of a computable structure $\mathcal{M}$ and is not the strong degree of categoricity of any computable…
Primes in the two complete associative normed division algebras C and H have affinities with structures seen in the standard model of particle physics. On the integers in the two algebras, there are two equivalence relations: a strong one,…
Many counterexamples are known in the class of small theories due to Goncharov and Millar. The prime model of a decidable small theory is not necessarily decidable. The saturated model of a hereditarily decidable small theory is not…
We investigate when a computable automorphism of a computable field can be effectively extended to a computable automorphism of its (computable) algebraic closure. We then apply our results and techniques to study effective embeddings of…
In computable topology, a represented space is called computably discrete if its equality predicate is semidecidable. While any such space is classically isomorphic to an initial segment of the natural numbers, the computable-isomorphism…
In modelling complex processes, the potential past data that influence future expectations are immense. Models that track all this data are not only computationally wasteful but also shed little light on what past data most influence the…
The phenomenological two-level atom is re-analysed using the methods of effective field theory. By presenting the Dicke-Jaynes-Cummings model in real space, an exact diagonalization is accomplished going beyond the rotating wave…
We show that for every finite set of prime numbers S, there are at most finitely many singular moduli that are S-units. The key new ingredient is that for every prime number p, singular moduli are p-adically disperse. We prove analogous…
For representation by partial functions in the signature with intersection, composition and antidomain, we show that a representation is meet complete if and only if it is join complete. We show that a representation is complete if and only…
Infamously, the finite and unrestricted implication problems for the classes of i) functional and inclusion dependencies together, and ii) embedded multivalued dependencies alone are each undecidable. Famously, the restriction of i) to…
Symmetries impose structure on the Hilbert space of a quantum mechanical model. The mathematical units of this structure are the irreducible representations of symmetry groups and I consider how they function as conceptual units of…
Associate a unique numerical sequence called the modular signature with each positive integer, using modular residues of each integer under the prime numbers, and distinguishing between the core seed primes and non-core seed primes used to…
Some results for two distinct but complementary exactly solvable algebraic models for pairing in atomic nuclei are presented: 1) binding energy predictions for isotopic chains of nuclei based on an extended pairing model that includes…
A set $X \subseteq 2^\omega$ with positive measure contains a perfect subset. We study such perfect subsets from the viewpoint of computability and prove that these sets can have weak computational strength. Then we connect the existence of…
Computational indistinguishability is a key property in cryptography and verification of security protocols. Current tools for proving it rely on cryptographic game transformations. We follow Bana and Comon's approach, axiomatizing what an…