Categoricity spectra for polymodal algebras

DOI10.1007/S11225-016-9667-YzbMATH Open1417.03233OpenAlexW2301374258MaRDI QIDQ514501FDOQ514501

Nikolay Bazhenov

Publication date: 2 March 2017

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11225-016-9667-y

Recommendations

• Computable isomorphisms of Boolean algebras with operators
• Algebraic polymodal logic: a survey
• Complexity of the universal theory of modal algebras
• A categorical approach to polyadic algebras
• Categoricity for primitive recursive and polynomial Boolean algebras

zbMATH Keywords

Turing computable embeddingcategoricity spectrumautostability spectrumBoolean algebra with operatorsdegree spectrumpolymodal algebra

Mathematics Subject Classification ID

Categoricity and completeness of theories (03C35) Computable structure theory, computable model theory (03C57) Other Turing degree structures (03D28) Theory of numerations, effectively presented structures (03D45) Boolean algebras with additional operations (diagonalizable algebras, etc.) (06E25)

Cites Work

• Title not available (Why is that?)
• Autostability of models
• Computable structures and the hyperarithmetical hierarchy
• A Borel reductibility theory for classes of countable structures
• \(d\)-computable categoricity for algebraic fields
• Turing computable embeddings
• Comparing Classes of Finite Structures
• Title not available (Why is that?)
• Limitwise monotonic sequences and degree spectra of structures
• CONSTRUCTIVE ALGEBRAS I
• Degrees of categoricity and the hyperarithmetic hierarchy
• Degrees of categoricity of computable structures
• Effective procedures in field theory
• Constructivizability of the Boolean algebra \( \mathfrak{B}( \omega ) \) with a distinguished automorphism
• Algebraic polymodal logic: a survey
• Degrees of autostability relative to strong constructivizations
• Title not available (Why is that?)
• The complexity of computable categoricity
• Degree spectra and computable dimensions in algebraic structures
• Degrees coded in jumps of orderings
• Index sets of autostable relative to strong constructivizations constructive models for familiar classes
• Using computability to measure complexity of algebraic structures and classes of structures
• Autostability spectra for Boolean algebras
• A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS
• 2-Computably Enumerable Degrees of Categoricity for Boolean Algebras with Distinguished Automorphisms
• The theory of projective planes is complete with respect to degree spectra and effective dimensions
• Computable isomorphisms of Boolean algebras with operators

Cited In (5)

• On the effective universality of mereological theories
• HKSS-completeness of modal algebras
• Computable Heyting algebras with distinguished atoms and coatoms
• Categoricity spectra of computable structures
• Effective categoricity for distributive lattices and Heyting algebras

This page was built for publication: Categoricity spectra for polymodal algebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q514501)