Erik Ellentuck

20 papers Journal 20

Year	Rank	Type	Title / Venue / Authors
1992	J	`jnl`	Myhill's Work in Recursion Theory. Ann. Pure Appl. Log. J. C. E. Dekker, Erik Ellentuck
1989	J	`jnl`	Isols and the Pigeonhole Principle. J. Symb. Log. J. C. E. Dekker, Erik Ellentuck
1983	J	`jnl`	Incompatible Extensions of Combinatorial Functions. J. Symb. Log. Erik Ellentuck
1983	J	`jnl`	Random Isols. Math. Log. Q. Erik Ellentuck
1981	J	`jnl`	Galois Theorems for Isolated Fields. Math. Log. Q. Erik Ellentuck
1981	J	`jnl`	Hyper-Torre Isols. J. Symb. Log. Erik Ellentuck
1980	J	`jnl`	Diagonal Methods in the Theory of Isols. Math. Log. Q. Erik Ellentuck
1976	J	`jnl`	Categoricity Regained. J. Symb. Log. Erik Ellentuck
1976	J	`jnl`	Decomposable Isols and Their Degrees. Math. Log. Q. Erik Ellentuck
1975	J	`jnl`	The Foundations of Suslin Logic. J. Symb. Log. Erik Ellentuck
1974	J	`jnl`	A New Proof that Analytic Sets are Ramsey. J. Symb. Log. Erik Ellentuck
1974	J	`jnl`	A triangle J. Symb. Log. Erik Ellentuck
1973	J	`jnl`	Degrees of isolic theories. Notre Dame J. Formal Log. Erik Ellentuck
1972	J	`jnl`	An Algebraic Difference Between Isols and Cosimple Isols. J. Symb. Log. Erik Ellentuck
1972	J	`jnl`	Nonrecursive Combinatorial Functions. J. Symb. Log. Erik Ellentuck
1972	J	`jnl`	The Positive Properties of Isolic Integers. J. Symb. Log. Erik Ellentuck
1971	J	`jnl`	Incompleteness via simple sets. Notre Dame J. Formal Log. Erik Ellentuck
1970	J	`jnl`	A Coding Theorem for Isols. J. Symb. Log. Erik Ellentuck
1970	J	`jnl`	Almost Combinatorial Skolem Functions. J. Symb. Log. Erik Ellentuck
1969	J	`jnl`	A Choice Free Theory of Dedekind Cardinals. J. Symb. Log. Erik Ellentuck