Add appendices

Chapters/Chapter02.tex

@@ -99,13 +99,24 @@ reassignment. A ground $\Sigma$-formula is said to be satisfiable in
 the $\Sigma$-theory $\mathcal{T}$, or $\mathcal{T}$-satisfiable, if
 there exists a $\Sigma$-structure $\mathcal{A} \in \mathcal{T}$ such
 that $\mathcal{A}$ satisfies $\varphi$. The structure $\mathcal{A}$ is
-then called a \emph{$\mathcal{T}$-model} of $\varphi$. If $\varphi$
-and $\psi$ are ground $\Sigma$-formulas such that
-$\varphi \wedge \neg \psi$ is $\mathcal{T}$-unsatisfiable, we say that
-\emph{$\varphi$ entails $\psi$ in $\mathcal{T}$} and write it as
-$\varphi \models_T \psi$. A $\Sigma$-formula $\varphi$ such that
-$\neg \varphi$ is $\mathcal{T}$-unsatisfiable is called a \emph{theory
-  lemma}.
+then called a \emph{$\mathcal{T}$-model} of $\varphi$. If $\varphi$ is
+a ground $\Sigma$-formula and $\Gamma$ is a set of ground
+$\Sigma$-formulas, we say that \emph{$\Gamma$ entails $\varphi$ in
+  $\mathcal{T}$}, written $\Gamma \models_\mathcal{T} \varphi$, if
+every $\Sigma$-structure that satisfies all formulas in $\Gamma$ also
+satisfies $\varphi$. If $\emptyset \models_\mathcal{T} \varphi$ for a
+ground $\Sigma$-formula $\varphi$, the formula $\varphi$ is called
+\emph{$\mathcal{T}$-valid} or a \emph{theory lemma}. A set $\Gamma$ of
+ground $\Sigma$-formulas is called \emph{$\mathcal{T}$-inconsistent},
+if $\Gamma \models_{\mathcal{T}} \bot$.
+
+% If $\varphi$
+% and $\psi$ are ground $\Sigma$-formulas such that
+% $\varphi \wedge \neg \psi$ is $\mathcal{T}$-unsatisfiable, we say that
+% \emph{$\varphi$ entails $\psi$ in $\mathcal{T}$} and write it as
+% . A $\Sigma$-formula $\varphi$ such that
+% $\neg \varphi$ is $\mathcal{T}$-unsatisfiable is called a \emph{theory
+%   lemma}.
 
 For two signatures $\Sigma$ and $\Omega$, we call $\Omega$ a
 \emph{sub-signature} of $\Sigma$ if $\Omega \subseteq \Sigma$,

Chapters/ChapterA1.tex

+\chapter{Publications}

Chapters/ChapterA2.tex

+\chapter{Summary of Author’s Ph.D. Study}
+
+\section{Presentations}
+I have presented the paper \emph{Solving Quantified Bit-vector
+  Formulas Using Binary Decision Diagrams} at the conference SAT 2016,
+July 2016, Bordeaux, France.
+
+\section{Other conferences}
+\begin{itemize}
+\item SMT Workshop 2015 (affiliated with CAV 2015, July 2015, San
+  Francisco)
+\item MEMICS 2015, October 2015, Telč, Czech Republic
+\item TACAS 2016, April 2016, Eindhoven, The Netherlands
+\end{itemize}
+\section{Teaching}
+Seminar tutor for the following courses:
+\begin{itemize}
+\item Automata, Grammars, and Complexity (2014--now)
+\item Formal Languages and Automata (2016--now)
+\item Non-Imperative Programming (2015--now)
+\end{itemize}
+
+\section{Schools}
+\begin{itemize}
+\item SAT/SMT Summer School, Stanford University, July 15--17, 2015
+\item RiSE \& LogiCS Spring School on Logic and Verification, TU Wien, April 15--17, 2016
+\end{itemize}
+
+\section{Passed courses}
+Besides the courses that are mandatory for the PhD study, I have
+passed the following courses:
+\begin{itemize}
+\item Academic Writing in English (spring 2016)
+\item Academic and professional skills in English for IT (spring 2015)
+\item C++ Programming (autumn 2014)
+\item Exercises in Category Theory (autumn 2014)
+\item Formal Methods in Theory and Practice (autumn 2014, spring 2015, autumn 2015, spring 2016)
+\item GEB -- limits of formal systems (autumn 2014)
+\item Modeling and Simulation (spring 2015)
+\item Probability in Computer Science (spring 2015)
+\item Selected problems of present-day written Czech (spring 2015)
+\item Seminar on Concurrency (autumn 2014, spring 2015, autumn 2015, spring 2016)
+\item Teaching Lab (spring 2016)
+\end{itemize}

ClassicThesis.tex

@@ -99,7 +99,10 @@
 \appendix
 % \renewcommand{\thechapter}{\alph{chapter}}
 \cleardoublepage
-\chapter{Appendix}
+%\chapter{Appendix}
+
+\include{Chapters/ChapterA1}
+\include{Chapters/ChapterA2}
 % \include{Chapters/Chapter0A}
 %********************************************************************
 % Other Stuff in the Back