logical counterexample
21Falsifiability — Are all swans white? Falsifiability or refutability of an assertion, hypothesis or theory is the logical possibility that it can be contradicted by an observation or the outcome of a physical experiment. That something is falsifiable does not… …
22Raven paradox — The Raven paradox, also known as Hempel s paradox or Hempel s ravens is a paradox proposed by the German logician Carl Gustav Hempel in the 1940s to illustrate a problem where inductive logic violates intuition. It reveals the problem of… …
23Universal quantification — In predicate logic, universal quantification is an attempt to formalize the notion that something (a logical predicate) is true for everything , or every relevant thing.The resulting statement is a universally quantified statement, and we have… …
24Busy beaver — In computability theory, a busy beaver (from the colloquial expression for an industrious person) is a Turing machine that attains the maximum operational busyness (such as measured by the number of steps performed, or the number of nonblank… …
25Method of analytic tableaux — A graphical representation of a partially built propositional tableau In proof theory, the semantic tableau (or truth tree) is a decision procedure for sentential and related logics, and a proof procedure for formulas of first order logic. The… …
26mind, philosophy of — Branch of philosophy that studies the nature of mind and its various manifestations, including intentionality, sensation and sense perception, feeling and emotion, traits of character and personality, the unconscious, volition, thought, memory,… …
27Law of excluded middle — This article uses forms of logical notation. For a concise description of the symbols used in this notation, see Table of logic symbols. In logic, the law of the excluded middle states that the propositional calculus formula P ∨ ¬ P ( P or not P… …
28Game semantics — (German: dialogische Logik) is an approach to formal semantics that grounds the concepts of truth or validity on game theoretic concepts, such as the existence of a winning strategy for a player, somewhat resembling Socratic dialogues or medieval …
29Identity of indiscernibles — The identity of indiscernibles is an ontological principle which states that two or more objects or entities are identical (are one and the same entity), if they have all their properties in common. That is, entities x and y are identical if any… …
30Model-based testing — is the application of Model based design for designing and optionally executing the necessary artifacts to perform software testing. Models can be used to represent the desired behavior of the System Under Test (SUT), or to represent the desired… …
