𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A short proof of a well-known theorem of intuitionistic analysis

✍ Scribed by Horst Luckhardt


Publisher
John Wiley and Sons
Year
1975
Tongue
English
Weight
104 KB
Volume
21
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

✦ Synopsis


A SHORT PROOF O F A WELL-KNOWN THEOREM O F INTUITIONISTIC ANALYSIS by HORST LUCILHARDT in Frankfurt/Main (B.R.D.) The theorem in question is BROUWER'S fundamental statement on the continuum Theorem. Every closed interval oi the continuum coincides with a fan. HEYTINQ [l] p. 46 indicates a proof; but if it is carried out in detail, it becomes longer and longer. So VESLEY needs in [2] nearly two compact printed pages (*R10.2 on p. 162; *R6.21 and *R6.22 on p. 145-146). Their fan contains only canonical number-generators (c.n.g.) but -as simple examples showfor end points in general not all the c.n.g. belonging to them thus rendering the situation unnecessarily difficult.

Presupposing the terminology of HEYTINQ [l] we shall give R more direct proof which uses a natural fan containing a l l c.n.g. corresponding t o the interval considered and more (otherwise the fan species would be undecidable). This proof is based on tht. following lemma. that Lemma. For c.n.g. a = (an 2-111, b = (b, 2-,} and q 2 2 : Vm(a, + q < b,) c-) a < b .


πŸ“œ SIMILAR VOLUMES


A short proof of a theorem on Hamiltonia
✍ Ainouche, A. πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 219 KB πŸ‘ 2 views

In this note, w e give a short proof of a stronger version of the following theorem: Let G be a 2-connected graph of order n such that for any independent set {u, u , w}, then G is hamiltonian. 0 1996 John

A short proof of the Chen-Manalastas the
✍ J.A. Bondy πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 232 KB

Gallai and Milgram (1960) proved that a digraph with stability number ct is spanned by ct disjoint directed paths. Chen and Manalastas Jr (1983) proved that a strong digraph with stability number at most two is spanned by at most two consistent directed circuits. We slightly simplify the proof of

A short proof for a generalization of Vi
✍ Claude Berge; Jean Claude Fournier πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 183 KB πŸ‘ 1 views

## Abstract For a simple graph of maximum degree Ξ”, it is always possible to color the edges with Ξ” + 1 colors (Vizing); furthermore, if the set of vertices of maximum degree is independent, Ξ” colors suffice (Fournier). In this article, we give a short constructive proof of an extension of these re