An Axiomatisation of the Conditionals of Post's Many Valued Logics
β Scribed by Stan J. Surma
- Publisher
- John Wiley and Sons
- Year
- 1995
- Tongue
- English
- Weight
- 180 KB
- Volume
- 41
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
β¦ Synopsis
The paper provides a method for a uniform complete Hilbert-style axiomatisation of Post's (m, u)-conditionals and Post's negation, where rn is the number of truth values and u is the number of designated truth values (cf. [5]). The main feature of the technique which we employ in this proof generalises the well-known Kalmir Lemma which was used by its author in his completeness argument for the ordinary, twc-valued logic (cf. [2]).
π SIMILAR VOLUMES
Up to categorical equivalence, abelian lattice-ordered groups with strong unit coincide with Chang's MV-algebrasαthe Lindenbaum algebras of the infinite-valued Εukasiewicz calculus. While the property of being a strong unit is not definable even in first-order logic, MV-algebras form an equational c