A characterization of definability of second-order generalized quantifiers with applications to non-definability (Q2453584): Difference between revisions

@@ Property / DOI @@
-.1016/j.jcss.2014.04.007
@@ Property / DOI: 10.1016/j.jcss.2014.04.007 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jcss.2014.04.007
+Normal rank
@@ Property / OpenAlex ID @@
+W2082972831
@@ Property / OpenAlex ID: W2082972831 / rank @@
+Normal rank
@@ Property / cites work @@
+On a generalization of quantifiers
@@ Property / cites work: On a generalization of quantifiers / rank @@
+Normal rank
@@ Property / cites work @@
+Q3113046
@@ Property / cites work: Q3113046 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4955349
@@ Property / cites work: Q4955349 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4255575
@@ Property / cites work: Q4255575 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4058132
@@ Property / cites work: Q4058132 / rank @@
+Normal rank
@@ Property / cites work @@
+LINDSTRÖM QUANTIFIERS AND LEAF LANGUAGE DEFINABILITY
+Normal rank
@@ Property / cites work @@
+On second-order generalized quantifiers and finite structures
+Normal rank
@@ Property / cites work @@
+Definability of second order generalized quantifiers
+Normal rank
@@ Property / cites work @@
+The hierarchy theorem for second order generalized quantifiers
+Normal rank
@@ Property / cites work @@
+A uniform approach to define complexity classes
@@ Property / cites work: A uniform approach to define complexity classes / rank @@
+Normal rank
@@ Property / cites work @@
+Q2752466
@@ Property / cites work: Q2752466 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4783318
@@ Property / cites work: Q4783318 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5525343
@@ Property / cites work: Q5525343 / rank @@
+Normal rank
@@ Property / cites work @@
+Rudimentary Languages and Second‐Order Logic
@@ Property / cites work: Rudimentary Languages and Second‐Order Logic / rank @@
+Normal rank
@@ Property / cites work @@
+Parity, circuits, and the polynomial-time hierarchy
+Normal rank
@@ Property / cites work @@
+Relating polynomial time to constant depth
@@ Property / cites work: Relating polynomial time to constant depth / rank @@
+Normal rank
@@ Property / cites work @@
+A remark on collective quantification
@@ Property / cites work: A remark on collective quantification / rank @@
+Normal rank
@@ Property / cites work @@
+Q4328560
@@ Property / cites work: Q4328560 / rank @@
+Normal rank
@@ Property / cites work @@
+Easy solutions for a hard problem? The computational complexity of reciprocals with quantificational antecedents
+Normal rank
@@ Property / cites work @@
+Q3068330
@@ Property / cites work: Q3068330 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4227581
@@ Property / cites work: Q4227581 / rank @@
+Normal rank
@@ Property / cites work @@
+The polynomial-time hierarchy
@@ Property / cites work: The polynomial-time hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel computation with threshold functions
@@ Property / cites work: Parallel computation with threshold functions / rank @@
+Normal rank
@@ Property / cites work @@
+On uniformity within \(NC^ 1\)
@@ Property / cites work: On uniformity within \(NC^ 1\) / rank @@
+Normal rank
@@ Property / cites work @@
+Extensions of MSO and the monadic counting hierarchy
+Normal rank
@@ Property / cites work @@
+A logical characterization of the counting hierarchy
+Normal rank
@@ Property / cites work @@
+Uniform constant-depth threshold circuits for division and iterated multiplication.
+Normal rank
@@ Property / cites work @@
+\(\Sigma_ 1^ 1\)-formulae on finite structures
@@ Property / cites work: \(\Sigma_ 1^ 1\)-formulae on finite structures / rank @@
+Normal rank
@@ Property / cites work @@
+First-order expressibility of languages with neutral letters or: The Crane Beach conjecture
+Normal rank
@@ Property / DOI @@
+.1016/J.JCSS.2014.04.007
@@ Property / DOI: 10.1016/J.JCSS.2014.04.007 / rank @@
+Normal rank