Definability in dynamic logic (Q1158140): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Infinitary logic and admissible sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3900029 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving termination with multiset orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of games to the completeness problem for formalized theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074367 / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order dynamic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3917485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finiteness is mu-ineffable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank

Latest revision as of 14:06, 13 June 2024

scientific article
Language Label Description Also known as
English
Definability in dynamic logic
scientific article

    Statements

    Definability in dynamic logic (English)
    0 references
    0 references
    0 references
    1981
    0 references
    0 references
    distinct classes of program constructions
    0 references
    expressive power
    0 references
    infinitary logic
    0 references
    random and array assignments
    0 references
    0 references