deductive system
101Platonism — Part of a series on …
102Semiotic elements and classes of signs — C. S. Peirce articles  General:    Charles Sanders Peirce Charles Sanders Peirce bibliography Philosophical:    Categories (Peirce) Semiotic elements and   classes of signs (Peirce) Pragmatic maxim • Pragmaticism… …
103Definition — For other uses, see Definition (disambiguation). A definition is a passage that explains the meaning of a term (a word, phrase or other set of symbols), or a type of thing. The term to be defined is the definiendum. A term may have many different …
104Decision problem — A decision problem has only two possible outputs, yes or no (or alternately 1 or 0) on any input. In computability theory and computational complexity theory, a decision problem is a question in some formal system with a yes or no answer,… …
105Ludwig Wittgenstein — Wittgenstein redirects here. For other uses, see Wittgenstein (disambiguation). Ludwig Wittgenstein Photographed by Ben Richards Swansea, Wales, 1947 Born 26 April 1889 …
106Intuitionism — This article is about Intuitionism in mathematics and philosophical logic. For other uses, see Ethical intuitionism. In the philosophy of mathematics, intuitionism, or neointuitionism (opposed to preintuitionism), is an approach to mathematics as …
107Paradox — For other uses, see Paradox (disambiguation). Further information: List of paradoxes A paradox is a seemingly true statement or group of statements that lead to a contradiction or a situation which seems to defy logic or intuition. Typically,… …
108Name — For other uses, see Name (disambiguation). Ceremonies, such as baptism, can be used to give names. A name is a word or term used for identification. Names can identify a class or category of things, or a single thing, either uniquely, or within a …
109Recursively enumerable set — In computability theory, traditionally called recursion theory, a set S of natural numbers is called recursively enumerable, computably enumerable, semidecidable, provable or Turing recognizable if: There is an algorithm such that the set of… …
110Löwenheim–Skolem theorem — In mathematical logic, the Löwenheim–Skolem theorem, named for Leopold Löwenheim and Thoralf Skolem, states that if a countable first order theory has an infinite model, then for every infinite cardinal number κ it has a model of size κ. The… …
