Index sets of autostable relative to strong constructivizations constructive models for familiar classes

DOI10.1134/S106456241505004XzbMath1382.03060MaRDI QIDQ906085

Margaret I. Marchuk, Nikolay Bazhenov, Sergei S. Goncharov

Publication date: 29 January 2016

Published in: Doklady Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items (6)

The index set of the groups autostable relative to strong constructivizations ⋮ \(\prod_1^1\)-completeness of the computable categoricity problem for projective planes ⋮ Index set of structures with two equivalence relations that are autostable relative to strong constructivizations ⋮ On decidable categoricity and almost prime models ⋮ Categoricity spectra for polymodal algebras ⋮ Categoricity spectra of computable structures

Cites Work

• The complexity of computable categoricity
• Pairs of recursive structures
• Problem of the number of non-self-equivalent constructivizations
• Computable structures and the hyperarithmetical hierarchy
• Degrees of categoricity for superatomic Boolean algebras
• Mathematical Problems from Applied Logic II
• Index Sets of Constructive Models that are Autostable Under Strong Constructivizations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Index sets of autostable relative to strong constructivizations constructive models for familiar classes