If two models of a first order theory are isomorphic then they remain isomorphic in any forcing extension of the universe of sets. In general, however, such a forcing extension may create new isomorphisms. For example, any forcing that collapses cardinals may easily make formerly non-isomorphic models isomorphic. Certain model theoretic constraints on the theory and other constraints on the for...

We study the complexity of isomorphism testing for boolean functions that are represented by decision trees or decision lists. Our results are the following: • Isomorphism testing of rank 1 decision trees is complete for logspace. • For any constant r ≥ 2, isomorphism testing for rank r decision trees is polynomial-time equivalent to Graph Isomorphism. As a consequence of our reduction, we obta...

we define a new function-valued inner product on l2(g), called ?-bracket product, where g is a locally compact abelian group and ? is a topological isomorphism on g. we investigate the notion of ?-orthogonality, bessel's inequality and ?-orthonormal bases with respect to this inner product on l2(g).

We consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G ∼= H. The n barrier for group isomorphism has withstood all attacks — even for the special cases of p-groups and solvable groups — ever since the n generator-enumeration algorithm. Following a framework due to Wagner, we present the first significant improvement over ...