# Term Logic

*Keywords:*term logic; Franz Brentano; Lewis Carroll; logic trees; logic diagrams

Next Article in Journal

Next Article in Special Issue

Next Article in Special Issue

Previous Article in Journal

Previous Article in Special Issue

Previous Article in Special Issue

Department of Philosophy, Trinity College Dublin, College Green, Dublin 2, Ireland

Received: 19 December 2019
/
Revised: 5 February 2020
/
Accepted: 6 February 2020
/
Published: 10 February 2020

(This article belongs to the Special Issue Deductive Systems in Traditional and Modern Logic)

The predominant form of logic before Frege, the logic of terms has been largely neglected since. Terms may be singular, empty or plural in their denotation. This article, presupposing propositional logic, provides an axiomatization based on an identity predicate, a predicate of non-existence, a constant empty term, and term conjunction and negation. The idea of basing term logic on existence or non-existence, outlined by Brentano, is here carried through in modern guise. It is shown how categorical syllogistic reduces to just two forms of inference. Tree and diagram methods of testing validity are described. An obvious translation into monadic predicate logic shows the system is decidable, and additional expressive power brought by adding quantifiers enables numerical predicates to be defined. The system’s advantages for pedagogy are indicated.

A term logic is one in which the only categorematic expressions are terms, that is to say, nominal expressions. Examples of terms from ordinary language are: singular terms, such as ‘Socrates’, ‘the North Pole’, ‘Vulcan’; plural terms, such as ‘the Beatles’, ‘the signatories to the Geneva Convention’; and general terms, such as ‘planet’, ‘black dog’, ‘negatively charged particle’. From this, it will be seen that the presence or absence of a definite article makes no difference to whether an expression is a term or not. It will further be seen that terms may be simple or complex. In term logic itself, we will employ mainly term variables: there will be only two constant terms, given below. All other expressions in a term logic are formal, or what were once called syncategorematic. They are the logical constants needed to form sentences using terms, and such operators on terms as may form complex terms from simpler ones, and the logical connectives of propositional logic. Quantifiers will be added later.

The syllogistic of Aristotle and his successors was a term logic, as was that of such logical algebraists as Leibniz, Boole, Jevons, Venn and Neville Keynes. Term logic was augmented by relational expressions in De Morgan, Peirce and Schröder, but terms, except for singular terms, disappeared altogether from the predicate logic of Frege, Russell and their successors. An exception was the logical system of Leśniewski, who retained plural and general terms, though Leśniewski’s system was also a predicate logic rather than a purely term logic. Term logic is a very natural medium for representing many inferences of ordinary discourse, more natural indeed than standard predicate logic. Though it has much less expressive power than predicate logic, being in its elementary form equivalent to monadic predicate calculus, it has much to recommend it from a pedagogical point of view, a fact recognised by Łukasiewicz, whose university textbook Elements of Mathematical Logic [1] augmented propositional calculus not with predicate calculus but with Aristotelian syllogistic.

The grammar of our language will be categorial, with two basic categories: sentence (s) and term (n). (It is standard in categorial grammars to notate the nominal category by ‘n’ for ‘name’ rather than ‘t’ for ‘term’. We are following this tradition notationally, though we call the category by the older expression ‘term’.) A functor category, the category of functor expressions taking arguments of categories β_{1}, …, β_{n} as arguments and forming an expression of category α, will be denoted as α⟨β_{1} … β_{n}⟩.

The Table 1 Basic Vocabulary below gives the basic expression used, together with their syntactic categories, categorial indices, and how we describe them.

The intended meanings of the term-logical constants are given in the Table 2 below:

In the interest of simplicity and brevity of expression, we delicately abuse the use/mention distinction and do not introduce special metavariables.

Any term variable or term constant is a term

If a is a term, so is (a)′

If a and b are terms, so is (ab)

Nothing else is a term except as allowed by definitions.

If a and b are terms, a = b is a sentence

If a is a term, Na is a sentence

If p is a sentence, so is ~(p)

If p and q are sentences, so are (p ∧ q), (p ∨ q), (p → q) and (p ↔ q)

Nothing else is a sentence except as allowed by definitions.

We will omit parentheses where no ambiguity results. Propositional connectives are assumed to bind in the order negation, conjunction, disjunction, implication, equivalence.

