The Monotonous Elimination of Predicate Variables

DOI10.1093/LOGCOM/4.1.23MaRDI QIDQ4286215zbMATH OpenOpenAlexFDO

Authors Harold Simmons

Publication date 27 March 1994

Published in Journal Of Logic And Computation (Search for Journal in Brave)

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

zbMATH Keywords

algorithmmodal logicnormal formuniversally quantified predicate variables

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Quantifier elimination, model completeness, and related topics (03C10)

Recommendations

• scientific article; zbMATH DE number 1421198
• Eliminating the fixed predicates from a circumscription
• An efficient method for eliminating varying predicates from a circumscription
• Variant quantifier elimination
• scientific article; zbMATH DE number 1301870
• Eliminating disjunctions by disjunction elimination
• Eliminating disjunctions by disjunction elimination
• Predicate Elimination for Preprocessing in First-Order Theorem Proving
• scientific article; zbMATH DE number 1670829

Cited in

(5)

• Towards automating duality
• Second-order quantifier elimination in higher-order contexts with applications to the semantical analysis of conditionals
• scientific article; zbMATH DE number 4023238 (Why is no real title available?)
• The Ackermann approach for modal logic, correspondence theory and second-order reduction
• scientific article; zbMATH DE number 1421198 (Why is no real title available?)

This page was built for publication: The Monotonous Elimination of Predicate Variables

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