67 citations
- George Washington UniversityUS4 papers
- Sobolev Institute of MathematicsRU2 papers
- University of FloridaUS2 papers
- University of Notre DameUS2 papers
- University of OregonUS2 papers
- City College of New YorkUS1 paper
- Columbia UniversityUS1 paper
- Cornell UniversityUS1 paper
- East Carolina UniversityUS1 paper
- Indiana University HealthUS1 paper
- Indiana University – Purdue University IndianapolisUS1 paper
- Piedmont International UniversityUS1 paper
4 papers · 2 filters
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 $…
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…
Classification from a Computable Viewpoint
Wesley Calvert, Julia F. Knight
Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important…