On the Decidability of Elementary Modal Logics (Q5277903): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1145/2817825 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2040640762 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarded Negation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The undecidability of the domino problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2744124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Restraining Power of Guards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on Berger's paper on the domino problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of universality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4910732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Universally Defined Undecidable Unimodal Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modal Logics Definable by Universal Three-Variable Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Variable First-Order Logic with Equivalence Closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Complexity of Provability in Systems of Modal Propositional Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5419895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidable Elementary Modal Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On languages with two variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two variable first-order logic over ordered domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the two-variable fragment with counting quantifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4081211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2957894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4348133 / rank
 
Normal rank

Latest revision as of 02:25, 14 July 2024

scientific article; zbMATH DE number 6744221
Language Label Description Also known as
English
On the Decidability of Elementary Modal Logics
scientific article; zbMATH DE number 6744221

    Statements

    On the Decidability of Elementary Modal Logics (English)
    0 references
    0 references
    0 references
    0 references
    12 July 2017
    0 references
    modal logic
    0 references
    computational complexity
    0 references
    elementary logics
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references