Christopher James Eagle
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Christopher James Eagle has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Ilijas Farah
Department of Mathematics and Statistics, York University, 4700 Keele Street, North York, Ontario, Canada, M3J 1P3
4 shared publications - Timothy H. McNicholl
Iowa State University
4 shared publications - Alessandro Vignati
Institut de Mathématiques de Jussieu - Paris, Rive Gauche (IMJ-PRG), Université Paris Cité, Bâtiment Sophie Germain, 8 Place Aurélie Nemours, 75013 Paris, France
3 shared publications - Franklin D. Tall
University of Toronto
3 shared publications - Isaac Goldbring
University of California, Irvine
3 shared publications Alessandro Vignati
Department of Mathematics and Statistics, York University, 4700 Keele Street, Toronto, ON, Canada M3J 1P3
2 shared publications
Latest Publications
- Open Access
- 29 May 2026
- Published by Canadian Mathematical Society in Canadian Mathematical Bulletin
- p. 1-6
Non-computability of K-theory for computably presented C*-algebras
We give an example of a unital $\mathrm {C}^*$ normal upper C Superscript asterisk -algebra $\mathbf {A}$ bold upper A with a computable presentation and for which neither $K_0(\mathbf {A})$ upper K 0 left parenthesis bold upper A right parenthesis nor $K_1(\mathbf {A})$ upper K 1 left parenthesis bold upper A right parenthesis has a computable presentation.- 29 May 2026
- Published by Canadian Mathematical Society in Canadian Mathematical Bulletin
- p. 1-6
Open AccessNon-computability of K-theory for computably presented C*-algebras
We give an example of a unital $\mathrm {C}^*$ normal upper C Superscript asterisk -algebra $\mathbf {A}$ bold upper A with a computable presentation and for which neither $K_0(\mathbf {A})$ upper K 0 left parenthesis bold upper A right parenthesis nor $K_1(\mathbf {A})$ upper K 1 left parenthesis bold upper A right parenthesis has a computable presentation. - Open Access
Computable $K$-theory for C*-algebras II: AF algebras
We continue the study of the effective content of $K$-theory for C*-algebras, with a focus on AF algebras. We show that from a c.e. presentation of an AF algebra it is possible to compute a representation of the algebra as an inductive limit of finite-dimensional algebras. Using this, and an analogous result for dimension groups, we show that the computable $K_0$ functor provides a computable equivalence of categories between c.e. presentations of AF algebras and c.e. presentations of unital (scaled) dimension groups, giving an effective version of Elliott's classification theorem. We use our results to determine the complexity of the index set and isomorphism problems for various classes of AF algebras.Open AccessComputable $K$-theory for C*-algebras II: AF algebras
We continue the study of the effective content of $K$-theory for C*-algebras, with a focus on AF algebras. We show that from a c.e. presentation of an AF algebra it is possible to compute a representation of the algebra as an inductive limit of finite-dimensional algebras. Using this, and an analogous result for dimension groups, we show that the computable $K_0$ functor provides a computable equivalence of categories between c.e. presentations of AF algebras and c.e. presentations of unital (scaled) dimension groups, giving an effective version of Elliott's classification theorem. We use our results to determine the complexity of the index set and isomorphism problems for various classes of AF algebras. - Open Access
Computable $K$-theory for $\mathrm{C}^*$-algebras: UHF algebras
We initiate the study of the effective content of $K$-theory for $\mathrm{C}^*$-algebras. We prove that there are computable functors which associate, to a computably enumerable presentation of a $\mathrm{C}^*$-algebra $\boldA$, computably enumerable presentations of the abelian groups $K_0(\boldA)$ and $K_1(\boldA)$. When $\boldA$ is stably finite, we show that the positive cone of $K_0(\boldA)$ is computably enumerable. We strengthen the results in the case that $\boldA$ is a UHF algebra by showing that the aforementioned presentation of $K_0(\boldA)$ is actually computable. In the UHF case, we also show that $\boldA$ has a computable presentation precisely when $K_0(\boldA)$ has a computable presentation, which in turn is equivalent to the supernatural number of $\boldA$ being lower semicomputable; we give an example that shows that this latter equivalence cannot be improved to requiring that the supernatural number of $\boldA$ is computable. Finally, we prove that every UHF algebra is computably categorical.Open AccessComputable $K$-theory for $\mathrm{C}^*$-algebras: UHF algebras
We initiate the study of the effective content of $K$-theory for $\mathrm{C}^*$-algebras. We prove that there are computable functors which associate, to a computably enumerable presentation of a $\mathrm{C}^*$-algebra $\boldA$, computably enumerable presentations of the abelian groups $K_0(\boldA)$ and $K_1(\boldA)$. When $\boldA$ is stably finite, we show that the positive cone of $K_0(\boldA)$ is computably enumerable. We strengthen the results in the case that $\boldA$ is a UHF algebra by showing that the aforementioned presentation of $K_0(\boldA)$ is actually computable. In the UHF case, we also show that $\boldA$ has a computable presentation precisely when $K_0(\boldA)$ has a computable presentation, which in turn is equivalent to the supernatural number of $\boldA$ being lower semicomputable; we give an example that shows that this latter equivalence cannot be improved to requiring that the supernatural number of $\boldA$ is computable. Finally, we prove that every UHF algebra is computably categorical. - 18 October 2024
- Published by Springer Nature in Integral Equations and Operator Theory
- Vol. 96 (4) , 1-23
Relative Topological Principality and the Ideal Intersection Property for Groupoid C*-Algebras
- 18 October 2024
- Published by Springer Nature in Integral Equations and Operator Theory
- Vol. 96 (4) , 1-23
Relative Topological Principality and the Ideal Intersection Property for Groupoid C*-Algebras
- Open Access
Computable Gelfand Duality
We establish a computable version of Gelfand Duality. Under this computable duality, computably compact presentations of metrizable spaces uniformly effectively correspond to computable presentations of unital commutative $C^*$ algebras.Open AccessComputable Gelfand Duality
We establish a computable version of Gelfand Duality. Under this computable duality, computably compact presentations of metrizable spaces uniformly effectively correspond to computable presentations of unital commutative $C^*$ algebras. - Open Access
- 14 March 2024
- Published by Journal of Logic and Analysis in Journal of Logic and Analysis
- Vol. 16
K-theory of co-existentially closed continua
K-theory of co-existentially closed continua
- 14 March 2024
- Published by Journal of Logic and Analysis in Journal of Logic and Analysis
- Vol. 16
Open AccessK-theory of co-existentially closed continua
K-theory of co-existentially closed continua
- Open Access
$K$-theory of co-existentially closed continua
We describe the possible values of $K$-theory for $C(X)$ when $X$ is a co-existentially closed continuum. As a consequence we also show that all pseudo-solenoids, except perhaps the universal one, are not co-existentially closed.Open Access$K$-theory of co-existentially closed continua
We describe the possible values of $K$-theory for $C(X)$ when $X$ is a co-existentially closed continuum. As a consequence we also show that all pseudo-solenoids, except perhaps the universal one, are not co-existentially closed. - Open Access
An undecidable extension of Morley's theorem on the number of countable models
We show that Morley's theorem on the number of countable models of a countable first-order theory becomes an undecidable statement when extended to second-order logic. More generally, we calculate the number of equivalence classes of $\sigma$-projective equivalence relations in several models of set theory. Our methods include random and Cohen forcing, Woodin cardinals and Inner Model Theory.
Open AccessAn undecidable extension of Morley's theorem on the number of countable models
We show that Morley's theorem on the number of countable models of a countable first-order theory becomes an undecidable statement when extended to second-order logic. More generally, we calculate the number of equivalence classes of $\sigma$-projective equivalence relations in several models of set theory. Our methods include random and Cohen forcing, Woodin cardinals and Inner Model Theory.
- 4 July 2023
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 174 (9)
An undecidable extension of Morley's theorem on the number of countable models
- 4 July 2023
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 174 (9)
An undecidable extension of Morley's theorem on the number of countable models
- 12 December 2019
- Published by Wiley in Mathematical Logic Quarterly
- Vol. 65 (4) , 490-497
Concrete barriers to quantifier elimination in finite dimensional C*‐algebras
- 12 December 2019
- Published by Wiley in Mathematical Logic Quarterly
- Vol. 65 (4) , 490-497
Concrete barriers to quantifier elimination in finite dimensional C*‐algebras