✦ LIBER ✦

Normal predicative logics with graded modalities

✍ Scribed by Francesco Caro

Publisher: Springer Netherlands
Year: 1988
Tongue: English
Weight: 571 KB
Volume: 47
Category: Article
ISSN: 0039-3215
DOI: 10.1007/bf00374048

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

General canonical models for graded norm

General canonical models for graded normal logics (graded modalities IV)

✍ C. Cerrato 📂 Article 📅 1990 🏛 Springer Netherlands 🌐 English ⚖ 590 KB

Decidability by filtrations for graded n

Decidability by filtrations for graded normal logics (graded modalities V)

✍ Claudio Cerrato 📂 Article 📅 1994 🏛 Springer Netherlands 🌐 English ⚖ 768 KB

Predicate provability logic with non-mod

Predicate provability logic with non-modalized quantifiers

✍ Giorgie Dzhaparidze 📂 Article 📅 1991 🏛 Springer Netherlands 🌐 English ⚖ 585 KB

An Infinitary Graded Modal Logic (Graded

An Infinitary Graded Modal Logic (Graded Modalities VI)

✍ Maurizio Fattorosi-Barnaba; Silvano Grassotti 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 951 KB

We prove a completeness theorem for K:l , the infinitary extension of the graded version K O of the minimal normal logic K , allowing conjunctions and disjunctions of countable sets of formulas. This goal is achieved using both the usual tools of the normal logics with graded modalities and the mach

“Everywhere” in predicate algebra and mo

“Everywhere” in predicate algebra and modal logic

✍ Rutger M. Dijkstra 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 574 KB

Modal sequents for normal modal logics

✍ Claudio Cerrato 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 433 KB

## Abstract We present sequent calculi for normal modal logics where modal and propositional behaviours are separated, and we prove a cut elimination theorem for the basic system K, so as completeness theorems (in the new style) both for K itself and for its most popular enrichments. MSC: 03B45, 03