scientific article; zbMATH DE number 2193711

zbMATH Open1066.03513MaRDI QIDQ5465461FDOQ5465461

Authors: Rui Xue 

Publication date: 8 August 2005

Title of this publication is not available (Why is that?)

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
• Title not available (Why is that?)
• Working with ARMs: Complexity results on atomic representations of Herbrand models
• Title not available (Why is that?)

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)