The Ackermann approach for modal logic, correspondence theory and second-order reduction (Q420837): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(7 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jal.2012.01.001 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03B45 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03B35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03C10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6037802 / rank
 
Normal rank
Property / zbMATH Keywords
 
modal logic
Property / zbMATH Keywords: modal logic / rank
 
Normal rank
Property / zbMATH Keywords
 
correspondence theory
Property / zbMATH Keywords: correspondence theory / rank
 
Normal rank
Property / zbMATH Keywords
 
second-order quantifier elimination
Property / zbMATH Keywords: second-order quantifier elimination / rank
 
Normal rank
Property / zbMATH Keywords
 
Ackermann lemma
Property / zbMATH Keywords: Ackermann lemma / rank
 
Normal rank
Property / zbMATH Keywords
 
substitution method
Property / zbMATH Keywords: substitution method / rank
 
Normal rank
Property / zbMATH Keywords
 
axiom and rule reductions
Property / zbMATH Keywords: axiom and rule reductions / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SQEMA / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jal.2012.01.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2043056708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2751353 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refutational theorem proving for hierarchic first-order theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2744124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3509049 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing circumscription revisited: A reduction algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3543581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relational and Kleene-Algebraic Methods in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary canonical formulae: extending Sahlqvist's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4081211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Second-Order Quantifier Elimination in Modal Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Monotonous Elimination of Predicate Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Correspondence Between Modal and Classical Logic: an Automated Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342096 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JAL.2012.01.001 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:03, 9 December 2024

scientific article
Language Label Description Also known as
English
The Ackermann approach for modal logic, correspondence theory and second-order reduction
scientific article

    Statements

    The Ackermann approach for modal logic, correspondence theory and second-order reduction (English)
    0 references
    0 references
    23 May 2012
    0 references
    modal logic
    0 references
    correspondence theory
    0 references
    second-order quantifier elimination
    0 references
    Ackermann lemma
    0 references
    substitution method
    0 references
    axiom and rule reductions
    0 references

    Identifiers