Category:Binary Messes

From ProofWiki
Jump to navigation Jump to search

This category contains results about Binary Messes.
Definitions specific to this category can be found in Definitions/Binary Messes.

Let $S$ be a set.

Let $I$ be the set of all finite subsets of $S$.

Let $\Bbb B$ be a Boolean domain.


Let $M$ be a set defined as:

$\ds M \subseteq \bigcup_{P \mathop \in I} \Bbb B^P$

where $\Bbb B^P$ denotes the set of all mappings from $P$ to $\Bbb B$.

That is, such that $M$ is a set of mappings from finite subsets of $S$ to $\Bbb B$.


Suppose that $M$ satisfies the binary mess axioms:

\((\text M 1)\)   $:$     \(\ds \forall P \in I: \exists t \in M:\) \(\ds \Dom t = P \)      Every finite subset of $S$ is the domain of some mapping in $M$
\((\text M 2)\)   $:$     \(\ds \forall P \in I: \forall t \in M:\) \(\ds t {\restriction_P} \in M \)      The restriction of every mapping in $M$ to every finite subset of $S$ is in $M$


Then $M$ is a binary mess on $S$.

Pages in category "Binary Messes"

This category contains only the following page.