论文部分内容阅读
It is proved that there exists a formula of first-order logic with only one non-logical symbol, a binary function symbol Ap signifying application, which uniformly defines inclusion in all BF(E)-models Some definability results give an isomorphism between