Second-order quantifier elimination in higher-order contexts with applications to the semantical analysis of conditionals

DOI10.1007/s11225-007-9075-4zbMath1127.03024OpenAlexW2057924377MaRDI QIDQ2462670

Andrzej Szałas, Dov M. Gabbay

Publication date: 3 December 2007

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11225-007-9075-4

zbMATH Keywords

conditionalssecond-order quantifier eliminationhigher-order relations

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Second- and higher-order model theory (03C85) Quantifier elimination, model completeness, and related topics (03C10)

Related Items

Fibring argumentation frames ⋮ Annotation theories over finite graphs ⋮ Towards incorporating background theories into quantifier elimination ⋮ A Roadmap to Decidability

Uses Software

• SQEMA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing circumscription revisited: A reduction algorithm
• Untersuchungen über das Eliminationsproblem der mathematischen Logik
• Knowledge representation techniques. A rough set approach.
• Determiners and logic
• On the Correspondence Between Modal and Classical Logic: an Automated Approach
• The Monotonous Elimination of Predicate Variables
• On an automated translation of modal proof rules into formulas of the classical logic
• Declarative PTIME queries for relational databases using quantifier elimination
• Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
• A semantic analysis of conditional logic1
• A general theory of the conditional in terms of a ternary operator
• Relational Methods in Computer Science

This page was built for publication: Second-order quantifier elimination in higher-order contexts with applications to the semantical analysis of conditionals