propositional operator
101If and only if — Iff redirects here. For other uses, see IFF (disambiguation). ↔ ⇔ ≡ Logical symbols representing iff. In logic and related fields such as mathematics and philosophy, if and only if (shortened iff) is a biconditional logical connective between… …
102Laws of classical logic — The laws of classical logic are a small collection of fundamental sentences of propositional logic and Boolean algebra, from which may be derived all true sentences in both of these elementary formal systems.The syntax of the laws of classical… …
103List of basic discrete mathematics topics — Discrete mathematics, also called finite mathematics, is the study of mathematical structures that are fundamentally , in the sense of not supporting or requiring the notion of continuity. Most, if not all, of the objects studied in finite… …
104Linear temporal logic — (LTL) is a modal temporal logic with modalities referring to time. In LTL, one can encode formulae about the future of paths such as that a condition will eventually be true, that a condition will be true until another fact becomes true,… …
105Derivative algebra (abstract algebra) — In abstract algebra, a derivative algebra is an algebraic structure of the signature <A, ·, +, , 0, 1, D> where <A, ·, +, , 0, 1> is a Boolean algebra and D is a unary operator, the derivative operator, satisfying the identities: 0D …
106List of mathematics articles (I) — NOTOC Ia IA automorphism ICER Icosagon Icosahedral 120 cell Icosahedral prism Icosahedral symmetry Icosahedron Icosian Calculus Icosian game Icosidodecadodecahedron Icosidodecahedron Icositetrachoric honeycomb Icositruncated dodecadodecahedron… …
107Algebraic semantics — In logic, algebraic semantics is a formal semantics based on algebras. For example, the modal logic S4 is characterized by the class of topological boolean algebras mdash;that is, boolean algebras with an interior operator. Other modal logics are …
108Mu calculus — The μ calculus (also modal μ calculus) is a class of temporal logics with a least fixpoint operator μ. It is used to describe properties of labelled transition systems and for verifying these properties.The (propositional) μ calculus was invented …
109List of basic topics in logic — For a more comprehensive list, see the List of logic topics. Logic, a branch of both philosophy and mathematics, is the study of criteria for the evaluation of arguments. The task of the logician is to advance an account of valid and fallacious… …
110Cylindric algebra — The notion of cylindric algebra, invented by Alfred Tarski, arises naturally in the algebraization of first order logic with equality. This is comparable to the role Boolean algebras play for propositional logic. Indeed, cylindric algebras are… …
