Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Journals
  3. Bulletin of Symbolic Logic
  4. Volume 5 Issue 3
Journal Home
Refine listing

Refine listing

Access:
Publication date:

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×
< Back to all issues

Volume 5 - Issue 3 - September 1999

Contents

Research Article

  • Models of Second-Order Zermelo Set Theory

  • Gabriel Uzquiano
  • Published online by Cambridge University Press: 15 January 2014, pp. 289-302

  • In [12], Ernst Zermelo described a succession of models for the axioms of set theory as initial segments of a cumulative hierarchy of levels UαVα. The recursive definition of the Vα's is:

    Thus, a little reflection on the axioms of Zermelo-Fraenkel set theory (ZF) shows that Vω, the first transfinite level of the hierarchy, is a model of all the axioms of ZF with the exception of the axiom of infinity. And, in general, one finds that if κ is a strongly inaccessible ordinal, then Vκ is a model of all of the axioms of ZF. (For all these models, we take ∈ to be the standard element-set relation restricted to the members of the domain.) Doubtless, when cast as a first-order theory, ZF does not characterize the structures 〈Vκ,∈∩(Vκ×Vκ)〉 for κ a strongly inaccessible ordinal, by the Löwenheim-Skolem theorem. Still, one of the main achievements of [12] consisted in establishing that a characterization of these models can be attained when one ventures into second-order logic. For let second-order ZF be, as usual, the theory that results from ZF when the axiom schema of replacement is replaced by its second-order universal closure. Then, it is a remarkable result due to Zermelo that second-order ZF can only be satisfied in models of the form 〈Vκ,∈∩(Vκ×Vκ)〉 for κ a strongly inaccessible ordinal.

  • Between Russell and Hilbert: Behmann on the Foundations of Mathematics

  • Paolo Mancosu
  • Published online by Cambridge University Press: 15 January 2014, pp. 303-330

  • After giving a brief overview of the renewal of interest in logic and the foundations of mathematics in Göttingen in the period 1914-1921, I give a detailed presentation of the approach to the foundations of mathematics found in Behmann's doctoral dissertation of 1918, Die Antinomie der transfiniten Zahl und ihre Auflösung durch die Theorie von Russell und Whitehead. The dissertation was written under the guidance of David Hilbert and was primarily intended to give a clear exposition of the solution to the antinomies as found in Principia Mathematica. In the process of explaining the theory of Principia, Behmann also presented an original approach to the foundations of mathematics which saw in sense perception of concrete individuals the Archimedean point for a secure foundation of mathematical knowledge. The last part of the paper points out an important numbers of connections between Behmann's work and Hilbert's foundational thought.

  • Completeness Before Post: Bernays, Hilbert, and the Development of Propositional Logic

  • Richard Zach
  • Published online by Cambridge University Press: 15 January 2014, pp. 331-366

  • Some of the most important developments of symbolic logic took place in the 1920s. Foremost among them are the distinction between syntax and semantics and the formulation of questions of completeness and decidability of logical systems. David Hilbert and his students played a very important part in these developments. Their contributions can be traced to unpublished lecture notes and other manuscripts by Hilbert and Bernays dating to the period 1917–1923. The aim of this paper is to describe these results, focussing primarily on propositional logic, and to put them in their historical context. It is argued that truth-value semantics, syntactic (“Post-”) and semantic completeness, decidability, and other results were first obtained by Hilbert and Bernays in 1918, and that Bernays's role in their discovery and the subsequent development of mathematical logic is much greater than has so far been acknowledged.

  • Accessible Recursive Functions

  • Stanley S. Wainer
  • Published online by Cambridge University Press: 15 January 2014, pp. 367-388

  • The class of all recursive functions fails to possess a natural hierarchical structure, generated predicatively from “within”. On the other hand, many (proof-theoretically significant) sub-recursive classes do. This paper attempts to measure the limit of predicative generation in this context, by classifying and characterizing those (predictably terminating) recursive functions which can be successively defined according to an autonomy condition of the form: allow recursions only over well-orderings which have already been “coded” at previous levels. The question is: how can a recursion code a well-ordering? The answer lies in Girard's theory of dilators, but is reworked here in a quite different and simplified framework specific to our purpose. The “accessible” recursive functions thus generated turn out to be those provably recursive in ( –CA)0.

Obituary

  • In Memoriam: Albert G. Dragalin 1941–1998

  • S. Artemov, B. Kushner, G. Mints, E. Nogina, A. Troelstra
  • Published online by Cambridge University Press: 15 January 2014, pp. 389-391
    • Article
      • You have access
    • PDF
    • Export citation

  • In Memoriam: Nelson Goodman 1906–1998

  • Joseph S. Ullian
  • Published online by Cambridge University Press: 15 January 2014, pp. 392-394
    • Article
      • You have access
    • PDF
    • Export citation

Meeting Report

Other

Front matter

  • BSL volume 5 issue 3 Cover and Front matter

  • Published online by Cambridge University Press: 05 July 2016, pp. f1-f6
    • Article
      • You have access
    • PDF
    • Export citation

Back matter

  • BSL volume 5 issue 3 Cover and Back matter

  • Published online by Cambridge University Press: 05 July 2016, pp. b1-b3
    • Article
      • You have access
    • PDF
    • Export citation