Structure (mathematical logic)

In universal algebra and in model theory, a structure consists of a set along with a collection of finitary operations and relations which are defined on it.

Universal algebra studies structures that generalize the algebraic structures such as groups, rings, fields, vector spaces and lattices. The term universal algebra is used for structures with no relation symbols.^[1]

Model theory has a different scope that encompasses more arbitrary theories, including foundational structures such as models of set theory. From the model-theoretic point of view, structures are the objects used to define the semantics of first-order logic. In model theory a structure is often called just a model, although it is sometimes disambiguated as a semantic model when one discusses the notion in the more general setting of mathematical models. Logicians sometimes refer to structures as interpretations.^[2]

In database theory, structures with no functions are studied as models for relational databases, in the form of relational models.

Definition

Formally, a structure can be defined as a triple $\mathcal A=(A, \sigma, I)$ consisting of a domain A, a signature σ, and an interpretation function I that indicates how the signature is to be interpreted on the domain. To indicate that a structure has a particular signature σ one can refer to it as a σ-structure.

Domain

The domain of a structure is an arbitrary set; it is also called the underlying set of the structure, its carrier (especially in universal algebra), or its universe (especially in model theory). In classical first-order logic, the definition of a structure prohibits the empty domain.^[3]

Sometimes the notation $\operatorname{dom}(\mathcal A)$ or $|\mathcal A|$ is used for the domain of $\mathcal A$ , but often no notational distinction is made between a structure and its domain. (I.e. the same symbol $\mathcal A$ refers both to the structure and its domain.)^[4]

Signature

Main article: Signature (logic)

The signature of a structure consists of a set of function symbols and relation symbols along with a function that ascribes to each symbol s a natural number $n=\operatorname{ar}(s)$ which is called the arity of s because it is the arity of the interpretation of s.

Since the signatures that arise in algebra often contain only function symbols, a signature with no relation symbols is called an algebraic signature. A structure with such a signature is also called an algebra; this should not be confused with the notion of an algebra over a field.

Interpretation function

The interpretation function I of $\mathcal A$ assigns functions and relations to the symbols of the signature. Each function symbol f of arity n is assigned an n-ary function $f^{\mathcal A}=I(f)$ on the domain. Each relation symbol R of arity n is assigned an n-ary relation $R^{\mathcal A}=I(R)\subseteq A^{\operatorname{ar(R)}}$ on the domain. A nullary function symbol c is called a constant symbol, because its interpretation I(c) can be identified with a constant element of the domain.

When a structure (and hence an interpretation function) is given by context, no notational distinction is made between a symbol s and its interpretation I(s). For example if f is a binary function symbol of $\mathcal A$ , one simply writes $f:\mathcal A^2\rightarrow\mathcal A$ rather than $f^{\mathcal A}:|\mathcal A|^2\rightarrow|\mathcal A|$ .

Examples

The standard signature σ_f for fields consists of two binary function symbols + and ×, a unary function symbol −, and the two constant symbols 0 and 1. Thus a structure (algebra) for this signature consists of a set of elements A together with two binary functions, a unary function, and two distinguished elements; but there is no requirement that it satisfy any of the field axioms. The rational numbers Q, the real numbers R and the complex numbers C, like any other field, can be regarded as σ-structures in an obvious way:

$\mathcal Q = (Q, \sigma_f, I_{\mathcal Q})$

$\mathcal R = (R, \sigma_f, I_{\mathcal R})$

$\mathcal C = (C, \sigma_f, I_{\mathcal C})$

where

$I_{\mathcal Q}(%2B)\colon Q\times Q\to Q$ is addition of rational numbers,

$I_{\mathcal Q}(\times)\colon Q\times Q\to Q$ is multiplication of rational numbers,

$I_{\mathcal Q}(-)\colon Q\to Q$ is the function that takes each rational number x to -x, and

$I_{\mathcal Q}(0)\in Q$ is the number 0 and

$I_{\mathcal Q}(1)\in Q$ is the number 1;

and $I_{\mathcal R}$ and $I_{\mathcal C}$ are similarly defined.

But the ring Z of integers, which is not a field, is also a σ_f-structure in the same way. In fact, there is no requirement that any of the field axioms hold in a σ_f-structure.

A signature for ordered fields needs an additional binary relation such as < or ≤, and therefore structures for such a signature are not algebras, even though they are of course algebraic structures in the usual, loose sense of the word.

