PDL for ordered trees (Q3647225): 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.15.115-135 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2117522142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability logic: an efficient fragment of transitive closure logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Modal Perspective on Path Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linguistics, Logic and Finite Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional dynamic logic of regular programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of philosophical logic. Volume II: Extensions of classical logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Syntactic codes and grammar refinement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4954002 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4833777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata-theoretic techniques for modal logics of programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of S1S and S2S / rank
 
Normal rank

Latest revision as of 06:18, 2 July 2024

scientific article
Language Label Description Also known as
English
PDL for ordered trees
scientific article

    Statements

    PDL for ordered trees (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    30 November 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    ordered trees
    0 references
    definability
    0 references
    expressivity
    0 references
    complexity
    0 references
    propositional dynamic logic
    0 references
    0 references