Deduction Theorem

In mathematical logic, the deduction theorem states that if a formula F is deducible from E then the implication E → F is demonstrable (i.e. it is "deducible" from the empty set). In symbols, if E \vdash F , then \vdash E \rightarrow F. The deduction theorem may be generalized to a countable sequence of assumption formulas such that from E_1, E_2, ... , E_{n-1}, E_n \vdash F , infer E_1, E_2, ... , E_{n-1} \vdash E_n \rightarrow F , and so on until \vdash E_1\rightarrow(...(E_{n-1} \rightarrow (E_n \rightarrow F))...) . The deduction theorem is a meta-theorem: it is used to deduce proofs in a given theory though it is not a theorem of the theory itself.

See also

conditional proof, propositional calculus.

Reference

 

<< PreviousWord BrowserNext >>
sebastin lerdo de tejada
california proposition 57 (2004)
rime dictionary
u.s. national cemetery
pitocin
asclepias
alcoa
california proposition 58 (2004)
agree to disagree
the satanic verses (novel)
antoni radziwill
haab
sandvik
subtractive color
tzolkin
janata party
attribute grammar
arizona biltmore hotel
mactan island
curriculum
x 20 dyna soar
two level grammar
national front (india)
26th of july movement
united front (india)
the mandrake
alexander herzen
traffic analysis
cabo rojo, puerto rico
cynewulf
palochka
chukchi
list of speakers of the house of representatives (fiji)
counties of liberia
well field system
seventeen
andrew faulds
boreal chickadee
the advertiser (newspaper)
the news
royal shrovetide football
ecological genetics
disko island
sidiq koya