propositional operator
111Multimodal logic — A multimodal logic is a modal logic that has more than one primitive modal operator. They find substantial applications in theoretical computer science. A modal logic with n primitive unary modal operators is called an n modal logic. Given these… …
112Law of noncontradiction — This article uses forms of logical notation. For a concise description of the symbols used in this notation, see List of logic symbols. In classical logic, the law of non contradiction (LNC) (or the principle of non contradiction (PNC), or the… …
113Tractatus Logico-Philosophicus — is the only book length work published by Austrian philosopher Ludwig Wittgenstein. He wrote it as a soldier and a prisoner of war during World War I. First published in German in 1921 as Logisch Philosophische Abhandlung , it is now widely… …
1140 (number) — Zero redirects here. For other uses, see Zero (disambiguation). 0 −1 0 1 2 3 4 5 6 7 8 …
115Logical implication — In logic and mathematics, logical implication is a logical relation that holds between a set T of formulae and a formula B when every model (or interpretation or valuation) of T is also a model of B . In symbols,# T models B, # T Rightarrow B # T …
116Linear logic — In mathematical logic, linear logic is a type of substructural logic that denies the structural rules of weakening and contraction . The interpretation is of hypotheses as resources : every hypothesis must be consumed exactly once in a proof.… …
117Calculus of constructions — The calculus of constructions (CoC) is a higher order typed lambda calculus, initially developed by Thierry Coquand, where types are first class values. It is thus possible, within the CoC, to define functions from, say, integers to types, types… …
118Constructive dilemma — Rules of inference Propositional calculus Modus ponens (A→B, A ⊢ B) Modus tollens (A→B, ¬B ⊢ ¬A) …
119Simply typed lambda calculus — The simply typed lambda calculus (lambda^ o) is a typed interpretation of the lambda calculus with only one type combinator: o (function type). It is the canonical and simplest example of a typed lambda calculus. The simply typed lambda calculus… …
120Logic alphabet — The logic alphabet was developed by Dr. Shea Zellweger in the 1950s while working as a switchboard operator. It constitutes an iconic set of symbols systematically representing the sixteen possible binary truth functions. Dr. Zellweger, now… …
