Boolean unification with predicates

DOI10.1093/LOGCOM/EXV059zbMath1407.68217OpenAlexW2307339663MaRDI QIDQ2987044

Daniel Weller, Stefan Hetzl, Sebastian Eberhard

Publication date: 17 May 2017

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/bf393c3cec5f80d277060acaaaf8d5a20ea56f8d

zbMATH Keywords

complexityquantifier eliminationdecidabilitysecond-order unificationBoolean unification

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Classical first-order logic (03B10) Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Quantifier elimination, model completeness, and related topics (03C10)

This page was built for publication: Boolean unification with predicates