We show that the predicate “x is the power set of y” is ‐definable, if V = L[E] is an extender model constructed from a coherent sequences of extenders, provided that there is no inner model with a Woodin cardinal. Here is a predicate true of just the infinite cardinals. From this we conclude: the validities of second order logic are reducible to, the set of validities of the Härtig quantifier logic. Further we show that if no L[E] model has (...) a cardinal strong up to one of its ℵ‐fixed points, and, the Löwenheim number of this logic, is less than the least weakly inaccessible δ, then (i) is a limit of measurable cardinals of K, and (ii) the Weak Covering Lemma holds at δ. (shrink)

We discuss an abstract notion of a logical operation and corresponding logics. It is shown that if all the logical operations considered are implicitely definable in a logic *, then the same holds also for the logic obtained from these operations. As an application we show that certain iterated forms of infinitely deep languages are implicitely definable in game quantifier languages. We consider also relations between structures and show that Karttunen's characterization of elementary equivalence for the ordinary infinitely deep languages (...) can be generalized to hold for the iterated infinitely deep languages. An early version of this work was presented in the Abstracts Section of ICM '78. (shrink)

Vectorization of a class of structures is a natural notion in finite model theory. Roughly speaking, vectorizations allow tuples to be treated similarly to elements of structures. The importance of vectorizations is highlighted by the fact that if the complexity class PTIME corresponds to a logic with reasonable syntax, then it corresponds to a logic generated via vectorizations by a single generalized quantifier (Dawar in J Log Comput 5(2):213–226, 1995). It is somewhat surprising, then, that there have been few systematic (...) studies of the expressive power of vectorizations of various quantifiers. In the present paper, we consider the simplest case: the cardinality quantifiers C S. We show that, in general, the expressive power of the vectorized quantifier logic $${{\rm FO}(\{{\mathsf C}_S^{(n)}\, | \, n \in \mathbb{Z}_+\})}$$ is much greater than the expressive power of the non-vectorized logic FO(C S ). (shrink)

We prove the following algebraic characterization of elementary equivalence: $\equiv$ restricted to countable structures of finite type is minimal among the equivalence relations, other than isomorphism, which are preserved under reduct and renaming and which have the Robinson property; the latter is a faithful adaptation for equivalence relations of the familiar model theoretical notion. We apply this result to Friedman's fourth problem by proving that if L = L ωω (Q i ) i ∈ ω 1 is an (ω 1 (...) , ω)-compact logic satisfying both the Robinson consistency theorem on countable structures of finite type and the Löwenheim-Skolem theorem for some $\lambda for theories having ω 1 many sentences, then $\equiv_L = \equiv$ on such structures. (shrink)

We study some large cardinals in terms of reflection, establishing new connections between the model-theoretic and the set-theoretic approaches.

This paper investigates the question “when is a logic more expressive than another?” In order to approach it, “logic” is understood in the model-theoretic sense and, contrary to other proposals in the literature, it is argued that relative expressiveness between logics is best framed with respect to the notion of expressing properties of models, a notion that can be captured precisely in various ways. It is shown that each precise rendering can give rise to a formal condition for relative expressiveness (...) that has appeared in the literature. Five such conditions are exposed, tested for some properties and compared to each other. As the formal conditions for relative expressiveness have various levels of stringency, some results on lifting some conditions to stricter ones are explored. Finally, a discussion on the properties of these formal conditions is presented. Special attention is given to notion of meaning equivalence, and how one may consider that it holds or not, depending on the weight attributed to logical and non-logical constants in expressiveness comparisons. (shrink)

A fundamental notion in a large part of mathematics is the notion of equicardinality. The language with Hartig quantifier is, roughly speaking, a first-order language in which the notion of equicardinality is expressible. Thus this language, denoted by LI, is in some sense very natural and has in consequence special interest. Properties of LI are studied in many papers. In [BF, Chapter VI] there is a short survey of some known results about LI. We feel that a more extensive exposition (...) of these results is needed. The aim of this paper is to give an overview of the present knowledge about the language LI and list a selection of open problems concerning it. After the Introduction $(\S1)$ , in $\S\S2$ and 3 we give the fundamental results about LI. In $\S4$ the known model-theoretic properties are discussed. The next section is devoted to properties of mathematical theories in LI. In $\S6$ the spectra of sentences of LI are discussed, and $\S7$ is devoted to properties of LI which depend on set-theoretic assumptions. The paper finishes with a list of open problem and an extensive bibliography. The bibliography contains not only papers we refer to but also all papers known to us containing results about the language with Hartig quantifier. Contents. $\S1$ . Introduction. $\S2$ . Preliminaries. $\S3$ . Basic results. $\S4$ . Model-theoretic properties of $LI. \S5$ . Decidability of theories with $I. \S6$ . Spectra of LI- sentences. $\S7$ . Independence results. $\S8$ . What is not yet known about LI. Bibliography. (shrink)

We prove that the two-variable fragment of first-order logic has the weak Beth definability property. This makes the two-variable fragment a natural logic separating the weak and the strong Beth properties since it does not have the strong Beth definability property.

Though deceptively simple and plausible on the face of it, Craig's interpolation theorem has proved to be a central logical property that has been used to reveal a deep harmony between the syntax and semantics of first order logic. Craig's theorem was generalized soon after by Lyndon, with application to the characterization of first order properties preserved under homomorphism. After retracing the early history, this article is mainly devoted to a survey of subsequent generalizations and applications, especially of many-sorted interpolation (...) theorems. Attention is also paid to methodological considerations, since the Craig theorem and its generalizations were initially obtained by proof-theoretic arguments while most of the applications are model-theoretic in nature. The article concludes with the role of the interpolation property in the quest for "reasonable" logics extending first-order logic within the framework of abstract model theory. (shrink)

We prove that compactness is equivalent to the amalgamation property, provided the occurrence number of the logic is smaller than the first uncountable measurable cardinal. We also relate compactness to the existence of certain regular ultrafilters related to the logic and develop a general theory of compactness and its consequences. We also prove some combinatorial results of independent interest.

We give a condensed survey of recent research on generalized quantifiers in logic, linguistics and computer science, under the following headings: Logical definability and expressive power, Polyadic quantifiers and linguistic definability, Weak semantics and axiomatizability, Computational semantics, Quantifiers in dynamic settings, Quantifiers and modal logic, Proof theory of generalized quantifiers.