\documentclass[%
version=last,%
a5paper,
10pt,%
headings=small,%
bibliography=totoc,%
index=totoc,%
twoside,%
reqno,%
cleardoublepage=empty,%
%open=any,%
parskip=half,%
%draft=false,%
draft=true,%
%DIV=classic,%
DIV=11,%
headinclude=true,%
pagesize]%{scrreprt}
{scrartcl}

%\usepackage[notref,notcite]{showkeys}
\renewcommand{\theequation}{\fnsymbol{equation}}

\usepackage[headsepline]{scrpage2}
\pagestyle{scrheadings}
\clearscrheadings
\ohead{\pagemark}
\ihead{Logics in general}

\usepackage{hfoldsty}
\usepackage[neverdecrease]{paralist}
\usepackage{url}

\usepackage{amsmath,amsthm,amssymb,bm,upgreek,mathrsfs}
\usepackage[all]{xy}
\newcommand{\Forall}[1]{\forall#1\;}
\newcommand{\Exists}[1]{\exists#1\;}
\newcommand{\conc}{\mathbin{\hat{\ }}}
\newcommand{\sig}{\mathscr S}
\newcommand{\str}[1]{\mathfrak{#1}}
\newcommand{\size}[1]{\lvert#1\rvert}
\newcommand{\abs}[1]{\lvert#1\rvert}
\DeclareMathOperator{\setMod}{Mod}
\newcommand{\sMod}[1]{\setMod(#1)}
\newcommand{\Mod}[2][]{\mathbf{Mod}_{#1}(#2)}
\newcommand{\Moda}[1]{\mathbf{Mod}^*(#1)}
\newcommand{\Str}{\mathbf{Str}}
\DeclareMathOperator{\sentences}{Sen}
\newcommand{\Sen}{\sentences}
\newcommand{\modsim}{/\mathord{\sim}}
\newcommand{\pow}[1]{\mathscr P(#1)}
\newcommand{\inv}{{}^{-1}}

\newcommand{\Cat}[1]{\bm{\mathsf{#1}}}
\newcommand{\Top}{\Cat{Top}}
\newcommand{\Frm}{\Cat{Frm}}
\newcommand{\Loc}{\Cat{Loc}}
\newcommand{\Grp}{\Cat{Grp}}
\newcommand{\Set}{\Cat{Set}}
\newcommand{\Sgn}{\Cat{Sgn}}
\DeclareMathOperator{\domain}{dom}
\newcommand{\dom}[1]{\domain(#1)}
\DeclareMathOperator{\points}{pt}
\newcommand{\pt}[1]{\points(#1)}
\DeclareMathOperator{\homoms}{Hom}
\newcommand{\Hom}[1]{\homoms(#1)}
\newcommand{\bel}[1]{\left[#1\right]}

\newcommand{\Sn}[1][\sig]{\sentences_{\sig}}
\newcommand{\Sna}[1][\sig]{\sentences^*_{\sig}}
\DeclareMathOperator{\formulas}{Fm}
\newcommand{\Fm}[1][\sig]{\formulas_{#1}}
\DeclareMathOperator{\freevariables}{fv}
\newcommand{\fv}[1]{\freevariables(#1)}
\DeclareMathOperator{\variables}{v}
\newcommand{\vr}[1]{\variables(#1)}
\DeclareMathOperator{\theory}{Th}
\newcommand{\Th}[1]{\theory(#1)}
\newcommand{\Tha}[1]{\theory^*(#1)}
\renewcommand{\emptyset}{\varnothing}
\renewcommand{\setminus}{\smallsetminus}
\renewcommand{\leq}{\leqslant}
\renewcommand{\nleq}{\nleqslant}
\renewcommand{\geq}{\geqslant}
\renewcommand{\phi}{\varphi}
%\newcommand{\Or}{\;\lor\;}
\newcommand{\Or}{\;\mathrel{\text{\textsc{or}}}\;}
\renewcommand{\models}{\vDash}
\newcommand{\nmodels}{\nvDash}
\newcommand{\included}{\subseteq}
\newcommand{\includes}{\supseteq}
\newcommand{\pincluded}{\subset}
\newcommand{\liff}{\Leftrightarrow}
\newcommand{\lto}{\Rightarrow}


\swapnumbers
\newtheorem{theorem}{Theorem}
\newtheorem{corollary}[theorem]{Corollary}
\newtheorem{lemma}{Lemma}

\theoremstyle{definition}
\newtheorem{definition}[theorem]{Definition}

\newtheorem{example}[theorem]{Example}

\theoremstyle{remark}
\newtheorem{remark}[theorem]{Remark}

\begin{document}

\title{Logics in general}
\author{David Pierce}
\date{August 30, 2014}
\publishers{Mimar Sinan Fine Arts University\\
\url{http://mat.msgsu.edu.tr/~dpierce/}}
\maketitle

Here are notes made by way of investigating what a logic is.
The original impetus was considerations of the topological meaning
of the Compactness Theorem of first-order logic.

\tableofcontents

\section{Institutions}

The question of what a logic is
is taken up in, for example, \cite{MR2134733},
where the answer is sought in the \textbf{institution.}
This consists of:
\begin{compactenum}[1)]
\item 
a category $\Sgn$ of \textbf{signatures;}
\item
a functor from $\Sgn$ to $\Set$,
assigning
\begin{compactenum}
\item 
to each signature $\sig$ 
the set
\begin{equation*}
\Sen_{\sig}
\end{equation*}
of \textbf{sentences} in that signature,
and
\item
to each morphism $f$ of signatures
a \textbf{translation}
\begin{equation*}
\sigma\mapsto f(\sigma)
\end{equation*}
of sentences;
\end{compactenum}
\item
a contravariant functor from $\Sgn$ 
to the quasi-category of all categories,
assigning
\begin{compactenum}
\item 
to each signature $\sig$ 
the category
\begin{equation*}
\Str_{\sig}
\end{equation*}
of \textbf{structures} of $\sig$,
and
\item
to each morphism $f$ from $\sig'$ to $\sig$ in $\Sgn$
the \textbf{reduction}
\begin{equation*}
\str A\mapsto\str A\restriction f
\end{equation*}
from $\abs{\Str_{\sig}}$ to $\abs{\Str_{\sig'}}$;
\end{compactenum}
\item
On $\abs{\Sgn}$,
a function
\begin{equation*}
\sig\mapsto{\models_{\sig}},
\end{equation*}
where $\models_{\sig}$ is the \textbf{truth} relation 
from $\abs{\Str_{\sig}}$ to $\Sen_{\sig}$,
and if
$\sigma\in\Sen_{\sig'}$, 
and $f$ is a morphism from $\sig'$ to $\sig$ in $\Sgn$,
and $\str A\in\Str_{\sig}$, then
\begin{equation*}
  \str A\models_{\sig}f(\sigma)\iff\str A\restriction f\models_{\sig'}\sigma.
\end{equation*}
\end{compactenum}
Here I have adjusted the notation of \cite{MR2134733},
introduced the term \emph{translation,}
used \emph{structure} in place of ``model,''
and used \emph{truth} in place of ``satisfaction.''
We may require that the same sentences be true
in isomorphic structures.

If $\sigma\in\Sen_{\sig}$, I define
\begin{equation*}
  \Mod{\sigma}=\{\str A\in\Str_{\sig}\colon\str A\models_{\sig}\sigma\},
\end{equation*}
writing henceforth $\Str_{\sig}$ instead of $\abs{\Str_{\sig}}$;
$\Mod{\sigma}$ is the class of \textbf{models} of $\sigma$.

I am interested in the case where the model-classes
are basic closed classes in a \emph{topology} on $\Str_{\sig}$.
This will require an adjustment to the usual definition of topology,
since we shall need to be able to talk about collections of closed classes.
We can do this by using a relation as in \S\ref{sect:top-classes} 
(page \pageref{sect:top-classes}).
The ideas of \emph{pointless topology} seem pertinent here.

\section{Pointless topology}

By the usual definition,
a \textbf{topology} on a set $X$
is a subset $\tau$ of $\pow{\Omega}$
having the following closure properties:
\begin{compactenum}[1)]
\item 
$X\in\tau$,
\item
$U\in\tau\And V\in\tau\implies U\cap V\in\tau$,
\item
$\mathscr X\included\tau\implies\bigcup\mathscr X\in\tau$.
\end{compactenum}
By the last condition,
since $\bigcup\emptyset=\emptyset$,
this is in $\tau$.
The pair $(X,\tau)$ is a \textbf{topological space.}
The elements of $\tau$ are said to be \textbf{open subsets} of the space;
complements in $X$ of elements of $\tau$ are \textbf{closed.}

If $(Y,\tau_1)$ is another topological space,
a function $f$ from $X$ to $Y$ is \textbf{continuous}
(with respect to $\tau$ and $\tau_1$)
if
\begin{equation*}
  U\mapsto f\inv[U]\colon\tau_1\to\tau.
\end{equation*}
In this case $f$ is a morphism from $(X,\tau)$ to $(Y,\tau_1)$ 
in the category $\Top$ of topological spaces.
An isomorphism in this category is called a \textbf{homeomorphism.}

We investigate the possibility of recovering $(X,\tau)$
(up to homeomorphism)
from the algebraic properties of $\tau$.
References for this are Johnstone's article \cite{MR682820}
and book \cite{MR698074},
and also the notes of Gooding \cite{Gooding}.

The set $\tau$ is ordered by inclusion ($\included$).
With respect to this ordering,
every subset $\mathscr O$ of $\tau$ has in $\tau$
\begin{compactitem}
\item 
a supremum, 
namely $\bigcup\mathscr O$, and (therefore)
\item
an infimum, namely the \emph{interior} of $\bigcap\mathscr O$:
\begin{align*}
  \inf(\mathscr O)
&=\bigcup\left\{U\in\tau\colon U\included\bigcap\mathscr O\right\}\\
&=\sup\left(\left\{U\in\tau\colon U\included\bigcap\mathscr O\right\}\right).
\end{align*}
\end{compactitem}
Thus $\tau$ is a \textbf{complete lattice.}
If $U$ and $V$ are in $\tau$, then
\begin{equation*}
\inf(\{U,V\})=U\cap V.
\end{equation*}
The lattice $\tau$ is \textbf{distributive} because
\begin{equation*}
  U\cap(V\cup W)=(U\cap V)\cup(U\cap W)
\end{equation*}
(and therefore also $U\cup(V\cap W)=(U\cup V)\cap(U\cup W)$).
Since moreover
\begin{equation*}
  U\cap\bigcup\mathscr O=\bigcup\{U\cap V\colon V\in\mathscr O\},
\end{equation*}
the distributive lattice is called a \textbf{frame.}

Suppose $A$ is an arbitrary set with an ordering
that makes it a frame.
We may use the notation
\begin{align*}
  &\begin{gathered}
    \sup(\{x,y\})=x\vee y,\\
\sup(X)=\bigvee X,\\
\sup(\emptyset)=\bot,
  \end{gathered}&
&
  \begin{gathered}
    \inf(\{x,y\})=x\wedge y,\\
\inf(X)=\bigwedge X,\\
\inf(\emptyset)=\top.
  \end{gathered}
\end{align*}
In the category $\Frm$ of frames,
the morphisms are the functions
that preserve $\top$, $\bot$, $\wedge$, and $\bigvee$.
We now have a contravariant functor $\Omega$ from $\Top$ to $\Frm$,
given by
\begin{align*}
  \Omega(X,\tau)&=\tau,\\
\Omega(f)&=(U\mapsto f\inv[U]).
\end{align*}
The opposite category of $\Frm$ is $\Loc$, the category of \textbf{locales;}
so a locale is a frame, and a morphism of locales
is a morphism of frames in the opposite direction.
So $\Omega$ is a (covariant) functor from $\Top$ to $\Loc$,
and for this reason one may prefer to think in terms of locales
rather than frames.
But I shall avoid doing this,
preferring morphisms to be actual functions.

Considering $0$ as the empty set
and $1$ as $\{0\}$, we have a unique topology on $1$;
this topology is just $\pow1$, which is $\{0,1\}$ and can be considered as $2$.
So we can understand $2$ as a frame.

Given the topological space $(X,\tau)$,
we have a bijection $x\mapsto(0\mapsto x)$ from $X$ 
to $\Hom{(1,\pow1),(X,\tau)}$.
Thus points $x$ of $X$
can be identified with morphisms $0\mapsto x$.
Given the morphism $0\mapsto x$,
we obtain the element $\Omega(0\mapsto x)$ of $\Hom{\tau,2}$
given by
\begin{equation*}
  \Omega(0\mapsto x)(U)=
  \begin{cases}
    1,\text{ if }x\in U,\\
0,\text{ if }x\in X\setminus U.
  \end{cases}
\end{equation*}
If $A$ is an arbitrary frame, we define
\begin{equation*}
  \pt A=\Hom{A,2};
\end{equation*}
this is the set of \textbf{points} of $A$.
Then
\begin{equation*}
  x\mapsto\Omega(0\mapsto x)\colon X\to\pt{\tau}.
\end{equation*}
If this map is bijective,
the space $(X,\tau)$ is called \textbf{sober.}

The space $(X,\tau)$ is called \textbf{Tychonoff} (or $T_0$)
if any two distinct points of it are topologically distinguishable,
that is, some open set contains exactly one of them.

\begin{theorem}
Assume $(X,\tau)$ is a topological space.
Then the map
\begin{equation*}
x\mapsto\Omega(0\mapsto x)\text{ from $X$ to $\pt{\tau}$}
\end{equation*}
is injective
if and only if $(X,\tau)$ is Tychonoff.
\end{theorem}

\begin{proof}
  If $\Omega(0\mapsto x)\neq\Omega(0\mapsto y)$,
then by definition they differ at some open subset $U$ of $X$,
and then this distinguishes $x$ from $y$.
Conversely, if $x$ and $y$ are so distinguishable,
then the original inequality holds.
\end{proof}

An element $a$ of a lattice is called \textbf{prime} if
\begin{gather*}
  a\neq\top,\\
  a=x\wedge y\implies a=x\Or a=y.
\end{gather*}
For example, if $p\in X$, 
then the element $\bigcup\{U\in\tau\colon p\notin U\}$ of $\tau$ is prime.

A subset $I$ of a lattice is an \textbf{ideal} if
\begin{gather*}
  \bot\in I,\qquad\top\notin I,\\
x\in I\And y\in I\implies x\wedge y\in I,\\
y\in I\And x\leq y\implies x\in I.
\end{gather*}
The ideal $I$ is \textbf{prime} if
\begin{equation*}
  x\wedge y\in I\implies x\in I\Or y\in I.
\end{equation*}
If $a$ belongs to a lattice $L$, we define
\begin{equation*}
  (a)=\{x\in L\colon x\leq a\};
\end{equation*}
this is the \textbf{principal ideal} generated by $a$.

\begin{theorem}
  Principal ideals are indeed ideals.
A principal ideal is prime if and only if its generator is prime.
If $A$ is a frame,
then the map
\begin{equation*}
  f\mapsto f\inv(0)
\end{equation*}
on $\Hom{A,2}$
is a bijection onto the set of principal prime ideals of $A$.
\end{theorem}

\begin{proof}
Suppose $f\in\Hom{A,2}$,
and let $a=\bigvee f\inv(0)$.
Then
\begin{equation*}
%f\left(\bigcup f\inv[\{0\}]\right)
f(a)
=\bigvee\{0\}=0,
\end{equation*}
and in general
\begin{equation*}
  f(x)=
  \begin{cases}
    0,&\text{ if }x\leq a,\\
1,&\text{ if }x\nleq a.
  \end{cases}
\end{equation*}
Thus $f\inv(0)=(a)$.
\end{proof}

The space $(X,\tau)$ is called \textbf{Hausdorff} (or $T_2$)
if any two distinct points of $X$ belong to disjoint open sets.

\begin{theorem}
Hausdorff spaces are sober.
\end{theorem}

In general, 
given the frame $A$,
we can understand $\pt A$ as a topological space as follows.
If $a\in A$, let
\begin{equation*}
  \bel{a}=\{f\in\pt A\colon f(a)=1\}.
\end{equation*}

\begin{theorem}
  If $A$ is a frame, 
then $\{\bel{x}\colon x\in A\}$ is a topology on $\pt A$.
\end{theorem}

\begin{proof}
Just note
\begin{gather*}
\pt A=  \bel{\top},\\
\bel{a}\cap\bel{b}=\bel{a\wedge b},\\
\bigcup\{\bel{x}\colon x\in X\}=\bel{\bigvee X}.\qedhere
\end{gather*}
\end{proof}

Thus we can understand
\begin{equation*}
  \Omega(\pt A)=\{\bel{x}\colon x\in A\}.
\end{equation*}
We now have
\begin{equation*}
  x\mapsto\bel x\colon A\to\Omega(\pt A);
\end{equation*}
evidently this is surjective, though it need not be injective.
If $A$ and $B$ are frames, and $g\in\Hom{B,A}$, we define
\begin{equation*}
\pt g=(f\mapsto f\circ g),
\end{equation*}
which is in $\Hom{\pt A,\pt B}$.
So $\points$ is a contravariant functor from $\Frm$ to $\Top$,
hence a covariant functor from $\Loc$ to $\Top$.

\section{Adjoints}

Let $\Grp$ be the category of groups; $\Set$, of sets.
Following Hodges \cite[p.~2]{MR94e:03002},
let us denote the \emph{forgetful functor} 
$(G,\times)\mapsto G$ from $\Grp$ to $\Set$ by $\domain$.
This has a \textbf{left adjoint,}
namely a functor $\mathrm F$ from $\Set$ to $\Grp$ such that,
for all sets $X$,
there is a map $\upeta_X$ from $X$ to $\dom{\mathrm F(X)}$ such that,
for all groups $G$,
if $f\colon X\to\dom G$,
then there is a homomorphism $\bar f$ from $\mathrm F(X)$ to $G$
such that
\begin{equation*}
  \dom{\bar f}\circ\upeta_X=f,
\end{equation*}
that is, the following diagram commutes.
\begin{equation*}
  \xymatrix@!{
\dom{\mathrm F(X)}\ar@{-->}[dr]^{\dom{\bar f}}&\\
X\ar[u]^{\upeta_X}\ar[r]_f&\dom G}
\end{equation*}
The function $X\mapsto\upeta_X$ is the \textbf{unit} of the adjunction.

\begin{theorem}
$\Omega$ is a left adjoint of $\points$ whose unit $\upeta$ is given by
  \begin{equation*}
    \upeta_{(X,\tau)}(x)=\Omega(0\mapsto x).
  \end{equation*}
\end{theorem}

\begin{proof}
  Given a topological space $(X,\tau)$, a frame $A$,
and a continuous function $f$ from $X$ to $\pt A$,
we have to find a homomorphism $\bar f$ from $A$ to $\tau$
such that the following diagram commutes.
\begin{equation*}
  \xymatrix@!{
\Hom{\tau,2}\ar@{-->}[dr]^{\phi\mapsto\phi\circ\bar f}&\\
(X,\tau)\ar[u]^{x\mapsto\Omega(0\mapsto x)}\ar[r]_f&\Hom{A,2}}
\end{equation*}
Thus we want
\begin{equation*}
  f(x)(a)
=\Omega(0\mapsto x)(\bar f(a))
=
\begin{cases}
  1,&\text{ if }x\in\bar f(a),\\
0,&\text{ if }x\in X\setminus\bar f(a),
\end{cases}
\end{equation*}
which we have, provided
\begin{align*}
\bar f(a)
&=\{x\in X\colon f(x)(a)=1\}\\
&=\{x\in X\colon f(x)\in\bel a\}\\
&=f\inv\bigl[\bel a\bigr].\qedhere
\end{align*}
\end{proof}

The adjunction of the theorem has the \textbf{co-unit} $\upepsilon$ given by
\begin{equation*}
  \upepsilon_A(a)=[a].
\end{equation*}
This means that for all frames $A$,
for all topological spaces $(X,\tau)$,
if $g\in\Hom{A,\tau}$,
then there is a continuous function $\bar g$ from $X$ to $\pt A$
such that
\begin{equation*}
  \Omega(\bar g)(\bel a)=g(a),
\end{equation*}
that is, the following diagram commutes.
\begin{equation*}
  \xymatrix@!{
\Omega(\pt A)\ar[dr]^{\Omega(\bar g)}&\\
A\ar[u]^{a\mapsto\bel a}\ar[r]_g&\tau}
\end{equation*}
What we want is
\begin{equation*}
  g(a)=\Omega(\bar g)([a])=\bar g\inv\bigl[\bel a\bigr],
\end{equation*}
so if $\bar g$ exists at all as a map from $X$ to $\pt A$, it is continuous.
We want also
\begin{equation*}
  \bar g(x)\in\bel a\iff x\in g(a),
\end{equation*}
that is,
\begin{equation*}
  \bar g(x)(a)=
  \begin{cases}
    1,&\text{ if }x\in g(a),\\
0,&\text{ if }x\notin g(a).
  \end{cases}
\end{equation*}
Since $g(a)\in\tau$, the function $\bar g(a)$ so defined
is indeed a morphism from $A$ to $2$.

A reference besides \cite{MR698074} for category theory
is Barr \&\ Wells \cite{Barr--Wells}.


\section{Topologies on classes}\label{sect:top-classes}

All of the foregoing work with topologies
was in terms of \emph{open sets,}
because these are the terms of the references.
Henceforth it will be more convenient to use closed sets.
Note that the closed subsets of a topological space $A$
compose a set $\kappa$ such that
\begin{enumerate}[1)]
\item 
$\emptyset\in\kappa$,
\item
$X\in\kappa\And Y\in\kappa\implies X\cup Y\in\kappa$,
\item
$\mathscr X\included\kappa\implies\bigcap\mathscr X\in\kappa$.
\end{enumerate}
In the last condition,
we understand $\bigcap\emptyset$ to be $A$,
so this is in $\kappa$.

We are going to want to topologize a proper class $\bm A$
so that closed sub\emph{classes} may indeed be proper classes.
Then $\kappa$ will not \emph{contain} the closed classes;
but it will \emph{index} them.
We proceed as follows.

\begin{definition}
  A \textbf{topology} on a class $\bm A$
is a relation $\models$ from $\bm A$ to a set $\kappa$ such that
\begin{compactenum}[1)]
\item 
for some $x$ in $\kappa$,
for all $a$ in $\bm A$,
\begin{equation*}
  a\nmodels x;
\end{equation*}
\item
for all $x$ and $y$ in $\kappa$,
there is $z$ in $\kappa$ such that,
for all $a$ in $\bm A$,
\begin{equation*}
  a\models z\iff a\models x\Or a\models y;
\end{equation*}
\item
for every subset $\mathscr X$ of $\kappa$,
there is $y$ in $\kappa$ such that,
for all $a$ in $\bm A$,
\begin{equation*}
  a\models y\iff\Forall x(x\in\mathscr X\implies a\models x).
\end{equation*}
\end{compactenum}
Given a relation $\models$ from $\bm A$ to $\kappa$,
for each $x$ in $\kappa$ we define
\begin{equation*}
  \Mod x=\{a\in\bm A\colon a\models x\}.
\end{equation*}
(Strictly this should be $\Mod[\models]x$.)
Then we define the relation $\sim$ on $\kappa$ by
\begin{equation*}
  x\sim y\iff\Mod x=\Mod y.
\end{equation*}
\end{definition}

The three conditions in the foregoing definition 
are equivalent respectively to the following.
\begin{compactenum}[1)]
\item 
For some $x$,
\begin{equation*}
  \Mod x=\emptyset.
\end{equation*}
\item
For all $x$ and $y$, for some $z$,
\begin{equation*}
  \Mod z=\Mod x\cup\Mod y.
\end{equation*}
\item
For every set $\mathscr X$, for some $y$,
\begin{equation*}
  \Mod y=\bigcap_{x\in\mathscr X}\Mod x.
\end{equation*}
\end{compactenum}
By replacing $\kappa$ with $\kappa\modsim$,
we may assume $\sim$ is just equality,
and then $\kappa$ will have the usual algebraic properties 
of a topology of closed sets:
it will be a ``dual frame.''
But we do not want to simplify things that much.

\begin{definition}
Suppose the relation $\models$ from $\bm A$ to $\kappa$
is a topology on $\bm A$.
A subset $\mathscr B$ of $\kappa$ is a \textbf{basis} of this topology
if for every $x$ in $\kappa$ there is a subset $Y$ of $\mathscr B$ such that
\begin{equation*}
  \Mod x=\bigcap_{y\in Y}\Mod y.
\end{equation*}
\end{definition}

\begin{theorem}
Suppose $\models$ is a relation from $\bm A$ to a set $\mathscr B$,
and $\mathscr B$ has an element $\bot$ and a binary operation $\lor$
such that
\begin{align*}
  \Mod{\bot}&=\emptyset,&
\Mod{x\lor y}&=\Mod x\cup\Mod y.
\end{align*}
Then the relation from $\bm A$ to $\pow{\mathscr B}$ given by
\begin{equation*}
  \Mod{\mathscr X}=\bigcap_{x\in\mathscr X}\Mod x
\end{equation*}
is a topology on $\bm A$ for which 
(the image in $\pow{\mathscr B}$ under $x\mapsto\{x\}$ of) 
$\mathscr B$ is a basis.
\end{theorem}

\begin{definition}
A \textbf{logic} consists of:
\begin{enumerate}[1)]
\item 
a class $\Str$,
\item
a set $\Sen$,
\item
a relation $\models$ from $\Str$ to $\Sen$, and
\item
an element $\bot$ and a binary operation $\lor$ on $\Sen$
\end{enumerate}
such that,
for all $\str A$ in $\Str$,
for all $\sigma$ and $\tau$ in $\Sen$,
\begin{equation}\label{eqn:truth}
  \left.
\begin{gathered}
  \str A\nmodels\bot,\\
\str A\models\sigma\lor\tau\iff\str A\models\sigma\Or\str A\models\tau.
\end{gathered}
\right\}
\end{equation}
The class $\Str$ consists of the \textbf{structures} of the logic;
the set $\Sen$ consists of the \textbf{sentences} of the logic.
The relation $\models$ is \textbf{truth,}
and if $\str A\in\Str$ and $\sigma\in\Sen$ and $\str A\models\sigma$,
then $\str A$ is a \textbf{model} of $\sigma$.
\end{definition}

\begin{example}
In what would appear to be the simplest nontrivial example:
\begin{enumerate}
\item 
$\Sen$ is the absolutely free algebra---%
understood as a set of written formulas---%
on an infinite set $V$ of ``propositional variables.''
\item
The class $\Str$ is $\pow V$,
the class of subsets of $V$.
\item
If $\str A\in\pow V$ and $P\in V$, then
\begin{equation*}
  \str A\models P\iff P\in\str A;
\end{equation*}
this and the rules \eqref{eqn:truth} determine $\models$.
\end{enumerate}
\end{example}

\begin{definition}
In an arbitrary logic,
sentences having the same models are \textbf{logically equivalent.}
\end{definition}

\begin{theorem}
  On the set of sentences of an arbitrary logic,
logical equivalence is a congruence relation 
with respect to the Boolean operations,
and the quotient of the algebra of sentences with respect to this relation
is an idempotent commutative monoid.
\end{theorem}

\bibliographystyle{plain}
\bibliography{../references}


\end{document}
