The Journal of Symbolic Logic: Volume 58 - Issue 1

Resultats optimaux sur l'existence d'une partie entiere dans les corps ordonnes
Sedki Boughattas
Published online by Cambridge University Press:

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

Quantifying over propositions in relevance logic: nonaxiomatisability of primary interpretations of ∀p and ∃p *
Philip Kremer
Published online by Cambridge University Press:

12 March 2014, pp. 334-349
- Article
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation
A typical approach to semantics for relevance (and other) logics: specify a class of algebraic structures and take a model to be one of these structures, α, together with some function or relation which associates with every formula A a subset of α. (This is the approach of, among others, Urquhart, Routley and Meyer and Fine.) In some cases there are restrictions on the class of subsets of α with which a formula can be associated: for example, in the semantics of Routley and Meyer [1973], a formula can only be associated with subsets which are closed upwards. It is natural to take a proposition of α to be such a subset of α, and, further, to take the propositional quantifiers to range over these propositions. (Routley and Meyer [1973] explicitly consider this interpretation.) Given such an algebraic semantics, we call (following Routley and Meyer [1973], who follow Henkin [1950]) the above-described interpretation of the quantifiers the primary interpretation associated with the semantics.

Andreas Blass. Near coherence of filters, 1: cofinal equivalence of models of arithmetic. Notre Dame journal of formal logic, vol. 27 (1986), pp. 579–591.
H. B. Enderton
Published online by Cambridge University Press:

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

A. H. Lachlan. On countable stable structures which are homogeneous for a finite relational language. Israel journal of mathematics, vol. 49 (1984), pp. 69–153. - G. Cherlin and A. H. Lachlan. Stable finitely homogeneous structures. Transactions of the American Mathematical Society, vol. 296 (1986), pp. 815–850.
Dugald Macpherson
Published online by Cambridge University Press:

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

Peter J. Freyd and Andre Scedrov. Categories, allegories. North-Holland mathematical library, vol. 39. North-Holland, Amsterdam etc. 1990, xviii + 296 pp.
Marta C. Bunge
Published online by Cambridge University Press:

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

Ieke Moerdijk and Gonzalo E. Reyes. Models for smooth infinitesimal analysis. Springer-Verlag, New York, Berlin, etc., 1991, x + 399 pp.
Anders Kock
Published online by Cambridge University Press:

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

Michael Makkai and Robert Paré. Accessible categories: the foundations of categorical model theory. Contemporary mathematics, vol. 104. American Mathematical Society, Providence1989, viii + 176 pp.
Andreas Blass
Published online by Cambridge University Press:

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

Richard Kaye. Models of Peano arithmetic. Oxford logic guides, no. 15. Clarendon Press, Oxford University Press, Oxford and New York1991, x + 292 pp.
C. Dimitracopoulos
Published online by Cambridge University Press:

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

Wolfram Pohlers. Proof theory. An introduction. Lecture notes in mathematics, vol. 1407. Springer-Verlag, Berlin etc. 1989, vi + 213 pp.
Andrea Cantini
Published online by Cambridge University Press:

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

Richard Beigel, William I. Gasarch, and Louise Hay. Bounded query classes and the difference hierarchy. Archive for mathematical logic, vol. 29 no. 2 (1989), pp. 69–84.
Melven Krom
Published online by Cambridge University Press:

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

Mike Townsend. Complexity for type-2 relations. Notre Dame journal of formal logic, vol. 31 (1990), pp. 241–262.
Bruce Kapron
Published online by Cambridge University Press:

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

Domenico Cantone, Alfredo Ferro, and Eugenio Omodeo. Computable set theory. Volume 1. International series of monographs on computer science, no. 6. Clarendon Press, Oxford University Press, Oxford and New York1989, xii + 347 pp.
Lincoln A. Wallen
Published online by Cambridge University Press:

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

Jon Barwise and John Etchemendy. The language of first-order logic, including the program Tarski's world. Includes version 3.0 of LV 370(2). CSLI lecture notes, no. 23. Center for the Study of Language and Information, Stanford 1990, also distributed by the University of Chicago Press, Chicago, xiii + 259 pp. + disk. - Jon Barwise and John Etchemendy. The language of first-order logic, including the Macintosh program Tarski's world. Second edition of the preceding. CSLI lecture notes, no. 23. Center for the Study of Language and Information, Stanford 1992 (© 1991), also distributed by the University of Chicago Press, Chicago, xiv + 297 pp. + disk.
Kevin J. Compton
Published online by Cambridge University Press:

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

