On functors enumerating structures

DOI10.17377/semi.2017.14.059zbMath1423.03128arXiv1706.05939MaRDI QIDQ2403649

Dino Rossegger

Publication date: 11 September 2017

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1706.05939

zbMATH Keywords

computable structurescomputable structure theoryenumeration reducibilityenumerable functor

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (3)

On functors enumerating structures ⋮ Computable embeddings for pairs of linear orders ⋮ Positive enumerable functors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relations between algorithmic reducibilities of algebraic systems
• Generic copies of countable structures
• Degree spectra and computable dimensions in algebraic structures
• On functors enumerating structures
• Turing Computability
• Rice sequences of relations
• Enumeration Reducibility and Computable Structure Theory
• Degrees of presentability of structures. I
• Degrees of presentability of structures. II
• Σ-Definability of countable structures over real numbers, complex numbers, and quaternions
• A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS
• BOREL FUNCTORS AND INFINITARY INTERPRETATIONS
• Turing computable embeddings
• Comparing Classes of Finite Structures
• COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY
• Effective model theory vs. recursive model theory

This page was built for publication: On functors enumerating structures