Nonstandard analysis and axiom of determinateness (Q1346918)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Nonstandard analysis and axiom of determinateness |
scientific article |
Statements
Nonstandard analysis and axiom of determinateness (English)
0 references
20 April 1995
0 references
The paper investigates \(*\)-finite games in nonstandard methods. Using the compactness theorem, the authors create a rather complicated theory with a form of the axiom of determinateness for an infinitely large natural number \(N\) understood as a model for the set of natural numbers. This form of the axiom takes into account the beginning of the enter sequence of the game steps (containing all the standard steps). For enter sequences having the same beginnings, the resulting sequences having the same beginnings are obtained. The analogous property of ``target'' sets is not investigated. There is no example of a \(*\)-finite game in the paper. Suitable examples may increase the reader's understanding. Let us now use the common nonstandard analysis. By the transfer principle we know that every \(*\)-finite game has a \(*\)-finite winning strategy for one of the two players. The strategy determines exactly the following step of the game from the previous ones. Hence two enter sequences of the game steps of one player having the same beginnings determine two resulting sequences of the game having the same beginnings. For this reason I do not see any contribution of the paper.
0 references
nonstandard-finite
0 references
\(*\)-finite games in nonstandard methods
0 references
compactness theorem
0 references
axiom of determinateness for an infinitely large natural number
0 references
winning strategy
0 references