The following pages link to On Moschovakis closure ordinals (Q4143287):
Displaying 34 items.
- On the expressive power of counting (Q672336) (← links)
- Computing with infinitary logic (Q672337) (← links)
- A uniform method for proving lower bounds on the computational complexity of logical theories (Q917543) (← links)
- Parametrization over inductive relations of a bounded number of variables (Q917545) (← links)
- Definability with bounded number of bound variables (Q922523) (← links)
- When is arithmetic possible? (Q922533) (← links)
- Infinitary logics and 0-1 laws (Q1193591) (← links)
- Reflective relational machines (Q1271557) (← links)
- A restricted second order logic for finite structures (Q1271559) (← links)
- On the power of built-in relations in certain classes of program schemes (Q1277684) (← links)
- Topological queries in spatial databases (Q1305920) (← links)
- Canonization for two variables and puzzles on the square (Q1361251) (← links)
- How to define a linear order on finite models (Q1371431) (← links)
- Atom structures of cylindric algebras and relation algebras (Q1377624) (← links)
- Metafinite model theory (Q1383163) (← links)
- The Kolmogorov expressive power of Boolean query languages (Q1389450) (← links)
- Integrity constraints for XML (Q1394804) (← links)
- Path constraints in semistructured databases (Q1591150) (← links)
- Generalized quantifiers and pebble games on finite structures (Q1892941) (← links)
- Hierarchies in transitive closure logic, stratified Datalog and infinitary logic (Q1919531) (← links)
- How many variables are needed to express an existential positive query? (Q2322719) (← links)
- Large finite structures with few \(L^k\)-types (Q2506492) (← links)
- An Extension of the Ehrenfeucht-Fraïssé Game for First Order Logics Augmented with Lindström Quantifiers (Q2947176) (← links)
- Pebble Games over Ordered Structural Abstractions (Q2988831) (← links)
- Semantic Restrictions over Second-Order Logic (Q3458159) (← links)
- Ordinal spectra of first-order theories (Q4198742) (← links)
- Computing on structures (Q4630296) (← links)
- Implicit definability and infinitary logic in finite model theory (Q4645216) (← links)
- Barwise: Infinitary Logic and Admissible Sets (Q4678932) (← links)
- Infinitary logic for computer science (Q5204339) (← links)
- The axiom of elementary sets on the edge of Peircean expressibility (Q5718697) (← links)
- LOGIC IN THE <i>TRACTATUS</i> (Q5737959) (← links)
- Arboreal categories and equi-resource homomorphism preservation theorems (Q6131200) (← links)
- Constraint satisfaction, graph isomorphism, and the pebbling comonad (Q6612794) (← links)
