summaryrefslogtreecommitdiffstats
path: root/essays/admissible_contradictions.tex
diff options
context:
space:
mode:
authorgrr <grr@lo2.org>2024-05-29 11:10:58 -0400
committergrr <grr@lo2.org>2024-05-29 11:10:58 -0400
commitdd74e4f752a43b11743ebe9ded889b1be6b69da6 (patch)
tree0caa16ac8e72f418e2f9e1e1c411b03008017489 /essays/admissible_contradictions.tex
parent4320d625e304a2f1dd63fe933dd1f52c7916a47b (diff)
downloadblueprint-dd74e4f752a43b11743ebe9ded889b1be6b69da6.tar.gz
bunch of other little fixes
Diffstat (limited to 'essays/admissible_contradictions.tex')
-rw-r--r--essays/admissible_contradictions.tex3
1 files changed, 2 insertions, 1 deletions
diff --git a/essays/admissible_contradictions.tex b/essays/admissible_contradictions.tex
index e95b85f..875ba55 100644
--- a/essays/admissible_contradictions.tex
+++ b/essays/admissible_contradictions.tex
@@ -90,7 +90,7 @@ The task of the theory is to determine whether the admissibility of the
cons postulated to be am implies the admissibility of any other cons. The
method we have developed for solving such problems will be expressed as a
collection of posiulates for our theory.
-
+\begin{hangers}
\postulate{1} Given $\varphi[(x\in A),(x\in B),\ldots]$ am, where $x\in A$, $x\in B$, ... are the
restrictions on the con parameter, and given $A_1\subset A$, $B_1\subset B$, ..., where $A_1,B_1,...\neq\emptyset$, then
$\varphi[(x\in A_1),(x\in B_1),...]$ is am. This postulate is obviously
@@ -102,6 +102,7 @@ $C=A_1\cup B_1\cup\ldots$ .)
parameters $x$ and $y$ is am if it satisfies the postulated requirements
concerning amcons on $x$ and the postulated requirements concerning amcons
on $y$.
+\end{hangers}
The effect of all our assumptions up to now is to make parameters
totally independent. They do not interact with each other at all.