The rule of procedure Re in \({\L}ukasiewicz's\) many-valued propositional calculi (Q1076008)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3952720
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The rule of procedure Re in \({\L}ukasiewicz's\) many-valued propositional calculi |
scientific article; zbMATH DE number 3952720 |
Statements
The rule of procedure Re in \({\L}ukasiewicz's\) many-valued propositional calculi (English)
0 references
1985
0 references
In this paper several complete axiomatizations of \({\L}ukasiewicz's\) \(\aleph_ 0\)-valued and m-valued propositional calculuses are defined in which C and N are the only primitive functors and the sole primitive rule of inference is the rule Re, that when P, Q, R are formulas and S is the result of replacing one occurrence of the subformula CPQ in R by Q, if P and R are correct formulas, then S is a correct formula. Modus ponens is a special case of this rule. For the infinite-valued systems independence of axioms is proved by means of matrices.
0 references
complete axiomatizations
0 references
0.812554657459259
0 references
0.8099608421325684
0 references
