✦ LIBER ✦

A program for the semantics of science

✍ Scribed by Mario Bunge

Publisher: Springer Netherlands
Year: 1972
Tongue: English
Weight: 691 KB
Volume: 1
Category: Article
ISSN: 0022-3611
DOI: 10.1007/bf00255564

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Formal Semantics for Program Paths

✍ Karl Lermer; Colin Fidge; Ian Hayes 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 230 KB

A Coalgebraic Semantics for Epistemic Pr

A Coalgebraic Semantics for Epistemic Programs

✍ Alexandru Baltag 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 256 KB

A Process Semantics for Functional Progr

A Process Semantics for Functional Programming

✍ Simon Brock; Gerald Ostheimer 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 335 KB

A true concurrency semantics for paralle

A true concurrency semantics for parallel programs

✍ Tatjana Kapus; Bogomir Horvat; Marjeta Pučko 📂 Article 📅 1993 🏛 Elsevier Science ⚖ 348 KB

A kripke-kleene semantics for logic prog

A kripke-kleene semantics for logic programs*

✍ Melvin Fitting 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 895 KB

We use a language L in which we have the propositional connectives A (and), V (or), and -i (not) as primitive. Alternatively we could take some as primitive and define others via the usual definitions, which work even in Kleene's three-valued logic. We also allow quantifiers V and 3, taking both as

A semantic basis for the termination ana

A semantic basis for the termination analysis of logic programs

✍ Michael Codish; Cohavit Taboch 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 287 KB

This paper presents a formal semantic basis for the termination analysis of logic programs. The semantics exhibits the termination properties of a logic program through its binary unfoldings ± a possibly in®nite set of binary clauses. Termination of a program P and goal G is determined by the absenc