AAAAAA
Results: 51-75/787
Authors:
Stephan, F
Citation: F. Stephan, On the structures inside truth-table degrees, J SYMB LOG, 66(2), 2001, pp. 731-770
Authors:
Kuhlmann, FV
Citation: Fv. Kuhlmann, Elementary properties of power series fields over finite fields, J SYMB LOG, 66(2), 2001, pp. 771-791
Authors:
Blaszczyk, A
Shelah, S
Citation: A. Blaszczyk et S. Shelah, Regular subalgebras of complete Boolean algebras., J SYMB LOG, 66(2), 2001, pp. 792-800
Authors:
Neeman, I
Zapletal, J
Citation: I. Neeman et J. Zapletal, Proper forcing and L(R)., J SYMB LOG, 66(2), 2001, pp. 801-810
Authors:
Baumgartner, JE
Hajnal, A
Citation: Je. Baumgartner et A. Hajnal, Polarized partition relations., J SYMB LOG, 66(2), 2001, pp. 811-821
Authors:
Kim, B
Citation: B. Kim, Simplicity and stability in there, J SYMB LOG, 66(2), 2001, pp. 822-836
Authors:
Djordjevic, M
Citation: M. Djordjevic, Finite variable logic. Stability and finite models, J SYMB LOG, 66(2), 2001, pp. 837-858
Authors:
Newelski, L
Citation: L. Newelski, Small profinite groups, J SYMB LOG, 66(2), 2001, pp. 859-872
Authors:
Hummel, TJ
Jockusch, CG
Citation: Tj. Hummel et Cg. Jockusch, Ramsey's theorem for computably enumerable colorings, J SYMB LOG, 66(2), 2001, pp. 873-880
Authors:
Cholak, P
Groszek, M
Slaman, T
Citation: P. Cholak et al., An almost deep degree, J SYMB LOG, 66(2), 2001, pp. 881-901
Authors:
Gao, S
Citation: S. Gao, Some dichotomy theorems for isomorphism relations of countable models, J SYMB LOG, 66(2), 2001, pp. 902-922
Authors:
Herrmann, E
Citation: E. Herrmann, Infinite chains and antichains in computable partial orderings, J SYMB LOG, 66(2), 2001, pp. 923-934
Authors:
Jager, G
Strahm, T
Citation: G. Jager et T. Strahm, Upper bounds for metapredicative Mahlo in explicit mathematics and admissible set theory, J SYMB LOG, 66(2), 2001, pp. 935-958
Authors:
Jin, RL
Citation: Rl. Jin, Existence of some sparse sets of nonstandard natural numbers, J SYMB LOG, 66(2), 2001, pp. 959-973
Authors:
Cholak, PA
Jockusch, CG
Slaman, TA
Citation: Pa. Cholak et al., On the strength of Ramsey's theorem for pairs, J SYMB LOG, 66(1), 2001, pp. 1-55
Authors:
Duparc, J
Citation: J. Duparc, Wadge hierarchy and Veblen hierarchy part I: Borel sets of finite rank, J SYMB LOG, 66(1), 2001, pp. 56-86
Authors:
Holmes, MR
Citation: Mr. Holmes, Strong axioms of infinity in NFU, J SYMB LOG, 66(1), 2001, pp. 87-116
Authors:
Ikeda, K
Citation: K. Ikeda, Minimal but not strongly minimal structures with arbitrary finite dimensions, J SYMB LOG, 66(1), 2001, pp. 117-126
Authors:
Lascar, D
Pillay, A
Citation: D. Lascar et A. Pillay, Hyperimaginaries and automorphism groups, J SYMB LOG, 66(1), 2001, pp. 127-143
Authors:
Seabold, DE
Citation: De. Seabold, Chang's conjecture and the non-stationary ideal, J SYMB LOG, 66(1), 2001, pp. 144-170
Authors:
Alekhnovich, M
Buss, S
Moran, S
Pitassi, T
Citation: M. Alekhnovich et al., Minimum propositional proof length is NP-hard to linearly approximate, J SYMB LOG, 66(1), 2001, pp. 171-191
Authors:
Solomon, R
Citation: R. Solomon, Pi-CA(0) and order types of countable ordered groups, J SYMB LOG, 66(1), 2001, pp. 192-206
Authors:
Stebletsova, V
Venema, Y
Citation: V. Stebletsova et Y. Venema, Undecidable theories of Lyndon algebras, J SYMB LOG, 66(1), 2001, pp. 207-224
Authors:
Colson, L
Grigorieff, S
Citation: L. Colson et S. Grigorieff, Syntactical truth predicates for second order arithmetic, J SYMB LOG, 66(1), 2001, pp. 225-256
Authors:
Kurilic, MS
Citation: Ms. Kurilic, Cohen-stable families of subsets of integers, J SYMB LOG, 66(1), 2001, pp. 257-270