13629 results in The Journal of Symbolic Logic
Andreas Baudisch, A new uncountably categorical group, Transactions of the American Mathematical Society, vol. 348 (1996), pp. 3889–3940.
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 2 / June 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 905-906
- Print publication:
- June 1999
-
- Article
- Export citation
sets and singletons
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 2 / June 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 590-616
- Print publication:
- June 1999
-
- Article
- Export citation
The cupping theorem in R/M
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 2 / June 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 643-650
- Print publication:
- June 1999
-
- Article
- Export citation
Interpolation, preservation, and pebble games
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 2 / June 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 881-903
- Print publication:
- June 1999
-
- Article
- Export citation
A jump operator for subrecursion theories
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 2 / June 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 460-468
- Print publication:
- June 1999
-
- Article
- Export citation
Nicholas Pippenger, Theories of computability. Cambridge University Press, Cambridge, New York, and Oakleigh, Victoria, 1997, ix + 251 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 2 / June 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 913-914
- Print publication:
- June 1999
-
- Article
- Export citation
Countable filters on ω
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 2 / June 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 469-478
- Print publication:
- June 1999
-
- Article
- Export citation
Universal classes of simple relation algebras
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 2 / June 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 575-589
- Print publication:
- June 1999
-
- Article
- Export citation
Tensor product and theories of modules
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 2 / June 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 617-628
- Print publication:
- June 1999
-
- Article
- Export citation
Undecidable relativizations of algebras of relations
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 2 / June 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 747-760
- Print publication:
- June 1999
-
- Article
- Export citation
Lascar strong types in some simple theories
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 2 / June 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 817-824
- Print publication:
- June 1999
-
- Article
- Export citation
The finite model property for various fragments of intuitionistic linear logic
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 2 / June 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 790-802
- Print publication:
- June 1999
-
- Article
- Export citation
JSL Volume 64 issue 2 Cover and Front matter
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 2 / June 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. f1-f2
- Print publication:
- June 1999
-
- Article
-
- You have access
- Export citation
On the cofinality of ultrapowers
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 2 / June 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 727-736
- Print publication:
- June 1999
-
- Article
- Export citation
Ordinal inequalities, transfinite induction, and reverse mathematics
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 2 / June 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 769-774
- Print publication:
- June 1999
-
- Article
- Export citation
Frege's theorem in a constructive setting
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 2 / June 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 486-488
- Print publication:
- June 1999
-
- Article
- Export citation
Neil D. Jones, Computability and complexity, From a programming perspective, Foundations of computing, The MIT Press, Cambridge, Mass., and London, 1997, xvi + 466 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 2 / June 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 914-916
- Print publication:
- June 1999
-
- Article
- Export citation
Équations génériques dans un groupe stable nilpotent
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 2 / June 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 761-768
- Print publication:
- June 1999
-
- Article
- Export citation
Constructing strongly equivalent nonisomorphic models for unsuperstable theories, Part C
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 2 / June 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 634-642
- Print publication:
- June 1999
-
- Article
- Export citation
Ehud Hrushovski, A new strongly minimal set, Annals of pure and applied logic, vol. 62 (1993), pp. 147–166. - Ehud Hrushovski, Strongly minimal expansions of algebraically closed fields, Israel journal of mathematics, vol. 79 (1992), pp. 129–151.
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 2 / June 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 904-905
- Print publication:
- June 1999
-
- Article
- Export citation