Julia F. Knight

,

Grant Goodman

,

,

,

,

,

,

J. Symb. Log., 2022

Copying One of a Pair of Structures.

[BibT_eX]

[DOI]

Rachael Alvir

,

Hannah Burchfield

,

J. Symb. Log., 2022

Coding in graphs and linear Orderings.

[BibT_eX]

[DOI]

,

Alexandra A. Soskova

,

Stefan V. Vatev

J. Symb. Log., 2020

Preface of the special issue for the Oberwolfach Workshop on Computability Theory 2018.

[BibT_eX]

[DOI]

,

,

,

Comput., 2019

Strong jump inversion.

[BibT_eX]

[DOI]

,

Andrey N. Frolov

,

,

,

,

,

J. Log. Comput., 2018

Uniform Procedures in uncountable Structures.

[BibT_eX]

[DOI]

Noam Greenberg

,

Alexander G. Melnikov

,

,

Daniel Turetsky

J. Symb. Log., 2018

Scott sentences for certain groups.

[BibT_eX]

[DOI]

,

Vikram Saraph

Arch. Math. Log., 2018

Hanf number for Scott sentences of computable structures.

[BibT_eX]

[DOI]

Sergey Goncharov

,

,

Ioannis A. Souldatos

Arch. Math. Log., 2018

Computing strength of Structures Related to the field of Real numbers.

[BibT_eX]

[DOI]

Gregory Igusa

,

,

Noah David Schweber

J. Symb. Log., 2017

Computable Structures in Generic Extensions.

[BibT_eX]

[DOI]

,

Antonio Montalbán

,

Noah David Schweber

J. Symb. Log., 2016

Comparing two Versions of the Reals.

[BibT_eX]

[DOI]

Gregory Igusa

,

J. Symb. Log., 2016

Representing Scott sets in algebraic settings.

[BibT_eX]

[DOI]

,

,

,

Arch. Math. Log., 2015

Erratum to: Limit computable integer parts.

[BibT_eX]

[DOI]

,

,

Karen M. Lange

Arch. Math. Log., 2015

Index sets and Scott sentences.

[BibT_eX]

[DOI]

,

Charles F. D. McCoy

Arch. Math. Log., 2014

Classes of structures with universe a subset of ω1.

[BibT_eX]

[DOI]

,

,

,

J. Log. Comput., 2013

Spectra of atomic theories.

[BibT_eX]

[DOI]

Uri Andrews

,

J. Symb. Log., 2013

The Arithmetical Hierarchy in the Setting of ω1.

[BibT_eX]

[DOI]

,

,

,

,

,

Comput., 2013

An example related to Gregory's Theorem.

[BibT_eX]

[DOI]

,

,

,

Arch. Math. Log., 2013

Isomorphism relations on computable structures.

[BibT_eX]

[DOI]

Ekaterina B. Fokina

,

Sy-David Friedman

,

,

,

Charles F. D. McCoy

,

Antonio Montalbán

J. Symb. Log., 2012

Corrigendum to: "Real closed fields and models of arithmetic".

[BibT_eX]

[DOI]

,

,

Sergei Starchenko

J. Symb. Log., 2012

Classes of Ulm type and coding rank-homogeneous trees in other structures.

[BibT_eX]

[DOI]

Ekaterina B. Fokina

,

,

Alexander G. Melnikov

,

Sara Quinn

,

C. Safranski

J. Symb. Log., 2011

Limit computable integer parts.

[BibT_eX]

[DOI]

,

,

Karen M. Lange

Arch. Math. Log., 2011

Decidability and Computability of Certain Torsion-Free Abelian Groups.

[BibT_eX]

[DOI]

,

,

,

,

,

Alexander G. Melnikov

,

Daniel Turetsky

Notre Dame J. Formal Log., 2010

Real closed fields and models of Peano arithmetic.

[BibT_eX]

[DOI]

,

,

Sergei Starchenko

J. Symb. Log., 2010

Computable Structures of Rank.

[BibT_eX]

[DOI]

,

Jessica Millar

J. Math. Log., 2010

Intrinsic bounds on complexity and definability at limit levels.

[BibT_eX]

[DOI]

John Chisholm

,

Ekaterina B. Fokina

,

,

,

,

Sara Quinn

J. Symb. Log., 2009

Chains and antichains in partial orderings.

[BibT_eX]

[DOI]

,

Carl G. Jockusch Jr.

,

Arch. Math. Log., 2009

Categoricity of computable infinitary theories.

[BibT_eX]

[DOI]

,

,

,

Arch. Math. Log., 2009

Turing computable embeddings.

[BibT_eX]

[DOI]

,

Sara Miller

,

Michael Vanden Boom

J. Symb. Log., 2007

Computable embeddings and strongly minimal theories.

[BibT_eX]

[DOI]

John Chisholm

,

,

Sara Miller

J. Symb. Log., 2007

Index sets for classes of high rank structures.

[BibT_eX]

[DOI]

,

,

,

,

,

,

J. Symb. Log., 2007

Computable trees of Scott rank ω1CK, and computable approximation.

[BibT_eX]

[DOI]

,

,

Jessica Millar

J. Symb. Log., 2006

Classification from a Computable Viewpoint.

[BibT_eX]

[DOI]

,

Bull. Symb. Log., 2006

Enumerations in computable structure theory.

[BibT_eX]

[DOI]

,

,

,

,

,

Ann. Pure Appl. Log., 2005

