doc-src/Logics/logics.toc
 author wenzelm Mon, 22 Nov 1993 11:28:25 +0100 changeset 136 a9015b16a0e5 parent 104 d8205bb279a7 child 359 b5a2e9503a7a permissions -rw-r--r--
*** empty log message ***
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
 104 d8205bb279a7 Initial revision lcp parents: diff changeset  1 \contentsline {chapter}{\numberline {1}Introduction}{1}  d8205bb279a7 Initial revision lcp parents: diff changeset  2 \contentsline {section}{\numberline {1.1}Syntax definitions}{1}  d8205bb279a7 Initial revision lcp parents: diff changeset  3 \contentsline {section}{\numberline {1.2}Proof procedures}{3}  d8205bb279a7 Initial revision lcp parents: diff changeset  4 \contentsline {chapter}{\numberline {2}First-order logic}{4}  d8205bb279a7 Initial revision lcp parents: diff changeset  5 \contentsline {section}{\numberline {2.1}Syntax and rules of inference}{4}  d8205bb279a7 Initial revision lcp parents: diff changeset  6 \contentsline {section}{\numberline {2.2}Generic packages}{8}  d8205bb279a7 Initial revision lcp parents: diff changeset  7 \contentsline {section}{\numberline {2.3}Intuitionistic proof procedures}{8}  d8205bb279a7 Initial revision lcp parents: diff changeset  8 \contentsline {section}{\numberline {2.4}Classical proof procedures}{10}  d8205bb279a7 Initial revision lcp parents: diff changeset  9 \contentsline {section}{\numberline {2.5}An intuitionistic example}{11}  d8205bb279a7 Initial revision lcp parents: diff changeset  10 \contentsline {section}{\numberline {2.6}An example of intuitionistic negation}{12}  d8205bb279a7 Initial revision lcp parents: diff changeset  11 \contentsline {section}{\numberline {2.7}A classical example}{14}  d8205bb279a7 Initial revision lcp parents: diff changeset  12 \contentsline {section}{\numberline {2.8}Derived rules and the classical tactics}{16}  d8205bb279a7 Initial revision lcp parents: diff changeset  13 \contentsline {subsection}{Deriving the introduction rule}{17}  d8205bb279a7 Initial revision lcp parents: diff changeset  14 \contentsline {subsection}{Deriving the elimination rule}{17}  d8205bb279a7 Initial revision lcp parents: diff changeset  15 \contentsline {subsection}{Using the derived rules}{18}  d8205bb279a7 Initial revision lcp parents: diff changeset  16 \contentsline {subsection}{Derived rules versus definitions}{20}  d8205bb279a7 Initial revision lcp parents: diff changeset  17 \contentsline {chapter}{\numberline {3}Zermelo-Fraenkel set theory}{23}  d8205bb279a7 Initial revision lcp parents: diff changeset  18 \contentsline {section}{\numberline {3.1}Which version of axiomatic set theory?}{23}  136 a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  19 \contentsline {section}{\numberline {3.2}The syntax of set theory}{24}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  20 \contentsline {section}{\numberline {3.3}Binding operators}{26}  104 d8205bb279a7 Initial revision lcp parents: diff changeset  21 \contentsline {section}{\numberline {3.4}The Zermelo-Fraenkel axioms}{28}  d8205bb279a7 Initial revision lcp parents: diff changeset  22 \contentsline {section}{\numberline {3.5}From basic lemmas to function spaces}{33}  136 a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  23 \contentsline {subsection}{Fundamental lemmas}{34}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  24 \contentsline {subsection}{Unordered pairs and finite sets}{34}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  25 \contentsline {subsection}{Subset and lattice properties}{37}  104 d8205bb279a7 Initial revision lcp parents: diff changeset  26 \contentsline {subsection}{Ordered pairs}{37}  d8205bb279a7 Initial revision lcp parents: diff changeset  27 \contentsline {subsection}{Relations}{37}  136 a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  28 \contentsline {subsection}{Functions}{38}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  29 \contentsline {section}{\numberline {3.6}Further developments}{41}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  30 \contentsline {section}{\numberline {3.7}Simplification rules}{49}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  31 \contentsline {section}{\numberline {3.8}The examples directory}{49}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  32 \contentsline {section}{\numberline {3.9}A proof about powersets}{52}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  33 \contentsline {section}{\numberline {3.10}Monotonicity of the union operator}{54}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  34 \contentsline {section}{\numberline {3.11}Low-level reasoning about functions}{55}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  35 \contentsline {chapter}{\numberline {4}Higher-order logic}{58}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  36 \contentsline {section}{\numberline {4.1}Syntax}{58}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  37 \contentsline {subsection}{Types}{58}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  38 \contentsline {subsection}{Binders}{61}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  39 \contentsline {section}{\numberline {4.2}Rules of inference}{61}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  40 \contentsline {section}{\numberline {4.3}Generic packages}{65}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  41 \contentsline {section}{\numberline {4.4}A formulation of set theory}{66}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  42 \contentsline {subsection}{Syntax of set theory}{66}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  43 \contentsline {subsection}{Axioms and rules of set theory}{72}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  44 \contentsline {subsection}{Derived rules for sets}{72}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  45 \contentsline {section}{\numberline {4.5}Types}{72}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  46 \contentsline {subsection}{Product and sum types}{77}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  47 \contentsline {subsection}{The type of natural numbers, $nat$}{77}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  48 \contentsline {subsection}{The type constructor for lists, $\alpha \pcomma list$}{77}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  49 \contentsline {subsection}{The type constructor for lazy lists, $\alpha \pcomma llist$}{81}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  50 \contentsline {section}{\numberline {4.6}Classical proof procedures}{81}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  51 \contentsline {section}{\numberline {4.7}The examples directories}{81}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  52 \contentsline {section}{\numberline {4.8}Example: deriving the conjunction rules}{82}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  53 \contentsline {subsection}{The introduction rule}{82}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  54 \contentsline {subsection}{The elimination rule}{83}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  55 \contentsline {section}{\numberline {4.9}Example: Cantor's Theorem}{84}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  56 \contentsline {chapter}{\numberline {5}First-order sequent calculus}{87}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  57 \contentsline {section}{\numberline {5.1}Unification for lists}{87}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  58 \contentsline {section}{\numberline {5.2}Syntax and rules of inference}{88}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  59 \contentsline {section}{\numberline {5.3}Tactics for the cut rule}{88}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  60 \contentsline {section}{\numberline {5.4}Tactics for sequents}{93}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  61 \contentsline {section}{\numberline {5.5}Packaging sequent rules}{93}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  62 \contentsline {section}{\numberline {5.6}Proof procedures}{94}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  63 \contentsline {subsection}{Method A}{95}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  64 \contentsline {subsection}{Method B}{95}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  65 \contentsline {section}{\numberline {5.7}A simple example of classical reasoning}{95}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  66 \contentsline {section}{\numberline {5.8}A more complex proof}{97}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  67 \contentsline {chapter}{\numberline {6}Constructive Type Theory}{99}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  68 \contentsline {section}{\numberline {6.1}Syntax}{100}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  69 \contentsline {section}{\numberline {6.2}Rules of inference}{100}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  70 \contentsline {section}{\numberline {6.3}Rule lists}{105}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  71 \contentsline {section}{\numberline {6.4}Tactics for subgoal reordering}{108}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  72 \contentsline {section}{\numberline {6.5}Rewriting tactics}{109}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  73 \contentsline {section}{\numberline {6.6}Tactics for logical reasoning}{109}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  74 \contentsline {section}{\numberline {6.7}A theory of arithmetic}{110}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  75 \contentsline {section}{\numberline {6.8}The examples directory}{110}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  76 \contentsline {section}{\numberline {6.9}Example: type inference}{112}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  77 \contentsline {section}{\numberline {6.10}An example of logical reasoning}{113}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  78 \contentsline {section}{\numberline {6.11}Example: deriving a currying functional}{116}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  79 \contentsline {section}{\numberline {6.12}Example: proving the Axiom of Choice}{117}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  80 \contentsline {chapter}{\numberline {7}Defining Logics}{121}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  81 \contentsline {section}{\numberline {7.1}Precedence grammars}{121}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  82 \contentsline {section}{\numberline {7.2}Basic syntax}{122}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  83 \contentsline {subsection}{Logical types and default syntax}{123}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  84 \contentsline {subsection}{Lexical matters *}{124}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  85 \contentsline {subsection}{Inspecting syntax *}{124}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  86 \contentsline {section}{\numberline {7.3}Abstract syntax trees}{126}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  87 \contentsline {subsection}{Parse trees to asts}{128}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  88 \contentsline {subsection}{Asts to terms *}{129}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  89 \contentsline {subsection}{Printing of terms *}{129}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  90 \contentsline {section}{\numberline {7.4}Mixfix declarations}{130}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  91 \contentsline {subsection}{Infixes}{133}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  92 \contentsline {subsection}{Binders}{133}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  93 \contentsline {section}{\numberline {7.5}Syntactic translations (macros)}{134}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  94 \contentsline {subsection}{Specifying macros}{135}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  95 \contentsline {subsection}{Applying rules}{136}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  96 \contentsline {subsection}{Rewriting strategy}{138}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  97 \contentsline {subsection}{More examples}{138}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  98 \contentsline {section}{\numberline {7.6}Translation functions *}{141}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  99 \contentsline {subsection}{A simple example *}{142}  a9015b16a0e5 *** empty log message *** wenzelm parents: 104 diff changeset  100 \contentsline {section}{\numberline {7.7}Example: some minimal logics}{143}