Advances in Databases and Information Systems

DOI10.1007/B100480MaRDI QIDQ5464722zbMATH OpenOpenAlexFDO

Authors P. Z. Revesz

Publication date 19 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b100480

Mathematics Subject Classification ID

Database theory (68P15) Quantifier elimination, model completeness, and related topics (03C10)

Recommendations

• scientific article; zbMATH DE number 4035803
• On the combinatorial and algebraic complexity of quantifier elimination
• Weak quantifier elimination for the full linear theory of the integers
• Linear quantifier elimination
• Linear Quantifier Elimination
• Quantifier elimination for a class of intuitionistic theories
• Quantifier elimination for linear modular constraints
• A construction of Boolean algebras from first-order structures

Cited in

(5)

• Effective Quantifier Elimination for Presburger Arithmetic with Infinity
• The Boolean Sentence Algebra of the Theory of Linear Ordering is Atomic with Respect to Logics with a Malitz Quantifier
• Decision procedures for term algebras with integer constraints
• Deciding Boolean algebra with Presburger arithmetic
• An incremental algorithm for DLO quantifier elimination via constraint propagation

This page was built for publication: Advances in Databases and Information Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5464722)