On undecidability of subset theories of some unars

DOI10.1134/S1064562424701874MaRDI QIDQ6575359zbMATH OpenFDO

Authors B. N. Karlov

Publication date 19 July 2024

Published in Doklady Mathematics (Search for Journal in Brave)

zbMATH Keywords

decidabilitytheoryquantifier eliminationunarsubset algebra

Mathematics Subject Classification ID

Theory of computing (68Qxx) Model theory (03Cxx) General logic (03Bxx)

Cites work

• scientific article; zbMATH DE number 3550662 (Why is no real title available?)
• A note on algebras of languages
• Boolean algebras of regular languages
• Complete theories of unars
• Complete theories of unars
• On decidability of theories of regular languages
• On direct products of theories
• On undecidability of concatenation theory for one-symbol languages

This page was built for publication: On undecidability of subset theories of some unars

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