The following pages link to Alan Rose (Q775345):
Displaying 50 items.
- An alternative generalisation of the concept of duality (Q775346) (← links)
- Self-dual binary and ternary connectives for \(m\)-valued propositional calculi (Q775685) (← links)
- Simplified formalisations of fragments of the propositional calculus (Q1224080) (← links)
- On the use of a complex (quaternion) velocity potential in three dimensions (Q2648592) (← links)
- Completeness of Lukasiewicz-Tarski propositional calculi (Q2648957) (← links)
- Conditioned disjunction as a primitive connective for the \(m\)-valued propositional calculus (Q2649134) (← links)
- A lattice-theoretic characterisation of the \(\aleph_0\)-valued propositional calculus (Q2649203) (← links)
- Systems of logic whose truth-values form lattices (Q2649513) (← links)
- The degree of completeness of a partial system of the 2-valued propositional calculus (Q2649879) (← links)
- A formalisation of Post's \(m\)-valued propositional calculus (Q2650389) (← links)
- Fragments of the \(m\)-valued propositional calculus (Q2651198) (← links)
- Self-dual primitives for modal logic (Q2651239) (← links)
- Some self-dual primitive functions for propositional calculi (Q2651240) (← links)
- A formalisation of the 2-valued propositional calculus with self-dual primitives (Q2651573) (← links)
- (Q3226742) (← links)
- A Gödel theorem for an infinite-valued. Erweiterter Aussagenkalkül (Q3228602) (← links)
- A single axiom for a partial system of the propositional calculus (Q3230351) (← links)
- (Q3235348) (← links)
- (Q3235349) (← links)
- An alternative formalisation of Sobociński's three‐valued implicational propositional calculus (Q3238328) (← links)
- Some formalisations of N<sub>0</sub>‐valued propositional calculi (Q3238329) (← links)
- Fragments of Many-Valued Statement Calculi (Q3256302) (← links)
- (Q3256305) (← links)
- (Q3257124) (← links)
- (Q3259701) (← links)
- (Q3260569) (← links)
- (Q3264476) (← links)
- A High Speed Parallel Adder (Q3266658) (← links)
- The use of universal decision elements as flip‐flops (Q3269474) (← links)
- Applications of logical computers to the construction of electrical control tables for signalling frames (Q3269507) (← links)
- Further Applications of Logical Computers to the Construction of Electrical Control Tables For Signalling Frames (Q3272801) (← links)
- (Q3284601) (← links)
- An extension of a theorem of margaris (Q3293393) (← links)
- SCOMPLETENESS OF SETS OF THREE-VALUED SHEFFER FUNCTION (Q3325695) (← links)
- (Q3701401) (← links)
- A GENERALISATION OF SLUPECKI'S CRITERION FOR FUNCTIONAL COMPLETENESS (Q3705425) (← links)
- GENERALISED FUNCTIONAL COMPLETENESS OF SETS OFm-VALUED SHEFFER FUNCTIONS (Q3705426) (← links)
- A Relationship Between Ordinary Functional Completeness and a Generalisation of the Concept (Q3770500) (← links)
- A Strongly Complete Formalisation of a 5-Valued Propositional Calculus (Q3770501) (← links)
- A Formalisation, Using non-Standard Rules, of A 5-Valued Propositional Calculus (Q3784050) (← links)
- A Simplified Self <i>m</i>‐AL Set of Primitive Functors for the <i>m</i>‐Valued Propositional Calculus (Q3843600) (← links)
- (Q3919676) (← links)
- A Generalisation of the Concept of Functional Completeness and Applications to Modus Ponens (Q3964529) (← links)
- (Q4065509) (← links)
- A note on the existence of tautologies without constants (Q4067057) (← links)
- Formalisations With Non‐Standard Degrees of Completeness (Q4108289) (← links)
- A Note on the Existence of Tautologies in Certain Propositional Calculi Without Propositional Variables (Q4109640) (← links)
- A Note on Formalisation by the Method of Description of Truth-Tables (Q4174673) (← links)
- (Q4174674) (← links)
- (Q4175253) (← links)
