| Publication | Date of Publication | Type |
|---|
On the c.e. degrees realizable in \(\Pi^0_1\) classes
Journal of Symbolic Logic | 2024-11-25 | Paper |
Computability and complexity. Foundations and tools for pursuing scientific applications
Undergraduate Topics in Computer Science | 2024-06-03 | Paper |
Lowness properties for strong reducibilities and the computational power of maximal sets
Computability | 2024-04-15 | Paper |
Online, computable and punctual structure theory
Logic Journal of the IGPL | 2024-02-20 | Paper |
COMPUTABLY COMPACT METRIC SPACES
The Bulletin of Symbolic Logic | 2023-08-10 | Paper |
Computable analysis and classification problems
| 2022-12-16 | Paper |
A MINIMAL SET LOW FOR SPEED
Journal of Symbolic Logic | 2022-11-18 | Paper |
Three topological reducibilities for discontinuous functions
Transactions of the American Mathematical Society, Series B | 2022-10-28 | Paper |
Limit Complexities, Minimal Descriptions, and $n$-Randomness
| 2022-08-05 | Paper |
Cousin’s lemma in second-order arithmetic
Proceedings of the American Mathematical Society, Series B | 2022-04-27 | Paper |
Relationships between computability-theoretic properties of problems
Journal of Symbolic Logic | 2022-04-12 | Paper |
ON SUPERSETS OF NON-LOW SETS
Journal of Symbolic Logic | 2021-12-09 | Paper |
Maximality and collapse in the hierarchy of \(\alpha\)-c.a. degrees
Computability | 2021-11-18 | Paper |
scientific article; zbMATH DE number 7407778 (Why is no real title available?)
| 2021-10-08 | Paper |
Hierarchy of Computably Enumerable Degrees II
New Zealand Journal of Mathematics | 2021-09-28 | Paper |
Sir Vaughan Frederick Randal Jones
New Zealand Journal of Mathematics | 2021-09-28 | Paper |
scientific article; zbMATH DE number 7377983 (Why is no real title available?)
| 2021-08-03 | Paper |
Relativizing computable categoricity
Proceedings of the American Mathematical Society | 2021-07-28 | Paper |
Cousin's lemma in second-order arithmetic
| 2021-05-06 | Paper |
PUNCTUAL CATEGORICITY AND UNIVERSALITY
Journal of Symbolic Logic | 2021-04-15 | Paper |
A minimal set low for speed
| 2020-11-18 | Paper |
Enumerating abelian \(p\)-groups
Journal of Algebra | 2020-08-25 | Paper |
Realizing Computably Enumerable Degrees in Separating Classes
| 2020-08-23 | Paper |
On low for speed oracles
| 2020-08-05 | Paper |
Foundations of Online Structure Theory II: The Operator Approach
| 2020-07-14 | Paper |
Minimal weak truth table degrees and computably enumerable Turing degrees
Memoirs of the American Mathematical Society | 2020-06-19 | Paper |
Graphs are not universal for online computability
Journal of Computer and System Sciences | 2020-06-09 | Paper |
A Hierarchy of Turing Degrees
| 2020-03-09 | Paper |
On realization of index sets in \(\Pi_1^0\)-classes
Algebra and Logic | 2020-02-28 | Paper |
Splitting theorems and low degrees
Computability | 2020-01-17 | Paper |
A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE
Journal of Symbolic Logic | 2020-01-10 | Paper |
On low for speed oracles
Journal of Computer and System Sciences | 2019-11-29 | Paper |
Computability and Randomness
Notices of the American Mathematical Society | 2019-10-28 | Paper |
Martin-Löf randomness implies multiple recurrence in effectively closed sets
Notre Dame Journal of Formal Logic | 2019-10-22 | Paper |
FOUNDATIONS OF ONLINE STRUCTURE THEORY
The Bulletin of Symbolic Logic | 2019-08-01 | Paper |
Categorical linearly ordered structures
Annals of Pure and Applied Logic | 2019-07-10 | Paper |
Degree spectra of unary relations on $\langle \omega, \leq \rangle$
| 2019-04-23 | Paper |
Relationships between computability-theoretic properties of problems
| 2019-03-11 | Paper |
Avoiding effective packing dimension 1 below array noncomputable c.e. degrees
Journal of Symbolic Logic | 2018-08-10 | Paper |
Degrees containing members of thin \(\Pi_1^0\) classes are dense and co-dense
Journal of Mathematical Logic | 2018-06-13 | Paper |
Splitting into degrees with low computational strength
Annals of Pure and Applied Logic | 2018-06-05 | Paper |
On a question of Kalimullin
Proceedings of the American Mathematical Society | 2018-06-04 | Paper |
A hierarchy of computably enumerable degrees
The Bulletin of Symbolic Logic | 2018-05-03 | Paper |
Corrigendum to: ``Advice classes of parameterized tractability
Annals of Pure and Applied Logic | 2018-03-21 | Paper |
Corrigendum: "On the complexity of the successivity relation in computable linear orderings"
Journal of Mathematical Logic | 2017-12-04 | Paper |
A Friedberg enumeration of equivalence structures
Journal of Mathematical Logic | 2017-12-04 | Paper |
Lowness and logical depth
Theoretical Computer Science | 2017-11-06 | Paper |
The finite intersection principle and genericity
Mathematical Proceedings of the Cambridge Philosophical Society | 2017-09-28 | Paper |
Minimal Pairs in the C.E. Truth-table Degrees
Proceedings of the 13th Asian Logic Conference | 2017-06-09 | Paper |
Resolute sequences in initial segment complexity
Proceedings of the 12th Asian Logic Conference | 2017-05-31 | Paper |
Any FIP real computes a 1-generic
Transactions of the American Mathematical Society | 2017-05-23 | Paper |
Kobayashi compressibility
Theoretical Computer Science | 2017-05-12 | Paper |
Notes on computable analysis
Theory of Computing Systems | 2017-03-31 | Paper |
Generic Muchnik reducibility and presentations of fields
Israel Journal of Mathematics | 2017-01-11 | Paper |
Courcelle's theorem for triangulations
Journal of Combinatorial Theory. Series A | 2016-11-29 | Paper |
Abelian \(p\)-groups and the halting problem
Annals of Pure and Applied Logic | 2016-08-31 | Paper |
Multiple Recurrence and Algorithmic Randomness
| 2016-04-14 | Paper |
Myhill-Nerode methods for hypergraphs
Algorithmica | 2016-02-19 | Paper |
Solovay functions and their applications in algorithmic randomness
Journal of Computer and System Sciences | 2015-08-31 | Paper |
Integer valued betting strategies and Turing degrees
Journal of Computer and System Sciences | 2015-07-13 | Paper |
Asymptotic density and the Ershov hierarchy
Mathematical Logic Quarterly | 2015-06-22 | Paper |
On \(\Delta_2^0\)-categoricity of equivalence relations
Annals of Pure and Applied Logic | 2015-05-26 | Paper |
The members of thin and minimal \(\Pi_1^0\) classes, their ranks and Turing degrees
Annals of Pure and Applied Logic | 2015-05-15 | Paper |
Iterated effective embeddings of abelian \(p\)-groups
International Journal of Algebra and Computation | 2015-01-21 | Paper |
Exact pairs for the ideal of the \(K\)-trivial sequences in the Turing degrees
Journal of Symbolic Logic | 2014-12-05 | Paper |
The complexity of computable categoricity
Advances in Mathematics | 2014-11-17 | Paper |
Confronting intractability via parameters
Computer Science Review | 2014-10-24 | Paper |
Characterizing lowness for Demuth randomness
The Journal of Symbolic Logic | 2014-09-30 | Paper |
Random strings and truth-table degrees of Turing complete c.e. sets
Logical Methods in Computer Science | 2014-09-30 | Paper |
Computable completely decomposable groups
Transactions of the American Mathematical Society | 2014-09-17 | Paper |
ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS
Journal of Mathematical Logic | 2014-03-10 | Paper |
Fundamentals of parameterized complexity
Texts in Computer Science | 2013-12-06 | Paper |
Strong jump-traceability. II: \(K\)-triviality
Israel Journal of Mathematics | 2013-11-01 | Paper |
Cutting up is hard to do: the parameterised complexity of \(k\)-cut and related problems
| 2013-08-27 | Paper |
Extensions of embeddings below computably enumerable degrees
Transactions of the American Mathematical Society | 2013-07-08 | Paper |
Effectively categorical abelian groups
Journal of Algebra | 2013-07-02 | Paper |
LIMITWISE MONOTONIC FUNCTIONS AND THEIR APPLICATIONS
Proceedings of the 11th Asian Logic Conference | 2013-06-03 | Paper |
Computable categoricity versus relative computable categoricity
Fundamenta Mathematicae | 2013-05-10 | Paper |
Schnorr randomness
Electronic Notes in Theoretical Computer Science | 2013-04-19 | Paper |
Trivial Reals
Electronic Notes in Theoretical Computer Science | 2013-04-19 | Paper |
Pseudo-jump inversion, upper cone avoidance, and strong jump-traceability
Advances in Mathematics | 2013-04-16 | Paper |
Lowness for bounded randomness
Theoretical Computer Science | 2012-11-27 | Paper |
A basic parameterized complexity primer
The Multivariate Algorithmic Revolution and Beyond | 2012-09-05 | Paper |
The birth and early years of parameterized complexity
The Multivariate Algorithmic Revolution and Beyond | 2012-09-05 | Paper |
Randomness, computation and mathematics
Lecture Notes in Computer Science | 2012-08-14 | Paper |
Bounded randomness
Computation, Physics and Beyond | 2012-06-15 | Paper |
A parameterized complexity tutorial
Language and Automata Theory and Applications | 2012-06-08 | Paper |
Kolmogorov complexity and solovay functions
| 2012-04-24 | Paper |
Computability, algorithmic randomness and complexity
| 2012-03-29 | Paper |
Limits on jump inversion for strong reducibilities
Journal of Symbolic Logic | 2011-12-23 | Paper |
Binary subtrees with few labeled paths
Combinatorica | 2011-12-20 | Paper |
On the complexity of the successivity relation in computable linear orderings
Journal of Mathematical Logic | 2011-10-24 | Paper |
Pseudo-jump inversion and SJT-hard sets
| 2011-09-30 | Paper |
Jump inversions inside effectively closed sets and applications to randomness
Journal of Symbolic Logic | 2011-06-28 | Paper |
Euclidean functions of computable Euclidean domains
Notre Dame Journal of Formal Logic | 2011-06-03 | Paper |
On the orbits of computably enumerable sets
Journal of the American Mathematical Society | 2010-11-19 | Paper |
Algorithmic randomness and complexity.
Theory and Applications of Computability | 2010-10-14 | Paper |
Lowness for Demuth Randomness
Mathematical Theory and Computational Practice | 2010-07-28 | Paper |
Effective packing dimension and traceability
Notre Dame Journal of Formal Logic | 2010-07-20 | Paper |
Decidability and computability of certain torsion-free abelian groups
Notre Dame Journal of Formal Logic | 2010-06-11 | Paper |
Parameterized approximation of dominating set problems
Information Processing Letters | 2010-06-09 | Paper |
Turing degrees of reals of positive effective packing dimension
Information Processing Letters | 2010-06-09 | Paper |
Working with strong reducibilities above totally \(\omega \)-c.e. and array computable degrees
Transactions of the American Mathematical Society | 2010-03-08 | Paper |
scientific article; zbMATH DE number 5657607 (Why is no real title available?)
| 2010-01-13 | Paper |
On computable self-embeddings of computable linear orderings
Journal of Symbolic Logic | 2010-01-07 | Paper |
On problems without polynomial kernels
Journal of Computer and System Sciences | 2009-11-10 | Paper |
𝐾-trivial degrees and the jump-traceability hierarchy
Proceedings of the American Mathematical Society | 2009-05-27 | Paper |
Space complexity of abelian groups
Archive for Mathematical Logic | 2009-03-17 | Paper |
Five lectures on algorithmic randomness
| 2009-02-09 | Paper |
The upward closure of a perfect thin class
Annals of Pure and Applied Logic | 2008-12-05 | Paper |
The isomorphism problem for torsion-free abelian groups is analytic complete
Journal of Algebra | 2008-11-12 | Paper |
scientific article; zbMATH DE number 5354044 (Why is no real title available?)
| 2008-10-20 | Paper |
Prompt simplicity, array computability and cupping
| 2008-10-20 | Paper |
On Problems without Polynomial Kernels (Extended Abstract)
Automata, Languages and Programming | 2008-08-28 | Paper |
TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
Journal of Mathematical Logic | 2008-08-26 | Paper |
Slender classes
Journal of the London Mathematical Society | 2008-08-11 | Paper |
Parameterized Approximation Problems
Parameterized and Exact Computation | 2008-06-03 | 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 |
Subspaces of computable vector spaces
Journal of Algebra | 2007-10-17 | Paper |
Ideals in computable rings
Journal of Algebra | 2007-10-17 | Paper |
Bounded fixed-parameter tractability and reducibility
Annals of Pure and Applied Logic | 2007-09-28 | Paper |
Undecidability of the structure of the Solovay degrees of c.e. reals
Journal of Computer and System Sciences | 2007-05-30 | Paper |
Theory and Applications of Models of Computation
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Schnorr dimension
Mathematical Structures in Computer Science | 2007-02-09 | Paper |
Online promise problems with online width metrics
Journal of Computer and System Sciences | 2007-01-22 | Paper |
Every 1-generic computes a properly 1-generic
Journal of Symbolic Logic | 2007-01-19 | Paper |
Calibrating Randomness
The Bulletin of Symbolic Logic | 2006-12-06 | Paper |
Lowness and nullsets
Journal of Symbolic Logic | 2006-11-29 | Paper |
On the structure of parameterized problems in NP
Information and Computation | 2006-10-10 | Paper |
scientific article; zbMATH DE number 5057386 (Why is no real title available?)
| 2006-09-26 | Paper |
Arithmetical Sacks forcing
Archive for Mathematical Logic | 2006-09-26 | Paper |
On the Orbits of Computably Enumerable Sets
| 2006-07-11 | Paper |
RELATIVIZING CHAITIN'S HALTING PROBABILITY
Journal of Mathematical Logic | 2006-04-06 | Paper |
New Computational Paradigms
Lecture Notes in Computer Science | 2006-01-11 | Paper |
On self-embeddings of computable linear orderings
Annals of Pure and Applied Logic | 2005-12-29 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2005-12-22 | Paper |
scientific article; zbMATH DE number 2236630 (Why is no real title available?)
| 2005-12-08 | Paper |
scientific article; zbMATH DE number 2216723 (Why is no real title available?)
| 2005-10-20 | Paper |
A basis theorem for Π₁⁰ classes of positive measure and jump inversion for random reals
Proceedings of the American Mathematical Society | 2005-10-06 | Paper |
scientific article; zbMATH DE number 2204767 (Why is no real title available?)
| 2005-09-12 | Paper |
Schnorr randomness
Journal of Symbolic Logic | 2005-08-29 | Paper |
Parameterized and Exact Computation
Lecture Notes in Computer Science | 2005-08-23 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
There are no maximal low d.c.e. degrees
Notre Dame Journal of Formal Logic | 2005-07-06 | Paper |
scientific article; zbMATH DE number 2167522 (Why is no real title available?)
| 2005-05-12 | Paper |
INVARIANCE AND NONINVARIANCE IN THE LATTICE OF $\Pi_1^0$ CLASSES
Journal of the London Mathematical Society | 2005-03-11 | Paper |
Degrees of d. c. e. reals
Mathematical Logic Quarterly | 2005-02-16 | Paper |
On Schnorr and computable randomness, martingales, and machines
MLQ | 2005-02-16 | Paper |
Decomposition and infima in the computably enumerable degrees
Journal of Symbolic Logic | 2005-02-09 | Paper |
The Kolmogorov complexity of random reals
Annals of Pure and Applied Logic | 2004-11-22 | Paper |
On Kurtz randomness
Theoretical Computer Science | 2004-11-12 | Paper |
Randomness and reducibility
Journal of Computer and System Sciences | 2004-09-08 | Paper |
scientific article; zbMATH DE number 2063218 (Why is no real title available?)
| 2004-03-29 | Paper |
scientific article; zbMATH DE number 2063217 (Why is no real title available?)
| 2004-03-29 | Paper |
Computability-theoretic and proof-theoretic aspects of partial and linear orderings
Israel Journal of Mathematics | 2004-03-17 | Paper |
Complementing cappable degrees in the difference hierarchy.
Annals of Pure and Applied Logic | 2004-03-14 | Paper |
scientific article; zbMATH DE number 2047485 (Why is no real title available?)
| 2004-02-29 | Paper |
Uniformly hard languages.
Theoretical Computer Science | 2003-05-25 | Paper |
Computably Enumerable Reals and Uniformly Presentable Ideals
| 2003-04-03 | Paper |
Maximal contiguous degrees
Journal of Symbolic Logic | 2003-03-22 | Paper |
scientific article; zbMATH DE number 1834658 (Why is no real title available?)
| 2002-11-25 | Paper |
Every Set has a Least Jump Enumeration
Journal of the London Mathematical Society | 2002-10-22 | Paper |
On genericity and Ershov's hierarchy
Mathematical Logic Quarterly (MLQ) | 2002-09-03 | Paper |
Presentations of computably enumerable reals.
Theoretical Computer Science | 2002-07-31 | Paper |
A \(\Delta_2^0\) set with no infinite low subset in either it or its complement
The Journal of Symbolic Logic | 2002-07-18 | Paper |
Index sets and parametric reductions
Archive for Mathematical Logic | 2002-07-14 | Paper |
Randomness, computability, and density
SIAM Journal on Computing | 2002-04-23 | Paper |
scientific article; zbMATH DE number 1531924 (Why is no real title available?)
| 2002-01-16 | Paper |
scientific article; zbMATH DE number 1688364 (Why is no real title available?)
| 2002-01-09 | 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 1543064 (Why is no real title available?)
| 2001-02-26 | Paper |
scientific article; zbMATH DE number 1507224 (Why is no real title available?)
| 2001-01-17 | Paper |
scientific article; zbMATH DE number 1421071 (Why is no real title available?)
| 2000-12-17 | Paper |
A set with barely degree
Journal of Symbolic Logic | 2000-12-17 | Paper |
scientific article; zbMATH DE number 1499087 (Why is no real title available?)
| 2000-09-03 | Paper |
On computing graph minor obstruction sets
Theoretical Computer Science | 2000-08-23 | Paper |
scientific article; zbMATH DE number 1303201 (Why is no real title available?)
| 2000-07-31 | Paper |
scientific article; zbMATH DE number 1303202 (Why is no real title available?)
| 2000-06-29 | Paper |
Undecidability results for low complexity time classes
Journal of Computer and System Sciences | 2000-06-05 | Paper |
scientific article; zbMATH DE number 1341905 (Why is no real title available?)
| 2000-05-04 | Paper |
scientific article; zbMATH DE number 1335896 (Why is no real title available?)
| 2000-05-04 | Paper |
scientific article; zbMATH DE number 1407500 (Why is no real title available?)
| 2000-04-06 | Paper |
The complexity of irredundant sets parameterized by size
Discrete Applied Mathematics | 2000-03-22 | Paper |
The Parametrized Complexity of Some Fundamental Problems in Coding Theory
SIAM Journal on Computing | 2000-03-19 | Paper |
Effective presentability of Boolean algebras of Cantor-Bendixson rank 1
Journal of Symbolic Logic | 1999-11-08 | Paper |
Splitting theorems and the jump operator
Annals of Pure and Applied Logic | 1999-11-08 | Paper |
scientific article; zbMATH DE number 1222098 (Why is no real title available?)
| 1999-08-17 | Paper |
On initial segments of computable linear orders
Order | 1999-06-27 | Paper |
scientific article; zbMATH DE number 1048041 (Why is no real title available?)
| 1999-06-27 | Paper |
Difference sets and computability theory
Annals of Pure and Applied Logic | 1999-06-24 | Paper |
Infima in the recursively enumerable weak truth table degrees
Notre Dame Journal of Formal Logic | 1999-04-08 | Paper |
Threshold dominating sets and an improved characterization of \(W[2\)]
Theoretical Computer Science | 1999-01-12 | Paper |
scientific article; zbMATH DE number 1136097 (Why is no real title available?)
| 1998-10-19 | Paper |
Contiguity and distributivity in the enumerable Turing degrees
Journal of Symbolic Logic | 1998-10-19 | Paper |
scientific article; zbMATH DE number 1114020 (Why is no real title available?)
| 1998-10-11 | Paper |
Parameterized circuit complexity and the \(W\) hierarchy
Theoretical Computer Science | 1998-08-13 | Paper |
scientific article; zbMATH DE number 1161563 (Why is no real title available?)
| 1998-06-10 | Paper |
On the parameterized complexity of short computation and factorization
Archive for Mathematical Logic | 1998-06-02 | Paper |
On the Universal Splitting Property
Mathematical Logic Quarterly | 1998-04-01 | Paper |
Advice classes of parametrized tractability
Annals of Pure and Applied Logic | 1997-11-02 | Paper |
There is no degree invariant half-jump
Proceedings of the American Mathematical Society | 1997-10-01 | Paper |
The parameterized complexity of sequence alignment and consensus
Theoretical Computer Science | 1997-09-29 | Paper |
There is no fat orbit
Annals of Pure and Applied Logic | 1997-03-17 | Paper |
Fixed-parameter tractability and completeness II: On completeness for W[1]
Theoretical Computer Science | 1997-02-28 | Paper |
Jumps of Minimal Degrees Below 0 ′
Journal of the London Mathematical Society | 1996-12-12 | Paper |
scientific article; zbMATH DE number 841084 (Why is no real title available?)
| 1996-11-04 | Paper |
Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree
Israel Journal of Mathematics | 1996-10-28 | Paper |
Degree theoretic definitions of the low2 recursively enumerable sets
Journal of Symbolic Logic | 1996-07-16 | Paper |
Fixed-Parameter Tractability and Completeness I: Basic Results
SIAM Journal on Computing | 1996-02-04 | Paper |
scientific article; zbMATH DE number 806748 (Why is no real title available?)
| 1995-10-17 | Paper |
scientific article; zbMATH DE number 749922 (Why is no real title available?)
| 1995-09-11 | Paper |
Embedding lattices into the wtt-degrees below 0′
Journal of Symbolic Logic | 1995-08-10 | Paper |
Permutations and Presentations
| 1995-07-27 | Paper |
Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(\) and PSPACE analogues]
Annals of Pure and Applied Logic | 1995-07-26 | Paper |
scientific article; zbMATH DE number 769946 (Why is no real title available?)
| 1995-07-03 | Paper |
scientific article; zbMATH DE number 749925 (Why is no real title available?)
| 1995-05-01 | Paper |
Recursively Enumerable m - and tt -Degrees III: Realizing all Finite Distributive Lattices
Journal of the London Mathematical Society | 1995-04-06 | Paper |
Array nonrecursive degrees and lattice embeddings of the diamond
Illinois Journal of Mathematics | 1995-02-16 | Paper |
The structure of the honest polynomial m-degrees
Annals of Pure and Applied Logic | 1995-01-09 | Paper |
Every Low Boolean Algebra is Isomorphic to a Recursive One
| 1995-01-02 | Paper |
scientific article; zbMATH DE number 512804 (Why is no real title available?)
| 1994-11-13 | Paper |
A rank one cohesive set
Annals of Pure and Applied Logic | 1994-09-05 | Paper |
Highness and bounding minimal pairs
Mathematical Logic Quarterly | 1994-08-31 | Paper |
There is no plus-capping degree
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 |
scientific article; zbMATH DE number 512844 (Why is no real title available?)
| 1994-03-10 | Paper |
Splitting theorems in recursion theory
Annals of Pure and Applied Logic | 1994-02-17 | Paper |
On the Cantor-Bendixon rank of recursively enumerable sets
Journal of Symbolic Logic | 1993-10-24 | Paper |
Friedberg splittings of recursively enumerable sets
Annals of Pure and Applied Logic | 1993-09-22 | Paper |
Every recursive Boolean algebra is isomorphic to one with incomplete atoms
Annals of Pure and Applied Logic | 1993-08-11 | Paper |
Countable thin \(\Pi^0_1\) classes
Annals of Pure and Applied Logic | 1993-05-16 | Paper |
scientific article; zbMATH DE number 125608 (Why is no real title available?)
| 1993-02-21 | Paper |
Nondiamond theorems for polynomial time reducibility
Journal of Computer and System Sciences | 1993-01-17 | Paper |
Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets
| 1993-01-16 | Paper |
scientific article; zbMATH DE number 90342 (Why is no real title available?)
| 1993-01-16 | Paper |
On co-simple isols and their intersection types
Annals of Pure and Applied Logic | 1992-09-27 | Paper |
Automorphisms of the lattice of recursively enumerable sets: Orbits
Advances in Mathematics | 1992-06-28 | Paper |
Tabular degrees in \(\alpha\)-recursion theory
Annals of Pure and Applied Logic | 1992-06-28 | Paper |
Orderings with αth Jump Degree 0 (α)
Proceedings of the American Mathematical Society | 1992-06-28 | Paper |
On \(\Pi{}^ 0_ 1\) classes and their ranked points
Notre Dame Journal of Formal Logic | 1992-06-28 | Paper |
Jumps of Hemimaximal Sets
Mathematical Logic Quarterly | 1992-06-26 | Paper |
Recursive Linear Orders with Incomplete Successivities
| 1992-06-25 | Paper |
On computational complexity and honest polynomial degrees
Theoretical Computer Science | 1991-01-01 | Paper |
scientific article; zbMATH DE number 4172959 (Why is no real title available?)
| 1990-01-01 | Paper |
scientific article; zbMATH DE number 4172960 (Why is no real title available?)
| 1990-01-01 | Paper |
Minimal degrees recursive in 1-generic degrees
Annals of Pure and Applied Logic | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4172958 (Why is no real title available?)
| 1990-01-01 | Paper |
Correction to ``Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures
Annals of Pure and Applied Logic | 1990-01-01 | Paper |
Lattice nonembeddings and initial segments of the recursively enumerable degrees
Annals of Pure and Applied Logic | 1990-01-01 | Paper |
D.R.E. Degrees and the Nondiamond Theorem
Bulletin of the London Mathematical Society | 1989-01-01 | Paper |
Degrees bounding minimal degrees
Mathematical Proceedings of the Cambridge Philosophical Society | 1989-01-01 | Paper |
On hyper-torre isols
Journal of Symbolic Logic | 1989-01-01 | Paper |
A Contiguous Nonbranching Degree
Zeitschrift für Mathematische Logik und Grundlagen der Mathematik | 1989-01-01 | Paper |
On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders
Zeitschrift für Mathematische Logik und Grundlagen der Mathematik | 1989-01-01 | Paper |
Completely mitotic r. e. degrees
Annals of Pure and Applied Logic | 1989-01-01 | Paper |
Recursively enumerable m- and tt-degrees. I: The quantity of m-degrees
Journal of Symbolic Logic | 1989-01-01 | Paper |
Intervals and sublattices of the r.e. weak truth table degrees. I: Density
Annals of Pure and Applied Logic | 1989-01-01 | Paper |
scientific article; zbMATH DE number 4181385 (Why is no real title available?)
| 1989-01-01 | Paper |
Intervals and sublattices of the r.e. weak truth table degrees. II: Nonbounding
Annals of Pure and Applied Logic | 1989-01-01 | Paper |
Classification of degree classes associated with r.e. subspaces
Annals of Pure and Applied Logic | 1989-01-01 | Paper |
scientific article; zbMATH DE number 4021121 (Why is no real title available?)
| 1988-01-01 | Paper |
Recursively enumerable \(m\)- and \(tt\)-degrees. II: The distribution of singular degrees
Archive for Mathematical Logic | 1988-01-01 | Paper |
Two Theorems on Truth Table Degrees
| 1988-01-01 | Paper |
Maximal theories
Annals of Pure and Applied Logic | 1987-01-01 | Paper |
Orbits of Creative Subspaces
| 1987-01-01 | Paper |
Automorphisms and Recursive Structures
Zeitschrift für Mathematische Logik und Grundlagen der Mathematik | 1987-01-01 | Paper |
\(\Delta\)\( ^ 0_ 2\) degrees and transfer theorems
Illinois Journal of Mathematics | 1987-01-01 | Paper |
Subsets of hypersimple sets
Pacific Journal of Mathematics | 1987-01-01 | Paper |
Degrees of Splittings and Bases of Recursively Enumerable Subspace
Transactions of the American Mathematical Society | 1987-01-01 | Paper |
Localization of a theorem of Ambos-Spies and the strong anti-splitting property
Archiv für Mathematische Logik und Grundlagenforschung | 1987-01-01 | Paper |
T-Degrees, Jump Classes, and Strong Reducibilities
| 1987-01-01 | Paper |
Recursion theory and ordered groups
Annals of Pure and Applied Logic | 1986-01-01 | Paper |
Bases of Supermaximal Subspaces and Steinitz Systems II
Mathematical Logic Quarterly | 1986-01-01 | Paper |
Sound, totally sound, and unsound recursive equivalence types
Annals of Pure and Applied Logic | 1986-01-01 | Paper |
Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures
Annals of Pure and Applied Logic | 1986-01-01 | Paper |
Splitting properties of r.e. sets and degrees
Journal of Symbolic Logic | 1986-01-01 | Paper |
Automorphisms of supermaximal subspaces
Journal of Symbolic Logic | 1985-01-01 | Paper |
Effective Extensions of Linear Forms on a Recursive Vector Space Over a Recursive Field
Zeitschrift für Mathematische Logik und Grundlagen der Mathematik | 1985-01-01 | Paper |
The Degrees of R.E. Sets Without the Universal Splitting Property
Transactions of the American Mathematical Society | 1985-01-01 | Paper |
Bases of supermaximal subspaces and Steinitz systems. I
Journal of Symbolic Logic | 1984-01-01 | Paper |
A NOTE ON DECOMPOSITIONS OF RECURSIVELY ENUMERABLE SUBSPACES
Zeitschrift für Mathematische Logik und Grundlagen der Mathematik | 1984-01-01 | Paper |
Co-immune subspaces and complementation inV∞
Journal of Symbolic Logic | 1984-01-01 | Paper |
Decidable subspaces and recursively enumerable subspaces
Journal of Symbolic Logic | 1984-01-01 | Paper |
The universal complementation property
Journal of Symbolic Logic | 1984-01-01 | Paper |
Perfect McLain groups are superperfect
Bulletin of the Australian Mathematical Society | 1984-01-01 | Paper |
SOME REMARKS ON A THEOREM OF IRAJ KALANTARI CONCERNING CONVEXITY AND RECURSION THEORY
Zeitschrift für Mathematische Logik und Grundlagen der Mathematik | 1984-01-01 | Paper |
ON A QUESTION OF A. RETZLAFF
Mathematical Logic Quarterly | 1983-01-01 | Paper |
Abstract dependence, recursion theory, and the lattice of recursively enumerable filters
Bulletin of the Australian Mathematical Society | 1983-01-01 | Paper |
scientific article; zbMATH DE number 3833946 (Why is no real title available?)
| 1983-01-01 | Paper |
