Skip to content
GitLab
Menu
Projects
Groups
Snippets
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
Menu
Open sidebar
Marianna Rapoport
iris-coq
Commits
6a9642c0
Commit
6a9642c0
authored
Mar 06, 2016
by
Ralf Jung
Browse files
docs: improve structure
parent
7e5ea1fe
Changes
1
Hide whitespace changes
Inline
Side-by-side
docs/logic.tex
View file @
6a9642c0
...
...
@@ -74,8 +74,6 @@ Furthermore, $\SigAx$ is a set of \emph{axioms}, that is, terms $\term$ of type
Again, the grammar of terms and their typing rules are defined below, and depends only on
$
\SigType
$
and
$
\SigFn
$
, not on
$
\SigAx
$
.
Elements of
$
\SigAx
$
are ranged over by
$
\sigax
$
.
\section
{
Syntax
}
\subsection
{
Grammar
}
\label
{
sec:grammar
}
\paragraph
{
Syntax.
}
...
...
@@ -276,7 +274,7 @@ In writing $\vctx, x:\type$, we presuppose that $x$ is not already declared in $
}
\end{mathparpagebreakable}
\subsection
{
Timeless
P
ropositions
}
\subsection
{
Timeless
p
ropositions
}
Some propositions are
\emph
{
timeless
}
, which intuitively means that step-indexing does not affect them.
This is a
\emph
{
meta-level
}
assertions about propositions, defined by the following judgment.
...
...
@@ -285,7 +283,7 @@ This is a \emph{meta-level} assertions about propositions, defined by the follow
\ralf
{
Define a judgment that defines them.
}
\subsection
{
Base logic
}
\subsection
{
Proof rules
}
\ralf
{
Go on checking below.
}
The judgment
$
\vctx
\mid
\pfctx
\proves
\prop
$
says that with free variables
$
\vctx
$
, proposition
$
\prop
$
holds whenever all assumptions
$
\pfctx
$
hold.
...
...
Write
Preview
Supports
Markdown
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment