Intro to Advanced Math (LN)
... In our definition of new propositions based on old ones, we didn’t need to know what the old propositions meant. That is, we didn’t need to know what their truth values were. We just exhausted the collection of all combination of values those propositions could have, and determined the value of the ...
... In our definition of new propositions based on old ones, we didn’t need to know what the old propositions meant. That is, we didn’t need to know what their truth values were. We just exhausted the collection of all combination of values those propositions could have, and determined the value of the ...
Uniformities and uniformly continuous functions on locally
... Using the left uniform discreteness of A and passing to a smaller neighbourhood if necessary, we can assume without loss of generality that V is a symmetric neighbourhood of the identity such that the left translates oV2 and bV2 are disjoint whenever a, b € A and a / b. One can choose a left uniform ...
... Using the left uniform discreteness of A and passing to a smaller neighbourhood if necessary, we can assume without loss of generality that V is a symmetric neighbourhood of the identity such that the left translates oV2 and bV2 are disjoint whenever a, b € A and a / b. One can choose a left uniform ...
PDF
... 3 Theorem (Moses). Let R be a computable relation on the domain of a computable linear ordering L. Then R is either definable by a quantifier-free formula with constants from L (in which case it is intrinsically computable) or not intrinsically computable. Another approach to the study of relations ...
... 3 Theorem (Moses). Let R be a computable relation on the domain of a computable linear ordering L. Then R is either definable by a quantifier-free formula with constants from L (in which case it is intrinsically computable) or not intrinsically computable. Another approach to the study of relations ...