~ubuntu-branches/ubuntu/oneiric/latex-beamer/oneiric

« back to all changes in this revision

Viewing changes to examples/beamerexample5.tex

  • Committer: Bazaar Package Importer
  • Author(s): OHURA Makoto
  • Date: 2004-11-06 01:06:13 UTC
  • mfrom: (1.1.1 upstream)
  • Revision ID: james.westby@ubuntu.com-20041106010613-j6m2aj1cx6i2qu0l
Tags: 3.01-1
New upstream release

Show diffs side-by-side

added added

removed removed

Lines of Context:
1
 
\documentclass{beamer}
2
 
 
3
 
\beamertemplateshadingbackground{red!10}{blue!10}
4
 
 
5
 
\usepackage{beamerthemeshadow}
6
 
 
7
 
\usepackage[german]{babel}
 
1
% $Header: /cvsroot/latex-beamer/latex-beamer/examples/beamerexample5.tex,v 1.22 2004/10/08 14:02:33 tantau Exp $
 
2
 
 
3
\documentclass[11pt]{beamer}
 
4
 
 
5
\usetheme{Darmstadt}
 
6
 
 
7
\usepackage{times}
 
8
\usefonttheme{structurebold}
 
9
 
 
10
\usepackage[english]{babel}
8
11
\usepackage{pgf,pgfarrows,pgfnodes,pgfautomata,pgfheaps}
9
12
\usepackage{amsmath,amssymb}
10
13
\usepackage[latin1]{inputenc}
11
14
 
12
 
\beamertemplatetransparentcovereddynamic
 
15
\setbeamercovered{dynamic}
13
16
 
14
17
\newcommand{\Lang}[1]{\operatorname{\text{\textsc{#1}}}}
15
18
 
37
40
 
38
41
\title{Weak Cardinality Theorems for First-Order Logic}
39
42
\author{Till Tantau}
40
 
\institute[Technische Universit\"at Berlin]{
 
43
\institute[Technische Universit\"at Berlin]{%
41
44
  Fakult�t f�r Elektrotechnik und Informatik\\
42
45
  Technische Universit\"at Berlin}
43
46
\date{Fundamentals of Computation Theory 2003}
44
47
 
45
 
\colorlet{redshaded}{red!25!averagebackgroundcolor}
46
 
\colorlet{shaded}{black!25!averagebackgroundcolor}
47
 
\colorlet{shadedshaded}{black!10!averagebackgroundcolor}
48
 
\colorlet{blackshaded}{black!40!averagebackgroundcolor}
 
48
\colorlet{redshaded}{red!25!bg}
 
49
\colorlet{shaded}{black!25!bg}
 
50
\colorlet{shadedshaded}{black!10!bg}
 
51
\colorlet{blackshaded}{black!40!bg}
49
52
 
50
53
\colorlet{darkred}{red!80!black}
51
54
\colorlet{darkblue}{blue!80!black}
217
220
 
218
221
\frame{\titlepage}
219
222
 
220
 
\section*{Outline}
 
223
%\section*{Outline}
 
224
\part{Main Part}
221
225
\frame{\frametitle{Outline}\tableofcontents[part=1]}
222
226
 
223
 
\part{Main Part}
224
227
\section{History}
225
228
 
226
229
\subsection{Enumerability in Recursion and Automata Theory}
503
506
  \end{block}
504
507
  
505
508
  \vskip1em
506
 
  \invisible<1>{
 
509
  \visible<2->{
507
510
    The second explanation is correct.\\
508
511
    The theorems can (almost) be unified using first-order logic.
509
512
    }