Peter A. Cholak

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Some recent research directions in the computably enumerable sets	2024-09-06	Paper
Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective Memoirs of the American Mathematical Society	2024-02-20	Paper
Extending properly n - REA sets1 Computability	2023-01-12	Paper
Extending Properly n-REA Sets (available as arXiv preprint)	2021-07-02	Paper
Some results concerning the $\mathsf{SRT}_2^2$ vs. $\mathsf{COH}$ problem Computability	2020-11-09	Paper
Realizing Computably Enumerable Degrees in Separating Classes	2020-08-23	Paper
Thin set theorems and cone avoidance Transactions of the American Mathematical Society	2020-03-02	Paper
The Rado path decomposition theorem Israel Journal of Mathematics	2019-12-17	Paper
Effective prime uniqueness Proceedings of the American Mathematical Society	2017-11-08	Paper
Density-1-bounding and quasiminimality in the generic degrees Journal of Symbolic Logic	2017-09-26	Paper
Any FIP real computes a 1-generic Transactions of the American Mathematical Society	2017-05-23	Paper
On splits of computably enumerable sets Computability and Complexity	2017-04-04	Paper
Computably enumerable sets that are automorphic to low sets Computability	2017-02-23	Paper
Genericity for Mathias forcing over general Turing ideals Israel Journal of Mathematics	2017-01-11	Paper
$\mathcal{D}$-maximal sets The Journal of Symbolic Logic	2016-03-22	Paper
Generics for computable Mathias forcing Annals of Pure and Applied Logic	2014-06-06	Paper
Some recent research directions in the computably enumerable sets	2013-12-20	Paper
Computably enumerable partial orders Computability	2013-01-30	Paper
On Mathias generic sets Lecture Notes in Computer Science	2012-08-14	Paper
On $n$-tardy sets Annals of Pure and Applied Logic	2012-07-11	Paper
Reverse mathematics and infinite traceable graphs Mathematical Logic Quarterly	2012-02-29	Paper
On the orbits of computably enumerable sets Journal of the American Mathematical Society	2010-11-19	Paper
Corrigendum to: ``On the strength of Ramsey's theorem for pairs'' Journal of Symbolic Logic	2010-01-07	Paper
The Complexity of Orbits of Computably Enumerable Sets The Bulletin of Symbolic Logic	2008-05-08	Paper
Strong jump-traceability. I: The computably enumerable case Advances in Mathematics	2008-03-05	Paper
Extension theorems, orbits, and automorphisms of the computably enumerable sets Transactions of the American Mathematical Society	2008-01-21	Paper
Uniform almost everywhere domination Journal of Symbolic Logic	2006-11-29	Paper
A computably stable structure with no Scott family of finitary formulas Archive for Mathematical Logic	2006-09-04	Paper
The computably enumerable sets: recent results and future directions	2006-08-16	Paper
On the Orbits of Computably Enumerable Sets	2006-07-11	Paper
scientific article; zbMATH DE number 2236628 (Why is no real title available?)	2005-12-08	Paper
Reverse mathematics and the equivalence of definitions for well and better quasi-orders Journal of Symbolic Logic	2005-08-29	Paper
INVARIANCE AND NONINVARIANCE IN THE LATTICE OF $\Pi_1^0$ CLASSES Journal of the London Mathematical Society	2005-03-11	Paper
Isomorphisms of splits of computably enumerable sets Journal of Symbolic Logic	2005-02-09	Paper
Maximal contiguous degrees Journal of Symbolic Logic	2003-03-22	Paper
An almost deep degree The Journal of Symbolic Logic	2002-09-05	Paper
On the strength of Ramsey's theorem for pairs The Journal of Symbolic Logic	2002-01-09	Paper
Definable Encodings in the Computably Enumerable Sets The Bulletin of Symbolic Logic	2002-01-09	Paper
Definable Encodings in the Computably Enumerable Sets The Bulletin of Symbolic Logic	2002-01-09	Paper
ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS Journal of Mathematical Logic	2002-01-01	Paper
Automorphisms of the lattice of $\Pi_1^0$ classes; perfect thin classes and anc degrees Transactions of the American Mathematical Society	2001-10-21	Paper
Some orbits for ${\mathcal E}$ Annals of Pure and Applied Logic	2001-09-30	Paper
scientific article; zbMATH DE number 1531921 (Why is no real title available?)	2001-04-16	Paper
scientific article; zbMATH DE number 708664 (Why is no real title available?)	2000-06-21	Paper
Atomless $r$-maximal sets Israel Journal of Mathematics	2000-02-14	Paper
Computably categorical structures and expansions by constants Journal of Symbolic Logic	2000-01-09	Paper
The dense simple sets are orbit complete with respect to the simple sets Annals of Pure and Applied Logic	1999-11-08	Paper
scientific article; zbMATH DE number 1136097 (Why is no real title available?)	1998-10-19	Paper
Permitting, forcing, and copying of a given recursive relation Annals of Pure and Applied Logic	1997-10-14	Paper
scientific article; zbMATH DE number 749922 (Why is no real title available?)	1995-09-11	Paper
Permutations and Presentations	1995-07-27	Paper
Iterated relative recursive enumerability Archive for Mathematical Logic	1995-04-20	Paper
Automorphisms of the lattice of recursively enumerable sets Memoirs of the American Mathematical Society	1995-04-11	Paper
Recursively Enumerable <i>m</i> - and <i>tt</i> -Degrees III: Realizing all Finite Distributive Lattices Journal of the London Mathematical Society	1995-04-06	Paper
The translation theorem Archive for Mathematical Logic	1994-07-07	Paper
Lattice nonembeddings and intervals of the recursively enumerable degrees Annals of Pure and Applied Logic	1994-03-10	Paper
On the Cantor-Bendixon rank of recursively enumerable sets Journal of Symbolic Logic	1993-10-24	Paper
Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets	1993-01-16	Paper
Boolean algebras and orbits of the lattice of r.e sets modulo the finite sets Journal of Symbolic Logic	1990-01-01	Paper

Research outcomes over time

This page was built for person: Peter A. Cholak