scientific article; zbMATH DE number 2193711

MaRDI QIDQ5465461zbMATH OpenFDO

Authors Rui Xue

Publication date 8 August 2005

zbMATH Keywords

computational complexitydecidabilityelementary equivalenceEhrenfeucht game

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Boolean algebras (Boolean rings) (06E99)

Cited in

(5)

• Atomicity of the Boolean algebra of direct factors of a directed set
• Atomless Boolean algebras computable in polynomial time
• scientific article; zbMATH DE number 1301755 (Why is no real title available?)
• Working with ARMs: Complexity results on atomic representations of Herbrand models
• scientific article; zbMATH DE number 1421070 (Why is no real title available?)

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 Q5465461)