Dino Rossegger

Available identifiers

Publication	Date of Publication	Type
Degrees of categoricity and treeable degrees	2024-12-06	Paper
Scott sentence complexities of linear orderings	2023-05-11	Paper
DEGREE SPECTRA OF ANALYTIC COMPLETE EQUIVALENCE RELATIONS	2022-11-18	Paper
Degrees of categoricity and treeable degrees	2022-09-09	Paper
The structural complexity of models of arithmetic	2022-08-02	Paper
Relations enumerable from positive information	2022-06-02	Paper
Positive enumerable functors	2022-03-22	Paper
On bi-embeddable categoricity of algebraic structures	2022-01-18	Paper
Degrees of bi-embeddable categoricity	2021-06-25	Paper
THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS	2021-03-19	Paper
Positive enumerable functors	2020-11-28	Paper
Degree spectra of analytic complete equivalence relations	2020-10-01	Paper
Bi‐embeddability spectra and bases of spectra	2020-05-06	Paper
Measuring the complexity of reductions between equivalence relations	2020-01-17	Paper
Degrees of bi-embeddable categoricity of equivalence structures	2019-07-04	Paper
Computable bi-embeddable categoricity	2019-03-13	Paper
Elementary bi-embeddability spectra of structures	2018-09-06	Paper
Bi-embeddability spectra and bases of spectra	2018-08-16	Paper
On functors enumerating structures	2017-09-11	Paper
A Lopez-Escobar Theorem for Continuous Domains	N/A	Paper
Learning Families of Algebraic Structures from Text	N/A	Paper
The Borel complexity of the class of models of first-order theories	N/A	Paper
Learning Equivalence Relations on Polish Spaces	N/A	Paper

This page was built for person: Dino Rossegger