scientific article; zbMATH DE number 1894708

MaRDI QIDQ4801784zbMATH OpenFDO

Authors Dongsheng Liao, Libo Luo, Ji-Qiang Liu

Publication date 2 November 2003

zbMATH Keywords

complete binary treesfinite coveringlayout formulasquantifier elimination

Mathematics Subject Classification ID

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

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

Cited in

(8)

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

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)