We presuppose without mention axioms sufficient for classical bivalent propositional logic, with substitution and modus ponens as inference rules.

for = ID a = a (Identity) LEIB a = b → (p[a] → p[b]) (Leibniz) |

Self-identity and Leibniz’s Law are standardly characteristic of identity.

for = and term conjunction IDEM aa = a (Idempotence) COMM ab = ba (Commutativity) ASSOC a(bc) = (ab)c (Associativity) |

For idempotence: to be an a which is an a is the same thing as to be an a

For commutativity: to be an a which is a b is the same thing as to be a b which is an a

For associativity: to be an a which is a (b which is a c) is the same thing as to be an (a which is a b) which is a c.

for = and ’ DN a’’= a (Term Double Negation) |

To be a non-non-a is the same thing as to be an a.

for =, ’ and term conjunction DIST a(bc)’ = ((ab’)’(ac’)’)’ (Distribution) |

This is the least self-evident of our axioms. It can be made more evident by considering an empty Venn or Carroll diagram for three terms and their negations: the three out of eight cells indicated by the left-hand side of the identity are the same as those picked out by the right-hand side, namely the cells for abc’, ab’c and ab’c’. Given the De Morgan definition of Term Addition ADD below, it permits the derivation of the desirable distribution laws DIST1 and DIST2 below.

for N and Λ HEID NΛ (Heidegger’s Law) |

There is no thing which does not exist.

for N and term conjunction NWK Na → Nab (N-Weakening) |

If there are no as, there are no as which are bs.

for N, term conjunction and ’ TNC Naa’ (Term Non-Contradiction) |

There are no as which are non-as. This is the term-logical version of the Principle of (Excluded) Contradiction, going back to Aristotle.

NEXH Nab ∧ Nab’ → Na (N-Exhaustion) |

If there are no as which are bs, and no as which are non-bs, then there are no as (at all).

The Table 3. below gives definitions of the constant expressions we define using the basic ones. The form is either an identity for terms or a propositional equivalence for functors.

IDAEQ a = b → a ≡ b NC, LEIB, aeq AEQ (Identity entails Equivalence) |

EWK Eab → Ea NWK, contrap., EX (Existential Weakening) |

EEXH Ea → Eab ∨ Eab’ NWK, contrap., EX (Existential Exhaustion) |

TDS Ea ∧ Nab → Eab’ NEXH, contrap., EX (Term Disjunctive Syllogism) |

DIST1 a(b + c) = ab + ac (Distribution, First Form) |

a(b + c) = a(b’c’)’ ADD = ((ab’’)’(ac’’)’)’ DIST = ((ab)’(ac)’)’ DN = ab + ac ADD |

DIST2 a + bc = (a + b)(a + c) (Distribution, Second Form) ☐ |

a + bc = (a’(bc)’) ADD = (((a’b’)’(a’c’)’)’)’ DIST = ((a’b’)’(a’c’)’)’’ rewrite = (a’b’)’(a’c’)’ DN = (a + b)(a + c) ADD |

EXCL N(ab)’ ↔ Na’ ∧ Nb’ (Exclusion) ☐ |

1. | N(ab)’ | A for CP (assumption for conditional proof) |

2. | N(ab)’ → Na’(ab)’ | nwk |

3. | Na’(ab) | nc, nwk, assoc, comm |

4. | Na’(ab)’ | 1, 2, MP |

5. | Na’ | 3, 4, NEXH |

6. | Nb’ | similiter |

7. | Na’ ∧ Nb’ | 5, 6 |

8. | N(ab)’ → Na’ ∧ Nb’ | 1–7 CP |

9. | Na’ ∧ Nb’ | A for CP |

10. | E(ab)’ | A for RAA (assumption for reductio ad absurdum) |

11. | Ea(ab)’ ∨ Ea’(ab)’ | 10, EEXH |

12. | Ea(ab)’ | 2nd disjunct incompatible with Na’ from 9 |

13. | Eab(ab)’ ∨ Eab’(ab)’ | 12, EEXH, term shuffling |

14. | Contradiction: first disjunct by TNC, second contradicts Nb’ from 9 | |

15. | N(ab)’ | 10, 14, reductio |

16. | Na’ ∧ Nb’ → N(ab)’ | 9–15 CP |

17. | N(ab)‘ ↔ Na’ ∧ Nb’ | 8, 16 ☐ |

