The following pages link to (Q4332930):
Displaying 40 items.
- Super/rosy \(L^k\)-theories and classes of finite structures (Q385799) (← links)
- The complexity of counting quantifiers on equality languages (Q515549) (← links)
- From a zoo to a zoology: Towards a general theory of graph polynomials (Q1015377) (← links)
- On the power of built-in relations in certain classes of program schemes (Q1277684) (← links)
- Canonization for two variables and puzzles on the square (Q1361251) (← links)
- Metafinite model theory (Q1383163) (← links)
- Program schemes, arrays, Lindström quantifiers and zero-one laws (Q1606129) (← links)
- Lower bounds for invariant queries in logics with counting. (Q1853505) (← links)
- Adding for-loops to first-order logic (Q1854443) (← links)
- Modal and guarded characterisation theorems over finite transition systems (Q1886323) (← links)
- Bisimulation-invariant PTIME and higher-dimensional \(\mu\)-calculus (Q1960425) (← links)
- On the expressive power of linear algebra on graphs (Q2035472) (← links)
- On symmetric circuits and fixed-point logics (Q2363965) (← links)
- Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs (Q2478545) (← links)
- Large finite structures with few \(L^k\)-types (Q2506492) (← links)
- Symbioses between mathematical logic and computer science (Q2630825) (← links)
- Is Polynomial Time Choiceless? (Q2947174) (← links)
- The Complexity of Counting Quantifiers on Equality Languages (Q3188273) (← links)
- PEBBLE GAMES AND LINEAR EQUATIONS (Q3450805) (← links)
- Semantic Restrictions over Second-Order Logic (Q3458159) (← links)
- On the Descriptive Complexity of Linear Algebra (Q3511442) (← links)
- Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs (Q3586010) (← links)
- The Computational Complexity of Quantified Reciprocals (Q3623832) (← links)
- On Preservation Theorems for Two-Variable Logic (Q4264532) (← links)
- RANK LOGIC IS DEAD, LONG LIVE RANK LOGIC! (Q4628673) (← links)
- On polynomial time computation over unordered structures (Q4779654) (← links)
- Fifty years of the spectrum problem: survey and new results (Q4902770) (← links)
- (Q5005107) (← links)
- Undecidability results on two-variable logics (Q5048929) (← links)
- (Q5091117) (← links)
- (Q5091274) (← links)
- (Q5091279) (← links)
- Constraint Satisfaction with Counting Quantifiers (Q5256528) (← links)
- Regular Graphs and the Spectra of Two-Variable Logic with Counting (Q5258916) (← links)
- CFI Construction and Balanced Graphs (Q5321700) (← links)
- The Relational Polynomial-Time Hierarchy and Second-Order Logic (Q5504578) (← links)
- Canonisation and Definability for Graphs of Bounded Rank Width (Q5875948) (← links)
- On matrices and \(K\)-relations (Q5918484) (← links)
- Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Graph Isomorphism Problem (Q6081762) (← links)
- INTERLEAVING LOGIC AND COUNTING (Q6199174) (← links)
