On the 1-decidability of Boolean algebras with one distinguished ideal

DOI10.1134/S0037446624050070MaRDI QIDQ6631334FDOQ6631334

Authors: M. N. Gaskova 

Publication date: 1 November 2024

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

Boolean algebracomputable modeldecidable modelI-algebra\( n \)-decidable modelbounded theories of Boolean algebrasideal on Boolean algebras

Mathematics Subject Classification ID

Computability and recursion theory (03Dxx) Model theory (03Cxx) General logic (03Bxx)

Cites Work

• Model theory
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Computable structures and the hyperarithmetical hierarchy
• Title not available (Why is that?)
• Title not available (Why is that?)
• The minimality of certain decidability conditions for Boolean algebras
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hierarchies of Boolean algebras
• Prime and countably saturated models of the theory of Boolean algebras with distinguished ideals

This page was built for publication: On the 1-decidability of Boolean algebras with one distinguished ideal

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