Affordable Access

Coding by club-sequences

Publication Date
  • Logic
  • Mathematics


Given any subset A of ? there is a proper partial order which forces that the predicate x ? A and the predicate x ? ? {set minus} A can be expressed by ZFC-provably incompatible S formulas over the structure <H2, ?, N S1 >. Also, if there is an inaccessible cardinal, then there is a proper partial order which forces the existence of a well-order of H2 definable over <H2, ?, N S1 > by a provably antisymmetric S formula with two free variables. The proofs of these results involve a technique for manipulating the guessing properties of club-sequences defined on stationary subsets of ? at will in such a way that the S theory of <H2, ?, N S1 > with countable ordinals as parameters is forced to code a prescribed subset of ?. On the other hand, using theorems due to Woodin it can be shown that, in the presence of sufficiently strong large cardinals, the above results are close to optimal from the point of view of the Levy hierarchy. © 2005 Elsevier B.V. All rights reserved.

There are no comments yet on this publication. Be the first to share your thoughts.


Seen <100 times

More articles like this

Coding by club-sequences

on Annals of Pure and Applied Log... Jan 01, 2006

Genes and non-coding DNA sequences.

on Ciba Foundation symposium 1979

Scaling properties of coding and non-coding DNA se...

on Physica A Statistical Mechanic... Jan 01, 1997
More articles like this..