SCAN—Elimination of predicate quantifiers

DOI10.1007/3-540-61511-3_77zbMath1412.68249OpenAlexW1586690077MaRDI QIDQ4647510

Hans Jürgen Ohlbach

Publication date: 15 January 2019

Published in: Automated Deduction — Cade-13 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61511-3_77

zbMATH Keywords

quantifier eliminationintuitionistic logicpredicate logiccorrespondence theorypredicate variableProlog program

Mathematics Subject Classification ID

Quantifier elimination, model completeness, and related topics (03C10)

Related Items (4)

Reconsideration of circumscriptive induction with pointwise circumscription ⋮ SAT-Inspired Higher-Order Eliminations ⋮ Saturation-based Boolean conjunctive query answering and rewriting for the guarded quantification fragments ⋮ SAT-Inspired Eliminations for Superposition

Cites Work

• Computing circumscription revisited: A reduction algorithm
• Untersuchungen über das Eliminationsproblem der mathematischen Logik

This page was built for publication: SCAN—Elimination of predicate quantifiers