Skip to content
August 27, 2013 / porton

One more conjecture about provability without axiom of choice

I addition to this conjecture I formulate one more similar conjecture:

Conjecture a\setminus^{\ast} b = a\#b for arbitrary filters a and b on a powerset cannot be proved in ZF (without axiom of choice).

Notation (where \mathfrak{F} is the set of filters on a powerset ordered reverse to set-theoretic inclusion):

  • a\setminus^{\ast} b = \bigcap\{z\in\mathfrak{F} \,|\, a\subseteq b\cup z \};
  • a\#b = \bigcup\{z\in\mathfrak{F} \,|\, z\subseteq a\wedge z\cap b=0 \}.
Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: