Short description: Omission of operations and relations of a structure
In universal algebra and in model theory, a reduct of an algebraic structure is obtained by omitting some of the operations and relations of that structure. The opposite of "reduct" is "expansion".
Definition
Let A be an algebraic structure (in the sense of universal algebra) or a structure in the sense of model theory, organized as a set X together with an indexed family of operations and relations φi on that set, with index set I. Then the reduct of A defined by a subset J of I is the structure consisting of the set X and J-indexed family of operations and relations whose j-th operation or relation for j ∈ J is the j-th operation or relation of A. That is, this reduct is the structure A with the omission of those operations and relations φi for which i is not in J.
A structure A is an expansion of B just when B is a reduct of A. That is, reduct and expansion are mutual converses.
Examples
The monoid (Z, +, 0) of integers under addition is a reduct of the group (Z, +, −, 0) of integers under addition and negation, obtained by omitting negation. By contrast, the monoid (N, +, 0) of natural numbers under addition is not the reduct of any group.
Conversely the group (Z, +, −, 0) is the expansion of the monoid (Z, +, 0), expanding it with the operation of negation.
References
- Burris, Stanley N.; H. P. Sankappanavar (1981). A Course in Universal Algebra. Springer. ISBN 3-540-90578-2. http://www.thoralf.uwaterloo.ca/htdocs/ualg.html.
- Hodges, Wilfrid (1993). Model theory. Cambridge University Press. ISBN 0-521-30442-3. https://archive.org/details/modeltheory0000hodg.
Mathematical logic |
|---|
| General |
- Formal language
- Formation rule
- Formal proof
- Formal semantics
- Well-formed formula
- Set
- Element
- Class
- Classical logic
- Axiom
- Rule of inference
- Relation
- Theorem
- Logical consequence
- Type theory
- Symbol
- Syntax
- Theory
|
|---|
| Systems |
- Formal system
- Deductive system
- Axiomatic system
- Hilbert style systems
- Natural deduction
- Sequent calculus
|
|---|
| 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
- Many-valued logic
|
|---|
| Predicate logic |
- First-order
- Quantifiers
- Predicate
- Second-order
- Monadic predicate calculus
|
|---|
| Naive set theory |
- Set
- Empty set
- Element
- Enumeration
- Extensionality
- Finite set
- Infinite set
- Subset
- Power set
- Countable set
- Uncountable set
- Recursive set
- Domain
- Codomain
- Image
- Map
- Function
- Relation
- Ordered pair
|
|---|
| Set theory |
- Foundations of mathematics
- Zermelo–Fraenkel set theory
- Axiom of choice
- General set theory
- Kripke–Platek set theory
- Von Neumann–Bernays–Gödel set theory
- Morse–Kelley set theory
- Tarski–Grothendieck set theory
|
|---|
| 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
|
|---|
 | Original source: https://en.wikipedia.org/wiki/Reduct. Read more |