𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Validity Measurement in Some Propositional Logics

✍ Scribed by Branislav Boričić

Publisher
John Wiley and Sons
Year
1997
Tongue
English
Weight
501 KB
Volume
43
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

The language of the propositional calculus is extended by two families of propositional probability operators, inductively applicable to the formulae, and the set of all formulae provable in an arbitrary superintuitionistic propositional logic is extended by the probability measure axioms concerning those probability operators. A logical system obtained in such a way, similar to a kind of polymodal logic, makes possible to express a probability measure of truthfulness of any formula. The paper contains a description of the Kripke‐type possible worlds semantics covering the considered logical systems, being followed by the corresponding completeness results.

📜 SIMILAR VOLUMES

Cut-free tableau calculi for some propos
Cut-free tableau calculi for some propositional normal modal logics
✍ Martin Amerbauer 📂 Article 📅 1996 🏛 Springer Netherlands 🌐 English ⚖ 700 KB

We give sound and complete tableau and sequent calculi for the propositional normal modal logics $4.04, K4B and G O (these logics axe the smallest normal modal logics containing K and the schemata [:]A -+ ODA, DA --+ A and D<)DA --+ (A --+ DA) ; DA -+ D[]A and A -+ D<>A ; DA --+ D[qA and D(D(A --+ D

Some applications of propositional logic
Some applications of propositional logic to cellular automata
✍ Stefano Cavagnetto 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB

## Abstract In this paper we give a new proof of Richardson's theorem [31]: a global function __G__~𝔸~ of a cellular automaton 𝔸 is injective if and only if the inverse of __G__~𝔸~ is a global function of a cellular automaton. Moreover, we show a way how to construct the inverse cellular automaton