Nuprl Lemma : decidable-ses-fresh-sequence

∀f:SecurityData ⟶ (Atom1?). ∀A:Id. ∀pas:ProtocolAction List.  Dec(ses-fresh-sequence(f;A;pas))


Proof




Definitions occuring in Statement :  ses-fresh-sequence: ses-fresh-sequence(f;A;pas),  protocol-action: ProtocolAction,  sdata: SecurityData,  Id: Id,  list: T List,  atom: Atom$n,  decidable: Dec(P),  all: ∀x:A. B[x],  unit: Unit,  function: x:A ⟶ B[x],  union: left + right
Definitions unfolded in proof :  all: ∀x:A. B[x],  pa-is-sign-implies: pa-is-sign-implies(a;v.P[v]),  pa-is-new-and: pa-is-new-and(a;v.P[v]),  ses-fresh-sequence: ses-fresh-sequence(f;A;pas),  member: t ∈ T,  uall: ∀[x:A]. B[x],  so_lambda: λ2x.t[x],  int_seg: {i..j-},  uimplies: b supposing a,  guard: {T},  lelt: i ≤ j < k,  and: P ∧ Q,  decidable: Dec(P),  or: P ∨ Q,  satisfiable_int_formula: satisfiable_int_formula(fmla),  exists: ∃x:A. B[x],  false: False,  implies: P ⇒ Q,  not: ¬A,  top: Top,  prop: ℙ,  less_than: a < b,  squash: ↓T,  pi1: fst(t),  pi2: snd(t),  subtype_rel: A ⊆r B,  so_apply: x[s],  cand: A c∧ B

Latex:
\mforall{}f:SecurityData  {}\mrightarrow{}  (Atom1?).  \mforall{}A:Id.  \mforall{}pas:ProtocolAction  List.    Dec(ses-fresh-sequence(f;A;pas))



Date html generated: 2016_05_17-PM-00_38_52
Last ObjectModification: 2016_01_18-AM-07_42_23

Theory : event-logic-applications


Home Index