N(a + b) ↔ Na ∧ Nb

Some Sample Syllogisms

BARBARA b ⊂ c, a ⊂ b ⊢ a ⊂ c |

1. | b ⊂ c | A |

2. | a ⊂ b | A |

3. | Nbc’ | 1, ALL |

4. | Nab’ | 2, ALL |

5. | Nabc’ | 3, NWK |

6. | Nab’c’ | 4, nwk |

7. | Nac’ | 5, 6, NEXH |

8. | a ⊂ c | 7, all |

DARII b ⊂ c, a Δ b ⊢ a Δ c ☐ |

1. | b ⊂ c | A |

2. | a Δ b | A |

3. | Nbc’ | 1, all |

4. | Eab | 2, SOM |

5. | Nabc’ | 3, NWK |

6. | Eabc | 4, 5, TDS, DN |

7. | Eac | 6, EWK |

8. | a Δ c | 7, som |

DARAPTI Eb, b ⊂ c, b ⊂ a ⊢ a Δ c ☐ |

1. | Eb | A |

2. | b ⊂ c | A |

3. | b ⊂ a | A |

4. | Nbc’ | 2, ALL |

5. | Nba’ | 3, ALL |

6. | Eab | 1, 5, tds, dn, comm |

7. | Nabc’ | 4, NWK |

8. | Eabc | 6, 7, TDS, DN |

9. | Eac | 8, EWK |

10. | a Δ c | 9, SOM ☐ |

DARAPTI is one of those syllogisms whose validity is dependent on existential import of the subject term of the two premises: this is made explicit as the first premise.

In fact, every valid categorical syllogism has one of just three forms. We let * be a toggle operator taking positive terms to negative terms and vice versa, that is, if a is positive a* = a’, while if a is negative, a = b’, a* = b. Then every syllogism has as its core one of the three valid inference forms

POSITIVE Eab, Nbc* ⊢ Eac (cf. DARII) |

NEGATIVE Nab*, Nbc ⊢ Nac (cf. CELARENT) |

IMPORT Ea, Nab*, Nbc* ⊢ Eac (cf. BARBARI) |

All can be derived from one of these by choosing b or c to be positive or negative, relabelling, swapping the order of premises, and applying commutativity (ab = ba) to obtain simple conversion. Furthermore, either POSITIVE or NEGATIVE is derivable from the other via partial contraposition and relabelling, so in the end Aristotelian categorical syllogistic owes its validity to just two forms of syllogistic inference, with a little propositional help.

Before concluding this section, a word about the ironic designation ‘Heidegger’s Law’. The basic non-existence predicate ‘N’ is best read as “Nothing is (a)”, and the definitionally empty term ‘Λ’ can often be read as ‘nothing’. The axiomatic formula ‘NΛ’ can then be read as ‘Nothing is (a) nothing’, or, with a little linguistic chivvying, ‘Nothing noths’ or Das Nichts nichtet. Of course, Heidegger did not intend to say anything so straightforward or trivial, but it does refute Carnap’s claim that the sentence has to be nonsense. Au contraire: suitably understood, it is a logical law.

It may seem a little perverse to have based this logic on the negative idea of non-existence rather than the positive one of existence. Of course, it is possible to do it the other way around, but in general the axioms for N are more satisfyingly elegant than those for E.

One of the standard principles of the Boolean algebra that emerged from Boole’s and others’ work on the algebra of terms in the nineteenth century is that all empty terms are identical: we have, e.g., that aa’ = bb’, Na ∧ Nb → a = b, Na → a = Λ. These are not theorems of our system and it is important to see why. Their analogues with equivalence ‘≡’ replacing identity ‘=‘ are theorems, and if we were to add an axiom of extensionality

they would be theorems, and there would be no distinction between identity and equivalence. Most nineteenth century algebraic logicians understood their logic extensionally, so would be happy with this simplification. However, Brentano was not, and nor am I. The axioms involving identity = and those involving non-existence N are distinct in intent. Existence and non-existence have to do, for the most part, with contingent facts: there are narwals; there are no unicorns. There are some non-contingent principles involving N, obviously, our axioms such as term non-contradiction, but the premises in syllogisms and the antecedents in NWK and NEXH are typically contingent in application to actual propositions and actual inferences.

EXT a ≡ b → a = b |

