The Journal of Symbolic Logic: Volume 56 - Issue 1

End-extensions preserving power set
Thomas Forster, Richard Kaye
Published online by Cambridge University Press:

12 March 2014, pp. 323-328
- Article
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation
We consider the quantifier hierarchy of Takahashi [1972] and show how it gives rise to reflection theorems for some large cardinals in ZF, a new natural subtheory of Zermelo's set theory, a potentially useful new reduction of the consistency problem for Quine's NF, and a sharpening of another reduction of this problem due to Boffa.

George Boolos and Vann McGee. The degree of the set of sentences of predicate provability logic that are true under every interpretation. The journal of symbolic logic, vol. 52 (1987), pp. 165–171.
Albert Visser
Published online by Cambridge University Press:

12 March 2014, p. 332
- Article
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Wilfried Buchholz and Kurt Schütte. Proof theory of impredicative subsystems of analysis. Studies in proof theory. Bibliopolis, Naples1988, 122 pp.
Gerhard Jäger
Published online by Cambridge University Press:

12 March 2014, pp. 332-333
- Article
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Kazuyuki Tanaka. The Galvin–Prikry theorem and set existence axioms. Annals of pure and applied logic, vol. 42 (1989), pp. 81–104.
F. R. Drake
Published online by Cambridge University Press:

12 March 2014, p. 334
- Article
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Jan Krajíček. On the number of steps in proofs. Annals of pure and applied logic, vol. 41 (1989), pp. 153–178.
William M. Farmer
Published online by Cambridge University Press:

12 March 2014, pp. 334-335
- Article
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Akira Kanda. Recursion theorems and effective domains. Annals of pure and applied logic, vol. 38 (1988), pp. 289–300.
Dag Normann
Published online by Cambridge University Press:

12 March 2014, p. 335
- Article
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Computational complexity theory, edited by Juris Hartmanis, Proceedings of symposia in applied mathematics, vol. 38, American Mathematical Society, Providence1989, ix + 128 pp.
Uwe Schöning
Published online by Cambridge University Press:

12 March 2014, pp. 335-336
- Article
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

A. A. Markov and N. M. Nagorny. The theory of algorithms. English translation by M. Greendlinger of Teoriya algorifmov. Mathematics and its applications (Soviet series). Kluwer Academic Publishers, Dordrecht, Boston, and London, 1988, xxiv + 369 pp.
Andre Scedrov
Published online by Cambridge University Press:

12 March 2014, pp. 336-337
- Article
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

A. A. Markov and N. M. Nagornyi. Teoriya algorifmov. Matematicheskaya logika i osnovaniya matematiki. “Nauka,” Moscow1984, 432 pp. - Arto Salomaa. Computation and automata. Encyclopedia of mathematics and its applications, vol. 25. Cambridge University Press, Cambridge etc. 1985, xiii + 284 pp.
R. Downey
Published online by Cambridge University Press:

12 March 2014, pp. 337-338
- Article
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Eitan Gurari. An introduction to the theory of computation. Principles of computer science series. Computer Science Press, Rockville, Md., 1989, xii + 314 pp.
William I. Gasarch
Published online by Cambridge University Press:

12 March 2014, pp. 338-339
- Article
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Raymond Turner. Logics for artificial intelligence. Ellis Horwood series in artificial intelligence. Ellis Horwood, Chichester 1984, also distributed by Halsted Press, New York, 121 pp.
Francis Jeffry Pelletier, Lenhart K. Schubert
Published online by Cambridge University Press:

12 March 2014, pp. 339-340
- Article
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Michael Barr and Charles Wells. Toposes, triples and theories. Grundlehren der mathematischen Wissenschaften, no. 278. Springer-Verlag, New York etc. 1985, xiii + 345 pp.
Andrew Pitts
Published online by Cambridge University Press:

12 March 2014, pp. 340-341
- Article
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Alexander Prestel. Einführung in die mathematische Logik und Modelltheorie. Vieweg studium, no. 60. Friedr. Vieweg & Sohn, Brunswick et Wiesbaden 1986, xiv + 286 pp.
Françoise Delon
Published online by Cambridge University Press:

12 March 2014, pp. 341-343
- Article
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Michael Canjar. Countable ultraproducts without CH. Annals of pure and applied logic, vol. 37 (1988), pp. 1–79. - R. Michael Canjar. Small filter forcing. The journal of symbolic logic, vol. 51 (1986), pp. 526–546.
Arnold W. Miller
Published online by Cambridge University Press:

12 March 2014, pp. 343-344
- Article
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Moti Gitik. The negation of the singular cardinal hypothesis from O(K) = K++. Annals of pure and applied logic, vol. 43 (1989), pp. 209–234.
W. J. Mitchell
Published online by Cambridge University Press:

