The Ackermann approach for modal logic, correspondence theory and second-order reduction
type: Item
instance of: scholarly article
title: The Ackermann approach for modal logic, correspondence theory and second-order reduction
zbMATH Open document ID: 1248.03039
author: Renate A. Schmidt
published in: Journal of Applied Logic
publication date: 2012-05-23T00:00:00Z
Mathematics Subject Classification ID: 03B45
Mathematics Subject Classification ID: 03B35
Mathematics Subject Classification ID: 03C10
zbMATH DE Number: 6037802
zbMATH Keywords: modal logic
zbMATH Keywords: correspondence theory
zbMATH Keywords: second-order quantifier elimination
zbMATH Keywords: Ackermann lemma
zbMATH Keywords: substitution method
zbMATH Keywords: axiom and rule reductions
describes a project that uses: SQEMA
MaRDI profile type: Publication
full work available at URL: j.jal.2012.01.001
OpenAlex ID: W2043056708
cites work: Resolution theorem proving
cites work: Refutational theorem proving for hierarchic first-order theories
cites work: Modal logic
cites work: Q3509049
cites work: Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
cites work: Computing circumscription revisited: A reduction algorithm
cites work: Q3543581
cites work: Relational and Kleene-Algebraic Methods in Computer Science
cites work: Elementary canonical formulae: extending Sahlqvist's theorem
cites work: Q4250040
cites work: Q4081211
cites work: Improved Second-Order Quantifier Elimination in Modal Logic
cites work: The Monotonous Elimination of Predicate Variables
cites work: On the Correspondence Between Modal and Classical Logic: an Automated Approach
cites work: Q4342096
DOI: 10.1016/J.JAL.2012.01.001
description: scientific article; zbMATH DE number 6037802