Complexity of monodic guarded fragments over linear and real time (Q2576942): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: I. M. Hodkinson / rank
Normal rank
 
Property / author
 
Property / author: I. M. Hodkinson / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2099799091 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modal languages and bounded fragments of predicate logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Non-local Propositional and Weak Monodic Quantified CTL* / rank
 
Normal rank
Property / cites work
 
Property / cites work: The decision problem for linear temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Deduction – CADE-19 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equality and monodic first-order temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3835817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many-dimensional modal logics: theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263155 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Restraining Power of Guards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003410 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loosely guarded fragment of first-order logic has the finite model property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monodic packed fragment with equality is decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Conformal Hypergraph Covers and Gaifman Cliques in Finite Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidable fragments of first-order temporal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monodic Fragments of First-Order Temporal Logics: 2000–2001 A.D. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3408140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the elementary theory of linear order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tolerance logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of temporal logic over the reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the temporal logic with ``until'' over general linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: $ℵ_0$-categoricity of linear orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of propositional linear temporal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axiomatizing the monodic fragment of first-order temporal logic / rank
 
Normal rank

Latest revision as of 13:32, 11 June 2024

scientific article
Language Label Description Also known as
English
Complexity of monodic guarded fragments over linear and real time
scientific article

    Statements

    Complexity of monodic guarded fragments over linear and real time (English)
    0 references
    29 December 2005
    0 references
    quasimodel
    0 references
    mosaic
    0 references
    first-order temporal logic
    0 references
    loosely guarded fragment
    0 references
    packed fragment
    0 references
    satisfiability
    0 references
    0 references

    Identifiers