Barwise: Infinitary logic and admissible sets

Bulletin of Symbolic Logic 10 (1):4-36 (2004)
  Copy   BIBTEX

Abstract

§0. Introduction. In [16], Barwise described his graduate study at Stanford. He told of his interactions with Kreisel and Scott, and said how he chose Feferman as his advisor. He began working on admissible fragments of infinitary logic after reading and giving seminar talks on two Ph.D. theses which had recently been completed: that of Lopez-Escobar, at Berkeley, on infinitary logic [46], and that of Platek [58], at Stanford, on admissible sets.Barwise's work on infinitary logic and admissible sets is described in his thesis [4], the book [13], and papers [5]—[16]. We do not try to give a systematic review of these papers. Instead, our goal is to give a coherent introduction to infinitary logic and admissible sets. We describe results of Barwise, of course, because he did so much. In addition, we mention some more recent work, to indicate the current importance of Barwise's ideas. Many of the central results are stated without proof, but occasionally we sketch a proof, to indicate how the ideas fit together.Chapters 1 and 2 describe infinitary logic and admissible sets at the time Barwise began his work, circa 1965. From Chapter 3 on, we survey the developments that took place after Barwise appeared on the scene.§1. Background on infinitary logic. In this chapter, we describe the situation in infinitary logic at the time that Barwise began his work. We need some terminology. By a vocabulary, we mean a set L of constant symbols, and relation and operation symbols with finitely many argument places. As usual, by an L-structureM, we mean a universe set M with an interpretation for each symbol of L.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,168

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Model theory for infinitary logic.H. Jerome Keisler - 1971 - Amsterdam,: North-Holland Pub. Co..
Infinitary logic and admissible sets.Jon Barwise - 1969 - Journal of Symbolic Logic 34 (2):226-252.
HC of an admissible set.Sy D. Friedman - 1979 - Journal of Symbolic Logic 44 (1):95-102.
Anti-admissible sets.Jacob Lurie - 1999 - Journal of Symbolic Logic 64 (2):407-435.
Applications of strict π11 predicates to infinitary logic.Jon Barwise - 1969 - Journal of Symbolic Logic 34 (3):409 - 423.
The pure part of HYP(M).Mark Nadel & Jonathan Stavi - 1977 - Journal of Symbolic Logic 42 (1):33-46.
The next admissible set.K. J. Barwise, R. O. Gandy & Y. N. Moschovakis - 1971 - Journal of Symbolic Logic 36 (1):108-120.
$L_a(\finv)$.Kim Bruce & H. J. Keisler - 1979 - Journal of Symbolic Logic 44 (1):15 - 28.

Analytics

Added to PP
2009-01-28

Downloads
124 (#146,579)

6 months
21 (#127,497)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Can logic be combined with probability? Probably.Colin Howson - 2009 - Journal of Applied Logic 7 (2):177-187.
Infinitary logic.John L. Bell - 2008 - Stanford Encyclopedia of Philosophy.
Supervenience and infinitary property-forming operations.Ralf M. Bader - 2012 - Philosophical Studies 160 (3):415-423.

Add more citations

References found in this work

Model Theory.Michael Makkai, C. C. Chang & H. J. Keisler - 1991 - Journal of Symbolic Logic 56 (3):1096.
The completeness of the first-order functional calculus.Leon Henkin - 1949 - Journal of Symbolic Logic 14 (3):159-166.
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Infinitary logic and admissible sets.Jon Barwise - 1969 - Journal of Symbolic Logic 34 (2):226-252.
Stationary logic.Jon Barwise - 1978 - Annals of Mathematical Logic 13 (2):171.

View all 26 references / Add more references