Game-theoretic inductive definability

DOI10.1016/0168-0072(93)90014-5zbMath0797.03045OpenAlexW2053227531MaRDI QIDQ1314543

V. Pereyra

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

zbMATH Keywords

inductive definabilityReduction Theoremabstract Kleene Theoreminduction along non-well-founded treesStage-Comparison Theorem

Mathematics Subject Classification ID

Applications of game theory (91A80) Model theory (03C99) Inductive definability (03D70)

Related Items (1)

X Latin American Symposium on Mathematical Logic

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

This page was built for publication: Game-theoretic inductive definability