9 citations · 19 across the 22 of their papers we have counts for
8 papers · 2 filters
Effective completeness for real computation
Wesley Calvert
The main result of this paper, as previously presented to arxiv, was incorrect. See the full text for details and for reference to the remaining results.
Metric Structures and Probabilistic Computation
Wesley Calvert
Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable m…
Effective categoricity of Abelian p-groups
W. Calvert, D. Cenzer, V. S. Harizanov +1
Let p be a fixed prime. An Abelian p-group is an Abelian group (not necessarily finitely generated) in which every element has for its order some power of p. The countable Abelian…
Effective categoricity of equivalence Structures
W. Calvert, D. Cenzer, V. S. Harizanov +1
An equivalence structure is a set with a single binary relation, satisfying sentences stating that the relation is an equivalence relation. A computable structure A is said to be $…
Structures in Familiar Classes Which Have Scott Rank
Wesley Calvert, Sergey S. Goncharov, Julia F. Knight
There are familiar examples of computable structures having various computable Scott ranks. There are also familiar structures, such as the Harrison ordering, which have Scott rank…
Index Sets of Computable Structures
Wesley Calvert, Valentina S. Harizanov, Julia F. Knight +1
The \emph{index set} of a computable structure is the set of indices for computable copies of . We determine the complexity of the index sets of various…