Publication:2364293: Difference between revisions
Created automatically from import240129110113 |
(No difference)
|
Latest revision as of 17:47, 2 February 2024
DOI10.1007/S10469-016-9381-XzbMATH Open1402.03064OpenAlexW2512277039MaRDI QIDQ2364293FDOQ2364293
Publication date: 18 July 2017
Published in: Algebra and Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10469-016-9381-x
Boolean algebraindex setautostabilitydegree of categoricityautostability relative to strong constructivizationsdegree of autostability
Computable structure theory, computable model theory (03C57) Other Turing degree structures (03D28) Theory of numerations, effectively presented structures (03D45) Structure theory of Boolean algebras (06E05)
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?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generic copies of countable structures
- Autostability of models
- Computable structures and the hyperarithmetical hierarchy
- Effective model theory vs. recursive model theory
- Degrees of categoricity and the hyperarithmetic hierarchy
- Degrees of categoricity of computable structures
- Degrees of autostability relative to strong constructivizations
- Recursive Pseudo-Well-Orderings
- Pairs of recursive structures
- Categoricity in hyperarithmetical degrees
- On the complexity of categoricity in computable structures
- Constructivizability of superatomic Boolean algebras
- Degrees of categoricity for superatomic Boolean algebras
Cited In (13)
- Autostability of automatic representations of well-orders and lower-rank linear orders
- Degrees of autostability relative to strong constructivizations of graphs
- Degrees of autostability for prime Boolean algebras
- Degrees of categoricity of rigid structures
- Categoricity spectra of computable structures
- Decidable categoricity spectra for almost prime models
- Autostability spectra for Boolean algebras
- Punctual categoricity relative to a computable oracle
- On bi-embeddable categoricity of algebraic structures
- The degree of decidable categoricity of a model with infinite solutions for complete formulas
- On decidable categoricity and almost prime models
- The index set of Boolean algebras autostable relative to strong constructivizations
- Degrees of bi-embeddable categoricity
This page was built for publication: Degrees of autostability relative to strong constructivizations for Boolean algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364293)