A Proof of the Compactness Theorem

A note on the compactness theorem

✍ R. R. Rockingham Gill 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB 👁 1 views

Z t i b r h r . /. math. h p i k und G'rutdlagtn d . . M a . l i d . ZI, s. 3 7 7 -378 (1975) A NOTE Oh' THE COMPACTNESS THEOREM by R. R. ROCKINGHAM GILL in Lampeter, Wales (Great Britain) # 3. In conclusion, let us remark that, if wc read " a filtcbr" for " a n ultrafilter" and "HORN sentence" for

A Proof of Shirshov's Theorem

✍ Giuseppe Pirillo 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 188 KB

Sane copiosam tu et uberem messem ex hoc agro collegisti, nos pauculas spicas contemptas tibi potius quam non visas. Triumphus igutur hic omnis tuus est: mihi abunde satis si armillis aut hasta donatus, sequar hunc candidae famae tuae currum. wJustus Lipsius In this paper we prove that, except fo

Proof of the TCP Theorem

✍ Gerhart Lüders 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 122 KB

A comparatively simple proof is given for the general theorem that a wide class of quantized field theories which are invariant under the proper Lorentz group is also invariant with respect to the product of time reversal (T), charge conjugation (C), and parity (P). In the proof use is made of an im

A Geometric Proof of the Gap Theorem

✍ David S. Herscovici 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 185 KB

Hollmann, Ko rner, and Litsyn used generalized Steiner systems to prove that it is impossible to partition an n-cube into k Hamming spheres if 2<k<n+2. Furthermore, if k=n+2, they showed the only partition of the n-cube consists of a single sphere of radius n&2 and n+1 spheres of radius 0. We give a

A Proof of a Theorem of Tennenbaum

✍ Paul E. Howard 📂 Article 📅 1972 🏛 John Wiley and Sons 🌐 English ⚖ 123 KB 👁 1 views

A simple proof of Moser's theorem

✍ Zhu, Xuding 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 243 KB 👁 2 views

This article gives a simple proof of a result of Moser, which says that, for any rational number r between 2 and 3, there exists a planar graph G whose circular chromatic number is equal to r.