A completeness theorem in the modal logic of programs
Krister Segerberg (1982)
Banach Center Publications
Similarity:
Krister Segerberg (1982)
Banach Center Publications
Similarity:
B. P. Alimpić (1968)
Matematički Vesnik
Similarity:
Božić, Milan (1985)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Daishi Yazaki (2019)
Bulletin of the Section of Logic
Similarity:
The main purpose of this paper is to give alternative proofs of syntactical and semantical properties, i.e. the subformula property and the nite model property, of the sequent calculi for the modal logics K4.3, KD4.3, and S4.3. The application of the inference rules is said to be acceptable, if all the formulas in the upper sequents are subformula of the formulas in lower sequent. For some modal logics, Takano analyzed the relationships between the acceptable inference rules and semantical...
Kosta Došen (1984)
Publications de l'Institut Mathématique
Similarity:
Mariusz Giero (2016)
Formalized Mathematics
Similarity:
This article introduces propositional logic as a formal system ([14], [10], [11]). The formulae of the language are as follows φ ::= ⊥ | p | φ → φ. Other connectives are introduced as abbrevations. The notions of model and satisfaction in model are defined. The axioms are all the formulae of the following schemes α ⇒ (β ⇒ α), (α ⇒ (β ⇒ γ)) ⇒ ((α ⇒ β) ⇒ (α ⇒ γ)), (¬β ⇒ ¬α) ⇒ ((¬β ⇒ α) ⇒ β). Modus ponens is the only derivation rule. The soundness theorem and the strong completeness theorem...
Markovic, Zoran (1981)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Došen, Kosta (1984)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Jan Štěpán (1989)
Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica
Similarity: