The following pages link to Global inductive definability (Q4177549):
Displaying 9 items.
- Descriptive characterizations of computational complexity (Q1123616) (← links)
- A Ramseyian theorem on products of trees (Q1176379) (← links)
- A progression semantics for first-order logic programs (Q1680677) (← links)
- The role of the Omitting Types Theorem in infinitary logic (Q3919693) (← links)
- 1998 European Summer Meeting of the Association for Symbolic Logic (Q4254644) (← links)
- Interpolation and preservation for pebble logics (Q4262589) (← links)
- Interpolation, preservation, and pebble games (Q4262591) (← links)
- Barwise: Infinitary Logic and Admissible Sets (Q4678932) (← links)
- $\aleph_1$ and the modal $\mu$-calculus (Q4972732) (← links)
