Attemped asymmetric dehydration with chiral carbodiimides /|nMin-jen Shiao. -- 260 0 St. Catharines [Ont. : s. n.],

This research work has been planned with the intention of synthesizing optically active bicyclo[3,l,0]-hexan-2-one using chiral carbodiimides. Several carbodiimides have been prepared for practice and for attempts at asymmetric induction. The total synthesis of dibenzo[e,g]- (l:3)diazonine and the partial synthesis of l:13-dimethyldibenzo[e,g]- (l:3)diazonine are reported. Attempts to resolve 6,6f-dimethyl-2,2t-diphenic acid were not successful. The NMR spectra of carbodiimides and the related thioureas are compared. The reaction transition state of the 4-hydroxycyclohexanone with optically pure R,R(+)-di(a-phenylethyl)-carbodiimide has been considered. The ORD application to chiral cyclohexanones is discussed.

Attempted asymmetric synthesis of Lactobacillic acid / |nFawzy F. Z. Georges. -- 260 St. Catharines, Ont. : [s. n.],

This research work has been planned with the intention of proving the absolute configuration of lactobacillc acid. During the course of this work, attempts have been made to synthesize cis-2-carboxycyclopropane- l-.acetic acid as,v,a suitable resolvable material. As the results were not satisfactory, the synthesis of ci,s-2-carboxycyclopropane-l-propionic acid has been alternatively attempted by ring opening of bicyclo- [4.1.~-heptan-2-onewithout much success. Attempts to resolve or prepare bicyclo[ 4.1.~-hePtan-2-one optically active are also reported. On the other hand, a complete scheme is described for the possible synthesis of optically active lactobacillic acid. If only bicyclo- ~.1.~ -heptan-2-one can be resolved or prepared optically active, this described scheme can be applied smoothly to the synthesis of enant~omeric lactobacillic acid.

An Interactive Theorem Prover for First-Order Dynamic Logic

Dynamic logic is an extension of modal logic originally intended for reasoning about computer programs. The method of proving correctness of properties of a computer program using the well-known Hoare Logic can be implemented by utilizing the robustness of dynamic logic. For a very broad range of languages and applications in program veri cation, a theorem prover named KIV (Karlsruhe Interactive Veri er) Theorem Prover has already been developed. But a high degree of automation and its complexity make it di cult to use it for educational purposes. My research work is motivated towards the design and implementation of a similar interactive theorem prover with educational use as its main design criteria. As the key purpose of this system is to serve as an educational tool, it is a self-explanatory system that explains every step of creating a derivation, i.e., proving a theorem. This deductive system is implemented in the platform-independent programming language Java. In addition, a very popular combination of a lexical analyzer generator, JFlex, and the parser generator BYacc/J for parsing formulas and programs has been used.