Pi11 relations and paths through.

[BibT_eX]

[DOI]

,

,

,

Richard A. Shore

J. Symb. Log., 2004

Bounding prime models.

[BibT_eX]

[DOI]

,

,

,

J. Symb. Log., 2004

Barwise: infinitary logic and admissible sets.

[BibT_eX]

[DOI]

H. Jerome Keisler

,

Bull. Symb. Log., 2004

Simple and immune relations on countable structures.

[BibT_eX]

[DOI]

,

,

,

Charles F. D. McCoy

Arch. Math. Log., 2003

Sequences of n-Diagrams.

[BibT_eX]

[DOI]

,

,

Andrei S. Morozov

J. Symb. Log., 2002

Minimality and Completions of PA.

[BibT_eX]

[DOI]

J. Symb. Log., 2001

Computable Boolean Algebras.

[BibT_eX]

[DOI]

,

Michael Stob

J. Symb. Log., 2000

Coding a Family of Sets.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1998

Quasi-Simple Relations in Copies of a Given Recursive Structure.

[BibT_eX]

[DOI]

,

,

Jeffrey B. Remmel

Ann. Pure Appl. Log., 1997

Possible Degrees in Recursive Copies II.

[BibT_eX]

[DOI]

,

Ann. Pure Appl. Log., 1997

Permitting, Forcing, and Copying of a Given Recursive Relation.

[BibT_eX]

[DOI]

,

Peter Cholak

,

Ann. Pure Appl. Log., 1997

Recursive Structures and Ershov's Hierarchy.

[BibT_eX]

[DOI]

,

Math. Log. Q., 1996

Requirement Systems.

[BibT_eX]

[DOI]

J. Symb. Log., 1995

Possible Degrees in Recursive Copies.

[BibT_eX]

[DOI]

,

Ann. Pure Appl. Log., 1995

A Completeness Theorem for Certain Classes of Recursive Infinitary Formulas.

[BibT_eX]

[DOI]

,

Math. Log. Q., 1994

Nonarithmetical aleph0-Categorical Theories with Recursive Models.

[BibT_eX]

[DOI]

J. Symb. Log., 1994

Mixed Systems.

[BibT_eX]

[DOI]

,

J. Symb. Log., 1994

Ramified Systems.

[BibT_eX]

[DOI]

,

Ann. Pure Appl. Log., 1994

A Metatheorem for Constructions by Finitely Many Workers.

[BibT_eX]

[DOI]

J. Symb. Log., 1990

Constructions by Transfinitely Many Workers.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1990

Pairs of Recursive Structures.

[BibT_eX]

[DOI]

,

Ann. Pure Appl. Log., 1990

Generic Copies of Countable Structures.

[BibT_eX]

[DOI]

,

,

,

Ann. Pure Appl. Log., 1989

Meeting of the Association for Symbolic Logic: San Antonio, 1987.

[BibT_eX]

[DOI]

J. Symb. Log., 1988

Degrees Coded in Jumps of Orderings.

[BibT_eX]

[DOI]

J. Symb. Log., 1986

Saturation of Homogeneous Resplendent Models.

[BibT_eX]

[DOI]

J. Symb. Log., 1986

Meeting of the Association for Symbolic Logic: Notre Dame, Indiana, 1984.

[BibT_eX]

[DOI]

John T. Baldwin

,

Matt Kaufmann

,

J. Symb. Log., 1985

Two Theorems on Degrees of Models of True Arithmetic.

[BibT_eX]

[DOI]

,

Alistair H. Lachlan

,

Robert I. Soare

J. Symb. Log., 1984

A Complete Theory with Arbitrarily Large Minimality Ranks.

[BibT_eX]

[DOI]

Robert E. Woodrow

,

J. Symb. Log., 1983

Degrees of Types and Independent Sequences.

[BibT_eX]

[DOI]

J. Symb. Log., 1983

Additive Structure in Uncountable Models for a Fixed Completion of P.

[BibT_eX]

[DOI]

J. Symb. Log., 1983

Models of Arithmetic and Closed Ideals.

[BibT_eX]

[DOI]

,

Mark E. Nadel

J. Symb. Log., 1982

Expansions of Models and Turing Degrees.

[BibT_eX]

[DOI]

,

Mark E. Nadel

J. Symb. Log., 1982

Algebraic Independence.

[BibT_eX]

[DOI]

J. Symb. Log., 1981

Prime and Atomic Models.

[BibT_eX]

[DOI]

J. Symb. Log., 1978

An Inelastic Model with Indiscernibles.

[BibT_eX]

[DOI]

J. Symb. Log., 1978

Skolem Functions and Elementary Embeddings.

[BibT_eX]

[DOI]

J. Symb. Log., 1977

A Complete L omega 1omega -Sentence Characterizing N1.

[BibT_eX]

[DOI]

J. Symb. Log., 1977

Hanf Numbers for Omitting Types Over Particular Theories.

[BibT_eX]

[DOI]

J. Symb. Log., 1976

Omitting Types in Set Theory and Arithmetic.

[BibT_eX]

[DOI]

J. Symb. Log., 1976

Types Omitted in Uncountable Models of Arithmetic.

[BibT_eX]

[DOI]

J. Symb. Log., 1975

Generic Expansions of Structures.

[BibT_eX]

[DOI]

J. Symb. Log., 1973

Complete Types and the Natural Numbers.

[BibT_eX]

[DOI]