Computable Heyting algebras with distinguished atoms and coatoms
From MaRDI portal
Publication:6117138
DOI10.1007/s10849-022-09371-0MaRDI QIDQ6117138
Publication date: 16 August 2023
Published in: Journal of Logic, Language and Information (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of computable categoricity
- Categoricity spectra for polymodal algebras
- Computable isomorphisms of Boolean algebras with operators
- Computably categorical Boolean algebras enriched by ideals and atoms
- Autostability of models
- Problem of the number of non-self-equivalent constructivizations
- Computable structures and the hyperarithmetical hierarchy
- Degree spectra and computable dimensions in algebraic structures
- Heyting algebras. Duality theory. Translated from the Russian by A. Evseev
- The computable dimension of ordered abelian groups
- Categoricity spectra of computable structures
- Degree spectra of structures
- Freely generated projective planes with finite computable dimension
- Effective categoricity for distributive lattices and Heyting algebras
- Computable Boolean algebras
- Turing's Legacy
- Turing Computability
- Strength and Weakness in Computable Structure Theory
- Effective procedures in field theory
- Recursive isomorphism types of recursive Boolean algebras
- Recursive Boolean algebras with recursive atoms
- The computable dimension of trees of infinite height
- On the triple jump of the set of atoms of a Boolean algebra
- Degrees coded in jumps of orderings
- Recursively Categorical Linear Orderings
- Theorie Der Numerierungen III
- Boolean algebras, Stone spaces, and the iterated Turing jump
- A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS
- Degrees of Structures
- Computable Contact Algebras
- CONSTRUCTIVE ALGEBRAS I
This page was built for publication: Computable Heyting algebras with distinguished atoms and coatoms
