scientific article; zbMATH DE number 1302871
zbMATH Open0952.03036MaRDI QIDQ4249357FDOQ4249357
Authors: Yuri L. Ershov, S. S. Goncharov
Publication date: 7 January 2001
Title of this publication is not available (Why is that?)
Recommendations
surveydecidabilityalgebraic complexitystrongly constructivizable modelconstructivizable modeldecidable Boolean algebra
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Model-theoretic algebra (03C60) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Boolean algebras (Boolean rings) (06E99)
Cited In (15)
- Title not available (Why is that?)
- Explicit algebraic models for constructive and classical theories with non-standard elements
- Title not available (Why is that?)
- Strongly constructive Boolean algebras
- Title not available (Why is that?)
- On the spectrum of degrees of decidable relations
- Elementary pairs of models
- The most nonelementary theory
- Title not available (Why is that?)
- Degree spectra of relations on structures of finite computable dimension
- Degrees of autostability relative to strong constructivizations
- Groups of recursive automorphisms of constructive Boolean algebras
- Title not available (Why is that?)
- Decidability of the restricted theories of a class of partial orders
- Constructibility and decidability versus domain independence and absoluteness
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249357)