We show that if we enrich first order logic by allowing quantification over isomorphisms between definable ordered fields the resulting logic, L(Q_{Of}), is fully compact. In this logic, we can give standard compactness proofs of various results. Next, we attempt to get compactness results for some other logics without recourse to diamond, i.e., all our results are in ZFC. We get the full result for the language where we quantify over automorphisms (isomorphisms) of ordered fields in Theorem 6.4. Unfortunately we are not able to show that the language with quantification over automorphisms of Boolean algebras is compact, but will have to settle for a close relative of that logic. This is theorem 5.1. In section 4 we prove we can construct models in which all relevant automorphism are somewhat definable: 4.1, 4.8 for BA, 4.13 for ordered fields. We also give a new proof of the compactness of another logic -- the one which is obtained when a quantifier Q_{Brch} is added to first order logic which says that a level tree (definitions will be given later) has an infinite branch. This logic was previously shown to be compact, but our proof yields a somewhat stronger result and provides a nice illustration of one of our methods.
We show that the ordering of the Hanf number of L_{omega, omega}(wo) (well ordering), L^c_{omega, omega} (quantification on countable sets), L_{omega, omega}(aa) (stationary logic) and second order logic, have no more restraints provable in ZFC than previously known (those independence proofs assume CON(ZFC) only). We also get results on corresponding logics for L_{lambda, mu} .
We prove, in ZFC alone, some new results on regularity and decomposability of ultrafilters. We also list some problems, and furnish applications to topological spaces and to extended logics.
We examine what happens if we replace ZFC with a localistic/relativistic system, LZFC, whose central new axiom, denoted by $Loc({\rm ZFC})$, says that every set belongs to a transitive model of ZFC. LZFC consists of $Loc({\rm ZFC})$ plus some elementary axioms forming Basic Set Theory (BST). Some theoretical reasons for this shift of view are given. All $Π_2$ consequences of ZFC are provable in ${\rm LZFC}$. LZFC strongly extends Kripke-Platek (KP) set theory minus $Δ_0$-Collection and minus $\in$-induction scheme. ZFC+``there is an inaccessible cardinal'' proves the consistency of LZFC. In LZ…
We prove that the class of all ordinals Ord is not weakly compact with respect to definable classes. Specifically, in any model of ZFC, the definable tree property fails for Ord, in that there is a definable Ord tree with no definable cofinal branch; the definable partition property fails, in that there is a definable 2-coloring of pairs from a certain definable proper class, with no definable homogeneous proper class; and the definable compactness property fails for $\mathcal{L}_{\infty,ω}$, in that there is a definable theory in this logic all of whose set-sized subtheories are satisfiable, …
Following a recent paper by Herrlich and Tachtsis, we investigate in ZFC the following compactness question: for which unountable cardinals $κ$, an arbitrary nonempty system $S$ of homogeneous $\mathbb Z$-linear equations is nontrivially solvable in $\mathbb Z$ provided that each its nonempty subsystem of cardinality $<κ$ is nontrivially solvable in $\mathbb Z$?
We consider the modality "$φ$ is true in every $σ$-centered forcing extension", denoted $\squareφ$, and its dual "$φ$ is true in some $σ$-centered forcing extension", denoted $\lozengeφ$ (where $φ$ is a statement in set theory), which give rise to the notion of a "principle of $σ$-centered forcing". We prove that if ZFC is consistent, then the modal logic of $σ$-centered forcing, i.e. the ZFC-provable principles of $σ$-centered forcing, is exactly $\mathsf{S4.2}$. We also generalize this result to other related classes of forcing.
The Wallace problem and countably compact torsion-free Abelian groups in ZFC
Independent researcher（独立研究者）；Department of Mathematics, Institute of Mathematics, Statistics and Computer Science, University of São Paulo（圣保罗大学数学、统计与计算机科学学院）
We show that supercompactness and strong compactness can be equivalent even as properties of pairs of regular cardinals. Specifically, we show that if V models ZFC + GCH is a given model (which in interesting cases contains instances of supercompactness), then there is some cardinal and cofinality preserving generic extension V[G] models ZFC + GCH in which, (a) (preservation) for kappa <= lambda regular, if V models ``kappa is lambda supercompact'', then V[G] models ``kappa is lambda supercompact'' and so that, (b) (equivalence) for kappa <= lambda regular, V[G] models ``kappa is lambda strong…
We answer a question of Darji and Keleti by proving in $ZFC$ that there exists a compact nullset $C_0\subset\RR$ such that for every perfect set $P\subset\RR$ there exists $x\in\RR$ such that $(C_0+x)\cap P$ is uncountable. Using this $C_0$ we answer a question of Gruenhage by showing that it is consistent with $ZFC$ that less than $2^ω$ many translates of a compact nullset cover $\RR$.
We show in ZFC that the existence of completely separable maximal almost disjoint families of subsets of $ω$ implies that the modal logic S4.1.2 is complete with respect to the Čech-Stone compactification of the natural numbers, the space $βω$. In the same fashion we prove that the modal logic S4 is complete with respect to the space $ω^*=βω\setminusω$. This improves the results of G. Bezhanishvili and J. Harding who prove these theorems under stronger assumptions ($\mathfrak{a}=\mathfrak{c}$). Our proof is also somewhat simpler.
Assuming some large cardinals, a model of ZFC is obtained in which aleph_{omega+1} carries no Aronszajn trees. It is also shown that if lambda is a singular limit of strongly compact cardinals, then lambda^+ carries no Aronszajn trees.
We study three kinds of compactness in some variants of Gödel logic: compactness, entailment compactness, and approximate entailment compactness. For countable first-order underlying language we use the Henkin construction to prove the compactness property of extensions of first-order Gödel logic enriched by nullary connective or the Baaz's projection connective. In the case of uncountable first-order language we use the ultraproduct method to derive the compactness theorem
One of the nice properties of the first-order logic is the compactness of satisfiability. It state that a finitely satisfiable theory is satisfiable. However, different degrees of satisfiability in many-valued logics, poses various kind of the compactness in these logics. One of this issues is the compactness of $K$-satisfiability. Here, after an overview on the results around the compactness of satisfiability and compactness of $K$-satisfiability in many-valued logic based on continuous t-norms (basic logic), we extend the results around this topic. To this end, we consider a reverse semantic…
With the aim of developing the concepts of positive logic and in response to a question that was asked by Poizat in one of his articles, I wrote this article. The main topic is the study of compactness in the extension as a compact structure. they are based on a fundamental characterization of the compactness, which was given by Itai Ben Yacov and Poizat in section Basis of positive logic.
A condition, in two variants, is given such that if a property P satisfies this condition, then every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The result is used to prove that for a number of natural properties P speaking about automorphism groups or connectivity, every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. We also give an example of a logic that extends first-order logic, has the compactness property and can express the property "the cardinality of…
We define the concept of a logic frame, which extends the concept of an abstract logic by adding the concept of a syntax and an axiom system. In a recursive logic frame the syntax and the set of axioms are recursively coded. A recursive logic frame is called recursively (countably) compact, if every recursive (respectively, countable) finitely consistent theory has a model. We show that for logic frames built from the cardinality quantifiers ''there exists at least lambda'' recursive compactness always implies countable compactness. On the other hand we show that a recursively compact extensio…
We construct, in $\mathsf{ZFC}$, a countably compact subgroup of $2^{\mathfrak{c}}$ without non-trivial convergent sequences, answering an old problem of van Douwen. As a consequence we also prove the existence of two countably compact groups $\mathbb{G}_{0}$ and $\mathbb{G}_{1}$ such that the product $\mathbb{G}_{0} \times \mathbb{G}_{1}$ is not countably compact, thus answering a classical problem of Comfort.
We produce a model of ZFC in which there are no locally compact first countable S-spaces, and in which 2^{aleph_0}<2^{aleph_1}. A consequence of this is that in this model there are no locally compact, separable, hereditarily normal spaces of size aleph_1, answering a question of the second author.
We introduce the notion of weakly extendible cardinals and show that these cardinals are characterized in terms of weak compactness of second order logic. The consistency strength and largeness of weakly extendible cardinals are located strictly between that of strongly unfoldable (i.e. shrewd) cardinals, and strongly uplifting cardinals. Weak compactness of many other logics can be connected to certain variants of the notion of weakly extendible cardinals. We also show that, under V=L, a cardinal $κ$ is the weak compactness number of ${\cal L}^{\aleph_0,II}_{stat,κ,ω}$ if and only if it is th…
We combine continuous and integral logics and found a logical framework for metric measure spaces equipped with a family of continuous relations and operations. We prove the ultraproduct theorem and deduce compactness and other usual results. We also give applications of the compactness theorem in metric measure theory.
In this short note we compare the expressive power of real-valued continuous logic (or just continuous logic, in recent literature) with that of compact-valued continuous logic, proposed by Chang and Keisler. We conclude that the two logics have the same expressive power, and moreover, that this remains true if we replace the plethora of potential quantifiers of compact-valued logic with a single ''primordial'' one.
We give Hennessy-Milner classes for intuitionistic, dual-intuitionistic and bi-intuitionistic logic interpreted in intuitionistic Kripke models, and generalise these results to modal (dual- and bi-)intuitionistic logics. Our main technical tools are image-compact and pre-image-compact relations that provide a semantical description of modal saturation properties.
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 (kappa,kappa)-compactness property and the Lowenheim-Skolem theorem down to kappa. With an additional set-theoretic assumption, there is no strongest extension of L_{kappa,kappa} with the (kappa,kappa)-compactness property and the Lowenheim-Skolem theorem down to <kappa.
We study expressive power of continuous logic in classes of (locally compact) groups. We also describe locally compact groups which are separably categorical structures.
In this paper (propositional) probability logic ($PL$) is investigated from model theoretic point of view. First of all, the ultraproduct construction is adapted for $σ$-additive probability models, and subsequently when this class of models is considered it is shown that the compactness property holds with respect to a fragment of $PL$ called basic probability logic ($BPL$). On the other hand, when dealing with finitely-additive probability models, one may extend the compactness property for a larger fragment of probability logic, namely positive probability logic ($PPL$). We finally prove th…
As the usage of theorem prover technology expands, so too does the reliance on correctness of the tools. Metamath Zero is a verification system that aims for simplicity of logic and implementation, without compromising on efficiency of verification. It is formally specified in its own language, and supports a number of translations to and from other proof languages. This paper describes the abstract logic of Metamath Zero, essentially a multi-sorted first order logic, as well as the binary proof format and the way in which it can ensure essentially linear time verification while still being co…
We extend to singular cardinals the model-theoretical relation $λ\stackrelκ{\Rightarrow} μ$ introduced in P. Lipparini, The compactness spectrum of abstract logics, large cardinals and combinatorial principles, Boll. Unione Matematica Italiana ser. VII, {\bf 4-B} 875--903 (1990). We extend some results obtained in Part II, finding equivalent conditions involving uniformity of ultrafilters and the existence of certain infinite matrices. Our present definition suggests a new compactness property for abstract logics.
We extend Łukasiewicz logic obtaining the infinitary logic $\mathcal{IR}Ł$ whose models are algebras $C(X,[0,1])$, where $X$ is a basically disconnected compact Hausdorff space. Equivalently, our models are unit intervals in $σ$-complete Riesz spaces with strong unit. The Lindenbaum-Tarski algebra of $\mathcal{IR}Ł$ is, up to isomorphism, an algebra of $[0,1]$-valued Borel functions. Finally, our system enjoys standard completeness with respect to the real interval $[0,1]$.
We study the complexity of isomorphism of classes of metric structures using methods from infinitary continuous logic. For Borel classes of locally compact structures, we prove that if the equivalence relation of isomorphism is potentially $\mathbfΣ^0_2$, then it is essentially countable. We also provide an equivalent model-theoretic condition that is easy to check in practice. This theorem is a common generalization of a result of Hjorth about pseudo-connected metric spaces and a result of Hjorth--Kechris about discrete structures. As a different application, we also give a new proof of Kechr…
In the the present contribution, we prove an Omitting Types Theorem (OTT) for an arbitrary fragment of hybriddynamic first-order logic with rigid symbols (i.e. symbols with fixed interpretations across worlds) closed under negation and retrieve. The logical framework can be regarded as a parameter and it is instantiated by some well-known hybrid and/or dynamic logics from the literature. We develop a forcing technique and then we study a forcing property based on local satisfiability, which lead to a refined proof of the OTT. For uncountable signatures, the result requires compactness, while f…
We consider compactness characterizations of large cardinals. Based on results of Benda \cite{b-sccomp}, we study compactness for omitting types in various logics. In $\bL_{κ, κ}$, this allows us to characterize any large cardinal defined in terms of normal ultrafilters, and we also analyze second-order and sort logic. In particular, we give a compactness for omitting types characterization of huge cardinals, which have consistency strength beyond Vopěnka's Principle.
Riesz representation theorem, Daniell-Stone theorem for Daniell integrals and Stone's representation theorem for probability and measure algebras are three important classical results in analysis concerning existence of measures with certain properties. Many proofs of these theorems can be found in the literature of analysis, from elementary ones which use ordinary techniques from measure theory, to more sophisticated ones, such as those employing techniques from nonstandard analysis, in particular for Riesz representation theorem. In this paper, as the first goal, we give new proofs for all t…
We characterise non-distributive positive logic as the fragment of a single-sorted first-order language that is preserved by a new notion of simulation called a meet-simulation. Meet-simulations distinguish themselves from simulations because they relate pairs of states from one model to single states from another. En route to this result we use a more traditional notion of simulations and prove a Hennessy-Milner style theorem for it, using an analogue of modal saturation called meet-compactness.
