We extend the results of Hamkins and Thomas concerning the malleability of automorphism tower heights of groups by forcing. We show that any reasonable sequence of ordinals can be realized as the automorphism tower heights of a certain group in consecutive forcing extensions or ground models, as desired. For example, it is possible to increase the height of the automorphism tower by passing to ...

In this paper, we present a concrete proof point, achieved after roughly two years of collaborative effort, resulting in substantially decreased time-to-silicon and improved semiconductor customer success. We describe a foundry package containing a unique Cadence evaluation test chip, available today, and fabricated using the 0.18um CMOS Tower Semiconductor process design kit, Tower standard-ce...

We carefully present an elementary proof of the well known theorem that each homotopy group (or, in degree zero, pointed set) of the inverse limit of a tower of fibrations maps naturally onto the inverse limit of the homotopy groups (or, in degree zero, pointed sets) of the spaces in the tower, with kernel naturally isomorphic to lim of the tower of homotopy groups of one dimension higher. The ...

This report describes how to use the reflective tower Blond. A reflective tower is a computational architecture where programs are given access to representations of the current state of computation. This models an infinite tower of interpreters interpreting each other, meta-circularly. Blond is a Scheme interpreter extended to be reflective. This report concentrates on its reflective extension...

Abstract: Wind load is the key and sensitive for tower structure but national standards tend to think that level stiffness change of cup type transmission tower is uniform along the height. The structure stiffness change of cup type transmission tower was simulated innovatively and found its nonuniformity. The result shows that the structural stiffness uniformly changes along the height when th...

Another version of programming ‘The Tower of Hanoi’ in TEX is provided. No nodding knowledge of Lisp is required; just plain TEX. There is no restriction on the number of disks, apart from the installed limits of TEX. Generalized disks can be moved as well.

We present a domain-independent algorithm for planning that computes macros in a novel way. Our algorithm computes macros “on-the-fly” for a given set of states and does not require previously learned or inferred information, nor prior domain knowledge. The algorithm is used to define new domainindependent tractable classes of classical planning that are proved to include Blocksworld-arm and To...

The game of the Towers of Hanoi is generalized to binary trees. First, a straightforward solution of the game is discussed. Second, a shorter solution is presented, which is then shown to be optimal.

Woodin proved the theorem in perhaps 1986 or 1987, using stationary tower forcing and (through the work of Martin and the author) iteration trees. The proof we give here uses only iteration trees. Stationary tower forcing is replaced by “genericity iterations”, as it can be in certain related contexts as well. We believe that the unity of method in the resulting proof gives it some interest. Th...

As an important quality index of high voltage electricity transmission tower, zinc coating thickness detection and quality control is more and more attention in recent years. The coating thickness and uniformity of tower materials provided by the suppliers are tested through the traditional method by the power department, the detection precision of this method is low efficiency and analysis res...