Structure (mathematical logic)

| Main Article
| Discussion
| Related Articles  [?]
| Bibliography  [?]
| External Links  [?]
| Citable Version  [?]

|
|
|
|
|
|
|
|

This editable Main Article is under development and subject to a disclaimer.

[edit intro]

In mathematical logic, the notion of a structure generalizes mathematical objects such as groups, rings, fields, lattices or ordered sets. A structure is a set equipped with any number of named constants, operations and relations. For example the ordered group of integers can be regarded as a structure consisting of the set of integers ℤ={…,−2,−1,0,1,2,…} together with the constant 0, the binary operation + (addition), the unary function − (which maps each integer to its inverse), and the binary relation <. This structure is often denoted by (ℤ,0,+,−,<).

Like most mathematical objects, structures are typically not studied individually in isolation. Given two structures A and B, a homomorphism from A to B is a map from the underlying set of A to the underlying set of B which respects the additional information given by the constants, operations and relations. For example the map f:ℤ->ℤ which multiplies every integer by 2 is a homomorphism from the structure (ℤ,0,+,−,<) to itself, because f(0)=0, f(x+y)=f(x)+f(y), f(−x)=−f(x), and because x<y implies f(x)<f(y). One only speaks of homomorphisms f:A->B when A and B have the same signature, i.e. when they both have the same number of constants and these have the same names, and the number, names and arities of functions and relations agree likewise.

Structures are studied in model theory, where the term model is often used as a synonym. Structures without relations are studied in universal algebra, and a structure with only constants and operations is often referred to as an algebra or, to avoid confusion with algebras over a field, as a universal algebra.