Game-theoretic inductive definability (Q1314543): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Y. Ventsov / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Y. Ventsov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0168-0072(93)90014-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2053227531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146722 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing notions of similarity for uncountable models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model theory for infinite quantifier languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing strongly equivalent nonisomorphic models for unstable theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Scott and Karp trees of uncountable models / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ehrenfeucht-Fraisse-Game of Length ω 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary induction on abstract structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4732453 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recursion principle for linear orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3669469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cantor-Bendixson theorem for the space ${ω_1}^{ω_1}$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to infinitary languages / rank
 
Normal rank

Latest revision as of 13:06, 22 May 2024

scientific article
Language Label Description Also known as
English
Game-theoretic inductive definability
scientific article

    Statements

    Game-theoretic inductive definability (English)
    0 references
    0 references
    17 February 1994
    0 references
    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.
    0 references
    0 references
    0 references
    0 references
    0 references
    inductive definability
    0 references
    induction along non-well-founded trees
    0 references
    abstract Kleene Theorem
    0 references
    Stage-Comparison Theorem
    0 references
    Reduction Theorem
    0 references
    0 references
    0 references