Game-theoretic inductive definability
type: Item
instance of: scholarly article
title: Game-theoretic inductive definability
zbMATH Open document ID: 0797.03045
DOI: 10.1016/0168-0072(93)90014-5
author: V. Pereyra
published in: Annals of Pure and Applied Logic
publication date: 1994-02-17T00:00:00Z
review text: The authors use game-theoretic ideas to define a generalization of the notion of inductive definability. This approach allows induction along non-well-founded trees. In the main results the authors prove an abstract Kleene Theorem and restricted versions of the Stage-Comparison Theorem and the Reduction Theorem.
Mathematics Subject Classification ID: 03D70
Mathematics Subject Classification ID: 03C99
Mathematics Subject Classification ID: 91A80
zbMATH DE Number: 503016
zbMATH Keywords: inductive definability
zbMATH Keywords: induction along non-well-founded trees
zbMATH Keywords: abstract Kleene Theorem
zbMATH Keywords: Stage-Comparison Theorem
zbMATH Keywords: Reduction Theorem
reviewed by: Y. Ventsov
MaRDI profile type: Publication
full work available at URL: 0168-0072(93)90014-5
OpenAlex ID: W2053227531
cites work: Q4146722
cites work: Comparing notions of similarity for uncountable models
cites work: Model theory for infinite quantifier languages
cites work: Constructing strongly equivalent nonisomorphic models for unstable theories
cites work: On Scott and Karp trees of uncountable models
cites work: The Ehrenfeucht-Fraisse-Game of Length ω 1
cites work: Elementary induction on abstract structures
cites work: Q4732453
cites work: A recursion principle for linear orderings
cites work: Q3669469
cites work: A Cantor-Bendixson theorem for the space ${ω_1}^{ω_1}$
cites work: A new approach to infinitary languages
description: scientific article; zbMATH DE number 503016