✦ LIBER ✦

A note on Kripke semantics for residuated logic

✍ Scribed by Wendy MacCaull

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 399 KB
Volume: 77
Category: Article
ISSN: 0165-0114
DOI: 10.1016/0165-0114(95)00085-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Kripke-style semantics for many-valued l

Kripke-style semantics for many-valued logics

✍ Franco Montagna; Lorenzo Sacchetti 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 192 KB

## Abstract This paper deals with Kripke‐style semantics for many‐valued logics. We introduce various types of Kripke semantics, and we connect them with algebraic semantics. As for modal logics, we relate the axioms of logics extending MTL to properties of the Kripke frames in which they are valid

Corrigendum to “Kripke-style semantics f

Corrigendum to “Kripke-style semantics for many-valued logics”

✍ Franco Montagna; Lorenzo Sacchetti 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 90 KB

## Abstract This note contains a correct proof of the fact that the set of all first‐order formulas which are valid in all predicate Kripke frames for Hájek's many‐valued logic BL is not arithmetical. The result was claimed in [5], but the proof given there was incorrect. (© 2003 WILEY‐VCH Verlag G

On Fuzzy Logic II. Enriched residuated l

On Fuzzy Logic II. Enriched residuated lattices and semantics of propositional calculi

✍ Jan Pavelka 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 805 KB

For instance, the consequence gy(,,, \*,O of the empty L-fuzzy set Op = 0, 'p E P ( P , L,A) is an L-fuzzy subset of F ( P , L, A ) , which assigns to every 'p E F ( P , L, A ) its tautological degree (%9(P,&)O) 'p E L.

A note on the stable model semantics for

A note on the stable model semantics for logic programs

✍ Michael Kaminski 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 900 KB

The stable model semantics for logic programs is extended from ground literals onto open literals by augmenting the program language with an infinite set of new constants. This, in turn, leads to a natural translation of logic programs into open default theories. @

A residualizing semantics for the partia

A residualizing semantics for the partial evaluation of functional logic programs

✍ Elvira Albert; Michael Hanus; Germán Vidal 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 103 KB

Recent proposals for multi-paradigm declarative programming combine the most important features of functional, logic and concurrent programming into a single framework. The operational semantics of these languages is usually based on a combination of narrowing and residuation. In this paper, we intr