TPS A higher-order theorem proving system This page was created and is maintained by Chad E Brown. | Landau, Grundlagen der Analysis, Simple Type Theory Version, PersSYMMETRIC LAMBDA r(OAA) FORALL x(A) FORALL y(A).r x y IMPLIES r y x TRANSITIVE LAMBDA r(OAA) FORALL x(A) FORALL y(A) FORALL z(A).r x y AND r y z IMPLIES r x z PER LAMBDA r(OAA).SYMMETRIC(O(OAA)) r AND TRANSITIVE(O(OAA)) r | TPS A higher-order theorem proving system |