Crossref Citations
This Book has been
cited by the following publications. This list is generated based on data provided by Crossref.
2021.
Computable Structure Theory.
p.
97.
2021.
Computable Structure Theory.
p.
187.
2021.
Computable Structure Theory.
p.
137.
2021.
Computable Structure Theory.
p.
75.
2021.
Computable Structure Theory.
p.
ix.
2021.
Computable Structure Theory.
p.
149.
2021.
Computable Structure Theory.
p.
115.
2021.
Computable Structure Theory.
p.
11.
2021.
Computable Structure Theory.
p.
51.
2021.
Computable Structure Theory.
p.
177.
2021.
Computable Structure Theory.
p.
1.
2021.
Computable Structure Theory.
p.
63.
2021.
Computable Structure Theory.
p.
33.
Montalbán, Antonio
2021.
Computable Structure Theory.
ALVIR, RACHAEL
CALVERT, WESLEY
GOODMAN, GRANT
HARIZANOV, VALENTINA
KNIGHT, JULIA
MILLER, RUSSELL
MOROZOV, ANDREY
SOSKOVA, ALEXANDRA
and
WEISSHAAR, ROSE
2022.
INTERPRETING A FIELD IN ITS HEISENBERG GROUP.
The Journal of Symbolic Logic,
Vol. 87,
Issue. 3,
p.
1215.
HARRISON-TRAINOR, MATTHEW
2022.
AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS.
The Bulletin of Symbolic Logic,
Vol. 28,
Issue. 1,
p.
71.
Morozov, A. S.
Puzarenko, V. G.
and
Faizrachmanov, M. Kh.
2023.
Families of Permutations and Ideals of Turing Degrees.
Algebra and Logic,
Vol. 61,
Issue. 6,
p.
481.
Grochow, Joshua A.
2023.
Polynomial-Time Axioms of Choice and Polynomial-Time Cardinality.
Theory of Computing Systems,
Vol. 67,
Issue. 3,
p.
627.
Dorzhieva, Marina
Melnikov, Alexander
Bazhenov, Nikolay
Kihara, Takayuki
and
Selivanova, Svetlana
2023.
Punctually presented structures I: Closure theorems.
Computability,
Vol. 12,
Issue. 4,
p.
323.
MONTALBÁN, ANTONIO
and
ROSSEGGER, DINO
2023.
THE STRUCTURAL COMPLEXITY OF MODELS OF ARITHMETIC.
The Journal of Symbolic Logic,
p.
1.