Inset theory,Ω-logic is aninfinitary logic anddeductive system proposed byW. Hugh Woodin (1999) as part of an attempt to generalize the theory ofdeterminacy ofpointclasses to coverthe structure. Just as theaxiom of projective determinacy yields a canonical theory of, he sought to find axioms that would give a canonical theory for the larger structure. The theory he developed involves a controversial argument that thecontinuum hypothesis is false.
Woodin'sΩ-conjecture asserts that if there is a proper class ofWoodin cardinals (for technical reasons, most results in the theory are most easily stated under this assumption), then Ω-logic satisfies an analogue of thecompleteness theorem. From this conjecture, it can be shown that, if there is any single axiom which is comprehensive over (in Ω-logic), it must imply that the continuum is not. Woodin also isolated a specific axiom, a variation ofMartin's maximum, which states that any Ω-consistent (over) sentence is true; this axiom implies that the continuum is.
Woodin also related his Ω-conjecture to a proposed abstract definition of large cardinals: he took a "large cardinal property" to be a property of ordinals which implies that α is astrong inaccessible, and which is invariant under forcing by sets of cardinal less than α. Then the Ω-conjecture implies that if there are arbitrarily large models containing a large cardinal, this fact will be provable in Ω-logic.
The theory involves a definition ofΩ-validity: a statement is an Ω-valid consequence of a set theoryT if it holds in every model ofT having the form for some ordinal and some forcing notion. This notion is clearly preserved under forcing, and in the presence of a proper class of Woodin cardinals it will also be invariant under forcing (in other words, Ω-satisfiability is preserved under forcing as well). There is also a notion ofΩ-provability;[1] here the "proofs" consist ofuniversally Baire sets and are checked by verifying that for every countable transitive model of the theory, and every forcing notion in the model, the generic extension of the model (as calculated inV) contains the "proof", restricted its own reals. For a proof-setA the condition to be checked here is called "A-closed". A complexity measure can be given on the proofs by their ranks in theWadge hierarchy. Woodin showed that this notion of "provability" implies Ω-validity for sentences which are overV. The Ω-conjecture states that the converse of this result also holds. In all currently knowncore models, it is known to be true; moreover the consistency strength of the large cardinals corresponds to the least proof-rank required to "prove" the existence of the cardinals.