\documentclass[12pt]{article}
\usepackage{amsfonts}
\begin{document}
\author{Ossie Manners}
\title{Ossie's Incompleteness Theorem}
\maketitle
\normalsize
\section*{Abstract}
G\"{o}del recieved much praise for his incompletness theorem and I feel much of this work could not have been accomplished without his insight. Lemma 1 needs a bit of work to make it more rigorous.
\section{Lemma 1}
There are a countable number of proofs
\subsection*{Proof}
Each proof can be translated into English to a string of finite length.
There are only a finite number of strings of length n for each n.
$|\mathbb{N}|=\aleph_0$ hence result.
\section{Lemma 2}
There are an uncountable number of true statements.
\subsection*{Proof}
For each positive real number $\alpha$ we have the statement $\alpha>0$.
\section{Theorem}
Not all true statements can be proved.
\subsection*{Proof}
Clear from lemmas 1 and 2
Q.E.D.
\section*{Acknowledgements}
None.
\begin{thebibliography}{99}
None.
\end{thebibliography}
\end{document}