Nuprl Definition : rv-unbounded
(X[n]⟶∞ as n⟶∞) == λs.∀B:ℚ. ∃n:ℕ. ∀m:ℕ. ((n ≤ m) ⇒ (B ≤ (X[m] s)))
Definitions occuring in Statement :
qle: r ≤ s,
rationals: ℚ,
nat: ℕ,
le: A ≤ B,
all: ∀x:A. B[x],
exists: ∃x:A. B[x],
implies: P ⇒ Q,
apply: f a,
lambda: λx.A[x]
FDL editor aliases :
rv-unbounded
Latex:
(X[n]{}\mrightarrow{}\minfty{} as n{}\mrightarrow{}\minfty{}) == \mlambda{}s.\mforall{}B:\mBbbQ{}. \mexists{}n:\mBbbN{}. \mforall{}m:\mBbbN{}. ((n \mleq{} m) {}\mRightarrow{} (B \mleq{} (X[m] s)))
Date html generated:
2016_05_15-PM-11_50_37
Last ObjectModification:
2008_02_27-PM-05_49_52
Theory : randomness
Home
Index