Related papers: Tameness for set theory $I$

As the second part of the treatise 'A General Theory of Concept Lattice', this paper speaks of the tractability of the general concept lattice for both its lattice structure and logic content. The general concept lattice permits a feasible…

We investigate an extension of ZFC set theory (in an extended language) that stipulates the existence of a proper class of indiscernibles over the universe. One of the main results of the paper shows that the purely set-theoretical…

We show that the notions of generic and Laver-generic supercompactness are first-order definable in the language of ZFC. This also holds for generic and Laver-generic (almost) hugeness as well as for generic versions of other large…

In this paper we establish a general framework in which the verification of support theorems for generalized convex functions acting between an algebraic structure and an ordered algebraic structure is still possible. As for the domain…

We study the cardinality of classes of equational theories (varieties) and logics by applying descriptive set theory. We affirmatively solve open problems raised by Jackson and Lee [Trans. Am. Math. Soc. 370 (2018), pp. 4785-4812] regarding…

We study the model-checking problem for first- and monadic second-order logic on finite relational structures. The problem of verifying whether a formula of these logics is true on a given structure is considered intractable in general, but…

Kikyo and Shelah showed that if $T$ is a theory with the Strict Order Property in some first-order language $\mathcal{L}$, then in the expanded language $\mathcal{L}_\sigma := \mathcal{L}\cup\{\sigma\}$ with a new unary function symbol…

Throughout, $T$ denotes a complete first-order theory in a countable language $L$ that has infinite models and $I(\aleph_0,T)$ denotes the number of countable models of $T$, up to an isomorphism. To determine $I(\aleph_0,T)$, it suffices to…

We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…

Let P be the direct product of countably many copies of the additive group Z of integers. We study, from a set-theoretic point of view, those subgroups of P for which all homomorphisms to Z annihilate all but finitely many of the standard…

Let $Z_3$ denote $3^{rd}$ order arithmetic. Let Harrington's Principle, HP, denote the statement that there is a real $x$ such that every $x$--admissible ordinal is a cardinal in $L$. In this paper, assuming there exists a remarkable…

We introduce a generalized notion of finiteness that provides a structural principle for the set of effective theories that can be consistently coupled to quantum gravity. More concretely, we propose a Tameness Conjecture that states that…

The main theorem of this article is that every countable model of set theory M, including every well-founded model, is isomorphic to a submodel of its own constructible universe. In other words, there is an embedding $j:M\to L^M$ that is…

In is paper we present a labelled tableau proof system that serves a wide class of interpretability logics. The system is proved sound and complete for any interpretability logic characterised by a frame condition given by a set of…

The main purpose of this paper is to present a new and more uniform model-theoretic/combinatorial proof of the theorem ([5]): The randomization $T^{R}$ of a complete first-order theory $T$ with $NIP$ is a (complete) first-order continuous…

We present a system of axioms motivated by a topological intuition: The set of subsets of any set is a topology on that set. On the one hand, this system is a common weakening of Zermelo-Fraenkel set theory ZF, the positive set theory GPK…

We deal with the complex issue of whether large cardinals are intrinsically justified principles of set theory (we call this the Intrinsicness Issue). In order to do this, we review, in a systematic fashion, (1.) the abstract principles…

We consider several ways of decomposing models into parts of bounded size forming a congruence over a base, and show that admitting any such decomposition is equivalent to mutual algebraicity at the level of theories. We also show that a…

We prove that a universal class categorical in a high-enough cardinal is categorical on a tail of cardinals. As opposed to other results in the literature, we work in ZFC, do not require the categoricity cardinal to be a successor, do not…

A pointwise definable model is one in which every object is definable without parameters. In a model of set theory, this property strengthens V=HOD, but is not first-order expressible. Nevertheless, if ZFC is consistent, then there are…