Relation theory
☞ This page belongs to resource collections on Logic and Inquiry.
Relation theory, or the theory of relations, treats the subject matter of relations in its combinatorial aspect, as distinguished from, though related to, its more properly logical study on one side and its more generally mathematical study on another.
A relation, as conceived in the combinatorial theory of relations, is a mathematical object that in general can have a very complex type, the complexity of which is best approached in several stages, as indicated next.
In order to approach the combinatorial definition of a relation, it helps to introduce a few preliminary notions that can serve as stepping stones to the general idea.
A relation in mathemat.css is defined as an object that has its existence as such within a definite context or setting. It is literally the case that to change this setting is to change the relation that is being defined. The particular type of context that is needed here is formalized as a collection of elements from which are chosen the elements of the relation in question. This larger collection of elementary relations or tuples is constructed by means of the settheoretic product commonly known as the cartesian product.
Contents
Preliminaries[edit]
A relation <math>L\!</math> is defined by specifying two mathematical objects as its constituent parts:
The first part is called the figure of <math>L,\!</math> notated as <math>\operatorname{figure}(L).</math> 
The second part is called the ground of <math>L,\!</math> notated as <math>\operatorname{ground}(L).</math> 
In the special case of a finitary relation, for concreteness a <math>k\!</math>place relation, the concepts of figure and ground are defined as follows:
The ground of <math>L\!</math> is a sequence of <math>k\!</math> nonempty sets, <math>X_1, \ldots, X_k,</math> called the domains of the relation <math>L.\!</math> 
The figure of <math>L\!</math> is a subset of the cartesian product taken over the domains of <math>L.\!</math> 
In sum we have: <math>\operatorname{figure}(L) ~\subseteq~ \operatorname{ground}(L) ~=~ X_1 \times \ldots, \times X_k.</math> 
Strictly speaking, then, the relation <math>L\!</math> is an ordered pair of mathematical objects, <math>L = (\operatorname{figure}(L), \operatorname{ground}(L)),</math> but it is customary in loose speech to use the single name <math>L\!</math> in a systematically equivocal fashion, taking it to denote either the pair <math>L = (\operatorname{figure}(L), \operatorname{ground}(L))</math> or the figure <math>\operatorname{figure}(L).</math> There is usually no confusion about this so long as the ground of the relation can be gathered from context.
Definition[edit]
The formal definition of a finite arity relation, specifically, a kary relation can now be stated.
 Definition. A kary relation L over the nonempty sets X_{1}, …, X_{k} is a (1+k)tuple L = (F(L), X_{1}, …, X_{k}) where F(L) is a subset of the cartesian product X_{1} × … × X_{k}. If all of the X_{j} for j = 1 to k are the same set X, then L is more simply called a kary relation over X. The set F(L) is called the figure of L and, provided that the sequence of sets X_{1}, …, X_{k} is fixed throughout a given discussion or is otherwise determinate in context, one may regard the relation L as being determined by its figure F(L).
The formal definition simply repeats more concisely what was said above, merely unwrapping the conceptual packaging of the relation's ground to define the relation in 1 + k parts, as L = (F(X), X_{1}, …, X_{k}), rather than just the two, as L = (F(L), G(L)).
A kary predicate is a booleanvalued function on k variables.
Local incidence properties[edit]
A local incidence property (LIP) of a relation L is a property that depends in turn on the properties of special subsets of L that are known as its local flags. The local flags of a relation are defined in the following way:
Let L be a kplace relation L ⊆ X_{1} × … × X_{k}.
Select a relational domain X_{j} and one of its elements x. Then L_{x.j} is a subset of L that is referred to as the flag of L with x at j, or the x.jflag of L, an object which has the following definition:
 L_{x.j} = { (x_{1}, …, x_{j}, …, x_{k}) ∈ L : x_{j} = x }.
