Infinitary logic

Cambridge University Press eBooks 2026 Book chapter

View at publisher
Authors: Antonio Montalbán
DOI: 10.1017/9781108780568.003
Cited by: 0

Abstract

In this chapter, we provide an introduction to the countable-infinitary logic called L-omega-1-omega. There is no computability theory in this chapter. We prove all the main results that are about countable structures. This includes the development of Scott ranks, and the type omitting theorem. All of this is done with the authors perpective, so that it fits better with the computability notions to be developed later.

Fields of Study & Subjects

Advanced Topology and Set Theory Computability Logic AI Algorithms Reasoning and Knowledge

Publication details

Journal / source
Cambridge University Press eBooks
Pages
17–50
Publication date
30 January 2026
Document type
Book chapter