Charles F. D. McCoy

According to our database, Charles F. D. McCoy authored at least 11 papers between 2002 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2022

On the isomorphism problem for some classes of computable algebraic structures.

Valentina S. Harizanov, Steffen Lempp, Charles F. D. McCoy, Andrei S. Morozov, Reed Solomon

Arch. Math. Log., 2022

2018

Strong jump inversion.

Wesley Calvert, Andrey N. Frolov, Valentina S. Harizanov, Julia F. Knight, Charles F. D. McCoy, Alexandra A. Soskova, Stefan V. Vatev

J. Log. Comput., 2018

2014

Index sets and Scott sentences.

Julia F. Knight, Charles F. D. McCoy

Arch. Math. Log., 2014

2013

The Arithmetical Hierarchy in the Setting of ω₁.

Jacob Carson, Jesse Johnson, Julia F. Knight, Karen M. Lange, Charles F. D. McCoy, John Wallbaum

Comput., 2013

2012

Isomorphism relations on computable structures.

Ekaterina B. Fokina, Sy-David Friedman, Valentina S. Harizanov, Julia F. Knight, Charles F. D. McCoy, Antonio Montalbán

J. Symb. Log., 2012

2005

Computable categoricity of trees of finite height.

Steffen Lempp, Charles F. D. McCoy, Russell G. Miller, Reed Solomon

J. Symb. Log., 2005

Enumerations in computable structure theory.

Sergei S. Goncharov, Valentina S. Harizanov, Julia F. Knight, Charles F. D. McCoy, Russell G. Miller, Reed Solomon

Ann. Pure Appl. Log., 2005

2003

Delta₂⁰ - categoricity in Boolean algebras and linear orderings.

Charles F. D. McCoy

Ann. Pure Appl. Log., 2003

Simple and immune relations on countable structures.

Sergei S. Goncharov, Valentina S. Harizanov, Julia F. Knight, Charles F. D. McCoy

Arch. Math. Log., 2003

2002

Group Theoretic Properties of the Group of Computable Automorphisms of a Countable Dense Linear Order.

Steffen Lempp, Charles F. D. McCoy, Andrei S. Morozov, Reed Solomon

Order, 2002

Finite computable dimension does not relativize.

Charles F. D. McCoy

Arch. Math. Log., 2002