Pages that link to "Item:Q1892941"

The following pages link to Generalized quantifiers and pebble games on finite structures (Q1892941):

Displaying 26 items.

• On vectorizations of unary generalized quantifiers (Q412063) (← links)
• On the expressive power of counting (Q672336) (← links)
• On the complexities of consistency checking for restricted UML class diagrams (Q1044829) (← links)
• Lower bounds for invariant queries in logics with counting. (Q1853505) (← links)
• Counting modulo quantifiers on finite structures (Q1854352) (← links)
• Adding for-loops to first-order logic (Q1854443) (← links)
• On the expressive power of monotone natural language quantifiers over finite models (Q1857361) (← links)
• Dependence logic with generalized quantifiers: axiomatizations (Q2361348) (← links)
• Game-based notions of locality over finite models (Q2478544) (← links)
• Pebble games and subroutines in least fixed point logic (Q2508327) (← links)
• On probabilistic elimination of generalized quantifiers (Q2748424) (← links)
• An Extension of the Ehrenfeucht-Fraïssé Game for First Order Logics Augmented with Lindström Quantifiers (Q2947176) (← links)
• (Q3125031) (← links)
• Almost Everywhere Equivalence of Logics in Finite Model Theory (Q3128483) (← links)
• Syllogistic Logic with Cardinality Comparisons (Q3305435) (← links)
• Semantic Restrictions over Second-Order Logic (Q3458159) (← links)
• Relativized logspace and generalized quantifiers over finite ordered structures (Q4358054) (← links)
• (Q4362728) (← links)
• (Q4945237) (← links)
• Notions of locality and their logical characterizations over finite models (Q4948541) (← links)
• Sameness (Q5214794) (← links)
• A dichotomy in classifying quantifiers for finite models (Q5486252) (← links)
• The hierarchy theorem for generalized quantifiers (Q5687317) (← links)
• GAMES AND CARDINALITIES IN INQUISITIVE FIRST-ORDER LOGIC (Q5880428) (← links)
• Games and Lindström theorems (Q6043095) (← links)
• Game comonads \& generalised quantifiers (Q6597958) (← links)