As will be seen more clearly when we consider diagrammatic representation, the axioms governing identity have to do not with contingent propositions but with the framework of discourse within which propositions and inference are employed. In any of the syllogisms considered, we are looking at three terms, their negations and conjunctions. For three terms, there are eight maximally specific combinations of conjunction and negation, for example ab’c, and the question may then arise whether N or E is true of this term. The axioms governing identity (and conjunction and negation) are formal synonymies, there to tell us, in advance of any statements about what does or does not exist, when term expressions relate to the same possibilities. Of these, the most obvious perhaps is a = a’’, term double negation. No contingent facts have any bearing on these two expressions’ relating to the same possibility of existence or non-existence. For this reason, I call the principles governing ‘=‘ intensional and those governing ‘N’ extensional. That does not mean I here endorse a modal logic or possible worlds, simply that the role played by framework description is different from and prior to that played by questions of existence and non-existence.

The system is consistent. In the empty universe, every term is empty, and the extensional axioms are trivially true. Interpreting identity as equivalence, so are the intensional axioms. The empty universe is expressly not ruled out by the system: the dual to Heidegger’s Law, namely.

EV There is something (rather than nothing) is not a theorem, because it is false for the empty universe.

It is well known that first-order monadic predicate logic is decidable [6]. We may interpret the term logic in monadic predicate logic by associating each term a with a monadic predicate A
the term Λ with a necessarily empty predicate, for example
with complex terms as follows
and the predicates as follows

a ↦ Ax

Λ ↦ ~(x = x)

a’ ↦ ~(Ax)

ab ↦ Ax ∧ Bx

a = b ↦ ∀x(Ax ↔ Bx)

Na ↦ ~∃x(Ax).

In this way, each formula of the term logic is correlated with a formula of monadic predicate logic. The interpretation validates extensionality. It can be seen that all the axioms of the term logic system are valid formulas of monadic first-order predicate logic, and the validity of a formula or inference with finitely many premises containing n term variables may be decided on a domain of no more than 2^{n} individuals.

Formulas and inferences with finitely many premises may be tested for validity or invalidity using tree techniques. The basic ideas were presented earlier for a slightly simpler system, so we can be brief [7]. We assume that all rules for trees for propositional logic are available, and we confine attention to term formulas using only the basic vocabulary of term variables, Λ, =, ’, conjunction, and N, as well as propositional connectives. Any defined constants are eliminated first as per their definitions. The counterexample set of an inference to be tested consists of the premises together with the negation of the conclusion, or the negation of a formula if that formula’s validity is to be tested. A tree starts with the counterexample set. It may then be extended according to the following rules:

- In a formula, terms may be replaced by terms identical to them according to the intensional axioms.
- Any sentence N(ab)’ may be replaced by the two sentences Na’, Nb’ by EXCL.
- These and DN may be used to drive term negations inwards so they only occur singly and modify term letters only.
- A branch containing ~Nab may be extended by ~Na, or ~Nb, or both.(In the next two rules, b is a term occurring in the premises but not occurring in a.)
- A branch containing Na may be extended by Nab and by Nab’
- A branch containing ~Na splits and continues with ~Nab in one branch and ~Nab’ in the other.
- Open branches are extended until all variables from the premises occur in any remaining branch, with term negations inmost, i.e., modifying a single term letter or constant term.Branches close under the following conditions:
- The branch contains two contradictory formulas, for example Eab’c and Nab’c
- The branch contains a formula ~NΛ
- The branch contains a formula ~Naa’.

If all branches close, the formula or inference is valid; if any branch remains open, the formulas along it may all be true and constitute a counterexample.

Diagrams for deciding the validity of logical inferences go back centuries, but the first effective ones are due to John Venn [8]. The idea, as applied to term logic, is to start with a diagram consisting of as many areas, or cells, as there are conjunctions of all simple terms and their negations contained in an inference. If there are n simple terms, that will be 2^{n} cells. Venn’s own curvilinear diagrams are inferior to the rectilinear ones proposed by Lewis Carroll, who ingeniously constructed diagrams for up to eight different simple terms, and indicated how to extend these further [9] (p. 245 ff.: “My Method of Diagrams”. Carroll was incidentally the first to use trees as an aid for solving logic problems: ibid., 279 ff. Since one of his problems (“Froggy’s Problem”, ibid., 338 ff.) is a sorites in 18 terms, which would require a diagram with 262,144 cells, taxing human capacity to solve, further aids were clearly needed.) The method for term logic as for syllogistic is to shade out those cells corresponding to N propositions, and indicate by crosses those cells corresponding to E propositions. The chief difficulty is that an E proposition whose term is not a maximal compound of simple terms and their negations must straddle several cells disjunctively, a problem compounded in any term-logical formula or inference employing disjunction or its equivalent. For this reason, diagrams are practicable only for relatively small and straightforward problems. Trees branch easily, but the only way to branch a diagram is to treat several diagrams disjunctively.