Any property C of the local flag L_{x.j} ⊆ L is said to be a local incidence property of L with respect to the locus x at j.
A kadic relation L ⊆ X_{1} × … × X_{k} is said to be Cregular at j if and only if every flag of L with x at j has the property C, where x is taken to vary over the theme of the fixed domain X_{j}.
Expressed in symbols, L is Cregular at j if and only if C(L_{x.j}) is true for all x in X_{j}.
Numerical incidence properties[edit]
A numerical incidence property (NIP) of a relation is a local incidence property that depends on the cardinalities of its local flags.
For example, L is said to be cregular at j if and only if the cardinality of the local flag L_{x.j} is c for all x in X_{j}, or, to write it in symbols, if and only if L_{x.j} = c for all x in X_{j}.
In a similar fashion, one can define the NIPs (< c)regular at j, (> c)regular at j, and so on. For ease of reference, a few of these definitions are recorded here:
<math>L</math>  is  cregular  at j  if and only if  L_{x.j}</math>  =  c  for all x in X_{j}.  
<math>L</math>  is  (< c)regular  at j  if and only if  L_{x.j}</math>  <  c  for all x in X_{j}.  
<math>L</math>  is  (> c)regular  at j  if and only if  L_{x.j}</math>  >  c  for all x in X_{j}. 
The definition of a local flag can be broadened from a point x in X_{j} to a subset M of X_{j}, arriving at the definition of a regional flag in the following way:
Suppose that L ⊆ X_{1} × … × X_{k}, and choose a subset M ⊆ X_{j}. Then L_{M.j} is a subset of L that is said to be the flag of L with M at j, or the M.jflag of L, an object which has the following definition:
L_{M.j}  =  { (x_{1}, …, x_{j}, …, x_{k}) ∈ L : x_{j} ∈ M }. 
Returning to 2adic relations, it is useful to describe some familiar classes of objects in terms of their local and their numerical incidence properties. Let L ⊆ S × T be an arbitrary 2adic relation. The following properties of L can be defined:
<math>L</math>  is  total  at S  if and only if  <math>L</math>  is  (≥1)regular  at S.  
<math>L</math>  is  total  at T  if and only if  <math>L</math>  is  (≥1)regular  at T.  
<math>L</math>  is  tubular  at S  if and only if  <math>L</math>  is  (≤1)regular  at S.  
<math>L</math>  is  tubular  at T  if and only if  <math>L</math>  is  (≤1)regular  at T. 
If L ⊆ S × T is tubular at S, then L is called a partial function or a prefunction from S to T, sometimes indicated by giving L an alternate name, say, "p", and writing L = p : S <math>\rightharpoonup</math> T.
Just by way of formalizing the definition:
L  =  p : S <math>\rightharpoonup</math> T  if and only if  L  is  tubular  at S. 
If L is a prefunction p : S <math>\rightharpoonup</math> T that happens to be total at S, then L is called a function from S to T, indicated by writing L = f : S → T. To say that a relation L ⊆ S × T is totally tubular at S is to say that it is 1regular at S. Thus, we may formalize the following definition:
L  =  f : S → T  if and only if  L  is  1regular  at S. 
In the case of a function f : S → T, one has the following additional definitions:
f  is  surjective  if and only if  f  is  total  at T.  
f  is  injective  if and only if  f  is  tubular  at T.  
f  is  bijective  if and only if  f  is  1regular  at T. 
Variations[edit]
Because the concept of a relation has been developed quite literally from the beginnings of logic and mathemat.css, and because it has incorporated contributions from a diversity of thinkers from many different times and intellectual climates, there is a wide variety of terminology that the reader may run across in connection with the subject.
One dimension of variation is reflected in the names that are given to kplace relations, with some writers using medadic, monadic, dyadic, triadic, kadic where other writers use nullary, unary, binary, ternary, kary.
One finds a relation on a finite number of domains described as either a finitary relation or a polyadic relation. If the number of domains is finite, say equal to k, then the parameter k may be referred to as the arity, the adicity, or the dimension of the relation. In these cases, the relation may be described as a kary relation, a kadic relation, or a kdimensional relation, respectively.
A more conceptual than nominal variation depends on whether one uses terms like 'predicate', 'relation', and even 'term' to refer to the formal object proper or else to the allied syntactic items that are used to denote them. Compounded with this variation is still another, frequently associated with philosophical differences over the status in reality accorded formal objects. Among those who speak of numbers, functions, properties, relations, and sets as being real, that is to say, as having objective properties, there are divergences as to whether some things are more real than others, especially whether particulars or properties are equally real or else one derivative of the other. Historically speaking, just about every combination of modalities has been used by one school of thought or another, but it suffices here merely to indicate how the options are generated.
Examples[edit]
 See the articles on relations, relation composition, relation reduction, sign relations, and triadic relations for concrete examples of relations.
Many relations of the greatest interest in mathemat.css are triadic relations, but this fact is somewhat disguised by the circumstance that many of them are referred to as binary operations, and because the most familiar of these have very specific properties that are dictated by their axioms. This makes it practical to study these operations for quite some time by focusing on their dyadic aspects before being forced to consider their proper characters as triadic relations.
References[edit]
 Peirce, C.S., "Description of a Notation for the Logic of Relatives, Resulting from an Amplification of the Conceptions of Boole's Calculus of Logic", Memoirs of the American Academy of Arts and Sciences, 9, 317378, 1870. Reprinted, Collected Papers CP 3.45149, Chronological Edition CE 2, 359429.
 Ulam, S.M. and Bednarek, A.R., "On the Theory of Relational Structures and Schemata for Parallel Computation", pp. 477508 in A.R. Bednarek and Françoise Ulam (eds.), Analogies Between Analogies : The Mathematical Reports of S.M. Ulam and His Los Alamos Collaborators, University of California Press, Berkeley, CA, 1990.
