AAAAAA
Results: 1-25/371
Authors:
DOWNEY R
LAFORTE G
NIES A
Citation: R. Downey et al., COMPUTABLY ENUMERABLE SETS AND QUASI-REDUCIBILITY, Annals of pure and applied Logic, 95(1-3), 1998, pp. 1-35
Authors:
SCHAEFFER B
Citation: B. Schaeffer, DYNAMIC NOTIONS OF GENERICITY AND ARRAY NONCOMPUTABILITY, Annals of pure and applied Logic, 95(1-3), 1998, pp. 37-69
Authors:
CHATZIDAKIS Z
PILLAY A
Citation: Z. Chatzidakis et A. Pillay, GENERIC STRUCTURES AND SIMPLE THEORIES, Annals of pure and applied Logic, 95(1-3), 1998, pp. 71-92
Authors:
ARAI T
Citation: T. Arai, SOME RESULTS ON CUT-ELIMINATION, PROVABLE WELL-ORDERINGS, INDUCTION AND REFLECTION, Annals of pure and applied Logic, 95(1-3), 1998, pp. 93-184
Authors:
MAXWELL S
Citation: S. Maxwell, A GENERAL-MODEL COMPLETENESS RESULT FOR EXPANSIONS OF THE REAL ORDERED FIELD, Annals of pure and applied Logic, 95(1-3), 1998, pp. 185-227
Authors:
LOMBARD M
VESLEY R
Citation: M. Lombard et R. Vesley, A COMMON AXIOM SET FOR CLASSICAL AND INTUITIONISTIC PLANE GEOMETRY, Annals of pure and applied Logic, 95(1-3), 1998, pp. 229-255
Authors:
KOHLENBACH U
Citation: U. Kohlenbach, ON THE ARITHMETICAL CONTENT OF RESTRICTED FORMS OF COMPREHENSION, CHOICE AND GENERAL UNIFORM BOUNDEDNESS, Annals of pure and applied Logic, 95(1-3), 1998, pp. 257-285
Authors:
AMBOSSPIES K
SLAMAN TA
SOARE RI
Citation: K. Ambosspies et al., CONFERENCE ON COMPUTABILITY THEORY - 27 JANUARY 3 FEBRUARY 1996 - OBERWOLFACH, GERMANY - PREFACE, Annals of pure and applied Logic, 94(1-3), 1998, pp. 1-1
Authors:
BECKMANN A
POHLERS W
Citation: A. Beckmann et W. Pohlers, APPLICATIONS OF CUT-FREE INFINITARY DERIVATIONS TO GENERALIZED RECURSION-THEORY, Annals of pure and applied Logic, 94(1-3), 1998, pp. 7-19
Authors:
CENZER D
REMMEL JB
Citation: D. Cenzer et Jb. Remmel, FEASIBLE GRAPHS WITH STANDARD UNIVERSE, Annals of pure and applied Logic, 94(1-3), 1998, pp. 21-35
Authors:
CHOLAK P
Citation: P. Cholak, THE DENSE SIMPLE SETS ARE ORBIT COMPLETE WITH RESPECT TO THE SIMPLE SETS, Annals of pure and applied Logic, 94(1-3), 1998, pp. 37-44
Authors:
DOWNEY RG
SHORE RA
Citation: Rg. Downey et Ra. Shore, SPLITTING THEOREMS AND THE JUMP OPERATOR, Annals of pure and applied Logic, 94(1-3), 1998, pp. 45-52
Authors:
FEJER PA
Citation: Pa. Fejer, LATTICE REPRESENTATIONS FOR COMPUTABILITY THEORY, Annals of pure and applied Logic, 94(1-3), 1998, pp. 53-74
Authors:
GONCHAROV SS
Citation: Ss. Goncharov, DECIDABLE BOOLEAN-ALGEBRAS OF LOW-LEVEL, Annals of pure and applied Logic, 94(1-3), 1998, pp. 75-95
Authors:
HARRINGTON L
SOARE RI
Citation: L. Harrington et Ri. Soare, DEFINABLE PROPERTIES OF THE COMPUTABLY ENUMERABLE SETS, Annals of pure and applied Logic, 94(1-3), 1998, pp. 97-125
Authors:
KNIGHT JF
Citation: Jf. Knight, CODING A FAMILY OF SETS, Annals of pure and applied Logic, 94(1-3), 1998, pp. 127-142
Authors:
LERMAN M
Citation: M. Lerman, A NECESSARY AND SUFFICIENT CONDITION FOR EMBEDDING RANKED FINITE PARTIAL LATTICES INTO THE COMPUTABLY ENUMERABLE DEGREES, Annals of pure and applied Logic, 94(1-3), 1998, pp. 143-180
Authors:
RATHJEN M
GRIFFOR ER
PALMGREN E
Citation: M. Rathjen et al., INACCESSIBILITY IN CONSTRUCTIVE SET-THEORY AND TYPE THEORY, Annals of pure and applied Logic, 94(1-3), 1998, pp. 181-200
Authors:
SCHWICHTENBERG H
Citation: H. Schwichtenberg, FINITE NOTATIONS FOR INFINITE TERMS, Annals of pure and applied Logic, 94(1-3), 1998, pp. 201-222
Authors:
SHLAPENTOKH A
Citation: A. Shlapentokh, WEAK PRESENTATIONS OF NON-FINITELY GENERATED FIELDS, Annals of pure and applied Logic, 94(1-3), 1998, pp. 223-252
Authors:
SLAMAN TA
WOODIN WH
Citation: Ta. Slaman et Wh. Woodin, EXTENDING PARTIAL ORDERS TO DENSE LINEAR ORDERS, Annals of pure and applied Logic, 94(1-3), 1998, pp. 253-261
Authors:
SORBI A
Citation: A. Sorbi, SETS OF GENERATORS AND AUTOMORPHISM BASES FOR THE ENUMERATION DEGREES, Annals of pure and applied Logic, 94(1-3), 1998, pp. 263-272
Authors:
STEPHAN F
Citation: F. Stephan, LEARNING VIA QUERIES AND ORACLES, Annals of pure and applied Logic, 94(1-3), 1998, pp. 273-296
Authors:
CENZER D
REMMEL JB
Citation: D. Cenzer et Jb. Remmel, COMPUTABILITY THEORY - PREFACE, Annals of pure and applied Logic, 93(1-3), 1998, pp. 1-2
Authors:
CENZER D
REMMEL J
Citation: D. Cenzer et J. Remmel, INDEX SETS FOR PI(0)(1) CLASSES, Annals of pure and applied Logic, 93(1-3), 1998, pp. 3-61