An unfilled diagram for n term variables, with its 2^{n} cells, represents the framework within which N and E propositions employing these variables are to be represented, and is neutral with respect to such propositions. The axioms for identity are then to be understood as indicating different but formally equivalent ways in which cells or groups of cells are indicated. This is why they play a different role in the logic from the N and E propositions.

It is natural to extend the term logic employed to date with variable-binding quantifiers. One reason is simply to enhance the representative scope of the system. Quantifiers binding term variables do not affect the decidability of the resulting system, (Ackermann, loc.cit.) but they bring greater expressive power. We take the universal quantifier as primitive and add the following axiom schemes, where A and B are sentences:
where a is any term variable which is not free in A;
where t is a term expression (variable, constant or compound), A[t/a] is the result of substituting t for all free occurrences of a in A, and no free occurrence of a in A is in a well-formed part of A of the form ∀t(B) [10] (p. 172).

QDIST ∀a(A → B) → (A → ∀a(B))

QINST #x2200;a(A) → A[t/a]

The particular quantifier may then be introduced in the standard way as dual of the universal:

FORSOME ∃a(A) ↔ ~∀a(~A)

It should be noted that the particular quantifier does not in this system carry existential import. Since it is a theorem that ~EΛ, it follows that ∃a(~Ea), so the quantifier cannot very well mean ‘there exists’, but must mean, neutrally, ‘for some’. If we wish to talk about existing things, we have the predicate ‘E’ to hand.

One of the ways in which quantifiers introduce greater expressive power is that they facilitate expressions of number. Hitherto, expressions of the form Ea only said that there is some a. This is compatible with there being one, two, … any number of as, and this is why the cells of any diagram for finitely many propositions need only be finite in number. Indeed, the terms need not denote individuals or pluralities of individuals at all: they could denote numberless stuffs, as do mass terms in ordinary language. The syllogism in Darii

- All morphine is highly addictive
- Some pain medication is morphine:

therefore Some pain medication is highly addictive

is no less valid for being about stuffs (“substances”) rather than individuals. If we wish to introduce numbers, to count individuals or also consignments of stuff, we need quantifiers. Here is how to define ‘at least two’:
So we can define ‘exactly one’ as

≥2 E_{≥2}a ↔ ∃x(Eax ∧ Eax’)

=1 E_{=1}a ↔ Ea ∧ ~E_{≥2}a

For students coming to logic with little or no background except in propositional calculus, term logic is quite natural and easy to understand. It is close to natural language (no bound variables, quantifiers as phrases not operators, logical and grammatical form closely similar); by comparison with predicate logic, there is minimal paraphrasing required; it has a straightforward and intuitive denotational semantics requiring no set theory, and is easy to do without special symbols. It can be treated by methods building easily on those of propositional logic: semantic diagrams, natural deduction proofs, axioms and trees. It has an accessible metalogic: it is sound, complete, and decidable, uses finitistic methods, affords a variety of approaches and good illustration of basic concepts. In difficulty, it is only slightly more complex than truth-tables and natural deduction for propositional logic, and is readily scriptable should one wish to write suitable computer programs. For an introduction to the history of logic, it allows much greater scope for comparison than post-Fregean predicate logic. It allows a variety of bases, apart from the one we have chosen. Alternative bases are equational (Leibniz, Boole, Jevons), subsumptional (Leibniz, Peirce, Schröder), existential (Leibniz, Brentano, Carroll), traditional (Aristotle, Łukasiewicz), or based on the singular copula (Leśniewski, Słupecki). It admits of various extensions, most obviously by introducing predicates, especially relational predicates, but also modal [11], towards Leśniewskian logic [3,12], and introducing higher types, up to and including full simple type theory.

