48 relations: Abelian group, Abstract algebra, Algebraic structure, Arity, Associative property, Axiom, Bijection, Binary operation, Boolean algebra, Boolean algebra (structure), Boolean domain, Boolean function, Bounded set, Canonical normal form, Commutative property, Concatenation, De Morgan's laws, Decidability (logic), Decision problem, Distributive lattice, Distributive property, Duality (order theory), Elementary algebra, Exponential function, Lattice (order), Laws of Form, Logical conjunction, Logical disjunction, Logical equivalence, Logical NOR, Map (mathematics), Mathematics, Metatheorem, Negation, Operation (mathematics), Order of operations, Order theory, Partially ordered set, Paul Halmos, Polynomial, Principle of bivalence, Sheffer stroke, Stanford Encyclopedia of Philosophy, Syntax, Unary operation, Universal algebra, Universe (mathematics), Willard Van Orman Quine.
In abstract algebra, an abelian group, also called a commutative group, is a group in which the result of applying the group operation to two group elements does not depend on the order in which they are written.
In algebra, which is a broad division of mathematics, abstract algebra (occasionally called modern algebra) is the study of algebraic structures.
In mathematics, and more specifically in abstract algebra, an algebraic structure on a set A (called carrier set or underlying set) is a collection of finitary operations on A; the set A with this structure is also called an algebra.
In logic, mathematics, and computer science, the arity of a function or operation is the number of arguments or operands that the function takes.
In mathematics, the associative property is a property of some binary operations.
An axiom or postulate is a statement that is taken to be true, to serve as a premise or starting point for further reasoning and arguments.
In mathematics, a bijection, bijective function, or one-to-one correspondence is a function between the elements of two sets, where each element of one set is paired with exactly one element of the other set, and each element of the other set is paired with exactly one element of the first set.
In mathematics, a binary operation on a set is a calculation that combines two elements of the set (called operands) to produce another element of the set.
In mathematics and mathematical logic, Boolean algebra is the branch of algebra in which the values of the variables are the truth values true and false, usually denoted 1 and 0 respectively.
In abstract algebra, a Boolean algebra or Boolean lattice is a complemented distributive lattice.
In mathematics and abstract algebra, a Boolean domain is a set consisting of exactly two elements whose interpretations include false and true.
In mathematics and logic, a (finitary) Boolean function (or switching function) is a function of the form ƒ: Bk → B, where B.
In mathematical analysis and related areas of mathematics, a set is called bounded, if it is, in a certain sense, of finite size.
In Boolean algebra, any Boolean function can be put into the canonical disjunctive normal form (CDNF) or minterm canonical form and its dual canonical conjunctive normal form (CCNF) or maxterm canonical form.
In mathematics, a binary operation is commutative if changing the order of the operands does not change the result.
In formal language theory and computer programming, string concatenation is the operation of joining character strings end-to-end.
In propositional logic and boolean algebra, De Morgan's laws are a pair of transformation rules that are both valid rules of inference.
In logic, the term decidable refers to the decision problem, the question of the existence of an effective method for determining membership in a set of formulas, or, more precisely, an algorithm that can and will return a boolean true or false value that is correct (instead of looping indefinitely, crashing, returning "don't know" or returning a wrong answer).
In computability theory and computational complexity theory, a decision problem is a problem that can be posed as a yes-no question of the input values.
In mathematics, a distributive lattice is a lattice in which the operations of join and meet distribute over each other.
In abstract algebra and formal logic, the distributive property of binary operations generalizes the distributive law from boolean algebra and elementary algebra.
In the mathematical area of order theory, every partially ordered set P gives rise to a dual (or opposite) partially ordered set which is often denoted by Pop or Pd.
Elementary algebra encompasses some of the basic concepts of algebra, one of the main branches of mathematics.
In mathematics, an exponential function is a function of the form in which the argument occurs as an exponent.
A lattice is an abstract structure studied in the mathematical subdisciplines of order theory and abstract algebra.
Laws of Form (hereinafter LoF) is a book by G. Spencer-Brown, published in 1969, that straddles the boundary between mathematics and philosophy.
In logic, mathematics and linguistics, And (∧) is the truth-functional operator of logical conjunction; the and of a set of operands is true if and only if all of its operands are true.
In logic and mathematics, or is the truth-functional operator of (inclusive) disjunction, also known as alternation; the or of a set of operands is true if and only if one or more of its operands is true.
In logic, statements p and q are logically equivalent if they have the same logical content.
In boolean logic, logical nor or joint denial is a truth-functional operator which produces a result that is the negation of logical or.
In mathematics, the term mapping, sometimes shortened to map, refers to either a function, often with some sort of special structure, or a morphism in category theory, which generalizes the idea of a function.
Mathematics (from Greek μάθημα máthēma, "knowledge, study, learning") is the study of such topics as quantity, structure, space, and change.
In logic, a metatheorem is a statement about a formal system proven in a metalanguage.
In logic, negation, also called the logical complement, is an operation that takes a proposition P to another proposition "not P", written \neg P (¬P), which is interpreted intuitively as being true when P is false, and false when P is true.
In mathematics, an operation is a calculation from zero or more input values (called operands) to an output value.
In mathematics and computer programming, the order of operations (or operator precedence) is a collection of rules that reflect conventions about which procedures to perform first in order to evaluate a given mathematical expression.
Order theory is a branch of mathematics which investigates the intuitive notion of order using binary relations.
In mathematics, especially order theory, a partially ordered set (also poset) formalizes and generalizes the intuitive concept of an ordering, sequencing, or arrangement of the elements of a set.
Paul Richard Halmos (Halmos Pál; March 3, 1916 – October 2, 2006) was a Hungarian-Jewish-born American mathematician who made fundamental advances in the areas of mathematical logic, probability theory, statistics, operator theory, ergodic theory, and functional analysis (in particular, Hilbert spaces).
In mathematics, a polynomial is an expression consisting of variables (also called indeterminates) and coefficients, that involves only the operations of addition, subtraction, multiplication, and non-negative integer exponents of variables.
In logic, the semantic principle (or law) of bivalence states that every declarative sentence expressing a proposition (of a theory under inspection) has exactly one truth value, either true or false.
In Boolean functions and propositional calculus, the Sheffer stroke, named after Henry M. Sheffer, written ↑, also written | (not to be confused with "||", which is often used to represent disjunction), or Dpq (in Bocheński notation), denotes a logical operation that is equivalent to the negation of the conjunction operation, expressed in ordinary language as "not both".
The Stanford Encyclopedia of Philosophy (SEP) combines an online encyclopedia of philosophy with peer-reviewed publication of original papers in philosophy, freely accessible to Internet users.
In linguistics, syntax is the set of rules, principles, and processes that govern the structure of sentences in a given language, usually including word order.
In mathematics, a unary operation is an operation with only one operand, i.e. a single input.
Universal algebra (sometimes called general algebra) is the field of mathematics that studies algebraic structures themselves, not examples ("models") of algebraic structures.
In mathematics, and particularly in set theory, category theory, type theory, and the foundations of mathematics, a universe is a collection that contains all the entities one wishes to consider in a given situation.
Willard Van Orman Quine (known to intimates as "Van"; June 25, 1908 – December 25, 2000) was an American philosopher and logician in the analytic tradition, recognized as "one of the most influential philosophers of the twentieth century." From 1930 until his death 70 years later, Quine was continually affiliated with Harvard University in one way or another, first as a student, then as a professor of philosophy and a teacher of logic and set theory, and finally as a professor emeritus who published or revised several books in retirement.