Infinitary logic and admissible sets
Author:
- 25 July 1969
- journal article
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 34 (2) , 226-252
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 infinitary logic.Keywords
This publication has 10 references indexed in Scilit:
- Infinitary logic and admissible setsThe Journal of Symbolic Logic, 1969
- Implicit definability and infinitary languagesThe Journal of Symbolic Logic, 1968
- The Syntax and Semantics of Infinitary Languages1968
- Remarks on an infinitary language with constructive formulasThe Journal of Symbolic Logic, 1967
- Languages with Expressions of Infinite Length.The American Mathematical Monthly, 1966
- Persistent and invariant formulas relative to theories of higher orderBulletin of the American Mathematical Society, 1966
- Metarecursive setsThe Journal of Symbolic Logic, 1965
- Incompactness in languages with infinitely long expressionsFundamenta Mathematicae, 1964
- On predicates with constructive infinitely long expressionsJournal of the Mathematical Society of Japan, 1963
- The Consistency of the Axiom of Choice and of the Generalized Continuum-HypothesisProceedings of the National Academy of Sciences, 1938