The rule of procedure Re in ukasiewicz's many-valued propositional calculi
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.
- The sentential calculus using rule of inference Re
- scientific article; zbMATH DE number 3847364 (Why is no real title available?)
- scientific article; zbMATH DE number 3875236 (Why is no real title available?)
- Replacing Modus Ponens With One-Premiss Rules
- scientific article; zbMATH DE number 3926885 (Why is no real title available?)
- A Formalisation, Using non-Standard Rules, of A 5-Valued Propositional Calculus
- scientific article; zbMATH DE number 124098 (Why is no real title available?)
- scientific article; zbMATH DE number 169734 (Why is no real title available?)
- scientific article; zbMATH DE number 1018725 (Why is no real title available?)
- On an Axiomatic System of the Infinitely Many‐Valued Threshold Predicate Calculi
- Axiomatic rejection in the implicational-negational invariant sentential calculi of Łukasiewicz
This page was built for publication: The rule of procedure Re in \({\L}ukasiewicz's\) many-valued propositional calculi
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1076008)