This manual is for Org version 8.2.9. Copyright (C) 2004-2015 Free Software Foundation, Inc. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, with the Front-Cover Texts being "A GNU Manual," and with the Back-Cover Texts as in (a) below. A copy of the license is included in the section entitled "GNU Free Documentation License." (a) The FSF's Back-Cover Text is: "You have the freedom to copy and modify this GNU manual." Created by GNU Texinfo 5.2, http://www.gnu.org/software/texinfo/ Next: LaTeX fragments , Previous: Special symbols , Up: Embedded LaTeX [ Contents ][ Index ] Just like in LaTeX, ‘ ^ ’ and ‘ _ ’ are used to indicate super- and subscripts. Again, these can be used without embeddi...

CentralNotice From Wikipedia, the free encyclopedia Jump to: navigation , search In mathematics , logic , and computer science , a type theory is any of a class of formal systems , some of which can serve as alternatives to set theory as a foundation for all mathematics. In type theory, every "term" has a "type" and operations are restricted to terms of a certain type. Type theory is closely related to (and in some cases overlaps with) type systems , which are a programming language feature used to reduce bugs . The types of type theory were created to avoid paradoxes in a variety of formal logics and rewrite systems and sometimes "type theory" is used to refer to this broader application. Two well-known type theories that can serve as mathematical foundations are Alonzo Church 's typed λ-calculus and Per Martin-Löf 's intuitionistic type theory . 1 History 2 B...