1969
DOI: 10.2307/2271099
|View full text |Cite
|
Sign up to set email alerts
|

Infinitary logic and admissible sets

Abstract: In recent years much effort has gone into the study of languages which strengthen the classical first-order predicate calculus in various ways. This effort has been motivated by the desire to find a language which is(I) strong enough to express interesting properties not expressible by the classical language, but(II) still simple enough to yield interesting general results. Languages investigated include second-order logic, weak second-order logic, ω-logic, languages with generalized quantifiers, and infinitar… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
258
1
1

Year Published

1975
1975
2008
2008

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 105 publications
(260 citation statements)
references
References 8 publications
0
258
1
1
Order By: Relevance
“…It works also in the countable admissible fragments of L ω 1 ω , as demonstrated by Barwise (1969). The best result in this direction in the classical higher infinitary logics is the following result of Malitz (1971):…”
Section: Positive Resultsmentioning
confidence: 90%
See 1 more Smart Citation
“…It works also in the countable admissible fragments of L ω 1 ω , as demonstrated by Barwise (1969). The best result in this direction in the classical higher infinitary logics is the following result of Malitz (1971):…”
Section: Positive Resultsmentioning
confidence: 90%
“…The admissible fragment Barwise (1969Barwise ( , 1975 Second order logic √ * * * Separation, * * Single-sorted…”
Section: Amentioning
confidence: 99%
“…It was shown by López-Escobar (1965) that L HC has the interpolation property and more generally by Barwise (1969) that the same holds for every L A with A a countable admissible subset of HC. Barwise also generalized the r.e.…”
Section: Lemmamentioning
confidence: 92%
“…Hanf numbers. In Barwise [1] it is shown that the Hanf number of LA is 3^n0n, for all countable admissible sets A. Is this theorem true for all admissible A with countable A n Onl…”
Section: Harvey Friedmanmentioning
confidence: 99%