| Publication | Date of Publication | Type |
|---|
| Lowness properties for strong reducibilities and the computational power of maximal sets | 2024-04-15 | Paper |
| Online, computable and punctual structure theory | 2024-02-20 | Paper |
| COMPUTABLY COMPACT METRIC SPACES | 2023-08-10 | Paper |
| Computable analysis and classification problems | 2022-12-16 | Paper |
| A MINIMAL SET LOW FOR SPEED | 2022-11-18 | Paper |
| Three topological reducibilities for discontinuous functions | 2022-10-28 | Paper |
| Limit Complexities, Minimal Descriptions, and $n$-Randomness | 2022-08-05 | Paper |
| Cousin’s lemma in second-order arithmetic | 2022-04-27 | Paper |
| RELATIONSHIPS BETWEEN COMPUTABILITY-THEORETIC PROPERTIES OF PROBLEMS | 2022-04-12 | Paper |
| ON SUPERSETS OF NON-LOW SETS | 2021-12-09 | Paper |
| Maximality and collapse in the hierarchy of α-c.a. degrees | 2021-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5155667 | 2021-10-08 | Paper |
| Hierarchy of Computably Enumerable Degrees II | 2021-09-28 | Paper |
| Sir Vaughan Frederick Randal Jones | 2021-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5004963 | 2021-08-03 | Paper |
| Relativizing computable categoricity | 2021-07-28 | Paper |
| Cousin's lemma in second-order arithmetic | 2021-05-06 | Paper |
| PUNCTUAL CATEGORICITY AND UNIVERSALITY | 2021-04-15 | Paper |
| A minimal set low for speed | 2020-11-18 | Paper |
| Enumerating abelian \(p\)-groups | 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 | 2020-06-19 | Paper |
| Graphs are not universal for online computability | 2020-06-09 | Paper |
| A Hierarchy of Turing Degrees | 2020-03-09 | Paper |
| On realization of index sets in \(\Pi_1^0\)-classes | 2020-02-28 | Paper |
| Splitting theorems and low degrees | 2020-01-17 | Paper |
| A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE | 2020-01-10 | Paper |
| On low for speed oracles | 2019-11-29 | Paper |
| Computability and Randomness | 2019-10-28 | Paper |
| Martin-Löf randomness implies multiple recurrence in effectively closed sets | 2019-10-22 | Paper |
| FOUNDATIONS OF ONLINE STRUCTURE THEORY | 2019-08-01 | Paper |
| Categorical linearly ordered structures | 2019-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4630794 | 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 | 2018-08-10 | Paper |
| Degrees containing members of thin Π10 classes are dense and co-dense | 2018-06-13 | Paper |
| Splitting into degrees with low computational strength | 2018-06-05 | Paper |
| On a question of Kalimullin | 2018-06-04 | Paper |
| A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES | 2018-05-03 | Paper |
| Corrigendum to: ``Advice classes of parameterized tractability | 2018-03-21 | Paper |
| A Friedberg enumeration of equivalence structures | 2017-12-04 | Paper |
| Corrigendum: "On the complexity of the successivity relation in computable linear orderings" | 2017-12-04 | Paper |
| Lowness and logical depth | 2017-11-06 | Paper |
| The finite intersection principle and genericity | 2017-09-28 | Paper |
| Minimal Pairs in the C.E. Truth-table Degrees | 2017-06-09 | Paper |
| Resolute sequences in initial segment complexity | 2017-05-31 | Paper |
| Any FIP real computes a 1-generic | 2017-05-23 | Paper |
| Kobayashi compressibility | 2017-05-12 | Paper |
| Notes on computable analysis | 2017-03-31 | Paper |
| Generic Muchnik reducibility and presentations of fields | 2017-01-11 | Paper |
| Courcelle's theorem for triangulations | 2016-11-29 | Paper |
| Abelian \(p\)-groups and the halting problem | 2016-08-31 | Paper |
| Multiple Recurrence and Algorithmic Randomness | 2016-04-14 | Paper |
| Myhill-Nerode Methods for Hypergraphs | 2016-02-19 | Paper |
| Solovay functions and their applications in algorithmic randomness | 2015-08-31 | Paper |
| Integer valued betting strategies and Turing degrees | 2015-07-13 | Paper |
| Asymptotic density and the Ershov hierarchy | 2015-06-22 | Paper |
| On \(\Delta_2^0\)-categoricity of equivalence relations | 2015-05-26 | Paper |
| The members of thin and minimal \(\Pi_1^0\) classes, their ranks and Turing degrees | 2015-05-15 | Paper |
| Iterated effective embeddings of abelian p-groups | 2015-01-21 | Paper |
| EXACT PAIRS FOR THE IDEAL OF THEK-TRIVIAL SEQUENCES IN THE TURING DEGREES | 2014-12-05 | Paper |
| The complexity of computable categoricity | 2014-11-17 | Paper |
| Confronting intractability via parameters | 2014-10-24 | Paper |
| CHARACTERIZING LOWNESS FOR DEMUTH RANDOMNESS | 2014-09-30 | Paper |
| Random strings and tt-degrees of Turing complete C.E. sets | 2014-09-30 | Paper |
| Computable completely decomposable groups | 2014-09-17 | Paper |
| ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS | 2014-03-10 | Paper |
| Myhill-Nerode Methods for Hypergraphs | 2014-01-14 | Paper |
| Fundamentals of parameterized complexity | 2013-12-06 | Paper |
| Strong jump-traceability. II: \(K\)-triviality | 2013-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2843923 | 2013-08-27 | Paper |
| Extensions of embeddings below computably enumerable degrees | 2013-07-08 | Paper |
| Effectively categorical abelian groups | 2013-07-02 | Paper |
| LIMITWISE MONOTONIC FUNCTIONS AND THEIR APPLICATIONS | 2013-06-03 | Paper |
| Computable categoricity versus relative computable categoricity | 2013-05-10 | Paper |
| Schnorr Randomness | 2013-04-19 | Paper |
| Trivial Reals | 2013-04-19 | Paper |
| Pseudo-jump inversion, upper cone avoidance, and strong jump-traceability | 2013-04-16 | Paper |
| Lowness for bounded randomness | 2012-11-27 | Paper |
| The Birth and Early Years of Parameterized Complexity | 2012-09-05 | Paper |
| A Basic Parameterized Complexity Primer | 2012-09-05 | Paper |
| Randomness, Computation and Mathematics | 2012-08-14 | Paper |
| Bounded Randomness | 2012-06-15 | Paper |
| A Parameterized Complexity Tutorial | 2012-06-08 | Paper |
| Kolmogorov Complexity and Solovay Functions | 2012-04-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3224093 | 2012-03-29 | Paper |
| Limits on jump inversion for strong reducibilities | 2011-12-23 | Paper |
| Binary subtrees with few labeled paths | 2011-12-20 | Paper |
| ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR ORDERINGS | 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 | 2011-06-28 | Paper |
| Euclidean functions of computable Euclidean domains | 2011-06-03 | Paper |
| On the orbits of computably enumerable sets | 2010-11-19 | Paper |
| Algorithmic Randomness and Complexity | 2010-10-14 | Paper |
| Lowness for Demuth Randomness | 2010-07-28 | Paper |
| Effective packing dimension and traceability | 2010-07-20 | Paper |
| Decidability and computability of certain torsion-free abelian groups | 2010-06-11 | Paper |
| Turing degrees of reals of positive effective packing dimension | 2010-06-09 | Paper |
| Parameterized approximation of dominating set problems | 2010-06-09 | Paper |
| Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees | 2010-03-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3656425 | 2010-01-13 | Paper |
| On computable self-embeddings of computable linear orderings | 2010-01-07 | Paper |
| On problems without polynomial kernels | 2009-11-10 | Paper |
| 𝐾-trivial degrees and the jump-traceability hierarchy | 2009-05-27 | Paper |
| Space complexity of abelian groups | 2009-03-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3597423 | 2009-02-09 | Paper |
| The upward closure of a perfect thin class | 2008-12-05 | Paper |
| The isomorphism problem for torsion-free abelian groups is analytic complete | 2008-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3530392 | 2008-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3530393 | 2008-10-20 | Paper |
| On Problems without Polynomial Kernels (Extended Abstract) | 2008-08-28 | Paper |
| TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES | 2008-08-26 | Paper |
| Slender classes | 2008-08-11 | Paper |
| Parameterized Approximation Problems | 2008-06-03 | Paper |
| The Complexity of Orbits of Computably Enumerable Sets | 2008-05-08 | Paper |
| Strong jump-traceability. I: The computably enumerable case | 2008-03-05 | Paper |
| Ideals in computable rings | 2007-10-17 | Paper |
| Subspaces of computable vector spaces | 2007-10-17 | Paper |
| Bounded fixed-parameter tractability and reducibility | 2007-09-28 | Paper |
| Undecidability of the structure of the Solovay degrees of c.e. reals | 2007-05-30 | Paper |
| Theory and Applications of Models of Computation | 2007-04-30 | Paper |
| Schnorr dimension | 2007-02-09 | Paper |
| Online promise problems with online width metrics | 2007-01-22 | Paper |
| Every 1-generic computes a properly 1-generic | 2007-01-19 | Paper |
| Calibrating Randomness | 2006-12-06 | Paper |
| Lowness and nullsets | 2006-11-29 | Paper |
| On the structure of parameterized problems in NP | 2006-10-10 | Paper |
| Arithmetical Sacks forcing | 2006-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5489365 | 2006-09-26 | Paper |
| On the Orbits of Computably Enumerable Sets | 2006-07-11 | Paper |
| RELATIVIZING CHAITIN'S HALTING PROBABILITY | 2006-04-06 | Paper |
| New Computational Paradigms | 2006-01-11 | Paper |
| On self-embeddings of computable linear orderings | 2005-12-29 | Paper |
| Developments in Language Theory | 2005-12-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5711881 | 2005-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5698851 | 2005-10-20 | Paper |
| A basis theorem for Π₁⁰ classes of positive measure and jump inversion for random reals | 2005-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5316387 | 2005-09-12 | Paper |
| Schnorr randomness | 2005-08-29 | Paper |
| Parameterized and Exact Computation | 2005-08-23 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| There are no maximal low d.c.e. degrees | 2005-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4677706 | 2005-05-12 | Paper |
| INVARIANCE AND NONINVARIANCE IN THE LATTICE OF $\Pi_1^0$ CLASSES | 2005-03-11 | Paper |
| On Schnorr and computable randomness, martingales, and machines | 2005-02-16 | Paper |
| Degrees of d. c. e. reals | 2005-02-16 | Paper |
| Decomposition and infima in the computably enumerable degrees | 2005-02-09 | Paper |
| The Kolmogorov complexity of random reals | 2004-11-22 | Paper |
| On Kurtz randomness | 2004-11-12 | Paper |
| Randomness and reducibility | 2004-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4460832 | 2004-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4460833 | 2004-03-29 | Paper |
| Computability-theoretic and proof-theoretic aspects of partial and linear orderings | 2004-03-17 | Paper |
| Complementing cappable degrees in the difference hierarchy. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4451642 | 2004-02-29 | Paper |
| Uniformly hard languages. | 2003-05-25 | Paper |
| Computably Enumerable Reals and Uniformly Presentable Ideals | 2003-04-03 | Paper |
| Maximal contiguous degrees | 2003-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779154 | 2002-11-25 | Paper |
| Every Set has a Least Jump Enumeration | 2002-10-22 | Paper |
| On Genericity and Ershov's Hierarchy | 2002-09-03 | Paper |
| Presentations of computably enumerable reals. | 2002-07-31 | Paper |
| A Δ20 set with no infinite low subset in either it or its complement | 2002-07-18 | Paper |
| Index sets and parametric reductions | 2002-07-14 | Paper |
| Randomness, Computability, and Density | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4513967 | 2002-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762505 | 2002-01-09 | Paper |
| Automorphisms of the lattice of $\Pi _1^0$ classes; perfect thin classes and anc degrees | 2001-10-21 | Paper |
| Some orbits for \({\mathcal E}\) | 2001-09-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4520519 | 2001-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4503944 | 2001-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4946096 | 2000-12-17 | Paper |
| A set with barely degree | 2000-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501141 | 2000-09-03 | Paper |
| On computing graph minor obstruction sets | 2000-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249724 | 2000-07-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249725 | 2000-06-29 | Paper |
| Undecidability results for low complexity time classes | 2000-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4258587 | 2000-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263467 | 2000-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4940885 | 2000-04-06 | Paper |
| The complexity of irredundant sets parameterized by size | 2000-03-22 | Paper |
| The Parametrized Complexity of Some Fundamental Problems in Coding Theory | 2000-03-19 | Paper |
| Splitting theorems and the jump operator | 1999-11-08 | Paper |
| Effective presentability of Boolean algebras of Cantor-Bendixson rank 1 | 1999-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4217593 | 1999-08-17 | Paper |
| On initial segments of computable linear orders | 1999-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4348127 | 1999-06-27 | Paper |
| Difference sets and computability theory | 1999-06-24 | Paper |
| Infima in the recursively enumerable weak truth table degrees | 1999-04-08 | Paper |
| Threshold dominating sets and an improved characterization of \(W[2\)] | 1999-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4381407 | 1998-10-19 | Paper |
| Contiguity and distributivity in the enumerable Turing degrees | 1998-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375789 | 1998-10-11 | Paper |
| Parameterized circuit complexity and the \(W\) hierarchy | 1998-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4393480 | 1998-06-10 | Paper |
| On the parameterized complexity of short computation and factorization | 1998-06-02 | Paper |
| On the Universal Splitting Property | 1998-04-01 | Paper |
| Advice classes of parametrized tractability | 1997-11-02 | Paper |
| There is no degree invariant half-jump | 1997-10-01 | Paper |
| The parameterized complexity of sequence alignment and consensus | 1997-09-29 | Paper |
| There is no fat orbit | 1997-03-17 | Paper |
| Fixed-parameter tractability and completeness II: On completeness for W[1] | 1997-02-28 | Paper |
| Jumps of Minimal Degrees Below 0 ′ | 1996-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4863240 | 1996-11-04 | Paper |
| Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree | 1996-10-28 | Paper |
| Degree theoretic definitions of the low2 recursively enumerable sets | 1996-07-16 | Paper |
| Fixed-Parameter Tractability and Completeness I: Basic Results | 1996-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4850549 | 1995-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4764103 | 1995-09-11 | Paper |
| Embedding lattices into the wtt-degrees below 0′ | 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] | 1995-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4837850 | 1995-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4764106 | 1995-05-01 | Paper |
| Recursively Enumerable m - and tt -Degrees III: Realizing all Finite Distributive Lattices | 1995-04-06 | Paper |
| Array nonrecursive degrees and lattice embeddings of the diamond | 1995-02-16 | Paper |
| The structure of the honest polynomial m-degrees | 1995-01-09 | Paper |
| Every Low Boolean Algebra is Isomorphic to a Recursive One | 1995-01-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281497 | 1994-11-13 | Paper |
| A rank one cohesive set | 1994-09-05 | Paper |
| Highness and bounding minimal pairs | 1994-08-31 | Paper |
| There is no plus-capping degree | 1994-07-07 | Paper |
| Lattice nonembeddings and intervals of the recursively enumerable degrees | 1994-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281539 | 1994-03-10 | Paper |
| Splitting theorems in recursion theory | 1994-02-17 | Paper |
| On the Cantor-Bendixon rank of recursively enumerable sets | 1993-10-24 | Paper |
| Friedberg splittings of recursively enumerable sets | 1993-09-22 | Paper |
| Every recursive Boolean algebra is isomorphic to one with incomplete atoms | 1993-08-11 | Paper |
| Countable thin \(\Pi^0_1\) classes | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4027320 | 1993-02-21 | Paper |
| Nondiamond theorems for polynomial time reducibility | 1993-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4018553 | 1993-01-16 | Paper |
| Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets | 1993-01-16 | Paper |
| On co-simple isols and their intersection types | 1992-09-27 | Paper |
| On \(\Pi{}^ 0_ 1\) classes and their ranked points | 1992-06-28 | Paper |
| Tabular degrees in \(\alpha\)-recursion theory | 1992-06-28 | Paper |
| Automorphisms of the lattice of recursively enumerable sets: Orbits | 1992-06-28 | Paper |
| Orderings with αth Jump Degree 0 (α) | 1992-06-28 | Paper |
| Jumps of Hemimaximal Sets | 1992-06-26 | Paper |
| Recursive Linear Orders with Incomplete Successivities | 1992-06-25 | Paper |
| On computational complexity and honest polynomial degrees | 1991-01-01 | Paper |
| Correction to ``Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures | 1990-01-01 | Paper |
| Minimal degrees recursive in 1-generic degrees | 1990-01-01 | Paper |
| Lattice nonembeddings and initial segments of the recursively enumerable degrees | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3197813 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3197814 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3197816 | 1990-01-01 | Paper |
| Completely mitotic r. e. degrees | 1989-01-01 | Paper |
| Intervals and sublattices of the r.e. weak truth table degrees. I: Density | 1989-01-01 | Paper |
| Intervals and sublattices of the r.e. weak truth table degrees. II: Nonbounding | 1989-01-01 | Paper |
| Classification of degree classes associated with r.e. subspaces | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3204500 | 1989-01-01 | Paper |
| On hyper-torre isols | 1989-01-01 | Paper |
| D.R.E. Degrees and the Nondiamond Theorem | 1989-01-01 | Paper |
| Recursively enumerable m- and tt-degrees. I: The quantity of m-degrees | 1989-01-01 | Paper |
| On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders | 1989-01-01 | Paper |
| A Contiguous Nonbranching Degree | 1989-01-01 | Paper |
| Degrees bounding minimal degrees | 1989-01-01 | Paper |
| Recursively enumerable \(m\)- and \(tt\)-degrees. II: The distribution of singular degrees | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3764143 | 1988-01-01 | Paper |
| Two Theorems on Truth Table Degrees | 1988-01-01 | Paper |
| Subsets of hypersimple sets | 1987-01-01 | Paper |
| \(\Delta\)\( ^ 0_ 2\) degrees and transfer theorems | 1987-01-01 | Paper |
| Maximal theories | 1987-01-01 | Paper |
| Orbits of Creative Subspaces | 1987-01-01 | Paper |
| Localization of a theorem of Ambos-Spies and the strong anti-splitting property | 1987-01-01 | Paper |
| Automorphisms and Recursive Structures | 1987-01-01 | Paper |
| Degrees of Splittings and Bases of Recursively Enumerable Subspace | 1987-01-01 | Paper |
| T-Degrees, Jump Classes, and Strong Reducibilities | 1987-01-01 | Paper |
| Sound, totally sound, and unsound recursive equivalence types | 1986-01-01 | Paper |
| Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures | 1986-01-01 | Paper |
| Recursion theory and ordered groups | 1986-01-01 | Paper |
| Splitting properties of r.e. sets and degrees | 1986-01-01 | Paper |
| Bases of Supermaximal Subspaces and Steinitz Systems II | 1986-01-01 | Paper |
| Automorphisms of supermaximal subspaces | 1985-01-01 | Paper |
| The Degrees of R.E. Sets Without the Universal Splitting Property | 1985-01-01 | Paper |
| Effective Extensions of Linear Forms on a Recursive Vector Space Over a Recursive Field | 1985-01-01 | Paper |
| Perfect McLain groups are superperfect | 1984-01-01 | Paper |
| SOME REMARKS ON A THEOREM OF IRAJ KALANTARI CONCERNING CONVEXITY AND RECURSION THEORY | 1984-01-01 | Paper |
| A NOTE ON DECOMPOSITIONS OF RECURSIVELY ENUMERABLE SUBSPACES | 1984-01-01 | Paper |
| Co-immune subspaces and complementation inV∞ | 1984-01-01 | Paper |
| Decidable subspaces and recursively enumerable subspaces | 1984-01-01 | Paper |
| Bases of supermaximal subspaces and Steinitz systems. I | 1984-01-01 | Paper |
| The universal complementation property | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3041179 | 1983-01-01 | Paper |
| ON A QUESTION OF A. RETZLAFF | 1983-01-01 | Paper |
| Abstract dependence, recursion theory, and the lattice of recursively enumerable filters | 1983-01-01 | Paper |