On the negative side, it delays students’ encounter with ∀ and ∃, with relations and multiple generality, has rather few links to modern mathematics, and being now unorthodox, suffers from a modern textbook gap. Most textbooks highlighting term logic (Łukasiewicz excepted) are antiquated attempts to keep pre-Fregean logic alive, often for non-logical reasons.

Nevertheless, I hope enough has been shown in this paper to suggest that term logic, whether done this way or in some other way, remains worthy of the attention of logicians and teachers of logic.

This research received no external funding.

No conflict of interest.

- Łukasiewicz, J. Elements of Mathematical Logic; Wojtasiewicz, O., Translator; Pergamon: Oxford, UK, 1963. [Google Scholar]
- Brentano, F. Die Lehre vom richtigen Urteil; Mayer-Hillebrand, F., Ed.; Francke: Bern, Switzerland, 1956. [Google Scholar]
- Simons, P. A Brentanian Basis for Leśniewskian Logic. Logique et Analyse
**1984**, 27, 297–307. [Google Scholar] - Simons, P. Judging Correctly: Brentano and the Reform of Elementary Logic. In The Cambridge Companion to Brentano; Jacquette, D., Ed.; Cambridge University Press: Cambridge, UK, 2003; pp. 45–65. [Google Scholar]
- Simons, P. Brentano’s Reform of Logic. Topoi
**1987**, 6, 23–63. [Google Scholar] [CrossRef] - Ackermann, W. Solvable Cases of the Decision Problem; North-Holland: Amsterdam, The Netherlands, 1954. [Google Scholar]
- Simons, P. Tree Proof for Syllogistic. Studia Logica
**1989**, 48, 539–554. [Google Scholar] [CrossRef] - Venn, J. On the diagrammatic and mechanical representation of propositions and reasonings. Philos. Mag.
**1880**, 59, 1–18. [Google Scholar] [CrossRef] - Carroll, L.; Dodgson, C.L. Lewis Carroll’s Symbolic Logic; Bartley, W.W., III, Eds.; Potter: New York, NY, USA, 1977. [Google Scholar]
- Church, A. An Introduction to Mathematical Logic; Princeton University Press: Princeton, NJ, USA, 1956. [Google Scholar]
- Simons, P. Calculi of Names: Free and Modal. In New Essays in Free Logic, In Honour of Karel Lambert; Morscher, E., Hieke, A., Eds.; Kluwer: Dordrecht, The Netherlands, 2001; pp. 49–65. [Google Scholar]
- Słupecki, J.S. Leśniewski’s Calculus of Names. Studia Logica
**1955**, 3, 7–72. [Google Scholar] [CrossRef]

Category | Index | Expressions | Description |
---|---|---|---|

Monadic Connective | s⟨s⟩ | ~ | Sentential negation |

Dyadic Connectives | s⟨ss⟩ | ∧ ∨ → ↔ | [Standard] |

Term Variables | n | a, b, c, a_{1}, a_{2}, … | |

Term Constant | n | Λ | Empty term |

Monadic Term Functor | n⟨n⟩ | ’ | Term negation |

Dyadic Term Functor | n⟨nn⟩ | [juxtaposition] | Term conjunction |

Monadic Predicate | s⟨n⟩ | N | Non-existence predicate |

Dyadic Predicate | s⟨nn⟩ | = | Identity predicate |

Expression | Meaning | Example |
---|---|---|

Λ | Non-existing thing | |

a’ | non-a | non-animal |

ab | a which is a b | doctor who is a musician |

Na | there are no a | there are no unicorns |

a = b | to be a is (the same thing as) to be b | to be a widow is to be a woman whose husband has died |

Name | Definition | Description | Reading |
---|---|---|---|

UN | V = Λ’ | Universal Term | thing; object |

ADD | a + b = (a’b’)’ | Term Addition | a or b |

EX | Ea ↔ ~Na | Existence | There are a; a exist |

NO | a | b ↔ Nab | Universal Negative | No a are b |

ALL | a ⊂ b ↔ Nab’ | Universal Positive | All a are b |

SOM | a Δ b ↔ Eab | Particular Positive | Some a are b |

AEQ | a ≡ b ↔ Nab’ ∧ Nba’ | Term Equivalence | The a are the b |

© 2020 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).