Computable Heyting algebras with distinguished atoms and coatoms

DOI10.1007/S10849-022-09371-0MaRDI QIDQ6117138FDOQ6117138

Nikolay Bazhenov

Publication date: 16 August 2023

Published in: Journal of Logic, Language and Information (Search for Journal in Brave)

zbMATH Keywords

computable categoricitycomputable structureHeyting algebradegree spectrum

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Autostability of models
• Computable structures and the hyperarithmetical hierarchy
• The computable dimension of ordered abelian groups
• Recursively Categorical Linear Orderings
• CONSTRUCTIVE ALGEBRAS I
• Problem of the number of non-self-equivalent constructivizations
• Effective procedures in field theory
• Recursive isomorphism types of recursive Boolean algebras
• Turing Computability
• Computable Boolean algebras
• The complexity of computable categoricity
• Degree spectra and computable dimensions in algebraic structures
• Degrees coded in jumps of orderings
• Boolean algebras, Stone spaces, and the iterated Turing jump
• Degrees of Structures
• Turing's legacy. Developments from Turing's ideas in logic
• A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS
• Categoricity spectra for polymodal algebras
• Computable isomorphisms of Boolean algebras with operators
• Recursive Boolean algebras with recursive atoms
• Theorie Der Numerierungen III
• Computably categorical Boolean algebras enriched by ideals and atoms
• Categoricity spectra of computable structures
• The computable dimension of trees of infinite height
• Degree spectra of structures
• Strength and Weakness in Computable Structure Theory
• Heyting algebras. Duality theory. Translated from the Russian by A. Evseev
• Effective categoricity for distributive lattices and Heyting algebras
• Freely generated projective planes with finite computable dimension
• Computable Contact Algebras
• On the triple jump of the set of atoms of a Boolean algebra

Cited In (1)

• Computing coproducts of finitely presented Gödel algebras

This page was built for publication: Computable Heyting algebras with distinguished atoms and coatoms

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