Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP
Browse files

Spelling corrections.

  • Loading branch information...
commit 2d15eeddd4f000901d62b67a91c83383b629ce2b 1 parent 30ae137
Ben Samuel authored
2  trunk/tex/1-preliminaries.tex
View
@@ -195,7 +195,7 @@ \subsection{Gathering}
quite recently since we were planning a trip from here to there.
Since we're familiar with the word, we don't have to worry about misspelling
-it. But what if we needed to transcribe the name ``Schuykill Expressway?''
+it. But what if we needed to transcribe the name ``Schuylkill Expressway?''
It's not obvious how to get from the written to the spoken form. How
do we know that our sources got it right? And do we attempt to describe
this uncertainty in our logical model?
2  trunk/tex/2.7-rvas.tex
View
@@ -80,7 +80,7 @@ \subsection{Relation-valued attributes} \label{rvas}
single \attribute\ is then known as a \rva. An example of a \relval\ that has a
\rva\ is shown in \autoref{rvas:projectsByBudget}.
-There is no single, authoratative way to represent a \rva, and our
+There is no single, authoritative way to represent a \rva, and our
representation simply typesets a table within the larger table. While every
representation has strengths and weaknesses, the notion of `table-in-table' is
a pretty reasonable first understanding of \rvas.
2  trunk/tex/3-syntax.tex
View
@@ -212,7 +212,7 @@ \section{Logical domains}
retained in symbolic form rather than actually being evaluated.
As an aside, one of the common causes of premature optimization is obsessing
-with the precise number of bytes per row in a paricular table. \Gybe's
+with the precise number of bytes per row in a particular table. \Gybe's
representation of a function apply should be relatively compact, especially if
symbols are represented as an enumerated type. But it should be possible for a
cost based storage optimizer to attempt to find redundant patterns within
10 trunk/tex/4.4-theorems.tex
View
@@ -193,7 +193,7 @@ \subsubsection{\Lawident}
\end{relident}
\Lawident\ is shown at \autoref{ba:ident}. This is a common feature in many
-algebras, that for an opreation $\oplus$, it's the case that
+algebras, that for an operation $\oplus$, it's the case that
$\exists i \forall x : x \oplus i = x$. In this, the constant $i$ is
the \lawident\ of $\oplus$. The simplest examples are $0$ with respect to
addition or $1$ with respect to multiplication.
@@ -208,9 +208,9 @@ \subsubsection{Nullary definitions}
\label{ba:nullary}
\end{relident}
-The defintions at \autoref{ba:nullary} define the relational constants
+The definitions at \autoref{ba:nullary} define the relational constants
\wdlittrue\ and \wdlitfalse\ as being the values of \wdconjoin\ and \wddisjoin,
-respecitvely, with zero arguments.
+respectively, with zero arguments.
\subsubsection{Complement}
@@ -427,11 +427,11 @@ \subsubsection{Remove identities}
Essentially, the left-hand and right-hand sides of the \wdremove\ expression
expand to every possible combination, and then the individual pairs can be
-examined. Althogh it's not demonstrated here, when there are multiple tuples,
+examined. Although it's not demonstrated here, when there are multiple tuples,
removal distributes over the \wddisjoin, due to \autoref{ba:rm:distdjls}.
Not to belabor the obvious, but this is not how a \wdremove\ expression would
-actually be computed. This is just an algebraic expalanation of what is
+actually be computed. This is just an algebraic explanation of what is
actually happening, and why the operator actually works.
The last rule, \autoref{ba:rm:migratenegate}, migrates
Please sign in to comment.
Something went wrong with that request. Please try again.