Game-theoretic inductive definability
From MaRDI portal
Publication:1314543
DOI10.1016/0168-0072(93)90014-5zbMath0797.03045MaRDI QIDQ1314543
Publication date: 17 February 1994
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-0072(93)90014-5
inductive definability; Reduction Theorem; abstract Kleene Theorem; induction along non-well-founded trees; Stage-Comparison Theorem
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constructing strongly equivalent nonisomorphic models for unstable theories
- Elementary induction on abstract structures
- The Ehrenfeucht-Fraisse-Game of Length ω 1
- A Cantor-Bendixson theorem for the space ${ω_1}^{ω_1}$
- Model theory for infinite quantifier languages
- On Scott and Karp trees of uncountable models
- A recursion principle for linear orderings
- A new approach to infinitary languages
- Comparing notions of similarity for uncountable models