The following pages link to Computing with first-order logic (Q1892224):
Displaying 19 items.
- Highly expressive query languages for unordered data trees (Q269323) (← links)
- On (uniform) hierarchical decompositions of finite structures and model-theoretic geometry (Q306575) (← links)
- Super/rosy \(L^k\)-theories and classes of finite structures (Q385799) (← links)
- Computing with infinitary logic (Q672337) (← links)
- Reflective relational machines (Q1271557) (← links)
- A restricted second order logic for finite structures (Q1271559) (← links)
- Semantics and expressiveness issues in active databases (Q1278040) (← links)
- Temporal connectives versus explicit timestamps to query temporal databases (Q1305921) (← links)
- How to define a linear order on finite models (Q1371431) (← links)
- Querying spatial databases via topological invariants (Q1591156) (← links)
- Adding for-loops to first-order logic (Q1854443) (← links)
- On the decidability of the termination problem of active database systems (Q1884939) (← links)
- Linear ordering on graphs, anti-founded sets and polynomial time computability (Q1960423) (← links)
- The Descriptive Complexity of Parity Games (Q3540190) (← links)
- Computing on structures (Q4630296) (← links)
- Computable Queries for Object Oriented Databases (Q4916216) (← links)
- The Relational Polynomial-Time Hierarchy and Second-Order Logic (Q5504578) (← links)
- Semiring reasoning frameworks in AI and their computational complexity (Q6488781) (← links)
- First order logic, fixed point logic and linear order (Q6560167) (← links)
