Richard A. Shore

J. Symb. Log., 2023

2022

Theorems of Hyperarithmetic Analysis and Almost theorems of Hyperarithmetic Analysis.

[BibT_eX]

[DOI]

James S. Barnes

Jun Le Goh

Bull. Symb. Log., 2022

2018

On the Jumps of the Degrees Below a Recursively Enumerable Degree.

[BibT_eX]

[DOI]

David R. Bélanger

Notre Dame J. Formal Log., 2018

Conservativity of Ultrafilters over Subsystems of second order Arithmetic.

[BibT_eX]

[DOI]

J. Symb. Log., 2018

2017

Σ _1^1 in Every Real in a Σ _1^1 Class of Reals Is Σ _1^1.

[BibT_eX]

[DOI]

Leo Harrington

Proceedings of the Computability and Complexity, 2017

2016

Mass problems and density.

[BibT_eX]

[DOI]

Stephen Binns

Stephen G. Simpson

J. Math. Log., 2016

The strength of the Grätzer-Schmidt theorem.

[BibT_eX]

[DOI]

Paul Kim Long V. Nguyen

Arch. Math. Log., 2016

2014

The Turing Degrees below generics and randoms.

[BibT_eX]

[DOI]

J. Symb. Log., 2014

The complexity of ascendant sequences in locally nilpotent groups.

[BibT_eX]

[DOI]

Chris J. Conidis

Int. J. Algebra Comput., 2014

2013

Degrees of Categoricity and the Hyperarithmetic Hierarchy.

[BibT_eX]

[DOI]

Barbara F. Csima

Johanna N. Y. Franklin

Notre Dame J. Formal Log., 2013

Low level nondefinability results: Domination and recursive enumeration.

[BibT_eX]

[DOI]

Mingzhong Cai

J. Symb. Log., 2013

2012

Domination, forcing, array nonrecursiveness and relative recursive enumerability.

[BibT_eX]

[DOI]

Mingzhong Cai

J. Symb. Log., 2012

The n-R.E. Degrees: Undecidability and σ1 Substructures.

[BibT_eX]

[DOI]

Mingzhong Cai

J. Math. Log., 2012

Computably Enumerable Partial Orders.

[BibT_eX]

[DOI]

Comput., 2012

Computing maximal chains.

[BibT_eX]

[DOI]

Alberto Marcone

Arch. Math. Log., 2012

2011

The maximal linear extension theorem in second order arithmetic.

[BibT_eX]

[DOI]

Alberto Marcone

Arch. Math. Log., 2011

Topological aspects of the Medvedev lattice.

[BibT_eX]

[DOI]

Andrew E. M. Lewis

Andrea Sorbi

Arch. Math. Log., 2011

2010

Lattice initial segments of the hyperdegrees.

[BibT_eX]

[DOI]

Bjørn Kjos-Hanssen

J. Symb. Log., 2010

Reverse mathematics: the playground of logic.

[BibT_eX]

[DOI]

Bull. Symb. Log., 2010

2007

Combinatorial principles weaker than Ramsey's Theorem for pairs.

[BibT_eX]

[DOI]

Denis R. Hirschfeldt

J. Symb. Log., 2007

The settling-time reducibility ordering.

[BibT_eX]

[DOI]

Barbara F. Csima

J. Symb. Log., 2007

Direct and Local Definitions of the Turing jump.

[BibT_eX]

[DOI]

J. Math. Log., 2007

Local Definitions in Degree Structures: The Turing Jump, Hyperdegrees and Beyond.

[BibT_eX]

[DOI]

Bull. Symb. Log., 2007

2006

Boolean Algebras, Tarski Invariants, and Index Sets.

[BibT_eX]

[DOI]

Barbara F. Csima

Notre Dame J. Formal Log., 2006

The Theory of the Metarecursively Enumerable Degrees.

[BibT_eX]

[DOI]

Noam Greenberg

J. Math. Log., 2006

Degree Structures: Local and Global Investigations.

[BibT_eX]

[DOI]

Bull. Symb. Log., 2006

A computably stable structure with no Scott family of finitary formulas.

[BibT_eX]

[DOI]

Peter Cholak

Reed Solomon

Arch. Math. Log., 2006

2004

Generalized high degrees have the complementation property.

[BibT_eX]

[DOI]

Noam Greenberg

J. Symb. Log., 2004

Pi11 relations and paths through.

[BibT_eX]

[DOI]

Sergei S. Goncharov

Valentina S. Harizanov

Julia F. Knight

J. Symb. Log., 2004

Reasoning about common knowledge with infinitely many agents.

[BibT_eX]

[DOI]

Joseph Y. Halpern

Inf. Comput., 2004

2003

A computably categorical structure whose expansion by a constant has infinite computable dimension.

[BibT_eX]

[DOI]

Denis R. Hirschfeldt

J. Symb. Log., 2003

Decomposition and infima in the computably enumerable degrees.

[BibT_eX]

[DOI]

Geoffrey LaForte

J. Symb. Log., 2003

2002

A nonlow2 R. E. Degree with the Extension of Embeddings Properties of a low2 Degree.

[BibT_eX]

[DOI]

Yue Yang

Math. Log. Q., 2002

Degree spectra and computable dimensions in algebraic structures.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2002

2001

The prospects for mathematical logic in the twenty-first century.

[BibT_eX]

[DOI]

Bull. Symb. Log., 2001

Every incomplete computably enumerable truth-table degree is branching.

[BibT_eX]

[DOI]

Peter A. Fejer

Arch. Math. Log., 2001

2000

Undecidability and 1-types in intervals of the computably enumerable degrees.

[BibT_eX]

[DOI]

Klaus Ambos-Spies

Denis R. Hirschfeldt

