1. A universal Turing machine;Aanderaa,1993
2. Non-Well-Founded Sets. CSLI Lecture Notes no. 14;Aczel,1988
3. Allwein, G., Barwise, J. (Eds.) 1993. Working Papers on Diagrams and Logic, Indiana University, Bloomington, IL.
4. Computational Complexity and Natural Languages;Barton,1987
5. The Situation in Logic. CSLI Lecture Notes no. 17;Barwise,1989