MM Bonsangue 07-10-1996
... programming language is a formal notation, its semantics can be seen as a translation of a formal system into another one. The need for a formal semantics of a programming language can thus be rephrased as the need for a suitable mathematical structure closer to our computational intuition. From thi ...
... programming language is a formal notation, its semantics can be seen as a translation of a formal system into another one. The need for a formal semantics of a programming language can thus be rephrased as the need for a suitable mathematical structure closer to our computational intuition. From thi ...
HYPERBOLIZATION OF POLYHEDRA
... (X, f) satisfies (C2), similar remarks hold with Z/2 coefficients. We have therefore, proved the following result. (ld.l) Lemma [W, p. 323]. (i) // (X9 f) satisfies (C2), then the map fL+: H^XAL Z/2) -> i/,(L Z/2) w # , ( £ ; A) is
on ...
... (X, f) satisfies (C2), similar remarks hold with Z/2 coefficients. We have therefore, proved the following result. (ld.l) Lemma [W, p. 323]. (i) // (X9 f) satisfies (C2), then the map fL+: H^XAL Z/2) -> i/,(L Z/2) w
arXiv:math/0201251v1 [math.DS] 25 Jan 2002
... closure is taken in C(X, X) with the compact open topology). Consequently, the space of orbit closures under h forms an uppersemicontinuous decomposition of X ( compatible with the Hausdorf metric) into compacta each of which is a topological abelian group ( Theorem 5). One difficulty created by the ...
... closure is taken in C(X, X) with the compact open topology). Consequently, the space of orbit closures under h forms an uppersemicontinuous decomposition of X ( compatible with the Hausdorf metric) into compacta each of which is a topological abelian group ( Theorem 5). One difficulty created by the ...
COMPACTIFICATIONS WITH DISCRETE REMAINDERS all
... O. Recall that 4>X is the smallest perfect compactification of X and that ßX , the Stone-Cech compactification, is the largest perfect compactification. See [9], [10], and [12] for properties of perfect compactifications. Also, 4>X is obtained from ßX by identifying the components of ßX - X to point ...
... O. Recall that 4>X is the smallest perfect compactification of X and that ßX , the Stone-Cech compactification, is the largest perfect compactification. See [9], [10], and [12] for properties of perfect compactifications. Also, 4>X is obtained from ßX by identifying the components of ßX - X to point ...
Monadic theory of order and topology, 1
... theory of chains. Under some set-theoretic assumptions"X is countable" is expressible in countably complete chains (see [5]) which implies categoricity and finite axiomatizability of the real line in monadic logic. Modest spaces are defined in w A chain M is perfunctorily n-modest itt it has no jump ...
... theory of chains. Under some set-theoretic assumptions"X is countable" is expressible in countably complete chains (see [5]) which implies categoricity and finite axiomatizability of the real line in monadic logic. Modest spaces are defined in w A chain M is perfunctorily n-modest itt it has no jump ...