The ordinary signature for set theory includes a single binary relation ∈. A structure for this signature consists of a set of elements and an interpretation of the ∈ relation as a binary relation on these elements.

Induced substructures and closed subsets

$\mathcal A$ is called an (induced) substructure of $\mathcal B$ if

$\mathcal A$ and $\mathcal B$ have the same signature $\sigma(\mathcal A)=\sigma(\mathcal B)$ ;
the domain of $\mathcal A$ is contained in the domain of $\mathcal B$ : $|\mathcal A|\subseteq |\mathcal B|$ ; and
the interpretations of all function and relation symbols agree on $|\mathcal B|$ .

The usual notation for this relation is $\mathcal A\subseteq\mathcal B$ .

A subset $B\subseteq|\mathcal A|$ of the domain of a structure $\mathcal A$ is called closed if it is closed under the functions of $\mathcal A$ , i.e. if the following condition is satisfied: for every natural number n, every n-ary function symbol f (in the signature of $\mathcal A$ ) and all elements $b_1,b_2,\dots,b_n\in B$ , the result of applying f to the n-tuple $b_1b_2\dots b_n$ is again an element of B: $f(b_1,b_2,\dots,b_n)\in B$ .

For every subset $B\subseteq|\mathcal A|$ there is a smallest closed subset of $|\mathcal A|$ that contains B. It is called the closed subset generated by B, or the hull of B, and denoted by $\langle B\rangle$ or $\langle B\rangle_{\mathcal A}$ . The operator $\langle\rangle$ is a finitary closure operator on the set of subsets of $|\mathcal A|$ .

