✦ LIBER ✦

Quantum logic of quantifiers

✍ Scribed by Heinz-Martin Denecke

Publisher: Springer Netherlands
Year: 1977
Tongue: English
Weight: 402 KB
Volume: 6
Category: Article
ISSN: 0022-3611
DOI: 10.1007/bf00262077

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pure Logic with Branched Quantifiers

✍ Marcin Mostowski 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 267 KB

λ-Terms, logic, determiners and quantifi

λ-Terms, logic, determiners and quantifiers

✍ Fairouz Kamareddine 📂 Article 📅 1992 🏛 Springer Netherlands 🌐 English ⚖ 973 KB

In this paper, a theory TH based on combining type freeness with logic is introduced and is then used to build a theory of properties which is applied to determiners and quantifiers.

Quantified coalition logic

✍ Thomas Ågotnes; Wiebe van der Hoek; Michael Wooldridge 📂 Article 📅 2008 🏛 Springer Netherlands 🌐 English ⚖ 303 KB

Predicate provability logic with non-mod

Predicate provability logic with non-modalized quantifiers

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

A quantified logic of evidence

✍ Melvin Fitting 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 400 KB

Quantified Computation Tree Logic

✍ A.C. Patthak; I. Bhattacharya; A. Dasgupta; Pallab Dasgupta; P.P. Chakrabarti 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 109 KB

Computation Tree Logic (CTL) is one of the most syntactically elegant and computationally attractive temporal logics for branching time model checking. In this paper, we observe that while CTL can be verified in time polynomial in the size of the state space times the length of the formula, there is