✦ LIBER ✦

Pure Logic with Branched Quantifiers

✍ Scribed by Marcin Mostowski

Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 267 KB
Volume: 35
Category: Article
ISSN: 0044-3050
DOI: 10.1002/malq.19890350106

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Predicate provability logic with non-mod

Predicate provability logic with non-modalized quantifiers

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

Characterizing Second Order Logic with F

Characterizing Second Order Logic with First Order Quantifiers

✍ David Harel 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 257 KB

CHARACTERIZING SECOND ORDER LOGIC WITH FIRST ORDER QU-4NTIFIERX by DAVID HAREL in Cambridge, Massachusets (U.S.A.) l) ') The author is indebted to W. J. WALKOE, A. R. MEYER, A. SHAMIR and a rcfeiee for comments on previous versions.

Quantified Modal Logic With Rigid Terms

✍ Giovanna Corsi 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 511 KB

QUANTIFIED MODAL LOGIC WITH NEIGHBORHOOD

QUANTIFIED MODAL LOGIC WITH NEIGHBORHOOD SEMANTICS

✍ Geir Waagbø; G. Waagbø 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 503 KB

## Abstract The paper presents a semantics for quantified modal logic which has a weaker axiomatization than the usual Kripke semantics. In particular, the Barcan Formula (BF) and its converse are not valid with the proposed semantics. Subclasses of models which validate BF and other interesting fo

Provability logics with quantifiers on p

Provability logics with quantifiers on proofs

✍ Rostislav E. Yavorsky 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 124 KB

We study here extensions of the Artemov's logic of proofs in the language with quantiÿers on proof variables. Since the provability operator A could be expressed in this language by the formula ∃u[u]A, the corresponding logic naturally extends the well-known modal provability logic GL. Besides, the

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