✦ LIBER ✦

Axiomatisability problems forS-posets

✍ Scribed by Victoria Gould; Lubna Shaheen

Book ID: 105928116
Publisher: Springer
Year: 2010
Tongue: English
Weight: 924 KB
Volume: 82
Category: Article
ISSN: 0037-1912
DOI: 10.1007/s00233-010-9273-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Axiomatisability problems forS-acts, rev

Axiomatisability problems forS-acts, revisited

✍ Lubna Shaheen 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 797 KB

Axiomatisability Problems for S-Systems

✍ Gould, V. 📂 Article 📅 1987 🏛 Oxford University Press 🌐 English ⚖ 199 KB

Banaschewski’s theorem forS-posets: regu

Banaschewski’s theorem forS-posets: regular injectivity and completeness

✍ M. M. Ebrahimi; M. Mahmoudi; H. Rasouli 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 382 KB

Two combinatorial problems on posets

✍ Yair Caro 📂 Article 📅 1996 🏛 Springer Netherlands 🌐 English ⚖ 367 KB

Bialostocki proposed the following problem: Let n 2 k 2 2 be integers such that k/n. Let p(n, k) denote the least positive integer having the property that for every poset P, IPI > p(n, k) and every &coloring f: P + & there exists either a chain or an antichain A, (Al = n and xaEA f(a) = 0 (modk). E

The poset scheduling problem

✍ Gerard J. Chang; Jack Edmonds 📂 Article 📅 1985 🏛 Springer Netherlands 🌐 English ⚖ 303 KB

Greedy posets for the bump-minimizing pr

Greedy posets for the bump-minimizing problem

✍ Nejib Zaguia 📂 Article 📅 1987 🏛 Springer Netherlands 🌐 English ⚖ 678 KB