Computable structure theory of partial combinatory algebras
EB Fokina, SA Terwijn - Conference on Computability in Europe, 2024 - Springer
Computable Structure Theory of Partial Combinatory Algebras | SpringerLink Skip to main
content Advertisement SpringerLink Account Menu Find a journal Publish with us Track your …
content Advertisement SpringerLink Account Menu Find a journal Publish with us Track your …
Classifying word problems of finitely generated algebras via computable reducibility
V Delle Rose, L San Mauro, A Sorbi - International Journal of …, 2023 - usiena-air.unisi.it
We contribute to a recent research program which aims at revisiting the study of the
complexity of word problems, a major area of research in combinatorial algebra, through the …
complexity of word problems, a major area of research in combinatorial algebra, through the …
Investigating the Computable Friedman–Stanley Jump
U Andrews, L San Mauro - The Journal of Symbolic Logic, 2024 - cambridge.org
INVESTIGATING THE COMPUTABLE FRIEDMAN–STANLEY JUMP Page 1 The Journal of
Symbolic Logic, Page 1 of 27 INVESTIGATING THE COMPUTABLE FRIEDMAN–STANLEY …
Symbolic Logic, Page 1 of 27 INVESTIGATING THE COMPUTABLE FRIEDMAN–STANLEY …
Classifying word problems of finitely generated algebras via computable reducibility
VD Rose, LS Mauro, A Sorbi - arXiv preprint arXiv:2305.11563, 2023 - arxiv.org
We contribute to a recent research program which aims at revisiting the study of the
complexity of word problems, a major area of research in combinatorial algebra, through the …
complexity of word problems, a major area of research in combinatorial algebra, through the …
Well-Orders Realized by CE Equivalence Relations
N Bazhenov, M Zubkov - Conference on Computability in Europe, 2022 - Springer
We study countable linear orders realized by computably enumerable equivalence relations
(ceers). A ceer E realizes a linear order L if there exists a computably enumerable binary …
(ceers). A ceer E realizes a linear order L if there exists a computably enumerable binary …
Effective inseparability and its applications
A Sorbi - Connecting with Computability: 17th Conference on …, 2021 - Springer
Effective Inseparability and Its Applications | SpringerLink Skip to main content
Advertisement SpringerLink Account Menu Find a journal Publish with us Track your …
Advertisement SpringerLink Account Menu Find a journal Publish with us Track your …
Contributions to ceers, logical depth, algorithmic randomness and their applications
V Delle Rose - 2022 - usiena-air.unisi.it
This thesis collects some contributions to different fields of computability theory and
algorithmic randomness. The first line of research, on which I have worked jointly with Luca …
algorithmic randomness. The first line of research, on which I have worked jointly with Luca …
[PDF][PDF] EFFECTIVE INSEPARABILITY AND POSITIVE STRUCTURES
A SORBI - math.nsc.ru
We examine the notion of effective inseparability, and how it has been recently exploited in
the study of positive structures, in particular positive lattices [2]. A positive lattice L is said to …
the study of positive structures, in particular positive lattices [2]. A positive lattice L is said to …