12 March 2014, p. 344
- Article
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Alexander S. Kechris and Alain Louveau. Descriptive set theory and the structure of sets of uniqueness. London Mathematical Society lecture note series, no. 128. Cambridge University Press, Cambridge etc. 1987, vii + 367 pp.
Miklos Ajtai
Published online by Cambridge University Press:

12 March 2014, pp. 344-345
- Article
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Mengenlehre, edited by Ulrich Feigner, Wissenschaftliche Buchgesellschaft, Darmstadt1979, vii + 331 pp.
A. R. D. Mathias
Published online by Cambridge University Press:

12 March 2014, pp. 345-348
- Article
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Realism, mathematics and modality, by Hartry Field, Basil Blackwell, Oxford and New York1989, viii + 290 pp.
Bob Hale
Published online by Cambridge University Press:

12 March 2014, pp. 348-351
- Article
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Graeme Forbes. Languages of possibility. An essay in philosophical logic. Aristotelian Society series, vol. 9. Basil Blackwell, Oxford and New York1989, ix + 181 pp.
I. L. Humberstone
Published online by Cambridge University Press:

12 March 2014, pp. 351-352
- Article
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

The Journal of Symbolic Logic

Refine listing

Actions for selected content:

Volume 56 - Issue 1 - March 1991

Research Article

End-extensions preserving power set

Reviews

George Boolos and Vann McGee. The degree of the set of sentences of predicate provability logic that are true under every interpretation. The journal of symbolic logic, vol. 52 (1987), pp. 165–171.

Wilfried Buchholz and Kurt Schütte. Proof theory of impredicative subsystems of analysis. Studies in proof theory. Bibliopolis, Naples1988, 122 pp.

Kazuyuki Tanaka. The Galvin–Prikry theorem and set existence axioms. Annals of pure and applied logic, vol. 42 (1989), pp. 81–104.

Jan Krajíček. On the number of steps in proofs. Annals of pure and applied logic, vol. 41 (1989), pp. 153–178.

Akira Kanda. Recursion theorems and effective domains. Annals of pure and applied logic, vol. 38 (1988), pp. 289–300.

Computational complexity theory, edited by Juris Hartmanis, Proceedings of symposia in applied mathematics, vol. 38, American Mathematical Society, Providence1989, ix + 128 pp.

A. A. Markov and N. M. Nagorny. The theory of algorithms. English translation by M. Greendlinger of Teoriya algorifmov. Mathematics and its applications (Soviet series). Kluwer Academic Publishers, Dordrecht, Boston, and London, 1988, xxiv + 369 pp.

A. A. Markov and N. M. Nagornyi. Teoriya algorifmov. Matematicheskaya logika i osnovaniya matematiki. “Nauka,” Moscow1984, 432 pp. - Arto Salomaa. Computation and automata. Encyclopedia of mathematics and its applications, vol. 25. Cambridge University Press, Cambridge etc. 1985, xiii + 284 pp.

Eitan Gurari. An introduction to the theory of computation. Principles of computer science series. Computer Science Press, Rockville, Md., 1989, xii + 314 pp.

Raymond Turner. Logics for artificial intelligence. Ellis Horwood series in artificial intelligence. Ellis Horwood, Chichester 1984, also distributed by Halsted Press, New York, 121 pp.

Michael Barr and Charles Wells. Toposes, triples and theories. Grundlehren der mathematischen Wissenschaften, no. 278. Springer-Verlag, New York etc. 1985, xiii + 345 pp.

Alexander Prestel. Einführung in die mathematische Logik und Modelltheorie. Vieweg studium, no. 60. Friedr. Vieweg & Sohn, Brunswick et Wiesbaden 1986, xiv + 286 pp.

Michael Canjar. Countable ultraproducts without CH. Annals of pure and applied logic, vol. 37 (1988), pp. 1–79. - R. Michael Canjar. Small filter forcing. The journal of symbolic logic, vol. 51 (1986), pp. 526–546.

Moti Gitik. The negation of the singular cardinal hypothesis from O(K) = K++. Annals of pure and applied logic, vol. 43 (1989), pp. 209–234.

Alexander S. Kechris and Alain Louveau. Descriptive set theory and the structure of sets of uniqueness. London Mathematical Society lecture note series, no. 128. Cambridge University Press, Cambridge etc. 1987, vii + 367 pp.

Mengenlehre, edited by Ulrich Feigner, Wissenschaftliche Buchgesellschaft, Darmstadt1979, vii + 331 pp.

Realism, mathematics and modality, by Hartry Field, Basil Blackwell, Oxford and New York1989, viii + 290 pp.

Graeme Forbes. Languages of possibility. An essay in philosophical logic. Aristotelian Society series, vol. 9. Basil Blackwell, Oxford and New York1989, ix + 181 pp.

The Journal of Symbolic Logic

Refine listing

Actions for selected content:

Save Search

Volume 56 - Issue 1 - March 1991

Research Article

Reviews