intuitionistic system
101Syllogism — A syllogism (Greek: συλλογισμός – syllogismos – conclusion, inference ) is a kind of logical argument in which one proposition (the conclusion) is inferred from two or more others (the premises) of a certain form. In antiquity, there were… …
102Fallacy — In logic and rhetoric, a fallacy is usually incorrect argumentation in reasoning resulting in a misconception or presumption. By accident or design, fallacies may exploit emotional triggers in the listener or interlocutor (appeal to emotion), or… …
103Mathematical proof — In mathematics, a proof is a convincing demonstration (within the accepted standards of the field) that some mathematical statement is necessarily true.[1][2] Proofs are obtained from deductive reasoning, rather than from inductive or empirical… …
104Name — 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 …
105Recursively 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… …
106Non-monotonic logic — A non monotonic logic is a formal logic whose consequence relation is not monotonic. Most studied formal logics have a monotonic consequence relation, meaning that adding a formula to a theory never produces a reduction of its set of consequences …
107Lö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… …
108List of Boolean algebra topics — This is a list of topics around Boolean algebra and propositional logic. Contents 1 Articles with a wide scope and introductions 2 Boolean functions and connectives 3 Examples of Boolean algebras …
109Computable function — Total recursive function redirects here. For other uses of the term recursive function , see Recursive function (disambiguation). Computable functions are the basic objects of study in computability theory. Computable functions are the formalized …
110Philosophical realism — Contemporary philosophical realism is the belief that our reality, or some aspect of it, is ontologically independent of our conceptual schemes, linguistic practices, beliefs, etc. Realism may be spoken of with respect to other minds, the past,… …
