✦ LIBER ✦

Two normal form theorems for CSP programs

✍ Scribed by K.R. Apt; Luc Bougé; Ph. Clermont

Book ID: 113162975
Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 908 KB
Volume: 26
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(87)90001-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Impossibility theorems for normal form g

Impossibility theorems for normal form games

✍ David Squires 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 96 KB

A normal form theorem for label grammars

✍ Matthias Jantzen; Manfred Opp 📂 Article 📅 1981 🏛 Springer 🌐 English ⚖ 956 KB

The Jordan normal form; decomposition th

The Jordan normal form; decomposition theorem for modules

✍ J. L. Brenner 📂 Article 📅 1964 🏛 Springer 🌐 English ⚖ 265 KB

A three-restricted normal form theorem f

A three-restricted normal form theorem for ETOL languages

✍ Takashi Yokomori; Derick Wood; Klaus-Jörn Lange 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 488 KB

On two duality theorems for continuous p

On two duality theorems for continuous programming problems

✍ William F Tyndall 📂 Article 📅 1970 🏛 Elsevier Science 🌐 English ⚖ 387 KB

A local normal form theorem for infinita

A local normal form theorem for infinitary logic with unary quantifiers

✍ H. Jerome Keisler; Wafik Boulos Lotfallah 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 152 KB

We prove a local normal form theorem of the Gaifman type for the infinitary logic L∞ω(Q u ) ω whose formulas involve arbitrary unary quantifiers but finite quantifier rank. We use a local Ehrenfeucht-Fraïssé type game similar to the one in [9]. A consequence is that every sentence of L∞ω(Q u ) ω of