(computer science) Model of computation based on combinators.

(mathematics) A form of reasoning, derived from fuzzy set theory, whereby a truth value need not be exactly zero (false) or one (true), but rather can be zero, one, or any value in between.

(logic) The generic term for symbolic formal systems like first-order logic, second-order logic, many-sorted logic or infinitary logic. / (logic) First-order logic.

(logic) A formal deductive system in which formulae representing propositions can be formed by combining atomic propositions using logical connectives.

(philosophy) The doctrine that the world consists of ultimate logical "facts" (or "atoms") that cannot be broken down any further.

(logic) A formal deductive system able to represent the distinction between intension and extension of a term.

(logic) A subfield of logic and mathematics consisting of both the mathematical study of logic and the application of this study to other areas of mathematics, exemplified by questions on the expressive power of formal logics and the deductive power of formal proof systems.

(logic) A formal system.

(logic) Mathematical logic. / (logic) A particular logical calculus.

(logic) A formal system.