Re: Continuum hypothesis



george <greeneg@xxxxxxxxxx> writes:

On Aug 20, 11:39 am, stevendaryl3...@xxxxxxxxx (Daryl McCullough)
wrote:
Bell's Theorem proves that no measurable function f can possible
satisfy this constraint. However, Pitowsky proved that if one
assumes the continuum hypothesis, one can construct a nonmeasurable
function that satisfies this constraint.

One line of the truth table still has not been completed here.
If one DENIES the continuum hypothesis, can there still
exist a NON-constructible nonmeasurable function that
satisfies the constraint? Or is the truth of the CH necessary
to the existence of the non-measurable function at all (regardless
of whether it can be proven to exist)?

Since the proof given uses Martin's Axiom and not the stronger CH,
and ZF+MA is consistent with not AC (assuming ZF consistent,
presumably), the existence of such functions is consistent
with not CH.

--
Alan Smaill
.



Relevant Pages

  • Re: Continuum hypothesis
    ... function that satisfies this constraint. ... If one DENIES the continuum hypothesis, ... and ZF+MA is consistent with not AC (assuming ZF consistent, ... There exists a well-ordering < of the reals such that for every ...
    (sci.logic)
  • Re: Continuum hypothesis
    ... satisfy this constraint. ... function that satisfies this constraint. ... One line of the truth table still has not been completed here. ... If one DENIES the continuum hypothesis, ...
    (sci.logic)
  • Re: UNIQUE constraint problem
    ... > Another mistake in the standard (and T-SQL, for being consistent). ... It's not the case that NULLs are treated differently in CHECK constraints. ... "A table check constraint is satisfied if and only if the specified <search ... the CHECK constraint allows the UNKNOWN case. ...
    (microsoft.public.sqlserver.programming)
  • Re: Relation Schemata vs. Relation Variables
    ... The point that I was making in the original post is that because keys can ... it means that the old rule that was used in the transition ... constraint to "pair up" tuples such that they describe the same entity ... prevent a user from inserting consistent but incorrect information, ...
    (comp.databases.theory)