Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

The Axiomatization of Propositional Logic

100%

Giero M.

Formalized Mathematics

2016

tom 24

nr 4

281-290

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 are proved. The proof of the completeness theorem is carried out by a counter-model existence method. In order to prove the completeness theorem, Lindenbaum’s Lemma is proved. Some most widely used tautologies are presented.

Ograniczanie wyników

1 Formalized Mathematics

1 Giero M.

1 2016

Wyniki wyszukiwania

The Axiomatization of Propositional Logic