A Formalisation of an ℵ0-Valued Propositional Calculus with Variable Functors
✍ Scribed by John Jones
- Publisher
- John Wiley and Sons
- Year
- 1982
- Tongue
- English
- Weight
- 272 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
✦ Synopsis
A FORMALISATION O F AN N,-VALUED PROPOSITIONAL CALCULUS WITH VARIABLE FUNCTORS by JOHN JONES in Nottingham (Great Britain) There has been given in [ 2 ] a complete formalisation of the ni-valued ( 2 ?H < N,)
propositional calculus with 1 designated truth-value in which the primitive symbols are propositional variables and variable functors which may take values from the set (C. C'>, where C denotes the primitive implication functor of EUKASIEWICZ (see [ l ] ) and C'PQ = CQP. The object of this paper is to give a formalisation of the corresponding ti,-valued propositional calculus.
The present formalisation uses the following ten axiom schemes and one primitive rule of procedure. The syntactical variables P, Q, . . . ; A , A, . . . denote formulae and variable functors respectively,
📜 SIMILAR VOLUMES
The m-valued propositional calculi of POST') with one designated truth-value have been formalised2) by means of ten axioms and the rules of substitution and modus ponens. However, in view of the definition of the functor "=" as a conjunction, several axioms may be regarded as sets of m axioms. The o
A FORMALlSATlON OF THE TYI -VALUED LUKASIEWICZ Ii\lPLICATIONAL YItOPOSlTIONAL CALCULUS WITH VARIABLE FUNCTORS by ALAN ROSE in Not,tingham (England) It has been shown1) that the m-valued LUKASIEWICZ implicational proposit,ioiial calculus with one designated truth-value may be fomialised by means of