A description is provided of a method – the Set Equality Method (SEM) – to determine the validity, or lack of validity, of each categorical syllogism. A justification is given for the presentation of a new method to solve a problem which has already been solved using different approaches. First, the SEM assigns an equality of certain sets (or two of those equalities in specific cases as will be indicated) to each of the categorical propositions composing each syllogism considered – that is, to each of the two premises and to the conclusion. Each syllogism considered is valid if and only if a) it is possible to select one of those equalities corresponding to one of the premises such that one of its members is a certain set and the other of those equalities corresponding to the other premise such that one of its members is a subset of the set mentioned, and b) it is possible to deduce an equality corresponding to the conclusion of the two equalities corresponding to the premises. In some cases, as will be specified, it is possible to provide a second test for the validity of a syllogism whose validity was already proven, thus providing information about the logical form of categorical syllogisms.
A description is provided of how the Square Wave Method (SWM) can be applied to analyze sequences of bases of human DNA. The results obtained are displayed using the Square Wave Transform (SWT), an SWM tool. It is hypothesized that the results of this analysis can be of interest, in certain cases, to understand the functional role of some of those sequences. Preliminary data which make this hypothesis plausible are presented.
A description is provided of how the Square Wave Method (SWM) can be applied to analyze sequences of bases of human DNA. The results obtained are displayed using the Square Wave Transform (SWT), an SWM tool. It is hypothesized that the results of this analysis can be of interest, in certain cases, to understand the functional role of some of those sequences. Preliminary data which make this hypothesis plausible are presented.
A characterization is provided for each natural number except one (1) by means of an ordered pair of elements. The first element is a natural number called the type of the natural number characterized, and the second is a natural number called the order of the number characterized within those of its type. A one-to-one correspondence is specified between the set of binary trees such that a) a given node has no child nodes (that is, it is a terminal node), or b) it has exactly two child nodes. Thus, binary trees such that one of their parent nodes has only one child node are excluded from the set considered here.
A review is presented of the correspondence existing in both classical bivalent logic (BL) and canonical fuzzy logic (CFL) between each law or tautology in propositional calculus and a law in set theory. The latter law consists of the equality of a) a set whose structure is isomorphic to the law considered in propositional calculus and b) the universal set. In addition to the operations of CFL considered previously by the authors, initial attention is given to the operations with infinite sets by considering two of them: the union of sets and the intersection of sets. Attention is also given to how propositional calculus in BL can be considered a particular case of propositional calculus in CFL, and how the theory of classical sets can be considered a particular case of the theory of fuzzy sets according to CFL.
A Post-Quantum Encryption Approach (PQEA) is presented. Its main advantages are 1) its high level of efficiency and effectiveness, and 2) the simplicity of its development and use. In messages encrypted with the PQEA there are no visible patterns or regularities which could give any idea of the corresponding original messages.