Pages that link to "Item:Q5248979"
From MaRDI portal
The following pages link to LINDSTRÖM QUANTIFIERS AND LEAF LANGUAGE DEFINABILITY (Q5248979):
Displaying 15 items.
- Dependence logic with a majority quantifier (Q302214) (← links)
- Languages polylog-time reducible to dot-depth 1/2 (Q859980) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- A remark on collective quantification (Q1006495) (← links)
- Machines that can output empty words (Q2272215) (← links)
- Perfect correspondences between dot-depth and polynomial-time hierarchies (Q2453555) (← links)
- A characterization of definability of second-order generalized quantifiers with applications to non-definability (Q2453584) (← links)
- A reducibility for the dot-depth hierarchy (Q2575760) (← links)
- On Second-Order Monadic Groupoidal Quantifiers (Q3511462) (← links)
- (Q4453869) (← links)
- On Existentially First-Order Definable Languages and Their Relation to NP (Q4718893) (← links)
- Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies (Q4800264) (← links)
- SOME OBSERVATIONS ABOUT GENERALIZED QUANTIFIERS IN LOGICS OF IMPERFECT INFORMATION (Q5241230) (← links)
- THE DOT-DEPTH AND THE POLYNOMIAL HIERARCHIES CORRESPOND ON THE DELTA LEVELS (Q5462667) (← links)
- The descriptive complexity approach to LOGCFL (Q5946058) (← links)