- A Bounded Jump for the Bounded Turing Degrees.Bernard Anderson & Barbara Csima - 2014 - Notre Dame Journal of Formal Logic 55 (2):245-264.details
|
|
(1 other version)Π 1 1 relations and paths through.Sergey S. Goncharov, Valentina S. Harizanov, Julia F. Knight & Richard A. Shore - 2004 - Journal of Symbolic Logic 69 (2):585-611.details
|
|
Computable categoricity of trees of finite height.Steffen Lempp, Charles McCoy, Russell Miller & Reed Solomon - 2005 - Journal of Symbolic Logic 70 (1):151-215.details
|
|
(1 other version)Bounding Prime Models.Barbara F. Csima, Denis R. Hirschfeldt, Julia F. Knight & Robert I. Soare - 2004 - Journal of Symbolic Logic 69 (4):1117 - 1142.details
|
|
Classification from a computable viewpoint.Wesley Calvert & Julia F. Knight - 2006 - Bulletin of Symbolic Logic 12 (2):191-218.details
|
|
The metamathematics of ergodic theory.Jeremy Avigad - 2009 - Annals of Pure and Applied Logic 157 (2-3):64-76.details
|
|
Barwise: Infinitary logic and admissible sets.H. Jerome Keisler & Julia F. Knight - 2004 - Bulletin of Symbolic Logic 10 (1):4-36.details
|
|
Degrees of Categoricity and the Hyperarithmetic Hierarchy.Barbara F. Csima, Johanna N. Y. Franklin & Richard A. Shore - 2013 - Notre Dame Journal of Formal Logic 54 (2):215-231.details
|
|
Classes of Ulm type and coding rank-homogeneous trees in other structures.E. Fokina, J. F. Knight, A. Melnikov, S. M. Quinn & C. Safranski - 2011 - Journal of Symbolic Logic 76 (3):846 - 869.details
|
|
Relative to any non-hyperarithmetic set.Noam Greenberg, Antonio Montalbán & Theodore A. Slaman - 2013 - Journal of Mathematical Logic 13 (1):1250007.details
|
|
Isomorphism relations on computable structures.Ekaterina B. Fokina, Sy-David Friedman, Valentina Harizanov, Julia F. Knight, Charles Mccoy & Antonio Montalbán - 2012 - Journal of Symbolic Logic 77 (1):122-132.details
|
|
Mass problems and measure-theoretic regularity.Stephen G. Simpson - 2009 - Bulletin of Symbolic Logic 15 (4):385-409.details
|
|
(1 other version)The Isomorphism Problem for Computable Abelian p-Groups of Bounded Length.Wesley Calvert - 2005 - Journal of Symbolic Logic 70 (1):331 - 345.details
|
|
(1 other version)Minimality and completions of PA.Julia F. Knight - 2001 - Journal of Symbolic Logic 66 (3):1447-1457.details
|
|
Computability-theoretic complexity of countable structures.Valentina S. Harizanov - 2002 - Bulletin of Symbolic Logic 8 (4):457-477.details
|
|
Indecomposable linear orderings and hyperarithmetic analysis.Antonio Montalbán - 2006 - Journal of Mathematical Logic 6 (1):89-120.details
|
|
Structure and Categoricity: Determinacy of Reference and Truth Value in the Philosophy of Mathematics.Tim Button & Sean Walsh - 2016 - Philosophia Mathematica 24 (3):283-307.details
|
|
Cone avoidance and randomness preservation.Stephen G. Simpson & Frank Stephan - 2015 - Annals of Pure and Applied Logic 166 (6):713-728.details
|
|
Computability of fraïssé limits.Barbara F. Csima, Valentina S. Harizanov, Russell Miller & Antonio Montalbán - 2011 - Journal of Symbolic Logic 76 (1):66 - 93.details
|
|
(1 other version)Sequences of n-diagrams.Valentina S. Harizanov, Julia F. Knight & Andrei S. Morozov - 2002 - Journal of Symbolic Logic 67 (3):1227-1247.details
|
|
A computable functor from graphs to fields.Russell Miller, Bjorn Poonen, Hans Schoutens & Alexandra Shlapentokh - 2018 - Journal of Symbolic Logic 83 (1):326-348.details
|
|
Scott sentences for equivalence structures.Sara B. Quinn - 2020 - Archive for Mathematical Logic 59 (3-4):453-460.details
|
|
Detecting properties from descriptions of groups.Iva Bilanovic, Jennifer Chubb & Sam Roven - 2020 - Archive for Mathematical Logic 59 (3-4):293-312.details
|
|
Scott sentences for certain groups.Julia F. Knight & Vikram Saraph - 2018 - Archive for Mathematical Logic 57 (3-4):453-472.details
|
|
Comparing two versions of the reals.G. Igusa & J. F. Knight - 2016 - Journal of Symbolic Logic 81 (3):1115-1123.details
|
|
Embedding jump upper semilattices into the Turing degrees.Antonio Montalbán - 2003 - Journal of Symbolic Logic 68 (3):989-1014.details
|
|
Index sets and Scott sentences.J. F. Knight & C. McCoy - 2014 - Archive for Mathematical Logic 53 (5-6):519-524.details
|
|
On the decidability of the theories of the arithmetic and hyperarithmetic degrees as uppersemilattices.James S. Barnes - 2017 - Journal of Symbolic Logic 82 (4):1496-1518.details
|
|
Hanf number for Scott sentences of computable structures.S. S. Goncharov, J. F. Knight & I. Souldatos - 2018 - Archive for Mathematical Logic 57 (7-8):889-907.details
|
|
Computably Isometric Spaces.Alexander G. Melnikov - 2013 - Journal of Symbolic Logic 78 (4):1055-1085.details
|
|
Abelian p-groups and the Halting problem.Rodney Downey, Alexander G. Melnikov & Keng Meng Ng - 2016 - Annals of Pure and Applied Logic 167 (11):1123-1138.details
|
|
Measuring complexities of classes of structures.Barbara F. Csima & Carolyn Knoll - 2015 - Annals of Pure and Applied Logic 166 (12):1365-1381.details
|
|
Degrees of categoricity of trees and the isomorphism problem.Mohammad Assem Mahmoud - 2019 - Mathematical Logic Quarterly 65 (3):293-304.details
|
|
Isomorphism of Computable Structures and Vaught's Conjecture.Howard Becker - 2013 - Journal of Symbolic Logic 78 (4):1328-1344.details
|
|
(1 other version)Up to Equimorphism, Hyperarithmetic Is Recursive.Antonio Montalbán - 2005 - Journal of Symbolic Logic 70 (2):360 - 378.details
|
|
The omega-rule interpretation of transfinite provability logic.David Fernández-Duque & Joost J. Joosten - 2018 - Annals of Pure and Applied Logic 169 (4):333-371.details
|
|
Models and Computability.W. Dean - 2014 - Philosophia Mathematica 22 (2):143-166.details
|
|
Computable trees of Scott rank ω 1CK, and computable approximation.Wesley Calvert, Julia F. Knight & Jessica Millar - 2006 - Journal of Symbolic Logic 71 (1):283-298.details
|
|
Spectra of Atomic Theories.Uri Andrews & Julia F. Knight - 2009 - Journal of Symbolic Logic 78 (4):1189-1198.details
|
|