A double arity hierarchy theorem for transitive closure logic (Q1913297): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4298571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of deterministic transitive closures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4866342 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete problems for fixed-point logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability hierarchies of generalized quantifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical hierarchies in PTIME / rank
 
Normal rank
Property / cites work
 
Property / cites work: Languages that Capture Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stationary logic and its friends. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3989926 / rank
 
Normal rank

Revision as of 11:20, 24 May 2024

scientific article
Language Label Description Also known as
English
A double arity hierarchy theorem for transitive closure logic
scientific article

    Statements

    A double arity hierarchy theorem for transitive closure logic (English)
    0 references
    0 references
    0 references
    22 August 1996
    0 references
    fragment of transitive closure logic
    0 references
    fragment of partial fixed point logic
    0 references
    generalized quantifiers
    0 references

    Identifiers