Person:435198: Difference between revisions

From MaRDI portal
Person:435198
Created automatically from import230924090903
 
m AuthorDisambiguator moved page Peter A. Cholak to Peter A. Cholak: Duplicate
 
(No difference)

Latest revision as of 22:13, 11 December 2023

Available identifiers

zbMath Open cholak.peter-aMaRDI QIDQ435198

List of research outcomes

PublicationDate of PublicationType
Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective2024-02-20Paper
Extending properly n - REA sets12023-01-12Paper
Extending Properly n-REA Sets2021-07-02Paper
Some results concerning the SRT 2 2 vs. COH problem2020-11-09Paper
Realizing Computably Enumerable Degrees in Separating Classes2020-08-23Paper
Thin set theorems and cone avoidance2020-03-02Paper
The Rado path decomposition theorem2019-12-17Paper
Effective prime uniqueness2017-11-08Paper
DENSITY-1-BOUNDING AND QUASIMINIMALITY IN THE GENERIC DEGREES2017-09-26Paper
Any FIP real computes a 1-generic2017-05-23Paper
On Splits of Computably Enumerable Sets2017-04-04Paper
Computably enumerable sets that are automorphic to low sets2017-02-23Paper
Genericity for Mathias forcing over general Turing ideals2017-01-11Paper
-MAXIMAL SETS2016-03-22Paper
Generics for computable Mathias forcing2014-06-06Paper
Some recent research directions in the computably enumerable sets2013-12-20Paper
Computably Enumerable Partial Orders2013-01-30Paper
On Mathias Generic Sets2012-08-14Paper
On \(n\)-tardy sets2012-07-11Paper
Reverse mathematics and infinite traceable graphs2012-02-29Paper
On the orbits of computably enumerable sets2010-11-19Paper
Corrigendum to: “On the strength of Ramsey's Theorem for pairs”2010-01-07Paper
The Complexity of Orbits of Computably Enumerable Sets2008-05-08Paper
Strong jump-traceability. I: The computably enumerable case2008-03-05Paper
Extension theorems, orbits, and automorphisms of the computably enumerable sets2008-01-21Paper
Uniform almost everywhere domination2006-11-29Paper
A computably stable structure with no Scott family of finitary formulas2006-09-04Paper
https://portal.mardi4nfdi.de/entity/Q54833002006-08-16Paper
On the Orbits of Computably Enumerable Sets2006-07-11Paper
https://portal.mardi4nfdi.de/entity/Q57118792005-12-08Paper
Reverse mathematics and the equivalence of definitions for well and better quasi-orders2005-08-29Paper
INVARIANCE AND NONINVARIANCE IN THE LATTICE OF $\Pi_1^0$ CLASSES2005-03-11Paper
Isomorphisms of splits of computably enumerable sets2005-02-09Paper
Maximal contiguous degrees2003-03-22Paper
An almost deep degree2002-09-05Paper
On the strength of Ramsey's theorem for pairs2002-01-09Paper
Definable Encodings in the Computably Enumerable Sets2002-01-09Paper
ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS2002-01-01Paper
Automorphisms of the lattice of $\Pi _1^0$ classes; perfect thin classes and anc degrees2001-10-21Paper
Some orbits for \({\mathcal E}\)2001-09-30Paper
https://portal.mardi4nfdi.de/entity/Q45139642001-04-16Paper
https://portal.mardi4nfdi.de/entity/Q43186392000-06-21Paper
Atomless \(r\)-maximal sets2000-02-14Paper
Computably categorical structures and expansions by constants2000-01-09Paper
The dense simple sets are orbit complete with respect to the simple sets1999-11-08Paper
https://portal.mardi4nfdi.de/entity/Q43814071998-10-19Paper
Permitting, forcing, and copying of a given recursive relation1997-10-14Paper
https://portal.mardi4nfdi.de/entity/Q47641031995-09-11Paper
Permutations and Presentations1995-07-27Paper
Iterated relative recursive enumerability1995-04-20Paper
Automorphisms of the lattice of recursively enumerable sets1995-04-11Paper
Recursively Enumerable m - and tt -Degrees III: Realizing all Finite Distributive Lattices1995-04-06Paper
The translation theorem1994-07-07Paper
Lattice nonembeddings and intervals of the recursively enumerable degrees1994-03-10Paper
On the Cantor-Bendixon rank of recursively enumerable sets1993-10-24Paper
Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets1993-01-16Paper
Boolean algebras and orbits of the lattice of r.e sets modulo the finite sets1990-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Peter A. Cholak