On the strength and scope of DLS (Q3647241): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.3166/jancl.16.279-296 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1968397692 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Untersuchungen über das Eliminationsproblem der mathematischen Logik / 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: Elementary canonical formulae: extending Sahlqvist's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Un-Skolemizing clause sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Correspondence Between Modal and Classical Logic: an Automated Approach / rank
 
Normal rank

Latest revision as of 05:19, 2 July 2024

scientific article
Language Label Description Also known as
English
On the strength and scope of DLS
scientific article

    Statements

    On the strength and scope of DLS (English)
    0 references
    0 references
    30 November 2009
    0 references
    second-order quantifier elimination
    0 references
    DLS algorithm
    0 references
    modal logic
    0 references
    Sahlqvist formulae
    0 references
    inductive formulae
    0 references
    canonicity
    0 references

    Identifiers