If $\mathcal A=(A,\sigma,I)$ and $B\subseteq A$ is a closed subset, then $(B,\sigma,I')$ is an induced substructure of $\mathcal A$ , where $I'$ assigns to every symbol of σ the restriction to B of its interpretation in $\mathcal A$ . Conversely, the domain of an induced substructure is a closed subset.

The closed subsets (or induced substructures) of a structure form a lattice. The meet of two subsets is their intersection. The join of two subsets is the closed subset generated by their union. Universal algebra studies the lattice of substructures of a structure in detail.

Examples

Let σ = {+, ×, −, 0, 1} be again the standard signature for fields. When regarded as σ-structures in the natural way, the rational numbers form a substructure of the real numbers, and the real numbers form a substructure of the complex numbers. The rational numbers are the smallest substructure of the real (or complex) numbers that also satisfies the field axioms.

The set of integers gives an even smaller substructure of the real numbers which is not a field. Indeed, the integers are the substructure of the real numbers generated by the empty set, using this signature. The notion in abstract algebra that corresponds to a substructure of a field, in this signature, is that of a subring, rather than that of a subfield.

The most obvious way to define a graph is a structure with a signature σ consisting of a single binary relation symbol E. The vertices of the graph form the domain of the structure, and for two vertices a and b, $(a,b)\!\in \text{E}$ means that a and b are connected by an edge. In this encoding, the notion of induced substructure is more restrictive than the notion of subgraph. For example, let G be a graph consisting of two vertices connected by an edge, and let H be the graph consisting of the same vertices but no edges. H is a subgraph of G, but not an induced substructure. The notion in graph theory that corresponds to induced substructures is that of induced subgraphs.

Homomorphisms and embeddings

Homomorphisms

Given two structures $\mathcal A$ and $\mathcal B$ of the same signature σ, a (σ-)homomorphism from $\mathcal A$ to $\mathcal B$ is a map $h:|\mathcal A|\rightarrow|\mathcal B|$ which preserves the functions and relations. More precisely:

For every n-ary function symbol f of σ and any elements $a_1,a_2,\dots,a_n\in|\mathcal A|$ , the following equation holds:

$h(f(a_1,a_2,\dots,a_n))=f(h(a_1),h(a_2),\dots,h(a_n))$ .

For every n-ary relation symbol R of σ and any elements $a_1,a_2,\dots,a_n\in|\mathcal A|$ , the following implication holds:

$(a_1,a_2,\dots,a_n)\in R \implies (h(a_1),h(a_2),\dots,h(a_n))\in R$ .

The notation for a homomorphism h from $\mathcal A$ to $\mathcal B$ is $h: \mathcal A\rightarrow\mathcal B$ .

For every signature σ there is a concrete category σ-Hom which has σ-structures as objects and σ-homomorphisms as morphisms.

A homomorphism $h: \mathcal A\rightarrow\mathcal B$ is sometimes called strong if for every n-ary relation symbol R and any elements $b_1,b_2,\dots,b_n\in|\mathcal B|$ such that $(b_1,b_2,\dots,b_n)\in R$ , there are $a_1,a_2,\dots,a_n\in|\mathcal A|$ such that $(a_1,a_2,\dots,a_n)\in R$ and $b_1=h(a_1),\,b_2=h(a_2),\,\dots,\,b_n=h(a_n).$ The strong homomorphisms give rise to a subcategory of σ-Hom.

Embeddings

A (σ-)homomorphism $h:\mathcal A\rightarrow\mathcal B$ is called a (σ-)embedding if it is one-to-one and

for every n-ary relation symbol R of σ and any elements $a_1,a_2,\dots,a_n$ , the following equivalence holds:

$(a_1,a_2,\dots,a_n)\in R \iff(h(a_1),h(a_2),\dots,h(a_n))\in R$ .

Thus an embedding is the same thing as a strong homomorphism which is one-to-one. The category σ-Emb of σ-structures and σ-embeddings is a concrete subcategory of σ-Hom.

Induced substructures correspond to subobjects in σ-Emb. If σ has only function symbols, σ-Emb is the subcategory of monomorphisms of σ-Hom. In this case induced substructures also correspond to subobjects in σ-Hom.

Example

As seen above, in the standard encoding of graphs as structures the induced substructures are precisely the induced subgraphs. However, a homomorphism between graphs is the same thing as a homomorphism between the two structures coding the graph. In the example of the previous section, even though the subgraph H of G is not induced, the identity map id: H → G is a homomorphism. This map is in fact a monomorphism in the category σ-Hom, and therefore H is a subobject of G which is not an induced substructure.

Homomorphism problem

The following problem is known as the homomorphism problem:

Given two finite structures $\mathcal A$ and $\mathcal B$ of a finite relational signature, find a homomorphism $h:\mathcal A\rightarrow\mathcal B$ or show that no such homomorphism exists.

Every constraint satisfaction problem (CSP) has a translation into the homomorphism problem.^[5] Therefore the complexity of CSP can be studied using the methods of finite model theory.

Another application is in database theory, where a relational model of a database is essentially the same thing as a relational structure. It turns out that a conjunctive query on a database can be described by another structure in the same signature as the database model. A homomorphism from the relational model to the structure representing the query is the same thing as a solution to the query. This shows that the conjunctive query problem is also equivalent to the homomorphism problem.

Structures and first-order logic

Structures are sometimes referred to as "first-order structures". This is misleading, as nothing in their definition ties them to any specific logic, and in fact they are suitable as semantic objects both for very restricted fragments of first-order logic such as that used in universal algebra, and for second-order logic. In connection with first-order logic and model theory, structures are often called models, even when the question "models of what?" has no obvious answer.

Satisfaction relation

Each first-order structure $\mathcal{M}$ has a satisfaction relation $\mathcal{M} \vDash \phi$ defined for all formulas $\, \phi$ in the language consisting of the language of $\mathcal{M}$ together with a constant symbol for each element of M, which is interpreted as that element. This relation is defined inductively using Tarski's T-schema.

A structure $\mathcal{M}$ is said to be a model of a theory T if the language of $\mathcal{M}$ is the same as the language of T and every sentence in T is satisfied by $\mathcal{M}$ . Thus, for example, a "ring" is a structure for the language of rings that satisfies each of the ring axioms, and a model of ZFC set theory is a structure in the language of set theory that satisfies each of the ZFC axioms.

Definable relations

An n-ary relation R on the universe M of a structure $\mathcal{M}$ is said to be definable (or explicitly definable, or $\emptyset$ -definable) if there is a formula φ(x₁,...,x_n) such that

$R = \{ (a_1,\ldots,a_n ) \in M^n�: \mathcal{M} \vDash \phi(a_1,\ldots,a_n)\}.$

In other words, R is definable if and only if there is a formula φ such that

$(a_1,\ldots,a_n ) \in R \Leftrightarrow \mathcal{M} \vDash \phi(a_1,\ldots,a_n)$

is correct.

An important special case is the definability of specific elements. An element m of M is definable in $\mathcal{M}$ if and only if there is a formula φ(x) such that

$\mathcal{M}\vDash \forall x ( x = m \leftrightarrow \phi(x)).$

Definability with parameters

A relation R is said to be definable with parameters (or $|\mathcal M|$ -definable) if there is a formula φ with parameters from $\mathcal{M}$ such that R is definable using φ. Every element of a structure is definable using the element itself as a parameter.

Implicit definability

Recall from above that an n-ary relation R on the universe M of a structure $\mathcal{M}$ is explicitly definable if there is a formula φ(x₁,...,x_n) such that

$R = \{ (a_1,\ldots,a_n ) \in M^n�: \mathcal{M} \vDash \phi(a_1,\ldots,a_n) \}$

Here the formula φ used to define a relation R must be over the signature of $\mathcal{M}$ and so φ may not mention R itself, since R is not in the signature of $\mathcal{M}$ . If there is a formula φ in the extended language containing the language of $\mathcal{M}$ and a new symbol R, and the relation R is the only relation on $\mathcal{M}$ such that $\mathcal{M} \vDash \phi$ , then R is said to be implicitly definable over $\mathcal{M}$ .

There are many examples of implicitly definable relations that are not explicitly definable.

Many-sorted structures

Structures as defined above are sometimes called one-sorted structures to distinguish them from the more general many-sorted structures. A many-sorted structure can have an arbitrary number of domains. The sorts are part of the signature, and they play the role of names for the different domains. Many-sorted signatures also prescribe on which sorts the functions and relations of a many-sorted structure are defined. Therefore the arities of function symbols or relation symbols must be more complicated objects such as tuples of sorts rather than natural numbers.

Vector spaces, for example, can be regarded as two-sorted structures in the following way. The two-sorted signature of vector spaces consists of two sorts V (for vectors) and S (for scalars) and the following function symbols:

+_S and ×_S of arity (S, S; S).
−_S of arity (S; S).
0_S and 1_S of arity (S).

+_V of arity (V, V; V).
−_V of arity (V; V).
0_V of arity (V).

× of arity (S, V; V).

If V is a vector space over a field F, the corresponding two-sorted structure $\mathcal V$ consists of the vector domain $|\mathcal V|_V=V$ , the scalar domain $|\mathcal V|_S=F$ , and the obvious functions, such as the vector zero $0_V^{\mathcal V}=0\in|\mathcal V|_V$ , the scalar zero $0_S^{\mathcal V}=0\in|\mathcal V|_S$ , or scalar multiplication $\times^{\mathcal V}:|\mathcal V|_S\times|\mathcal V|_V\rightarrow|\mathcal V|_V$ .

Many-sorted structures are often used as a convenient tool even when they could be avoided with a little effort. But they are rarely defined in a rigorous way, because it is straightforward and tedious (hence unrewarding) to carry out the generalization explicitly.

In most mathematical endeavours, not much attention is paid to the sorts. A many-sorted logic however naturally leads to a type theory. As Bart Jacobs puts it: "A logic is always a logic over a type theory." This emphasis in turn leads to categorical logic because a logic over a type theory categorically corresponds to one ("total") category, capturing the logic, being fibred over another ("base") category, capturing the type theory.^[6]

Other generalizations

Partial algebras

Both universal algebra and model theory study classes of (structures or) algebras that are defined by a signature and a set of axioms. In the case of model theory these axioms have the form of first-order sentences. The formalism of universal algebra is much more restrictive; essentially it only allows first-order sentences that have the form of universally quantified equations between terms, e.g. $\forall$ x $\forall$ y (x + y = y + x). One consequence is that the choice of a signature is more significant in universal algebra than it is in model theory. For example the class of groups, in the signature consisting of the binary function symbol × and the constant symbol 1, is an elementary class, but it is not a variety. Universal algebra solves this problem by adding a unary function symbol ⁻¹.

In the case of fields this strategy works only for addition. For multiplication it fails because 0 does not have a multiplicative inverse. An ad hoc attempt to deal with this would be to define 0⁻¹ = 0. (This attempt fails, essentially because with this definition 0 × 0⁻¹ = 1 is not true.) Therefore one is naturally led to allow partial functions, i.e., functions which are defined only on a subset of their domain. However, there are several obvious ways to generalize notions such as substructure, homomorphism and identity.

Structures for typed languages

In type theory, there are many sorts of variables, each of which has a type. Types are inductively defined; given two types δ and σ there is also a type σ → δ that represents functions from objects of type σ to objects of type δ. A structure for a typed language (in the ordinary first-order semantics) must include a separate set of objects of each type, and for a function type the structure must have complete information about the function represented by each object of that type.

Higher-order languages

Main article: Second-order logic

There is more than one possible semantics for higher-order logic, as discussed in the article on second-order logic. When using full higher-order semantics, a structure need only have a universe for objects of type 0, and the T-schema is extended so that a quantifier over a higher-order type is satisfied by the model if and only if it is disquotationally true. When using first-order semantics, an additional sort is added for each higher-order type, as in the case of a many sorted first order language.

Structures that are proper classes

In the study of set theory and category theory, it is sometimes useful to consider structures in which the domain of discourse is a proper class instead of a set. These structures are sometimes called class models to distinguish them from the "set models" discussed above. When the domain is a proper class, each function and relation symbol may also be represented by a proper class.

In Bertrand Russell's Principia Mathematica, structures were also allowed to have a proper class as their domain.

Notes

^ Some authors refer to structures as "algebras" when generalizing universal algebra to allow relations as well as functions.
^ Wilfrid Hodges (2009). "Functional Modelling and Mathematical Models". In Anthonie Meijers. Philosophy of technology and engineering sciences. Handbook of the Philosophy of Science. 9. Elsevier. ISBN 9780444516671.
^ This is similar to the definition of a prime number in elementary number theory, which has been carefully chosen so that the irreducible number 1 is not considered prime. The convention that the domain of a structure may not be empty is particularly important in logic, because several common inference rules, notably, universal instantiation, are not sound when empty structures are permitted. A logical system that allows the empty domain is known as a free logic.
^ As a consequence of these conventions, the notation $|\mathcal A|$ may also be used to refer to the cardinality of the domain of $\mathcal A$ . In practice this never leads to confusion.
^ Jeavons, Peter; David Cohen; Justin Pearson (1998), "Constraints and universal algebra", Annals of Mathematics and Artificial Intelligence 24: 51–67, doi:10.1023/A:1018941030227.
^ Jacobs, Bart (1999), Categorical Logic and Type Theory, Elsevier, pp. 1–4

References

Burris, Stanley N.; Sankappanavar, H. P. (1981), A Course in Universal Algebra, Berlin, New York: Springer-Verlag, http://www.thoralf.uwaterloo.ca/htdocs/ualg.html
Chang, Chen Chung; Keisler, H. Jerome (1989) [1973], Model Theory, Elsevier, ISBN 978-0-7204-0692-4
Diestel, Reinhard (2005) [1997], Graph Theory, Graduate Texts in Mathematics, 173 (3rd ed.), Berlin, New York: Springer-Verlag, ISBN 978-3-540-26183-4, http://www.math.uni-hamburg.de/home/diestel/books/graph.theory/
Ebbinghaus, Heinz-Dieter; Flum, Jörg; Thomas, Wolfgang (1994), Mathematical Logic (2nd ed.), New York: Springer, ISBN 978-0-387-94258-2
Hinman, P. (2005), Fundamentals of Mathematical Logic, A K Peters, ISBN 978-1-56881-262-5
Hodges, Wilfrid (1993), Model theory, Cambridge: Cambridge University Press, ISBN 978-0-521-30442-9
Hodges, Wilfrid (1997), A shorter model theory, Cambridge: Cambridge University Press, ISBN 978-0-521-58713-6
Marker, David (2002), Model Theory: An Introduction, Berlin, New York: Springer-Verlag, ISBN 978-0-387-98760-6
Poizat, Bruno (2000), A Course in Model Theory: An Introduction to Contemporary Mathematical Logic, Berlin, New York: Springer-Verlag, ISBN 978-0-387-98655-5
Rautenberg, Wolfgang (2010), A Concise Introduction to Mathematical Logic (3rd ed.), New York: Springer Science+Business Media, doi:10.1007/978-1-4419-1221-3, ISBN 978-1-4419-1220-6, http://www.springerlink.com/content/978-1-4419-1220-6/
Rothmaler, Philipp (2000), Introduction to Model Theory, London: CRC Press, ISBN 9789056993139

External links

Semantics section in Classical Logic (an entry of Stanford Encyclopedia of Philosophy)

Logic

Overview

Academic areas	Argumentation theory Axiology Critical thinking Computability theory Formal semantics History of logic Informal logic Logic in computer science Mathematical logic Mathematics Metalogic Metamathematics Model theory Philosophical logic Philosophy Philosophy of logic Philosophy of mathematics Proof theory Set theory

Foundational concepts	Abduction Analytic truth Antinomy A priori Deduction Definition Description Entailment Induction Inference Logical consequence Logical form Logical implication Logical truth Name Necessity Meaning Paradox Possible world Presupposition Probability Reason Reasoning Reference Semantics Statement Strict implication Substitution Syntax Truth Truth value Validity

Philosophical logic

Critical thinking and Informal logic	Analysis Ambiguity Argument Belief Bias Credibility Evidence Explanation Explanatory power Fact Fallacy Inquiry Opinion Parsimony Premise Propaganda Prudence Reasoning Relevance Rhetoric Rigor Vagueness

Theories of deduction	Constructivism Dialetheism Fictionalism Finitism Formalism Intuitionism Logical atomism Logicism Nominalism Platonic realism Pragmatism Realism

Metalogic and metamathematics

Cantor's theorem Church's theorem Church's thesis Consistency Effective method Foundations of mathematics Gödel's completeness theorem Gödel's incompleteness theorems Soundness Completeness Decidability Interpretation Löwenheim–Skolem theorem Metatheorem Satisfiability Independence Type–token distinction Use–mention distinction

Mathematical logic

General	Formal language Formation rule Formal system Deductive system Formal proof Formal semantics Well-formed formula Set Element Class Classical logic Axiom Natural deduction Rule of inference Relation Theorem Logical consequence Axiomatic system Type theory Symbol Syntax Theory

Traditional logic	Proposition Inference Argument Validity Cogency Syllogism Square of opposition Venn diagram

Propositional calculus and Boolean logic	Boolean functions Propositional calculus Propositional formula Logical connectives Truth tables

Predicate	First-order Quantifiers Predicate Second-order Monadic predicate calculus

Set theory	Set Empty set Enumeration Extensionality Finite set Function Subset Power set Countable set Recursive set Domain Range Ordered pair Uncountable set

Model theory	Model Interpretation Non-standard model Finite model theory Truth value Validity

Proof theory	Formal proof Deductive system Formal system Theorem Logical consequence Rule of inference Syntax

Computability theory	Recursion Recursive set Recursively enumerable set Decision problem Church–Turing thesis Computable function Primitive recursive function

Non-classical logic

Modal logic	Alethic Axiologic Deontic Doxastic Epistemic Temporal

Intuitionism	Intuitionistic logic Constructive analysis Heyting arithmetic Intuitionistic type theory Constructive set theory

Fuzzy logic	Degree of truth Fuzzy rule Fuzzy set Fuzzy finite element Fuzzy set operations

Substructural logic	Structural rule Relevance logic Linear logic

Paraconsistent logic	Dialetheism

Description logic	Ontology Ontology language

Logicians

Anderson Aristotle Averroes Avicenna Bain Barwise Bernays Boole Boolos Cantor Carnap Church Chrysippus Curry De Morgan Frege Geach Gentzen Gödel Hilbert Kleene Kripke Leibniz Löwenheim Peano Peirce Putnam Quine Russell Schröder Scotus Skolem Smullyan Tarski Turing Whitehead William of Ockham Wittgenstein Zermelo

Lists

Topics	Outline of logic Index of logic articles Mathematical logic Boolean algebra Set theory

Other	Logicians Rules of inference Paradoxes Fallacies Logic symbols

Portal
Category
Outline
WikiProject
Talk
changes

Structure (mathematical logic)

Contents

Definition

Domain

Signature

Interpretation function

Examples

Induced substructures and closed subsets

Examples

Homomorphisms and embeddings

Homomorphisms

Embeddings

Example

Homomorphism problem

Structures and first-order logic

Satisfaction relation

Definable relations

Definability with parameters

Implicit definability

Many-sorted structures

Other generalizations

Partial algebras

Structures for typed languages

Higher-order languages

Structures that are proper classes

Notes

References

External links