Nuprl Definition : guarded_permutation
guarded_permutation(T;P) == (λL1,L2. ∃i:ℕ||L1|| - 1. ((P L1 i) ∧ (L2 = swap(L1;i;i + 1) ∈ (T List))))^*
Definitions occuring in Statement :
swap: swap(L;i;j),
length: ||as||,
list: T List,
rel_star: R^*,
int_seg: {i..j-},
exists: ∃x:A. B[x],
and: P ∧ Q,
apply: f a,
lambda: λx.A[x],
subtract: n - m,
add: n + m,
natural_number: $n,
equal: s = t ∈ T
Definitions occuring in definition :
rel_star: R^*,
lambda: λx.A[x],
exists: ∃x:A. B[x],
int_seg: {i..j-},
subtract: n - m,
length: ||as||,
and: P ∧ Q,
apply: f a,
equal: s = t ∈ T,
list: T List,
swap: swap(L;i;j),
add: n + m,
natural_number: $n
FDL editor aliases :
guarded_permutation
Latex:
guarded\_permutation(T;P) ==
(\mlambda{}L1,L2. \mexists{}i:\mBbbN{}||L1|| - 1. ((P L1 i) \mwedge{} (L2 = swap(L1;i;i + 1))))\^{}*
Date html generated:
2016_05_15-PM-02_05_12
Last ObjectModification:
2015_09_23-AM-07_37_47
Theory : list!
Home
Index