Stewart Shapiro. Foundations without foundationalism. A case for second-order logic. Oxford logic guides, no. 17. Clarendon Press, Oxford University Press, Oxford and New York1991, xx + 277 pp.
John Burgess
Published online by Cambridge University Press:

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

Gödel's theorem in focus, edited by S. G. Shanker, Philosophers in focus series, Croom Helm, London, New York, and Sydney, 1988, and Routledge, London and New York 1989, ix + 261 pp.
David D. Auerbach
Published online by Cambridge University Press:

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

Franz von Kutschera. Gottlob Frege. Eine Einführung in sein Werk. Walter de Gruyter, Berlin and New York1989, x + 207 pp.
Matthias Schirn
Published online by Cambridge University Press:

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

The International Conference on Theoretical Aspects of Computer Science, Sendai, 1991
Albert R. Meyer, Takayasu Ito
Published online by Cambridge University Press:

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

Annual Meeting of the Association for Symbolic Logic, Durham, 1992
Sy D. Friedman
Published online by Cambridge University Press:

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

Notices
Published online by Cambridge University Press:

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

JSL volume 58 issue 1 Cover and Front matter
Published online by Cambridge University Press:

12 March 2014, pp. f1-f2
- Article
- - You have access
- PDF
- Export citation

The Journal of Symbolic Logic

Refine listing

Actions for selected content:

Volume 58 - Issue 1 - March 1993

Research Article

Resultats optimaux sur l'existence d'une partie entiere dans les corps ordonnes

Quantifying over propositions in relevance logic: nonaxiomatisability of primary interpretations of ∀p and ∃p *

Reviews

Andreas Blass. Near coherence of filters, 1: cofinal equivalence of models of arithmetic. Notre Dame journal of formal logic, vol. 27 (1986), pp. 579–591.

Peter J. Freyd and Andre Scedrov. Categories, allegories. North-Holland mathematical library, vol. 39. North-Holland, Amsterdam etc. 1990, xviii + 296 pp.

Ieke Moerdijk and Gonzalo E. Reyes. Models for smooth infinitesimal analysis. Springer-Verlag, New York, Berlin, etc., 1991, x + 399 pp.

Michael Makkai and Robert Paré. Accessible categories: the foundations of categorical model theory. Contemporary mathematics, vol. 104. American Mathematical Society, Providence1989, viii + 176 pp.

Richard Kaye. Models of Peano arithmetic. Oxford logic guides, no. 15. Clarendon Press, Oxford University Press, Oxford and New York1991, x + 292 pp.

Wolfram Pohlers. Proof theory. An introduction. Lecture notes in mathematics, vol. 1407. Springer-Verlag, Berlin etc. 1989, vi + 213 pp.

Richard Beigel, William I. Gasarch, and Louise Hay. Bounded query classes and the difference hierarchy. Archive for mathematical logic, vol. 29 no. 2 (1989), pp. 69–84.

Mike Townsend. Complexity for type-2 relations. Notre Dame journal of formal logic, vol. 31 (1990), pp. 241–262.

Domenico Cantone, Alfredo Ferro, and Eugenio Omodeo. Computable set theory. Volume 1. International series of monographs on computer science, no. 6. Clarendon Press, Oxford University Press, Oxford and New York1989, xii + 347 pp.

Stewart Shapiro. Foundations without foundationalism. A case for second-order logic. Oxford logic guides, no. 17. Clarendon Press, Oxford University Press, Oxford and New York1991, xx + 277 pp.

Gödel's theorem in focus, edited by S. G. Shanker, Philosophers in focus series, Croom Helm, London, New York, and Sydney, 1988, and Routledge, London and New York 1989, ix + 261 pp.

Franz von Kutschera. Gottlob Frege. Eine Einführung in sein Werk. Walter de Gruyter, Berlin and New York1989, x + 207 pp.

Other

The International Conference on Theoretical Aspects of Computer Science, Sendai, 1991

Annual Meeting of the Association for Symbolic Logic, Durham, 1992

Notices

Front matter

JSL volume 58 issue 1 Cover and Front matter

The Journal of Symbolic Logic

Refine listing

Actions for selected content:

Save Search

Volume 58 - Issue 1 - March 1993

Research Article

Reviews

Other

Front matter