Pages that link to "Item:Q4371697"
From MaRDI portal
The following pages link to Fixpoint logics, relational machines, and computational complexity (Q4371697):
Displayed 20 items.
- Computing with infinitary logic (Q672337) (← links)
- Reflective relational machines (Q1271557) (← links)
- A restricted second order logic for finite structures (Q1271559) (← links)
- A query language for NC (Q1376409) (← links)
- Domain-independent queries on databases with external functions (Q1389449) (← links)
- The descriptive complexity of decision problems through logics with relational fixed-point and capturing results (Q1744448) (← links)
- On the structural simplicity of machines and languages (Q1924785) (← links)
- Computation on structures. Behavioural theory, logic, complexity (Q2117601) (← links)
- Comparison of expressive power of some query languages for databases (Q2510772) (← links)
- Semantic Restrictions over Second-Order Logic (Q3458159) (← links)
- The Descriptive Complexity of Parity Games (Q3540190) (← links)
- Finite Variable Logics in Descriptive Complexity Theory (Q4254565) (← links)
- Computing on structures (Q4630296) (← links)
- Implicit definability and infinitary logic in finite model theory (Q4645216) (← links)
- 2003 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquim '03 (Q4678940) (← links)
- Computable Queries for Object Oriented Databases (Q4916216) (← links)
- Infinitary logic for computer science (Q5204339) (← links)
- The Relational Polynomial-Time Hierarchy and Second-Order Logic (Q5504578) (← links)
- A restricted second order logic for finite structures (Q6064291) (← links)
- A query language for NC (extended abstract) (Q6064297) (← links)