Effectively Extensible Theories. - Marian Boykan Pour-El (J. Symb. Log., 1968)

Axiomatizable Theories with Few Axiomatizable Extensions. - Donald A. Martin; Marian Boykan Pour-El (J. Symb. Log., 1970)

On a simple definition of computable function of a real variable-with applications to functions of a complex variable. - Marian Boykan Pour-El; Jerome Caldwell (Math. Log. Q., 1975)

Computer Science And Recursion Theory. - Marian Boykan Pour-El (ACM Annual Conference (1), 1978)

Differentiability properties of computable functions - a summary. - Marian Boykan Pour-El; I. Richards 001 (Acta Cybern., 1978)

Computability in analysis and physics. - Marian Boykan Pour-El; Jonathan Ian Richards (Springer, 1989)

The Wave Equation with Computable Initial Data Whose Unique Solution Is Nowhere Computable. - Marian Boykan Pour-El; Ning Zhong 002 (Math. Log. Q., 1997)

The Structure of Computability in Analysis and Physical Theory. - Marian Boykan Pour-El (Handbook of Computability Theory, 1999)

From Axiomatics to Intrinsic Characterization: Some Open Problems in Computable Analysis. - Marian Boykan Pour-El (Theor. Comput. Sci., 1999)

The Degree of Unsolvability of a Real Number. - Anthony J. Dunlop; Marian Boykan Pour-El (CCA, 2000)