(computer science) Model of computation based on combinators.

plural of logan

(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.

In a logarithmic manner.

(mathematics) The logarithm base two.

(logic) The fragment of predicate logic in which all predicate letters are monadic (that is, they take only one argument), and there are no function letters.

(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 extended from propositional logic with the possibility to quantify over individuals of the domain of discourse.

(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.