Remez inequality: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>Bbukh
m →‎Extensions: Nazarov-Turan Lemma: En-dash, and accent on Turán
en>Trappist the monk
m →‎References: Remove redundant |year= parameter from CS1 citations; using AWB
 
Line 1: Line 1:
{{Unreferenced|date=December 2008}}In [[mathematics]], specifically [[set theory]], a '''''tail sequence''''' is an [[unbounded]] sequence of contiguous ordinals. Formally, let β be a limit ordinal. Then a γ-sequence <math>s \equiv \langle s_{\alpha}| \alpha < \gamma\rangle</math> is a '''''tail sequence''''' in β if there exists an ε < β such that ''s'' is a [[normal function|normal sequence]] assuming all values in <math>\beta \setminus \epsilon.</math>
Hi there. Allow me start by introducing the author, her name is Sophia. I am truly fond of to go to karaoke but I've been taking on new things lately. My wife and I live in Kentucky. Office supervising is what she does for a residing.<br><br>My weblog: [http://203.250.78.160/zbxe/?document_srl=1792908 psychic readings]
 
[[Category:Set theory]]
 
{{settheory-stub}}

Latest revision as of 22:41, 25 December 2014

Hi there. Allow me start by introducing the author, her name is Sophia. I am truly fond of to go to karaoke but I've been taking on new things lately. My wife and I live in Kentucky. Office supervising is what she does for a residing.

My weblog: psychic readings