Bibliography[edit]
 Barr, M. and Wells, C., Category Theory for Computing Science, Hemel Hempstead, UK, 1990.
 Bourbaki, N., Elements of the History of Mathemat.css, John Meldrum (trans.), SpringerVerlag, Berlin, Germany, 1994.
 Carnap, Rudolf, Introduction to Symbolic Logic with Applications, Dover Publications, New York, NY, 1958.
 Chang, C.C., and Keisler, H.J., Model Theory, NorthHolland, Amsterdam, Netherlands, 1973.
 van Dalen, D., Logic and Structure, 2nd edition, SpringerVerlag, Berlin, Germany, 1980.
 Devlin, K.J., The Joy of Sets: Fundamentals of Contemporary Set Theory, 2nd edition, SpringerVerlag, New York, NY, 1993.
 Halmos, P.R., Naive Set Theory, D. Van Nostrand Company, Princeton, NJ, 1960.
 van Heijenoort, J., From Frege to Gödel, A Source Book in Mathematical Logic, 1879?1931, Harvard University Press, Cambridge, MA, 1967. Reprinted with corrections, 1977.
 Kelley, J.L., General Topology, Van Nostrand Reinhold, New York, NY, 1955.
 Kneale, W. and Kneale, M., The Development of Logic, Oxford University Press, Oxford, UK, 1962. Reprinted with corrections, 1975.
 Lawvere, F.W., and Rosebrugh, R., Sets for Mathemat.css, Cambridge University Press, Cambridge, UK, 2003.
 Lawvere, F.W., and Schanuel, S.H., Conceptual Mathemat.css, A First Introduction to Categories, Cambridge University Press, Cambridge, UK, 1997. Reprinted with corrections, 2000.
 Maddux, R.D., Relation Algebras, Volume 150, 'Studies in Logic and the Foundations of Mathemat.css', Elsevier Science, 2006.
 Manin, Yu. I., A Course in Mathematical Logic, Neal Koblitz (trans.), SpringerVerlag, New York, NY, 1977.
 Mathematical Society of Japan, Encyclopedic Dictionary of Mathemat.css, 2nd edition, 2 vols., Kiyosi Itô (ed.), MIT Press, Cambridge, MA, 1993.
 Mili, A., Desharnais, J., Mili, F., with Frappier, M., Computer Program Construction, Oxford University Press, New York, NY, 1994. (Introduction to Tarskian relation theory and its applications within the relational programming paradigm.)
 Mitchell, J.C., Foundations for Programming Languages, MIT Press, Cambridge, MA, 1996.
 Peirce, C.S., Collected Papers of Charles Sanders Peirce, vols. 1–6, Charles Hartshorne and Paul Weiss (eds.), vols. 7–8, Arthur W. Burks (ed.), Harvard University Press, Cambridge, MA, 1931–1935, 1958. Cited as CP volume.paragraph.
 Peirce, C.S., Writings of Charles S. Peirce : A Chronological Edition, Volume 2, 1867–1871, Peirce Edition Project (eds.), Indiana University Press, Bloomington, IN, 1984. Cited as CE 2.
 Poizat, B., A Course in Model Theory: An Introduction to Contemporary Mathematical Logic, Moses Klein (trans.), SpringerVerlag, New York, NY, 2000.
 Quine, W.V., Mathematical Logic, 1940. Revised edition, Harvard University Press, Cambridge, MA, 1951. New preface, 1981.
 Royce, J., The Principles of Logic, Philosophical Library, New York, NY, 1961.
 Runes, D.D. (ed.), Dictionary of Philosophy, Littlefield, Adams, and Company, Totowa, NJ, 1962.
 Shoenfield, J.R., Mathematical Logic, AddisonWesley, Reading, MA, 1967.
 Styazhkin, N.I., History of Mathematical Logic from Leibniz to Peano, MIT Press, Cambridge, MA, 1969.
 Suppes, Patrick, Introduction to Logic, 1st published 1957. Reprinted, Dover Publications, New York, NY, 1999.
 Suppes, Patrick, Axiomatic Set Theory, 1st published 1960. Reprinted, Dover Publications, New York, NY, 1972.
 Tarski, A., Logic, Semant.css, Metamathemat.css, Papers from 1923 to 1938, J.H. Woodger (trans.), first edition, Oxford University Press, 1956, second edition, J. Corcoran (ed.), Hackett Publishing, Indianapolis, IN, 1983.
 Ulam, S.M., Analogies Between Analogies : The Mathematical Reports of S.M. Ulam and His Los Alamos Collaborators, A.R. Bednarek and Françoise Ulam (eds.), University of California Press, Berkeley, CA, 1990.
 Ullman, J.D., Principles of Database Systems, Computer Science Press, Rockville, MD, 1980.
 Venetus, P., Logica Parva, Translation of the 1472 Edition with Introduction and Notes, Alan R. Perreiah (trans.), Philosophia Verlag, Munich, Germany, 1984.
Syllabus[edit]
Focal nodes[edit]
Peer nodes[edit]
Logical operators[edit]
Related top.css[edit]
Relational concepts[edit]

Information, Inquiry[edit]
Related articles[edit]
Document history[edit]
Portions of the above article were adapted from the following sources under the GNU Free Documentation License, under other applicable licenses, or by permission of the copyright holders.