scientific article; zbMATH DE number 1894708

zbMATH Open1022.03014MaRDI QIDQ4801784FDOQ4801784

Authors: Dongsheng Liao, Libo Luo, Ji-Qiang Liu 

Publication date: 2 November 2003

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

Recommendations

• A new proof of quantifier elimination of complete forked trees
• scientific article; zbMATH DE number 5171238
• Quantifier elimination of the theory of dense binary orders. I
• scientific article; zbMATH DE number 2213969
• On the computational complexity of the theory of complete binary trees

zbMATH Keywords

quantifier eliminationfinite coveringcomplete binary treeslayout formulas

Mathematics Subject Classification ID

Data structures (68P05) Quantifier elimination, model completeness, and related topics (03C10)

Cited In (8)

• A new proof of quantifier elimination of complete forked trees
• Cardinality Quantifiers in MLO over Trees
• Weak sequential theories of finite full binary trees
• On the computational complexity of the theory of complete binary trees
• The classification of all quantifier-eliminable directed or undirected trees with a root
• On constructing the elimination tree
• Quantifier elimination of the theory of dense binary orders. I
• Quantifier-eliminable locally finite graphs

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