This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Bibliography
Addison, J., The theory of hierarchies, Logic, methodology, and philosophy of science, Proc. 1960 International Congress, Stanford 1962, pp. 26–37.
Barwise, J., Infinitary logic and admissible sets, J. Symbolic Logic vol. 34 (1969), pp. 226–252.
Barwise, J., Gandy, R., and Moschovakis, Y., The next admissible set, J. Symbolic Logic vol. 36 (1971), pp. 108–120.
Craig, W., and Vaught, R., Finite axiomatizability using additional predicater, J. Symbolic Logic vol. 23 (1958), pp. 289–308.
Jensen, R., and Karp, C., Primitive recursive set functions. Axiomatic set theory, Amer. Math. Soc. Proc. Symp. Pure Math., Providence, 1971, pp. 143–176.
Karp, C., Languages with Expressions of Infinite Length, Amsterdam, 1964.
Keisler, H. J., Finite approximations of infinitely long formulas, Proc. Berkeley Symposium on the Theory of Models, Amsterdam, 1965, pp. 158–169.
Keisler, H. J., Infinite quantifier and continuous games. Applications of Model Theory to Algebra, Analysis, and Probability, New York, 1969, pp. 228–264.
Kleene, S., Finite axiomatizability of theories in the predicate calculus using additional predicate symbols. Memoirs Amer. Math. Soc. no. 10 (1952), pp. 27–68.
Kreisel, G., Model-theoretic invariants: Applications to recursive and hyperarithmetic operations. Proc. Berkeley Symposium on the Theory of Models, Amsterdam, 1965, pp. 190–205.
Kuratowski, K., Topology I, New York-Warsaw, 1966.
Lopez-Escobar, E. G. K., An interpolation theorem for denumerably long formulas, Fund. Math. vol. 57 (1965), pp. 253–272.
Lopez-Escobar, E. G. K., On defining well-orderings, Fund. Math. vol. 59 (1966), pp. 13–21.
Makkai, M., On PCΔ-classes in the theory of models, Publ. Math. Inst. Hungarian Acad. Sci. vol. 9 (1964), pp. 159–194.
Makkai, M., An application of a method of Smullyan to logics on admissible sets, Bull. Acad. Polon. des Sciences (Serie des sciences math.) vol. 17 (1969), pp. 341–346.
Morley, M., Omitting classes of elements. Proc. Berkeley Symposium on the Theory of Models, Amsterdam, 1965, pp. 265–273.
Morley, M., The Hanf number for ω-logic. J. Symbolic Logic vol. 32 (1967), p. 437.
Morley, M., The number of countable models. J. Symbolic Logic vol. 35 (1970), pp. 14–18.
Morley, M., The Lowenheim-Skolem theorem for models with standard part. Symposia Mathematica vol. v, Academic Press, London-New York, 1971, pp. 43–52.
Moschovakis, Y., Abstract first order computability I, II, Trans. Amer. Math. Soc. vol. 138 (1969), pp. 427–464, pp. 465–504.
Moschovakis, Y., Abstract computability and invariant definability, J. Symbolic Logic vol. 34 (1969), pp. 605–633.
Moschovakis, Y., The Suslin-Kleene Theorem for countable structures, Duke Math. J. vol. 37 (1970), pp. 341–352.
Moschovakis, Y., The game quantifier. Proc. Amer. Math. Soc. vol. 31 (1972), pp. 245–250.
Myers, D., The failure of the \(L_{\omega _l \omega }\) analogue of II 11 uniformization, Notices Amer. Math. Soc. vol. 19 (1972), p. A-330.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1973 Springer-Verlag
About this paper
Cite this paper
Vaught, R. (1973). Descriptive set theory in \(L_{\omega _l \omega }\) . In: Mathias, A.R.D., Rogers, H. (eds) Cambridge Summer School in Mathematical Logic. Lecture Notes in Mathematics, vol 337. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0066791
Download citation
DOI: https://doi.org/10.1007/BFb0066791
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-05569-3
Online ISBN: 978-3-540-36884-7
eBook Packages: Springer Book Archive