Nepedia
Back to Discover
Advanced Reader
🔢

Structure (mathematical logic)

math Maturity 11-13 Next article →

In mathematical logic, a structure is a formal way to organize a set of objects using specific rules. It is not just a collection of things; it is a system that defines how those things interact. Mathematicians use structures to study algebra and model theory. Universal algebra looks at structures that generalize ideas like groups, rings, and vector spaces. Model theory uses structures to define the meaning of first-order logic. In this field, a structure is often called a model if it satisfies all the sentences in a given theory.

To build a structure, you must define three specific components: a domain, a signature, and an interpretation function. The domain is an arbitrary set of objects, sometimes called the universe or the underlying set. In classical first-order logic, the domain cannot be empty. The signature is a list of symbols that represent functions and relations. Each symbol has an arity, which is a natural number representing how many elements the symbol acts upon. Finally, the interpretation function connects the symbols to the domain. It assigns an n-ary function to each function symbol and an n-ary relation to each relation symbol.

Functions and relations within a structure work in very specific ways. A function symbol of arity $n$ becomes a real operation that takes $n$ elements from the domain and produces a result. If a function symbol has an arity of zero, it is called a constant symbol. This constant identifies a specific, fixed element within the domain. Relation symbols work differently by describing how elements relate to one another. For example, a binary relation symbol might describe a connection between two elements. These rules allow us to turn abstract symbols into concrete mathematical actions.

The history of these ideas involves several important thinkers. Since the 19th century, mathematicians have used models to prove if a set of axioms is consistent. In 1940, the philosopher Willard Van Orman Quine used the term "model" while referencing the work of Richard Dedekind. Dedekind was a pioneer in set theory from 1831 to 1916. Later, in 1954, Alfred Tarski, a member of the Lwów–Warsaw school, coined the term "theory of models." These developments helped move logic from abstract reasoning toward a more formal, structural science.

We can see structures in many familiar mathematical systems. For instance, the rational numbers can be viewed as a structure with a specific signature. This signature includes two binary function symbols for addition and multiplication, a unary function for negation, and two constant symbols for zero and one. The real numbers and complex numbers follow this same pattern. Interestingly, the ring of integers is also a structure using this same signature, even though it is not a field. This shows that a structure does not have to satisfy every rule of a specific system to be valid.

Sometimes, one structure is contained within another, which we call an induced substructure. For a structure to be an induced substructure, it must share the same signature and its domain must be a subset of the larger domain. Furthermore, all functions and relations must work the same way in both. A subset of a domain is called "closed" if applying any function to its elements always results in another element within that same subset. The rational numbers are an induced substructure of the real numbers. Similarly, the real numbers are an induced substructure of the complex numbers.

Mathematicians also use homomorphisms to compare different structures. A homomorphism is a map from one structure to another that preserves all functions and relations. If you move an element from one system to another using a homomorphism, the mathematical rules must still hold true. A special type of homomorphism is called an embedding. An embedding is a homomorphism that is also injective, meaning it maps distinct elements to distinct targets. These concepts are vital in computer science. For example, the "homomorphism problem" is used to study the complexity of constraint satisfaction problems and database queries.

665 words

Where will your curiosity go next?

Keep exploring at your chosen reading level.

More to explore

What is Nepedia?

A free, ad-free encyclopedia for children. Every article is written at five reading levels, so the same page works for a five-year-old and a fifteen-year-old — use the level switcher above to see this one change. No account needed to read.