- (2 other versions)Computable Structures and the Hyperarithmetical Hierarchy.Valentina Harizanov - 2001 - Bulletin of Symbolic Logic 7 (3):383-385.details
|
|
(1 other version)Logic with Denumerably Long Formulas and Finite Strings of Quantifiers.Dana Scott, J. W. Addison, Leon Henkin & Alfred Tarski - 1971 - Journal of Symbolic Logic 36 (1):157-158.details
|
|
Π₁¹ 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
|
|
Index sets and Scott sentences.J. F. Knight & C. McCoy - 2014 - Archive for Mathematical Logic 53 (5-6):519-524.details
|
|
(1 other version)Logic with denumerably long formulas and finite strings of quantifiers.Dana Scott - 1965 - Journal of Symbolic Logic 36 (1):1104--329.details
|
|
On the complexity of categoricity in computable structures.Walker M. White - 2003 - Mathematical Logic Quarterly 49 (6):603.details
|
|
The isomorphism problem for classes of computable fields.Wesley Calvert - 2004 - Archive for Mathematical Logic 43 (3):327-336.details
|
|
[Omnibus Review].H. Jerome Keisler - 1970 - Journal of Symbolic Logic 35 (2):342-344.details
|
|
The Isomorphism Problem for Computable Abelian p-Groups of Bounded Length.Wesley Calvert - 2005 - Journal of Symbolic Logic 70 (1):331 - 345.details
|
|
Π 1 1 relations and paths through.Sergey Goncharov, Valentina Harizanov, Julia Knight & Richard Shore - 2004 - Journal of Symbolic Logic 69 (2):585-611.details
|
|
Boolean Algebras, Tarski Invariants, and Index Sets.Barbara F. Csima, Antonio Montalbán & Richard A. Shore - 2006 - Notre Dame Journal of Formal Logic 47 (1):1-23.details
|
|
Model theory for infinitary logic.H. Jerome Keisler - 1971 - Amsterdam,: North-Holland Pub. Co..details
|
|
Computable structures and the hyperarithmetical hierarchy.C. J. Ash - 2000 - New York: Elsevier. Edited by J. Knight.details
|
|
Elementary Properties of Abelian Groups.W. Szmielew - 1959 - Journal of Symbolic Logic 24 (1):59-59.details
|
|