Q5101338 (Q5101338): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On propositional quantifiers in provability logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of hybrid temporal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid logics: characterization, interpolation and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representability in second-order propositional poly-modal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modal logics of sabotage revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2767023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modal Logics with Composition on Finite Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2744124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of logical theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3384161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5525343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On modal logic with propositional quantifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second-order propositional modal logic: expressiveness and completeness results / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of one-agent refinement modal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3336675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal Logics in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Expressiveness of QCTL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding full branching time logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graded modalities. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional quantifiers in modal logic1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: In so many possible worlds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decision Procedure for the First Order Theory of Real Addition with Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4475142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using the Universal Modality: Gains and Questions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of propositional quantification in intuitionistic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional quantification in the topological semantics for \(\mathbf S4\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expressive power of second-order propositional modal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting branching temporal logics with existential quantification over atomic propositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second-order propositional modal logic and monadic alternation hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantified CTL: Expressiveness and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting ATL with strategy contexts / rank
 
Normal rank
Property / cites work
 
Property / cites work: An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantified computation tree logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE FLUTED FRAGMENT REVISITED / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of Second-Order Theories and Automata on Infinite Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2003 / 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: Complexity Hierarchies beyond Elementary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4068699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-reference and modal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complementation problem for Büchi automata with applications to temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressivity of second order propositional modal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: PSPACE Reasoning for Graded Modal Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4348133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of quantified propositional intuitionistic logic and S4 on trees of height and arity \(\leq \omega\) / rank
 
Normal rank

Latest revision as of 23:56, 29 July 2024

scientific article; zbMATH DE number 7577569
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7577569

    Statements

    0 references
    0 references
    30 August 2022
    0 references
    propositional quantifier
    0 references
    modal logic over trees
    0 references
    satisfiability problem
    0 references
    tower-hardness
    0 references
    computational tree logic CTL
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers