✦ LIBER ✦

A Proof Dedicated Meta-Language

✍ Scribed by David Delahaye

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 174 KB
Volume: 70
Category: Article
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)80508-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A meta-algorithmic language

✍ V. F. Turchin 📂 Article 📅 1968 🏛 Springer US 🌐 English ⚖ 972 KB

Language and proof theory

✍ Dov Gabbay; Ruth Kempson 📂 Article 📅 1996 🏛 Springer Netherlands 🌐 English ⚖ 321 KB

A high-level language architecture for t

A high-level language architecture for time-critical dedicated microprocessing

✍ V Milutinovic; K Waldschmidt 📂 Article 📅 1983 🏛 Elsevier Science ⚖ 624 KB

Two proof methods for the GRAFCET langua

Two proof methods for the GRAFCET language

✍ P Le Parc; B Queguineur; L Marcé 📂 Article 📅 1994 🏛 Elsevier Science ⚖ 473 KB

Remarks on formal languages for writing

Remarks on formal languages for writing proofs

✍ K. P. Vershinin 📂 Article 📅 1974 🏛 Springer US 🌐 English ⚖ 322 KB

A proof of Simon's theorem on piecewise

A proof of Simon's theorem on piecewise testable languages

✍ Peter M. Higgins 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 587 KB

We give a new proof of the Theorem of I. Simon that a language is piecewise testable if and only if it is recognized by a finite F-trivial monoid. Our proof is based on representations by certain types of decreasing mappings.