This is the project page of the project ACOSE  Algorithmic complexity of structural equivalence relations funded by a Marie Skłodowska Curie Global Fellowship under Horizon 2020 of the European Commission.
The goal of this project is to investigate the relationship between notions of complexity in computable structure theory and notions of complexity in descriptive set theory. The project consist of a two year outgoing phase at the University of California, Berkeley and a one year return phase at Technische Universität Wien.
Participants
 Principal Investigator: Dino Rossegger
 Supervision Outgoing phase: Antonio Montalbán
 Supervision Return phase: Ekaterina Fokina
Talks
 The Borel complexity of firstorder theories [ Slides  Video ]
Models of Peano Arithmetic seminar, City University of New York, 13.02.2024  The Borel complexity of firstorder theories [  Video ]
World Logic Day workshop, Nazarbayev University, 14.01.2024  Structural complexity notions for foundational theories [ Slides ]
Logic Seminar, Kurt Gödel Research Center, 09.11.2023  Structural complexity notions for foundational theories [ Slides ]
Pennstate Logic Seminar, 07.11.2023  Learning equivalence relations [ Slides ]
Online Logic Seminar, 19.10.2023  The strong degrees of categoricity above 0" [ Slides ]
Logic Seminar, University of Wisconsin at Madison, 18.04.2023  The strong degrees of categoricity above 0" [ Slides ]
Logic Seminar, University of Michigan at Ann Arbor, 12.04.2023  Pairs of Structures: Variations and Application [ Slides ]
Plenary Talk, ASL Annual Meeting 2023, UC Irvine, 28.03.2023  The strong degrees of categoricity above 0" [ Slides ]
Logic Seminar, Iowa State University, 01.03.2023  The Structural Complexity of Models of Arithmetic [ Slides ]
California State University, Northridge, 30.11.2022  Analytic complete equivalence relations and their degree spectra [ Slides ]
Caltech Logic Seminar, 02.11.2022  The degrees of categoricity above 0 double jump [ Slides ]
Logic Colloquium, University of California, Berkeley, 07.10.2022  The Structural Complexity of Models of Arithmetic [ Slides ]
ASL Logic Colloquium 2022, Reykjavik, Iceland, 01.07.2022  The Structural Complexity of Models of Arithmetic [ Slides  Video ]
Models of Peano Arithmetic seminar, City University of New York, 03.05.2022  The Structural Complexity of Models of Arithmetic [ Slides ]
Computability Special Session, ASL Annual Meeting at Cornell University 2022, 09.04.2022  New Examples of Degrees of Categoricity [ Slides  Video ]
Computability Theory and Applications, 02.11.2021
Publications
 A LopezEscobar Theorem for Continuous Domains
[ DOI
 arXiv
]
with Nikolay Bazhenov, Ekaterina Fokina, Alexandra Soskova, and Stefan Vatev
The Journal of Symbolic Logic (2024)  The Borel complexity of the class of models of firstorder theories
[ DOI
]
with Uri Andrews, David Gonzalez, Steffen Lempp, and Hongyu Zhu
submitted for publication (2024)  Learning Families of Algebraic Structures from Text
[ DOI
]
with Nikolay Bazhenov, Ekaterina Fokina, Alexandra Soskova, and Stefan Vatev
submitted for publication (2024)  Scott sentence complexities of linear orderings
[ DOI

arXiv
]
with David Gonzalez
submitted for publication (2023)  The structural complexity of models of arithmetic
[ DOI

arXiv
]
with Antonio Montalbán
The Journal of Symbolic Logic (2023)  Degrees of categoricity and treeable degrees
[ DOI
 arXiv
]
with Barbara F. Csima
Journal of Mathematical Logic (2023)  Relations enumerable from positive information
[ DOI

arXiv
]
with Barbara F. Csima, and Luke MacLean
submitted for publication (2022)  Degree spectra of analytic complete equivalence relations
[ DOI

arXiv
]
The Journal of Symbolic Logic vol. 87 (4) , 16631676 (2022)