Pages that link to "Item:Q4508261"
From MaRDI portal
The following pages link to On fixed-point logic with counting (Q4508261):
Displaying 10 items.
- An analysis of fixed-point queries on binary trees (Q1183571) (← links)
- Arrow logic and infinite counting (Q1582310) (← links)
- Logical definability of counting functions (Q1816735) (← links)
- Tree canonization and transitive closure (Q1854332) (← links)
- Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs (Q2478545) (← links)
- On the Descriptive Complexity of Linear Algebra (Q3511442) (← links)
- (Q3781093) (← links)
- Enhancing fixed point logic with cardinality quantifiers (Q4399514) (← links)
- On polynomial time computation over unordered structures (Q4779654) (← links)
- A logical characterization of the counting hierarchy (Q5277825) (← links)