boolean connective

  • 31Propositional variable — In mathematical logic, a propositional variable (also called a sentential variable or sentential letter) is a variable which can either be true or false. Propositional variables are the basic building blocks of propositional formulas, used in… …

    Wikipedia

  • 32Truth table — A truth table is a mathematical table used in logic specifically in connection with Boolean algebra, boolean functions, and propositional calculus to compute the functional values of logical expressions on each of their functional arguments, that …

    Wikipedia

  • 33Converse nonimplication — In logic, converse nonimplication is a logical connective which is the negation of the converse of implication. Contents 1 Definition 1.1 Truth table 1.2 Venn diagram …

    Wikipedia

  • 34Relation algebra — is different from relational algebra, a framework developed by Edgar Codd in 1970 for relational databases. In mathematics, a relation algebra is a residuated Boolean algebra supporting an involutary unary operation called converse. The… …

    Wikipedia

  • 35Truth function — Truth functional redirects here, for the truth functional conditional, see Material conditional. In mathematical logic, a truth function is a function from a set of truth values to truth values. Classically the domain and range of a truth… …

    Wikipedia

  • 36Post's lattice — In logic and universal algebra, Post s lattice denotes the lattice of all clones on a two element set {0, 1}, ordered by inclusion. It is named for Emil Post, who published a complete description of the lattice in 1941 [E. L. Post, The two valued …

    Wikipedia

  • 37Logical disjunction — Disjunction redirects here. For separation of chromosomes, see Meiosis. For disjunctions in distribution, see Disjunct distribution. Venn diagram of the logical disjunction of A and B …

    Wikipedia

  • 38Sheffer stroke — This article is about the logical NAND operator. For the electronic NAND gate, see Negated AND gate. For other uses, see Nand (disambiguation). Venn diagram of In Boolean functions and propositional calculus, the Sheffer stroke, named after …

    Wikipedia

  • 39Tautology (logic) — In propositional logic, a tautology (from the Greek word ταυτολογία) is a propositional formula that is true under any possible valuation (also called a truth assignment or an interpretation) of its propositional variables. For example, the… …

    Wikipedia

  • 40Leibniz operator — One of the cornerstone concepts in the theory of abstract algebraic logic is that of the Leibniz operator.MotivationThe Leibniz operator was introduced by Willem Blok and Don Pigozzi, two of the founders of the field, as a means to abstract the… …

    Wikipedia