𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Proof of the Characterization Theorem for Consequence Relations

✍ Scribed by Zvonimir Šikić

Publisher
John Wiley and Sons
Year
1991
Tongue
English
Weight
139 KB
Volume
37
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A simple proof for the matrix-geometric
A simple proof for the matrix-geometric theorem
✍ Latouche, Guy 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 239 KB 👁 2 views

## Abstract For block‐partitioned matrices of the __GI/M/__1 type, it has been shown by M. F. Neuts that the stationary probability vector, when it exists, has a matrix‐geometric form. We present here a new proof, which we believe to be the simplest available today.

A Geometric Proof of the Gap Theorem
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 short proof for a generalization of Vi
A short proof for a generalization of Vizing's theorem
✍ 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

A constructive proof of the Peter-Weyl t
A constructive proof of the Peter-Weyl theorem
✍ Thierry Coquand; Bas Spitters 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB 👁 1 views

We present a new and constructive proof of the Peter-Weyl theorem on the representations of compact groups. We use the Gelfand representation theorem for commutative C\*-algebras to give a proof which may be seen as a direct generalization of Burnside's algorithm [3]. This algorithm computes the cha

A Simpler Proof of the Excluded Minor Th
A Simpler Proof of the Excluded Minor Theorem for Higher Surfaces
✍ Carsten Thomassen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 223 KB

We give a simple proof of the fact (which follows from the Robertson Seymour theory) that a graph which is minimal of genus g cannot contain a subdivision of a large grid. Combining this with the tree-width theorem and the quasi-wellordering of graphs of bounded tree-width in the Robertson Seymour t