The following pages link to (Q4227581):
Displaying 50 items.
- The ultra-weak Ash conjecture and some particular cases (Q3376535) (← links)
- Reachability is in DynFO (Q3449473) (← links)
- On the Descriptive Complexity of Linear Algebra (Q3511442) (← links)
- Pure Pointer Programs with Iteration (Q3540172) (← links)
- The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey (Q3586006) (← links)
- Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs (Q3586010) (← links)
- Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems (Q3599136) (← links)
- (Q4453869) (← links)
- (Q4625692) (← links)
- Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic (Q4637759) (← links)
- (Q4638077) (← links)
- (Q4643956) (← links)
- Comparing the succinctness of monadic query languages over finite trees (Q4659888) (← links)
- A local normal form theorem for infinitary logic with unary quantifiers (Q4666943) (← links)
- Fifty years of the spectrum problem: survey and new results (Q4902770) (← links)
- Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH (Q4916232) (← links)
- Monadic Second-Order Logic and Transitive Closure Logics over Trees (Q4917997) (← links)
- Graph Grammars for Querying Graph-like Data (Q4921552) (← links)
- Expressibility of Higher Order Logics (Q4924534) (← links)
- The complexity of properties of transformation semigroups (Q4960463) (← links)
- Equivalence Criteria for Compositional IF Modal Logics (Q4982119) (← links)
- (Q5002805) (← links)
- Identifiability of Graphs with Small Color Classes by the Weisfeiler--Leman Algorithm (Q5009334) (← links)
- (Q5021005) (← links)
- Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata (Q5041265) (← links)
- Parameterized Parallel Computing and First-Order Logic (Q5049039) (← links)
- THE MODAL LOGIC OF STEPWISE REMOVAL (Q5065135) (← links)
- Cyclic congruences of slim semimodular lattices and non-finite axiomatizability of some finite structures (Q5071539) (← links)
- (Q5079744) (← links)
- (Q5091279) (← links)
- FIRST-ORDER AXIOMATISATIONS OF REPRESENTABLE RELATION ALGEBRAS NEED FORMULAS OF UNBOUNDED QUANTIFIER DEPTH (Q5100063) (← links)
- On the Computational Complexity of Non-Dictatorial Aggregation (Q5154769) (← links)
- The Descriptive Complexity of the Deterministic Exponential Time Hierarchy (Q5179012) (← links)
- Logic and Complexity in Cognitive Science (Q5249690) (← links)
- Expressiveness of Logic Programs under the General Stable Model Semantics (Q5278207) (← links)
- Complexity and polymorphisms for digraph constraint problems under some basic constructions (Q5298320) (← links)
- First order quantifiers in monadic second order logic (Q5311712) (← links)
- Truth definitions in finite models (Q5311718) (← links)
- On spectra of sentences of monadic second order logic with counting (Q5311744) (← links)
- CFI Construction and Balanced Graphs (Q5321700) (← links)
- (Q5376663) (← links)
- An empirical analysis of algorithms for partially Clairvoyant scheduling (Q5421611) (← links)
- Descriptive complexity of finite structures: Saving the quantifier rank (Q5718668) (← links)
- Positive predicate structures for continuous data (Q5740676) (← links)
- First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries (Q5870513) (← links)
- Canonisation and Definability for Graphs of Bounded Rank Width (Q5875948) (← links)
- Systematic Refinement of Abstract State Machines with Higher-Order Logic (Q5881450) (← links)
- Weak models of distributed computing, with connections to modal logic (Q5918244) (← links)
- Independence-friendly logic without Henkin quantification (Q5918342) (← links)
- Circuit complexity of regular languages (Q5918477) (← links)
