Game-theoretic inductive definability (Q1314543): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| 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 | |||
Revision as of 22:58, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Game-theoretic inductive definability |
scientific article |
Statements
Game-theoretic inductive definability (English)
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
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
