Acoustic wave equation: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
→‎Spherical coordinates: The wording was bad, so I added the word "solution".
 
en>Dicklyon
Line 1: Line 1:
Golda is what's written on my birth certification  [http://brazil.amor-amore.com/irboothe accurate psychic readings] even though it is not the title on my birth certification. One of the very best things in the globe for him  psychic phone ([http://www.seekavideo.com/playlist/2199/video/ http://www.seekavideo.com]) is performing ballet and he'll be beginning something else along with it. Distributing manufacturing has been his occupation for some time. Ohio is where her house is.<br><br>Stop by my webpage - certified psychics ([http://koreanyelp.com/index.php?document_srl=1798&mid=SchoolNews koreanyelp.com])
In [[descriptive set theory]], a '''lightface analytic game''' is a [[Determinacy#Games|game]] whose [[Determinacy#Games|payoff set]] ''A'' is a <math>\Sigma^1_1</math> [[subset]] of [[Baire space (set theory)|Baire space]]; that is, there is a [[Tree (descriptive set theory)|tree]] ''T'' on <math>\omega\times\omega</math> which is a [[computable]] subset of <math>(\omega\times\omega)^{<\omega}</math>, such that ''A'' is the projection of the set of all branches of ''T''.
 
The [[determinacy]] of all lightface analytic games is equivalent to the existence of [[Zero sharp|0<sup>#</sup>]].
 
[[Category:Effective descriptive set theory]]
[[Category:Determinacy]]
 
 
{{mathlogic-stub}}

Revision as of 07:12, 28 January 2014

In descriptive set theory, a lightface analytic game is a game whose payoff set A is a subset of Baire space; that is, there is a tree T on which is a computable subset of , such that A is the projection of the set of all branches of T.

The determinacy of all lightface analytic games is equivalent to the existence of 0#.


Template:Mathlogic-stub