Sciweavers

Share
NDJFL
2010
8 years 10 months ago
Embeddings of Computable Structures
We study what the existence of a classical embedding between computable structures implies about the existence of computable embeddings. In particular, we consider the effect of fi...
Asher M. Kach, Oscar Levin, Reed Solomon
NDJFL
2010
8 years 10 months ago
Subclasses of the Weakly Random Reals
The weakly random reals contain not only the Schnorr random reals as a subclass but also the weakly 1-generic reals and therefore the n-generic reals for every n. While the class o...
Johanna N. Y. Franklin
NDJFL
2010
8 years 10 months ago
An Extension of van Lambalgen's Theorem to Infinitely Many Relative 1-Random Reals
Van Lambalgen's Theorem plays an important role in algorithmic randomness, especially when studying relative randomness. In this paper we extend van Lambalgen's Theorem ...
Kenshi Miyabe
NDJFL
2010
8 years 10 months ago
A Natural Model of the Multiverse Axioms
Victoria Gitman, Joel David Hamkins
NDJFL
2010
8 years 10 months ago
Decidability and Computability of Certain Torsion-Free Abelian Groups
We study completely decomposable torsion-free abelian groups of the form GS := nSQpn for sets S . We show that GS has a decidable copy if and only if S is 0 2 and has a computable...
Rodney G. Downey, Sergei S. Goncharov, Asher M. Ka...
NDJFL
2010
8 years 10 months ago
Polyadic Quantification via Denoting Concepts
The question of the origin of polyadic expressivity is explored and the results are brought to bear on Bertrand Russell's 1903 theory of denoting concepts, which is the main o...
Ori Simchen
NDJFL
2010
8 years 10 months ago
Numerical Abstraction via the Frege Quantifier
l Abstraction via the Frege Quantifier G. Aldo Antonelli Abstract This paper presents a formalization of first-order aritharacterizing the natural numbers as abstracta of the equin...
Gian Aldo Antonelli
books