Remarks on an infinitary language with constructive formulas
- 9 October 1967
- journal article
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 32 (3) , 305-318
- https://doi.org/10.2307/2270771
Abstract
It is well known that L, the first-order predicate calculus, is unsuitable for characterizing certain mathematical structures. Since some of those structures are quite often considered by mathematicians, extensions of L have been considered which (partially) solve the above problem. Roughly speaking, the extensions of L fall into two main categories: (I) extensions obtained by allowing higher order variables, and (II) extensions obtained by allowing infinitely long formulas.Keywords
This publication has 6 references indexed in Scilit:
- An interpolation theorem for denumerably long formulasFundamenta Mathematicae, 1965
- On predicates with constructive infinitely long expressionsJournal of the Mathematical Society of Japan, 1963
- Arithmetization of metamathematics in a general settingFundamenta Mathematicae, 1960
- Remarks on predicate logic with infinitely long expressionsColloquium Mathematicum, 1958
- Introduction to Metamathematics. By S. C. Kleene. Pp. x, 550, Fl. 32.50. 1952. (Noordhoff, Groningen; North-Holland Publishing Co., Amsterdam)The Mathematical Gazette, 1954
- On notation for ordinal numbersThe Journal of Symbolic Logic, 1938