Nikolay Bazhenov

Arch. Math. Log., May, 2024

Primitive recursive reverse mathematics.

[BibT_eX]

[DOI]

Marta Fiori-Carones

Lu Liu

Ann. Pure Appl. Log., January, 2024

2023

Computable Stone spaces.

[BibT_eX]

[DOI]

Matthew Harrison-Trainor

Ann. Pure Appl. Log., October, 2023

Learning algebraic structures with the help of Borel equivalence relations.

[BibT_eX]

[DOI]

Vittorio Cipriani

Theor. Comput. Sci., March, 2023

Computable Heyting Algebras with Distinguished Atoms and Coatoms.

[BibT_eX]

[DOI]

J. Log. Lang. Inf., March, 2023

On the main scientific achievements of Victor Selivanov.

[BibT_eX]

[DOI]

Comput., 2023

Preface.

[BibT_eX]

[DOI]

Takayuki Kihara

Svetlana Selivanova

Comput., 2023

Complexity of Σ<sup>0</sup><sub>n</sub>-classifications for definable subsets.

[BibT_eX]

[DOI]

Svetlana Aleksandrova

Maxim V. Zubkov

Arch. Math. Log., 2023

Degree Spectra, and Relative Acceptability of Notations.

[BibT_eX]

[DOI]

Dariusz Kalocinski

Proceedings of the 31st EACSL Annual Conference on Computer Science Logic, 2023

2022

Rogers semilattices of punctual numberings.

[BibT_eX]

[DOI]

Sergei Ospichev

Math. Struct. Comput. Sci., 2022

On the effective universality of mereological theories.

[BibT_eX]

[DOI]

Hsing-chien Tsai

Math. Log. Q., 2022

Rogers semilattices of limitwise monotonic numberings.

[BibT_eX]

[DOI]

Zhansaya Tleuliyeva

Math. Log. Q., 2022

Relatively acceptable notation.

[BibT_eX]

[DOI]

Dariusz Kalocinski

CoRR, 2022

Primitive recursive equivalence relations and their primitive recursive complexity.

[BibT_eX]

[DOI]

Comput., 2022

On bi-embeddable categoricity of algebraic structures.

[BibT_eX]

[DOI]

Dino Rossegger

Maxim V. Zubkov

Ann. Pure Appl. Log., 2022

On Two Types of Concept Lattices in the Theory of Numberings.

[BibT_eX]

[DOI]

Anvar M. Nurakunov

Proceedings of the Theory and Applications of Models of Computation, 2022

Intrinsic Complexity of Recursive Functions on Natural Numbers with Standard Order.

[BibT_eX]

[DOI]

Dariusz Kalocinski

Michal Wroclawski

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Well-Orders Realized by C.E. Equivalence Relations.

[BibT_eX]

[DOI]

Maxim V. Zubkov

Proceedings of the Revolutions and Revelations in Computability, 2022

Calculating the Mind Change Complexity of Learning Algebraic Structures.

[BibT_eX]

[DOI]

Vittorio Cipriani

Proceedings of the Revolutions and Revelations in Computability, 2022

2021

On the Turing complexity of learning finite families of algebraic structures.

[BibT_eX]

[DOI]

J. Log. Comput., 2021

Degrees of bi-embeddable categoricity.

[BibT_eX]

[DOI]

Comput., 2021

Approximating Approximate Reasoning: Fuzzy Sets and the Ershov Hierarchy.

[BibT_eX]

[DOI]

Proceedings of the Logic, Rationality, and Interaction - 8th International Workshop, 2021

2020

Online presentations of finitely generated structures.

[BibT_eX]

[DOI]

Keng Meng Ng

Theor. Comput. Sci., 2020

Decompositions of decidable abelian groups.

[BibT_eX]

[DOI]

Sergey Goncharov

Int. J. Algebra Comput., 2020

Learning families of algebraic structures from informant.

[BibT_eX]

[DOI]

Ekaterina B. Fokina

Inf. Comput., 2020

Classifying equivalence relations in the Ershov hierarchy.

[BibT_eX]

[DOI]

Arch. Math. Log., 2020

Semilattices of Punctual Numberings.

[BibT_eX]

[DOI]

Sergei Ospichev

Proceedings of the Theory and Applications of Models of Computation, 2020

Definable Subsets of Polynomial-Time Algebraic Structures.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2020

A Note on Computable Embeddings for Ordinals and Their Reverses.

[BibT_eX]

[DOI]

Stefan V. Vatev

Proceedings of the Beyond the Horizon of Computability, 2020

2019

Automatic and Polynomial-Time Algebraic Structures.

[BibT_eX]

[DOI]

Matthew Harrison-Trainor

Keng Meng Ng

J. Symb. Log., 2019

Computable Contact Algebras.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2019

Foundations of Online Structure Theory.

[BibT_eX]

[DOI]

Rod Downey

Bull. Symb. Log., 2019

Elementary theories and hereditary undecidability for semilattices of numberings.

[BibT_eX]

[DOI]

Arch. Math. Log., 2019

Degrees of bi-embeddable categoricity of equivalence structures.

[BibT_eX]

[DOI]

Arch. Math. Log., 2019

Computable Isomorphisms of Distributive Lattices.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2019

Bounded Reducibility for Computable Numberings.

[BibT_eX]

[DOI]

Sergei Ospichev

Proceedings of the Computing with Foresight and Industry, 2019

Effective Embeddings for Pairs of Structures.

[BibT_eX]

[DOI]

Hristo Ganchev

Stefan V. Vatev

Proceedings of the Computing with Foresight and Industry, 2019

2018

Autostability spectra for decidable structures.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2018

Degrees of Categoricity and spectral Dimension.

[BibT_eX]

[DOI]

J. Symb. Log., 2018

Degrees of Categoricity for Prime and Homogeneous Models.

[BibT_eX]

[DOI]

Margarita Marchuk

Proceedings of the Sailing Routes in the World of Computation, 2018

2017

A Note on Effective Categoricity for Linear Orderings.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2017

Degrees of Categoricity of Rigid Structures.

[BibT_eX]

[DOI]

Proceedings of the Unveiling Dynamics and Complexity, 2017

Turing Computable Embeddings, Computable Infinitary Equivalence, and Linear Orders.

[BibT_eX]

[DOI]

Proceedings of the Unveiling Dynamics and Complexity, 2017

2016

Categoricity Spectra for Polymodal Algebras.

[BibT_eX]

[DOI]

Stud Logica, 2016

2015

Prime Model with No Degree of Autostability Relative to Strong Constructivizations.

[BibT_eX]

[DOI]