Nuprl Theory formula_satisfaction

(only non hidden objects are presented)

DISPformula_sat_df<a:Assignment:L> |= <F:Formula:L> == <a> |= <F>
ABSformula_sata |= F == (F under a) = 3
THMformula_sat_wfa:Assignment. F:Formula. a |= F
THMsq_stable__formula_sata:Assignment. F:Formula. SqStable(a |= F )
THMdecidable__formula_sata:Assignment. f:Formula. Dec(a |= f )

the other theories