✦ LIBER ✦

Tarski's Fixpoint Lemma and combinatorial games

✍ Scribed by B. Banaschewski; A. Pultr

Publisher: Springer Netherlands
Year: 1991
Tongue: English
Weight: 683 KB
Volume: 7
Category: Article
ISSN: 0167-8094
DOI: 10.1007/bf00383202

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Counting Lemma and Multiple Combinator

A Counting Lemma and Multiple Combinatorial Stokes' Theorem

✍ Shyh-Nan Lee; Mau-Hsiang Shih 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 150 KB

We prove in the present paper a counting lemma for bipartite digraphs which is useful in the combinatorics of pseudomanifolds. By an application of the lemma, we prove a multiple combinatorial Stokes' theorem, generalizing the 1967 Ky Fan combinatorial formula to multiple labelings.

Combinatorial lemma and structure of a c

Combinatorial lemma and structure of a class of binary codes

✍ Al. A. Markov 📂 Article 📅 1970 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 230 KB