Jerome Malitz. Introduction to mathematical logic. Set theory, computable functions, model theory. Undergraduate texts in mathematics. Springer-Verlag, New York, Heidelberg, and Berlin, 1979, xii + 198 pp.

P. Eklof

doi:10.2307/2274209

I. Lavrov and L. Maksimova. Problems in set theory, mathematical logic, and the theory of algorithms. The University Series in Mathematics, Kluwer Academic/Plenum Publishers, New York, 2003, ix + 282 pp.

Bulletin of Symbolic Logic ◽

10.1017/s1079898600004005 ◽

2004 ◽

Vol 10 (02) ◽

pp. 222-223

Author(s):

John T. Baldwin

Keyword(s):

New York ◽

Mathematical Logic ◽

Set Theory ◽

The University

Bruno Poizat. A course in model theory. An introduction to contemporary mathematical logic. English translation by Moses Klein of JSL LVIII 1074. Universitext. Springer, New York, Berlin, Heidelberg, etc., 2000, xxxi + 443 pp.

Bulletin of Symbolic Logic ◽

10.2307/2687797 ◽

2001 ◽

Vol 7 (4) ◽

pp. 521-522

Author(s):

Gregory Cherlin

Keyword(s):

New York ◽

Mathematical Logic ◽

Model Theory ◽

English Translation

Mathematical logic: a course with exercises Part II: Recursion theory, Gödel’s theorems, set theory, model theory, by René Cori and Daniel Lascar, translated by Donald H. Pelletier. Pp. 331. £62 (hb), £26 (pb). 2001. ISBN 0 19 850051 3 (hb) 0 19 850050 5 (pb) (Oxford University Press).

The Mathematical Gazette ◽

10.1017/s0025557200174832 ◽

2004 ◽

Vol 88 (511) ◽

pp. 187-188

Author(s):

S. C. Russen

Keyword(s):

Mathematical Logic ◽

Set Theory ◽

Model Theory ◽

Recursion Theory ◽

Theory Model ◽

Oxford University ◽

Oxford University Press

Jack H. Silver. Some applications of model theory in set theory. Annals of mathematical logic, vol. 3 no. 1 (1971), pp. 45–110.

Journal of Symbolic Logic ◽

10.2307/2272903 ◽

1974 ◽

Vol 39 (3) ◽

pp. 597-598

Author(s):

Agnieszka Wojciechowska

Keyword(s):

Mathematical Logic ◽

Set Theory ◽

Model Theory

R. B. Jensen. Concrete models of set theory. Sets, models and recursion theory, Proceedings of the Summer School in Mathematical Logic and Tenth Logic Colloquium, Leicester, August-September 1965, edited by John N. Crossley, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam, and Humanities Press, New York, 1967, pp. 44–74.

Journal of Symbolic Logic ◽

10.2307/2270737 ◽

1970 ◽

Vol 35 (3) ◽

pp. 472-473

Author(s):

Frank R. Drake

Keyword(s):

New York ◽

Mathematical Logic ◽

Set Theory ◽

Summer School ◽

Recursion Theory ◽

Publishing Company ◽

Foundations Of Mathematics ◽

North Holland Publishing Company ◽

North Holland Publishing ◽

Models Of Set Theory

Ebbinghaus Heinz-Dieter and Jörg Flum. Finite model theory. Perspectives in mathematical logic. Springer, Berlin, Heidelberg, New York, etc., 1995, xv + 327 pp.

Journal of Symbolic Logic ◽

10.2307/2275800 ◽

1996 ◽

Vol 61 (3) ◽

pp. 1049-1050

Author(s):

G. L. McColm

Keyword(s):

New York ◽

Mathematical Logic ◽

Model Theory ◽

Finite Model ◽

Finite Model Theory

One hundred and two problems in mathematical logic

Journal of Symbolic Logic ◽

10.2307/2271891 ◽

1975 ◽

Vol 40 (2) ◽

pp. 113-129 ◽

Cited By ~ 106

Author(s):

Harvey Friedman

Keyword(s):

Mathematical Logic ◽

Set Theory ◽

Model Theory ◽

Proof Theory ◽

Recursion Theory ◽

Logic Model ◽

Mathematical Statement ◽

Question Mark ◽

Truth Value ◽

Expository Paper

