Counting modulo quantifiers on finite structures (Q1854352): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: \(\Sigma_ 1^ 1\)-formulae on finite structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3204028 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular languages in \(NC\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniformity within \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. X: Linear orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4431384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parity, circuits, and the polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: On monadic NP vs monadic co-NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3758820 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5551141 / 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: Relational queries computable in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized quantifiers and pebble games on finite structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchies of monadic generalized quantifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5641083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On winning strategies with unary quantifiers / 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: On winning Ehrenfeucht games and monadic NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5668796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273661 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular languages defined with generalized quantifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unary quantifiers on finite models / rank
 
Normal rank

Latest revision as of 11:08, 5 June 2024

scientific article
Language Label Description Also known as
English
Counting modulo quantifiers on finite structures
scientific article

    Statements

    Counting modulo quantifiers on finite structures (English)
    0 references
    0 references
    14 January 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    elementary equivalence
    0 references
    counting modulo quantifiers
    0 references
    ordered graphs
    0 references
    0 references