Categoricity spectra for polymodal algebras
type: Item
instance of: scholarly article
title: Categoricity spectra for polymodal algebras
zbMATH Open document ID: 1417.03233
published in: Studia Logica
publication date: 2017-03-02T00:00:00Z
Mathematics Subject Classification ID: 03C57
Mathematics Subject Classification ID: 03C35
Mathematics Subject Classification ID: 03D45
Mathematics Subject Classification ID: 03D28
Mathematics Subject Classification ID: 06E25
zbMATH DE Number: 6690912
zbMATH Keywords: polymodal algebra
zbMATH Keywords: Boolean algebra with operators
zbMATH Keywords: categoricity spectrum
zbMATH Keywords: autostability spectrum
zbMATH Keywords: degree spectrum
zbMATH Keywords: Turing computable embedding
author: Nikolay Bazhenov
MaRDI profile type: Publication
full work available at URL: s11225-016-9667-y
OpenAlex ID: W2301374258
cites work: Computable structures and the hyperarithmetical hierarchy
cites work: 2-Computably Enumerable Degrees of Categoricity for Boolean Algebras with Distinguished Automorphisms
cites work: Autostability spectra for Boolean algebras
cites work: Constructivizability of the Boolean algebra \( \mathfrak{B}( \omega ) \) with a distinguished automorphism
cites work: Comparing Classes of Finite Structures
cites work: Degrees of categoricity and the hyperarithmetic hierarchy
cites work: The complexity of computable categoricity
cites work: Q4956005
cites work: Computable isomorphisms of Boolean algebras with operators
cites work: Degrees of categoricity of computable structures
cites work: A Borel reductibility theory for classes of countable structures
cites work: Effective procedures in field theory
cites work: Algebraic polymodal logic: a survey
cites work: Q4513969
cites work: Degrees of autostability relative to strong constructivizations
cites work: Index sets of autostable relative to strong constructivizations constructive models for familiar classes
cites work: Autostability of models
cites work: Degree spectra and computable dimensions in algebraic structures
cites work: Limitwise monotonic sequences and degree spectra of structures
cites work: Degrees coded in jumps of orderings
cites work: Using computability to measure complexity of algebraic structures and classes of structures
cites work: Turing computable embeddings
cites work: The theory of projective planes is complete with respect to degree spectra and effective dimensions
cites work: CONSTRUCTIVE ALGEBRAS I
cites work: Q5537372
cites work: d-computable categoricity for algebraic fields
cites work: A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS
DOI: 10.1007/S11225-016-9667-Y
description: scientific article; zbMATH DE number 6690912