binary connective

См. также в других словарях:

• Logical connective — This article is about connectives in classical logic. For connectors in natural languages, see discourse connective. For connectives and operators in other logics, see logical constant. For other logical symbols, see table of logic symbols. In… …   Wikipedia

• Propositional formula — In propositional logic, a propositional formula is a type of syntactic formula which is well formed and has a truth value. If the values of all variables in a propositional formula are given, it determines a unique truth value. A propositional… …   Wikipedia

• First-order logic — is a formal logical system used in mathematics, philosophy, linguistics, and computer science. It goes by many names, including: first order predicate calculus, the lower predicate calculus, quantification theory, and predicate logic (a less… …   Wikipedia

• Functional completeness — In logic, a functionally complete set of logical connectives or Boolean operators is one which can be used to express all possible truth tables by combining members of the set into a Boolean expression.[1][2] A well known complete set of… …   Wikipedia

• Propositional 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

• Recursive definition — A recursive definition or inductive definition is one that defines something in terms of itself (that is, recursively), albeit in a useful way. For it to work, the definition in any given case must be well founded, avoiding an infinite regress.… …   Wikipedia

• Łukasiewicz logic — In mathematics, Łukasiewicz logic is a non classical, many valued logic. It was originally defined by Jan Łukasiewicz as a three valued logic;Łukasiewicz J., 1920, O logice trójwartościowej (in Polish). Ruch filozoficzny 5:170–171. English… …   Wikipedia

• T-norm fuzzy logics — are a family of non classical logics, informally delimited by having a semantics which takes the real unit interval [0, 1] for the system of truth values and functions called t norms for permissible interpretations of conjunction. They are mainly …   Wikipedia

• List of algebraic structures — In universal algebra, a branch of pure mathematics, an algebraic structure is a variety or quasivariety. Abstract algebra is primarily the study of algebraic structures and their properties. Some axiomatic formal systems that are neither… …   Wikipedia

• Algebraic structure — In algebra, a branch of pure mathematics, an algebraic structure consists of one or more sets closed under one or more operations, satisfying some axioms. Abstract algebra is primarily the study of algebraic structures and their properties. The… …   Wikipedia

• Interpretation (logic) — An interpretation is an assignment of meaning to the symbols of a formal language. Many formal languages used in mathematics, logic, and theoretical computer science are defined in solely syntactic terms, and as such do not have any meaning until …   Wikipedia