Index sets for classes of high rank structures

DOI10.2178/JSL/1203350796zbMath1145.03021OpenAlexW2017105773MaRDI QIDQ5444710

Ekaterina B. Fokina, V. G. Puzarenko, Wesley Calvert, Oleg V. Kudinov, Julia F. Knight, Sergei S. Goncharov, Andrey S. Morozov

Publication date: 25 February 2008

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.jsl/1203350796

zbMATH Keywords

computable structuresindex setsScott rankKlenee's \({\mathcal O}\)

Mathematics Subject Classification ID

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

Related Items (7)

AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS ⋮ Rice’s Theorem in Effectively Enumerable Topological Spaces ⋮ There is no classification of the decidably presentable structures ⋮ Computable numberings of the class of Boolean algebras with distinguished endomorphisms ⋮ Computable elements and functions in effectively enumerable topological spaces ⋮ AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES ⋮ On Σ¹ ₁ equivalence relations over the natural numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Pairs of recursive structures
• Computable structures and the hyperarithmetical hierarchy
• Index sets of computable structures
• Scott sentences and admissible sets
• On the complexity of categoricity in computable structures

This page was built for publication: Index sets for classes of high rank structures