We review the construction of the extender algebra, a Boolean algebra which is due to Woodin, with δ-many generators. The resulting genericity iteration is applied to prove a new Σ1-absoluteness theorem for c.c.c. forcings with ordinal parameters. Additionally we introduce and discuss sets that extend to a class with unique condensation. We analyse the sets that extend to classes with unique co...

A generic, or more properly 1-generic, serial manipulator is one whose forward kinematic mapping exhibits singularities of given rank in a regular way. In this paper, the product-ofexponentials formulation of a kinematic mapping together with the Baker–Campbell–Hausdorff formula for Lie groups is used to derive an algebraic condition for the regularity.

We study the genericity of the first weak inverse shadowing property and the second weak inverse shadowing property in the space of homeomorphisms on a compact metric space, and show that every shift homeomorphism does not have the first weak inverse shadowing property but it has the second weak inverse shadowing property.

We present the new version of the Graphics Recognition Module developed within the Machine Drawing Understanding System (MDUS) for the graphics recognition contest, to be held during the second IAPR Workshop on Graphics Recognition, Nancy, France, 1997. A generic integrated graphics recognition algorithm is adapted to meet the requirements of the contest: straight and circular, solid and dashed...

We give natural examples of factors of the Muchnik lattice which capture intuitionistic propositional logic (IPC), arising from the concepts of lowness, 1-genericity, hyperimmune-freeness and computable traceability. This provides a purely computational semantics for IPC.