Relational Methods in Computer Science

DOI10.1007/11734673zbMATH Open1185.03063OpenAlexW2482623798MaRDI QIDQ5899321FDOQ5899321

Ewa Orłowska, Andrzej Szałas

Publication date: 2 May 2007

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

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

Recommendations

• The Ackermann approach for modal logic, correspondence theory and second-order reduction
• scientific article; zbMATH DE number 1303431
• scientific article; zbMATH DE number 1931662
• Improved Second-Order Quantifier Elimination in Modal Logic
• Publication:4946227

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Axiomatics of classical set theory and its fragments (03E30) Quantifier elimination, model completeness, and related topics (03C10)

Cited In (6)

• Towards incorporating background theories into quantifier elimination
• Title not available (Why is that?)
• Quantifier elimination for infinite terms
• Elimination problems in logic: a brief history
• Second-order quantifier elimination in higher-order contexts with applications to the semantical analysis of conditionals
• Title not available (Why is that?)

This page was built for publication: Relational Methods in Computer Science

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