The Journal of Symbolic Logic publishes original scholarly work in symbolic logic. Founded in 1936, it has become the leading research journal in the field. The Journal aims to represent logic broadly, including its connections with mathematics and philosophy as well as newer aspects related to computer science and linguistics.
Volume 67, Issue 2
Publication Date: June 2002
Congruence relations on lattices of recursively enumerable sets
Todd Hammond; 497-504
Monoid based semantics for linear formulas
W. P. R. Mitchell and H. Simmons; 505-527
Splitting properties of {$n$}-c.e. enumeration degrees
I. Sh. Kalimullin; 537-546
On the Ramseyan properties of some special subsets of {$2\sp ømega$} and their algebraic sums
Andrzej Nowik and Tomasz Weiss; 547-556
Groundwork for weak analysis
António M. Fernandes and Fernando Ferreira; 557-578
Coding with ladders a well ordering of the reals
Uri Abraham and Saharon Shelah; 579-597
An isomorphism between monoids of external embeddings: about definability in arithmetic
Mihai Prunescu; 598-620
Multiplication complexe et équivalence élémentaire dans le langage des corps
Xavier Vidaux; 635-648
Degree spectra of relations on computable structures in the presence of {$\Delta\sb 2\sp 0$} isomorphisms
Denis R. Hirschfeldt; 697-720
Deconstructing inner model theory
Ralf-Dieter Schindler, John Steel and Martin Zeman; 721-736
Compact complex manifolds with the DOP and other properties
Anand Pillay and Thomas Scanlon; 737-743
Local supersimplicity and related concepts
Enrique Casanovas and Frank O. Wagner; 744-758
On Diophantine definability and decidability in some rings of algebraic functions of characteristic 0
Alexandra Shlapentokh; 759-786
Indestructibility and the level-by-level agreement between strong compactness and supercompactness
Arthur W. Apter and Joel David Hamkins; 820-840
Modules with few types over some finite-dimensional algebras
Mike Prest and Vera Puninskaya; 841-858
More undecidable lattices of Steinitz exchange systems
L. R. Galminas and John W. Rosenthal; 859-878
The relation of recursive isomorphism for countable structures
Riccardo Camerlo; 879-895