scientific article; zbMATH DE number 2203952

MaRDI QIDQ5315662zbMATH OpenFDO

Authors Rui Xue

Publication date 9 September 2005

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Quantifier elimination, model completeness, and related topics (03C10) Models of other mathematical theories (03C65) Complexity of computation (including implicit computational complexity) (03D15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 2157312
• scientific article; zbMATH DE number 3884128
• Recognition complexity of theories and their computational expressivity
• The minimality of certain decidability conditions for Boolean algebras
• The recognition complexity of decidable theories

Cited in

(13)

• Completeness and reduction in algebraic complexity theory
• Atomless Boolean algebras computable in polynomial time
• scientific article; zbMATH DE number 3884128 (Why is no real title available?)
• scientific article; zbMATH DE number 4217898 (Why is no real title available?)
• scientific article; zbMATH DE number 5139037 (Why is no real title available?)
• scientific article; zbMATH DE number 1196693 (Why is no real title available?)
• scientific article; zbMATH DE number 2154086 (Why is no real title available?)
• scientific article; zbMATH DE number 2157312 (Why is no real title available?)
• Boolean complexity classes vs. their arithmetic analogs
• scientific article; zbMATH DE number 1421070 (Why is no real title available?)
• The recognition complexity of decidable theories
• Recognition complexity of theories and their computational expressivity
• Computational complexity of quantified Boolean formulas with fixed maximal deficiency

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