Current List of Publications

The older publications are not available electronically; please contact me for hard copy.

• Topological Forcing Semantics with Settling: Available in pdf, dvi, and ps formats, and as slides.

• Well-founded Iterations of Infinite Time Turing Machines: Available as slides.

• Signed-Bit Representations of Real Numbers and the Constructive Stone-Yosida Theorem, joint with Fred Richman: Available as slides.

• On the Constructive Dedekind Reals, joint with Michael Rathjen, Proceedings of LFCS ’07, Lecture Notes in Computer Science #4514 (Sergei N. Artemov and Anil Nerode, eds.), Springer, 2007, pp. 349-362, also to appear in Logic and Analysis: Available in pdf, dvi, and ps formats.

• On the Cauchy Completeness of the Constructive Cauchy Reals, Mathematical Logic Quarterly, 53, No. 4-5 (2007), pp. 396-414: Available in pdf, dvi, and ps formats.

• CZF and Second Order Arithmetic, Annals of Pure and Applied Logic, 141 (2006), pp. 29-34: Available in pdf, dvi, and ps formats.

• Independence Results around Constructive ZF, Annals of Pure and Applied Logic, 132, No. 2-3 (2005), pp. 209-225: Available in pdf, dvi, and ps formats.

• On the Regular Extension Axiom and Its Variants (joint with Michael Rathjen), Mathematical Logic Quarterly, 49, No. 5 (2003), pp. 511-518: Available in pdf format; see also Rathjen's home page.

• IKP and Friends, Journal of Symbolic Logic, 67 (2002), pp. 1295-1322: Available in pdf, dvi, and ps formats.

• Intuitionistic L, in Logical Methods in Computer Science: The Nerode Conference (Crossley et al., eds.), Birkhauser, 1993, pp. 555-571

• μ-definable Sets of Integers, Journal of Symbolic Logic, 58 (1993), pp. 291-313

• An Introduction to γ-recursion Theory, Journal of Symbolic Logic, 55 (1990), pp. 194-206

• μ-definable Sets of Integers, Proceedings of the 4th Annual Symposium on Logic in Computer Science, IEEE Computer Society Press, 1989, pp. 343-352

• There's No Forcing a Least Uper Bound, Proceedings of the American Mathematical Society, 105 (1989), pp. 998-1002

• Sacks Forcing Sometimes Needs Help to Produce a Minimal Upper Bound, Journal of Symbolic Logic, 54 (1989), pp. 490-498

• Definability and Initial Segments of c-degrees, Journal of Symbolic Logic, 53 (1988), pp. 1070-1081

• Admissibility Spectra and Minimality, Annals of Pure and Applied Logic, 40 (1988), pp. 257-276

• Playing with Admissibility Spectra, Israel Journal of Mathematics, 63 (1988), pp. 243-256

• Another Extension of Van de Wiele's Theorem, Annals of Pure and Applied Logic, 38 (1988), pp. 301-306

• Hook-up Security and Generalized Restrictiveness, Proceedings of the 12th National Computer Security Conference, Baltimore, pp. 111-122

• The SDOS Project -- Verifying Hook-Up Security, Proceedings of the 1987 Aerospece Computer Security Conference, Orlando, Florida , AIAA (with Doug Weber)

• Simple R.E. Degree Structures, Journal of Symbolic Logic, 52 (1987), pp. 203-213

• Uncountable Master Codes and the Jump Hierarchy, Journal of Symbolic Logic, 52 (1987), pp. 952-958

• Lattices of c-degrees, Annals of Pure and Applied Logic, 36 (1987), pp. 115-118

• Admissibility Spectra through Aleph-1, Israel Journal of Mathematics, 60 (1987), pp. 225-235