Related papers: Model theory of class-sized logics
Given a multiplicatively closed subset $S$ of the integers, there exist Structure Theorems for $LC$ modules over the localization $\mathbb{Z}S^{-1}$ that are "similar" to those of $LCA$ groups. The most notable one is the 1st Theorem: Given…
Assuming the consistency of ZFC with appropriate large cardinal axioms we produce a model of ZFC where $\aleph_\omega$ is a strong limit cardinal and the inner model $L(\mathcal{P}(\aleph_\omega))$ satisfies the following properties: (1)…
We compare finiteness properties of locally compact groups that generalize the properties of being compactly generated and of being compactly presented. Three such families of properties have been proposed: Abels--Tiemeyer's type $C_n$,…
Over the past two decades several fragments of first-order logic have been identified and shown to have good computational and algorithmic properties, to a great extent as a result of appropriately describing the image of the standard…
We give a brief survey on the interplay between forcing axioms and various other non-constructive principles widely used in many fields of abstract mathematics, such as the axiom of choice and Baire's category theorem. First of all we…
We extend to singular cardinals the model-theoretical relation $\lambda \stackrel{\kappa}{\Rightarrow} \mu$ introduced in P. Lipparini, The compactness spectrum of abstract logics, large cardinals and combinatorial principles, Boll. Unione…
We introduce "$n$-choiceless" supercompact and extendible cardinals in Zermelo-Fraenkel set theory without the Axiom of Choice. We prove relations between these cardinals and Vop\v{e}nka's Principle similar to those of Bagaria's work in his…
We point out a gap in Shelah's proof of the following result: $\mathbf{Claim}$ Let $K$ be an abstract elementary class categorical in unboundedly many cardinals. Then there exists a cardinal $\lambda$ such that whenever $M, N \in K$ have…
A forcing extension may create new isomorphisms between two models of a first order theory. Certain model theoretic constraints on the theory and other constraints on the forcing can prevent this pathology. A countable first order theory is…
We prove a compact embedding theorem in a class of spaces of piecewise H1 functions subordinated to a class of shape regular, but not necessarily quasi-uniform triangulations of a polygonal domain. This result generalizes the…
Hilbert's Entscheidungsproblem has given rise to a broad and productive line of research in mathematical logic, where the classification process of decidable classes of first-order sentences represent only one of the remarkable results.…
We study rigidity properties of linearly ordered sets (chains) under automorphisms, order-embeddings, epimorphisms, and endomorphisms. We focus on two main cases, dense subchains of the real numbers, and uncountable dense chains of higher…
Stable infiniteness, strong finite witnessability, and smoothness are model-theoretic properties relevant to theory combination in satisfiability modulo theories. Theories that are strongly finitely witnessable and smooth are called…
We show that a strong form of the so called Lindstrom's Theorem fails to generalize to extensions of L_{kappa,omega} and L_{kappa,kappa}: For weakly compact kappa there is no strongest extension of L_{kappa,omega} with the…
Model theoretic results such as Characterization and Definability give important information about different logics. It is well known that the proofs of those results for several modal logics have, somehow, the same 'taste'. A general proof…
The approximation classes of modules that arise as components of cotorsion pairs are tied up by Salce's duality. Here we consider general approximation classes of modules and investigate possibilities of dualization in dependence on closure…
We prove a compactness theorem for pseudopower operations of the form $pp_{\Gamma(\mu,\sigma)}(\mu)$ where $\aleph_0<\sigma=cf(\sigma)\leq cf(\mu)$. Our main tool is a result that has Shelah's cov vs. pp Theorem as a consequence. We also…
The paper continues the line of model-theoretic characterizations for versions of intuitionistic logic previously achieved by the author, further generalizing them. This results in a model-theoretic characterization of expressive powers of…
We study the expressive power of the two-variable fragment of order-invariant first-order logic. This logic departs from first-order logic in two ways: first, formulas are only allowed to quantify over two variables. Second, formulas can…
Hamkins and L\"{o}we asked whether there can be a model $N$ of set theory with the property that $N\equiv N[g]$ whenever $g$ is a generic collapse of a cardinal of $N$ onto $\omega$. We give equiconsistency results for two weaker versions…