The comparison of the expressive power of first-order dynamic logics (Q791517): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: New estimates of odd exponents of infinite Burnside groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of LR(k) parsers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200049 / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order dynamic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5537599 / rank
 
Normal rank

Latest revision as of 12:24, 14 June 2024

scientific article
Language Label Description Also known as
English
The comparison of the expressive power of first-order dynamic logics
scientific article

    Statements

    The comparison of the expressive power of first-order dynamic logics (English)
    0 references
    1983
    0 references
    The paper presents basic results concerning the expressive power of dynamic logics. The main result is the proof that the deterministic regular logic is strictly weaker than regular logic. Some new open problems are stated.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    dynamic logic
    0 references
    expressive power
    0 references
    deterministic regular logic
    0 references
    0 references