This expository paper contains a list of 102 problems which, at the time of publication, are unsolved. These problems are distributed in four subdivisions of logic: model theory, proof theory and intuitionism, recursion theory, and set theory. They are written in the form of statements which we believe to be at least as likely as their negations. These should not be viewed as conjectures since, in some cases, we had no opinion as to which way the problem would go.In each case where we believe a problem did not originate with us, we made an effort to pinpoint a source. Often this was a difficult matter, based on subjective judgments. When we were unable to pinpoint a source, we left a question mark. No inference should be drawn concerning the beliefs of the originator of a problem as to which way it will go (lest the originator be us).The choice of these problems was based on five criteria. Firstly, we are only including problems which call for the truth value of a particular mathematical statement. A second criterion is the extent to which the concepts involved in the statements are concepts that are well known, well denned, and well understood, as well as having been extensively considered in the literature. A third criterion is the extent to which these problems have natural, simple and attractive formulations. A fourth criterion is the extent to which there is evidence that a real difficulty exists in finding a solution. Lastly and unavoidably, the extent to which these problems are connected with the author's research interests in mathematical logic.

Abraham Robinson. Forcing in model theory. Symposia mathematica, vol. 5, Istituto Nazionale di Alta Matematica, Academic Press, London and New York 1971, pp. 69–82. - Jon Barwise and Abraham Robinson. Completing theories by forcing. Annals of mathematical logic, vol. 2 no. 2 (1970), pp. 119–142. - Abraham Robinson. Infinite forcing in model theory. Proceedings of the Second Scandinavian Logic Symposium, edited by J. E. Fenstad, Studies in logic and the foundations of mathematics, vol. 63, North-Holland Publishing Company, Amsterdam and London 1971, pp. 317–340. - Abraham Robinson. Forcing in model theory. Actes du Congrès International des Mathematiciens 1970, Gauthier-Villars, Paris 1971, Vol. 1, pp. 245–250.

Journal of Symbolic Logic ◽

10.2307/2271854 ◽

1975 ◽

Vol 40 (4) ◽

pp. 633-634 ◽

Cited By ~ 1

Author(s):

H. Jerome Keisler

Keyword(s):

New York ◽

Mathematical Logic ◽

Model Theory ◽

Publishing Company ◽

Foundations Of Mathematics ◽

Academic Press ◽

North Holland Publishing Company ◽

North Holland Publishing

The Prospects for Mathematical Logic in the Twenty-First Century

Bulletin of Symbolic Logic ◽

10.2307/2687773 ◽

2001 ◽

Vol 7 (2) ◽

pp. 169-196 ◽

Cited By ~ 11

Author(s):

Samuel R. Buss ◽

Alexander S. Kechris ◽

Anand Pillay ◽

Richard A. Shore

Keyword(s):

Mathematical Logic ◽

Computer Science ◽

Set Theory ◽

Model Theory ◽

Proof Theory ◽

Recursion Theory ◽

First Century ◽

Future Developments ◽

The Future ◽

Twenty First Century

AbstractThe four authors present their speculations about the future developments of mathematical logic in the twenty-first century. The areas of recursion theory, proof theory and logic for computer science, model theory, and set theory are discussed independently.

Tomek Bartoszynski. On the structure of measurable filters on a countable set. Real analysis exchange, vol. 17 no. 2 (1992), pp. 681–701. - Tomek Bartoszynski and Saharon Shelah. Intersection of < 2ℵ0 ultrafilters may have measure zero. Archive for mathematical logic, vol. 31 (1992), pp. 221–226. - Tomek Bartoszynski and Haim Judah. Measure and Category—filters on ω. Set theory of the continuum, edited by H. Judah, W. Just, and H. Woodin, Mathematical Sciences Research Institute publications, vol. 26, Springer-Verlag, New York, Berlin, Heidelberg, etc., 1992, pp. 175–201. - Tomek Bartoszynski, Martin Goldstern, Haim Judah, and Saharon Shelah. All meager filters may be null. Proceedings of the American Mathematical Society, vol. 117 (1993), pp. 515–521. - Tomek Bartoszyński. Remarks on the intersection of filters. Topology and its applications, vol. 84 (1998), pp. 139–143.

Bulletin of Symbolic Logic ◽

10.2307/2687761 ◽

2001 ◽

Vol 7 (3) ◽

pp. 388-389

Author(s):

Claude Laflamme

Keyword(s):

New York ◽

Mathematical Logic ◽

Set Theory ◽

Measure Zero ◽

American Mathematical Society ◽

Mathematical Society ◽

Real Analysis ◽

Mathematical Sciences ◽

The Continuum ◽

Research Institute