Ann. Pure Appl. Log., 2000

1999

Computably Categorical Structures and Expansions by Constants.

[BibT_eX]

[DOI]

J. Symb. Log., 1999

Erratum to "Computable Isomorphisms, Degree Spectra of Relations, and Scott Families".

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1999

The Recursively Enumerable Degrees.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Computability Theory, 1999

1998

Computable Isomorphisms, Degree Spectra of Relations, and Scott Families.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1998

Splitting Theorems and the Jump Operator.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1998

1997

Computable Models of Theories with Few Models.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 1997

Alonzo Church.

[BibT_eX]

[DOI]

Bull. Symb. Log., 1997

Logic Colloquium '95, Haifa, Israel, 9-17 August 1995 - Preface.

[BibT_eX]

Ann. Pure Appl. Log., 1997

Conjectures and questions from Gerald Sacks's Degrees of Unsolvability.

[BibT_eX]

[DOI]

Arch. Math. Log., 1997

Logic for Applications, Second Edition.

[BibT_eX]

[DOI]

Anil Nerode

Graduate Texts in Computer Science, Springer, ISBN: 978-1-4612-0649-1, 1997

1996

Definability in the recursively enumerable degrees.

[BibT_eX]

[DOI]

Bull. Symb. Log., 1996

Interpolating d-r.e. and REA Degrees between r.e. Degrees.

[BibT_eX]

[DOI]

Marat M. Arslanov

Steffen Lempp

Ann. Pure Appl. Log., 1996

Categoricity and Scott Families.

[BibT_eX]

Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996

1995

Degree Theoretic Definitions of the low2 Recursively Enumerable Sets.

[BibT_eX]

[DOI]

J. Symb. Log., 1995

The Bulletin of Symbolic Logic.

[BibT_eX]

[DOI]

Bull. Symb. Log., 1995

Interpreting True Arithmetic in the Theory of the r.e. Truth Table Degrees.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1995

Intervals Without Critical Triples.

[BibT_eX]

[DOI]

Peter Cholak

Rod Downey

Proceedings of the Annual European Summer Meeting of the Association of Symbolic Logic, 1995

1993

Highness and Bounding Minimal Pairs.

[BibT_eX]

[DOI]

Steffen Lempp

Math. Log. Q., 1993

Working below a Highly Recursively Enumerable Degree.

[BibT_eX]

[DOI]

J. Symb. Log., 1993

Countable Thin Pi01 Classes.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1993

Undecidability and 1-Types in the Recursively Enumerable Degrees.

[BibT_eX]

[DOI]

Klaus Ambos-Spies

Ann. Pure Appl. Log., 1993

Logic for Applications.

[BibT_eX]

[DOI]

Anil Nerode

Texts and Monographs in Computer Science, Springer, ISBN: 978-1-4684-0211-7, 1993

1992

The p-T Degrees of the Recursive Sets: Lattice Embeddings, Extensions of Embeddings and the Two-Quantifier Theory.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

The Theory of the Recursively Enumerable Weak Truth-Table Degrees Is Undecidability.

[BibT_eX]

[DOI]

Klaus Ambos-Spies

J. Symb. Log., 1992

On the strength of König's duality theorem for infinite bipartite graphs.

[BibT_eX]

[DOI]

Ron Aharoni

Menachem Magidor

J. Comb. Theory B, 1992

Then-rea enumeration degrees are dense.

[BibT_eX]

[DOI]

Alistair H. Lachlan

Arch. Math. Log., 1992

1990

Undecidability and Initial Segments of the R.E. tt-Degrees.

[BibT_eX]

[DOI]

Christine Ann Haught

J. Symb. Log., 1990

Working below a low2 recursively enumerably degree.

[BibT_eX]

[DOI]

Arch. Math. Log., 1990

1989

The P-T-Degrees of the Recursive Sets: Lattice Embeddings, Extension of Embeddings and the Two Quantifier Theory.

[BibT_eX]

[DOI]

Proceedings of the Proceedings: Fourth Annual Structure in Complexity Theory Conference, 1989

1988

Infima of recursively enumerable truth table degrees.

[BibT_eX]

[DOI]

Peter A. Fejer

Notre Dame J. Formal Log., 1988

A non-inversion theorem for the jump operator.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1988

1984

Pseudo-Jump Operators. II: Transfinite Iterations, Hierarchies and Minimal Covers.

[BibT_eX]

[DOI]

Carl G. Jockusch Jr.

J. Symb. Log., 1984

The arithmetic and Turing degrees are not elementarily equivalent.

[BibT_eX]

[DOI]

Arch. Math. Log., 1984

1982

On Homogeneity and Definability in the First-Order Theory of the Turing Degrees.

[BibT_eX]

[DOI]

J. Symb. Log., 1982

1978

Some More Minimal Pairs of α-Recursively Enumerable Degrees.

[BibT_eX]

[DOI]

Math. Log. Q., 1978

Nowhere Simple Sets and the Lattice of Recursively Enumerable Sets.

[BibT_eX]

[DOI]

J. Symb. Log., 1978

Controlling the Dependence Degree of a Recursive Enumerable Vector Space.

[BibT_eX]

[DOI]

J. Symb. Log., 1978

1976

Types of Simple alpha-Recursively Enumerable Sets.

[BibT_eX]

[DOI]

Anne Leggett

J. Symb. Log., 1976

1974

sigman Sets which are trianglen-Incomparable (Uniformly).

[BibT_eX]

[DOI]

J. Symb. Log., 1974

1972

Weak Compactness and Square Bracket Partition Relations.

[BibT_eX]

[DOI]

E. M. Kleinberg

J. Symb. Log., 1972

1971

On Large Cardinals and Partition Relations.

[BibT_eX]

[DOI]

E. M. Kleinberg