Graduate studies at Western
|Abstract||We begin with the following quotation from Karp : My interest in infinitary logic dates back to a February day in 1956 when I remarked to my thesis supervisor, Professor Leon Henkin, that a particularly vexing problem would be so simple if only I could write a formula which would say x = 0 or x = 1 or x = 2 etc. To my surprise, he replied, "Well, go ahead." Traditionally, expressions in formal systems have been regarded as signifying finite inscriptions which are—at least in principle—capable of actually being written out in primitive notation. However, the fact that (first-order) formulas may be identified with natural numbers (via "Gödel numbering") and hence with finite sets makes it no longer necessary to regard formulas as inscriptions, and suggests the possibility of fashioning "languages" some of whose formulas— such as that in the above quotation—would be naturally identified as infinite sets. A "language" of this kind is called an infinitary language: in this article we discuss those infinitary languages which can be obtained in a straightforward manner from first-order languages by allowing conjunctions, disjunctions and, possibly, quantifier sequences, to be of infinite length. In the course of the discussion we shall see that, while the expressive power of such languages far exceeds that of their finitary (first-order) counterparts, very few of them possess the "attractive" features (e.g., compactness and completeness) of the latter. Accordingly, the infinitary languages that do in fact possess these features merit special attention. In §1 we lay down the basic syntax and semantics of infinitary languages and demonstrate their expressive power by means of examples. §2 is devoted to those infinitary languages which permit only finite quantifier sequences: these languages turn out to be relatively well-behaved. In §3 we discuss the compactness problem for infinitary languages and its..|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|External links||This entry has no external links. Add one.|
|Through your library||Only published papers are available at libraries|
Similar books and articles
Jon Barwise (1968). Implicit Definability and Compactness in Infinitary Languages. Lecture Notes in Mathematics 72:1--35.
Herman Ruge Jervell (1972). Herbrand and Skolem Theorems in Infinitary Languages. Oslo,Universitetet I Oslo, Matematisk Institutt.
Attila Máté (1971). Incompactness in Infinitary Languages with Respect to Boolean-Valued Interpretations. Szeged,University of Szeged Bolyai Mathematical Institute.
M. A. Dickmann (1975). Large Infinitary Languages: Model Theory. American Elsevier Pub. Co..
Ian Pratt & Dominik Schoop (2000). Expressivity in Polygonal, Plane Mereotopology. Journal of Symbolic Logic 65 (2):822-838.
Yoshihito Tanaka (2007). An Infinitary Extension of Jankov's Theorem. Studia Logica 86 (1):111 - 131.
H. Jerome Keisler (1971). Model Theory for Infinitary Logic. Amsterdam,North-Holland Pub. Co..
M. A. Dickmann (1970). Model Theory of Infinitary Languages. [Aarhus, Denmark,Universitet, Matematisk Institut].
Maaret Karttunen (1983). Model Theoretic Results for Infinitely Deep Languages. Studia Logica 42 (2-3):223 - 241.
John L. Bell, Infinitary Logic. Stanford Encyclopedia of Philosophy.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Recent downloads (6 months)0
How can I increase my downloads?