In mathematical logic and computer science the symbol has taken the name turnstile because of its resemblance to a typical turnstile if viewed from above. It is also referred to as tee and is often read as "yields", "proves", "satisfies" or "entails". The symbol was first used by Gottlob Frege in his 1879 book on logic, Begriffsschrift.
In TeX, the turnstile symbol is obtained from the command \vdash. In Unicode, the turnstile symbol (⊢) is called right tack and is at code point U+22A2. On a typewriter, a turnstile can be composed from a vertical bar (|) and a dash (–). In LaTeX there is a turnstile package which issues this sign in many ways, and is capable of putting labels below or above it, in the correct places.
- In metalogic, the study of formal languages; the turnstile represents syntactic consequence (or "derivability"). This is to say, that it shows that one string can be derived from another in a single step, according to the transformation rules (i.e. the syntax) of some given formal system. As such, the expression
- means that is derivable from in the system.
- Consistent with its use for derivability, a "" followed by an expression without anything preceding it denotes a theorem, which is to say that the expression can be derived from the rules using an empty set of axioms. As such, the expression
- means that is a theorem in the system.
- In proof theory, the turnstile is used to denote "provability". For example, if is a formal theory and is a particular sentence in the language of the theory then
- means that is provable from . This usage is demonstrated in the article on propositional calculus.
- In the typed lambda calculus, the turnstile is used to separate typing assumptions from the typing judgment.
- In category theory, a reversed turnstile (⊣), as in , is used to indicate that the functor is left adjoint to the functor .
- Gottlob Frege, Begriffsschrift: Eine der arithmetischen nachgebildete Formelsprache des reinen Denkens. Halle, 1879.
- Unicode standard
- A. S. Troelstra and H. Schwichtenberg, Basic Proof Theory, second edition, Cambridge University Press, 2000, ISBN 978-0-521-77911-1.
- David A. Schmidt, The Structure of Typed Programming Languages, MIT Press, 1994, ISBN 0-262-19349-3