We prove that every weakly square compact cardinal is a strong limit cardinal, and therefore weakly compact. We also study Aronszajn trees with no uncountable finitely splitting subtrees, characterizing them in terms of being Lindelöf with respect to a particular topology. We prove that the class of such trees is consistently non-empty and lies between the classes of Suslin and Aronszajn trees.

The Compactness Theorem The compactness theorem is a fundamental theorem for the model theory of classical propositional and first-order logic. As well as having importance in several areas of mathematics, such as algebra and combinatorics, it also helps to pinpoint the strength of these logics, which are the standard ones used in mathematics and arguably … Continue reading Compactness →.

We give a systematic technical exposition of the foundations of the theory of computably compact metric spaces. We discover several new characterizations of computable compactness and apply these characterizations to prove new results in computable analysis and effective topology. We also apply the technique of computable compactness to give new and less combinatorially involved proofs of known results from the literature. Some of these results do not have computable compactness or compact spaces in their statements, and thus (...) these applications are not necessarily direct or expected. (shrink)

Judea Pearl (2000) was the first to propose a definition of actual causation using causal models. A number of authors have suggested that an adequate account of actual causation must appeal not only to causal structure but also to considerations of normality. In Halpern and Hitchcock (2011), we offer a definition of actual causation using extended causal models, which include information about both causal structure and normality. Extended causal models are potentially very complex. In this study, we show how it (...) is possible to achieve a compact representation of extended causal models. (shrink)

We prove the Compact Domination Conjecture for groups definable in linear o-minimal structures. Namely, we show that every definably compact group G definable in a saturated linear o-minimal expansion of an ordered group is compactly dominated by (G/G 00, m, π), where m is the Haar measure on G/G 00 and π : G → G/G 00 is the canonical group homomorphism.

Lascar described E KP as a composition of E L and the topological closure of E L (Casanovas et al. in J Math Log 1(2):305–319). We generalize this result to some other pairs of equivalence relations. Motivated by an attempt to construct a new example of a non-G-compact theory, we consider the following example. Assume G is a group definable in a structure M. We define a structure M′ consisting of M and X as two sorts, where X is an (...) affine copy of G and in M′ we have the structure of M and the action of G on X. We prove that the Lascar group of M′ is a semi-direct product of the Lascar group of M and G/G L . We discuss the relationship between G-compactness of M and M′. This example may yield new examples of non-G-compact theories. (shrink)

Let M be an o-minimal expansion of a real closed field. Let G be a definably compact definably connected abelian n-dimensional group definable in M. We show the following: the o-minimal fundamental group of G is isomorphic to ℤn; for each k>0, the k-torsion subgroup of G is isomorphic to n, and the o-minimal cohomology algebra over ℚ of G is isomorphic to the exterior algebra over ℚ with n generators of degree one.

We introduce and study the framework of compact metric structures and their associated notions of isomorphisms such as homeomorphic and bi-Lipschitz isomorphism. This is subsequently applied to model various classification problems in analysis such as isomorphism ofC*-algebras and affine homeomorphism of Choquet simplices, where among other things we provide a simple proof of the completeness of the isomorphism relation of separable, simple, nuclearC*-algebras recently established by M. Sabok.

A structure which generalizes formulas by including substitution terms is used to represent proofs in classical logic. These structures, called expansion trees, can be most easily understood as describing a tautologous substitution instance of a theorem. They also provide a computationally useful representation of classical proofs as first-class values. As values they are compact and can easily be manipulated and transformed. For example, we present an explicit transformations between expansion tree proofs and cut-free sequential proofs. A theorem prover which represents (...) proofs using expansion trees can use this transformation to present its proofs in more human-readable form. Also a very simple computation on expansion trees can transform them into Craig-style linear reasoning and into interpolants when they exist. We have chosen a sublogic of the Simple Theory of Types for our classical logic because it elegantly represents substitutions at all finite types through the use of the typed -calculus. Since all the proof-theoretic results we shall study depend heavily on properties of substitutions, using this logic has allowed us to strengthen and extend prior results: we are able to prove a strengthen form of the firstorder interpolation theorem as well as provide a correct description of Skolem functions and the Herbrand Universe. The latter are not straightforward generalization of their first-order definitions. (shrink)

How are the various classically equivalent definitions of compactness for metric spaces constructively interrelated? This question is addressed with Bishop-style constructive mathematics as the basic system – that is, the underlying logic is the intuitionistic one enriched with the principle of dependent choices. Besides surveying today's knowledge, the consequences and equivalents of several sequential notions of compactness are investigated. For instance, we establish the perhaps unexpected constructive implication that every sequentially compact separable metric space is totally bounded. As (...) a by-product, the fan theorem for detachable bars of the complete binary fan proves to be necessary for the unit interval possessing the Heine-Borel property for coverings by countably many possibly empty open balls. (shrink)

Working within the framework of Bishop's constructive mathematics, we will show that it is possible to define compactness in a more general setting than that of uniform spaces. It is also shown that it is not possible to do this in a topological space.

The concept of neutrosophic locally compact and neutrosophic compact open topology are introduced and some interesting propositions are discussed.

The United Nations Global Compact (UNGC) was created in 2000 to leverage UN prestige and induce corporations to embrace 10 principles incorporating values of environmental sustainability, protection of human rights, fair treatment of workers, and elimination of bribery and corruption. We review and analyze the GC’s activities and impact in enhancing corporate social responsibility since inception. First, we propose an analytical framework which allows us to assess the qualities of the UNGC and its principles in the context of external and (...) internal elements that influence code effectiveness and implementation. Second, we analyze UNGC performance in encouraging companies to become signatory members and bring about demonstrable change in corporate CSR-sustainability activities. In its 10-year report, UNGC has proclaimed growth in both membership and program activity. However, all credible and publicly available data and documentation conclusively demonstrate that the UNGC has failed to induce its signatory companies to enhance their CSR efforts and integrate the 10 principles in their policies and operations. The result has been a loss of public trust and support of UNGC from important constituencies among civil society organizations, and those individuals and groups adversely impacted by corporate activities and resultant negative externalities. This diminished credibility has also made UNGC largely dependent on the corporate sector for its very survival. We conclude that this dependence has in turn impaired and would continue to hinder UNGC’s ability to fulfill its mission. Such an outcome raises serious questions as to the viability, usefulness, and continued existence of UNGC. (shrink)

It is shown that for compact metric spaces the following statements are pairwise equivalent: “X is Loeb”, “X is separable”, “X has a we ordered dense subset”, “X is second countable”, and “X has a dense set G = ∪{Gn : n ∈ ω}, ∣Gn∣ < ω, with limn→∞ diam = 0”. Further, it is shown that the statement: “Compact metric spaces are weakly Loeb” is not provable in ZF0 , the Zermelo-Fraenkel set theory without the axiom of regularity, and (...) that the countable axiom of choice for families of finite sets CACfin does not imply the statement “Compact metric spaces are separable”. (shrink)

Two new notions of compactness, each classically equivalent to the standard classical one of sequential compactness, for apartness spaces are examined within Bishop-style constructive mathematics.

We show that compactness is preserved by arbitrary direct products of lattices of truth values and that the Löwenheim-Skolem property is preserved by finite direct products of lattices of truth values.

The Compactness Theorem The compactness theorem is a fundamental theorem for the model theory of classical propositional and first-order logic. As well as having importance in several areas of mathematics, such as algebra and combinatorics, it also helps to pinpoint the strength of these logics, which are the standard ones used in mathematics and arguably … Continue reading Compactness Theorem →.

If a locale is presented by a “flat site”, it is shown how its frame can be presented by generators and relations as a dcpo. A necessary and sufficient condition is derived for compactness of the locale . Although its derivation uses impredicative constructions, it is also shown predicatively using the inductive generation of formal topologies. A predicative proof of the binary Tychonoff theorem is given, including a characterization of the finite covers of the product by basic opens. The (...) discussion is then related to the double powerlocale. (shrink)

Entailment in propositional Gödel logics can be defined in a natural way. While all infinite sets of truth values yield the same sets of tautologies, the entailment relations differ. It is shown that there is a rich structure of infinite-valued Gödel logics, only one of which is compact. It is also shown that the compact infinite-valued Gödel logic is the only one which interpolates, and the only one with an r.e. entailment relation.

In this paper we define sheaf spaces of BL-algebras (or BL-sheaf spaces), we study completely regular and compact BL-sheaf spaces and compact representations of BL-algebras and, finally, we prove that the category of non-trivial BL-algebras is equivalent with the category of compact local BL-sheaf spaces.

This paper explores several topics related to Woodin’s HOD conjecture. We improve the large cardinal hypothesis of Woodin’s HOD dichotomy theorem from an extendible cardinal to a strongly compact cardinal. We show that assuming there is a strongly compact cardinal and the HOD hypothesis holds, there is no elementary embedding from HOD to HOD, settling a question of Woodin. We show that the HOD hypothesis is equivalent to a uniqueness property of elementary embeddings of levels of the cumulative hierarchy. We (...) prove that the HOD hypothesis holds if and only if every regular cardinal above the first strongly compact cardinal carries an ordinal definable [Formula: see text]-Jónsson algebra. We show that if the HOD hypothesis holds and HOD satisfies the Ultrapower Axiom, then every supercompact cardinal is supercompact in HOD. (shrink)

대도시에서 발생하는 문제들을 해결하기 위해 스마트시티가 미래도시의 모델로 추동되고 있다. 지능형 융합기술에 기반 한 스마트시티는 인문적 가치를 상실하지 않기 위해 편리성, 경제성의 가치 넘어 거주 공동체의 감성적, 공공적 가치를 창출해야 한다. 따라서 본 논문은 프랑스 대도시들에서 실현되고 있는 시간정책과 파리 15구에 위치한 이씨 레 물리뇨(Issy Les Moulineaux)의 첫 친환경 스마트 시범지구인 포르디씨(Fort d.

Journal of Mathematical Logic, Volume 22, Issue 02, August 2022. The Ultrapower Axiom is a combinatorial principle concerning the structure of large cardinals that is true in all known canonical inner models of set theory. A longstanding test question for inner model theory is the equiconsistency of strongly compact and supercompact cardinals. In this paper, it is shown that under the Ultrapower Axiom, the least strongly compact cardinal is supercompact. A number of stronger results are established, setting the stage for (...) a complete analysis of strong compactness and supercompactness under UA that will be carried out in the sequel to this paper. (shrink)

A characterization of groups definable in o-minimal structures having maximal definable definably compact subgroups is given. This follows from a definable decomposition in analogy with Lie groups, where the role of maximal tori is played by maximal 0-subgroups. Along the way we give structural theorems for solvable groups, linear groups, and extensions of definably compact by torsion-free definable groups.

We establish the consistency of the failure of the diamond principle on a cardinal [Formula: see text] which satisfies a strong simultaneous reflection property. The result is based on an analysis of Radin forcing, and further leads to a characterization of weak compactness of [Formula: see text] in a Radin generic extension.

In this dissertation we explore projective Fraïssé theory and its applications, as well as limitations, to the study of compact metrizable spaces. The goal of projective Fraïssé theory is to approximate spaces via classes of finite structures and glean topological or dynamical properties of a space by relating them to combinatorial features of the associated class of structures. Using the framework of compact metrixable structures, we establish general results which expand and help contextualize previous works in the field. Many proofs (...) in the domain of projective Fraïssé theory are carried out in a context dependent fashion and have thus far eluded clean generalizations. A reason is to be found in the lack of a clear understanding of which spaces are amenable to be studied via projective Fraïssé limits. We give both positive and negative results in this direction. We isolate a combinatorial condition which entails a correspondence between finite structures and regular quasi-partitions of compact metrizable spaces. This correspondence greatly aids the combinatorial-toplogical translation. We apply this machinery to study a class of one-dimensional compact metrizable spaces, which we call smooth fences. To this end, we isolate a class of finite structures—finite partial orders whose Hasse diagram is a forest—whose projective Fraïssé limit approximates a distinctive smooth fence with remarkable properties. We call it the Fraïssé fence and characterize it topologically by carefully exploiting the bridge between the combinatorial and topological worlds. We explore homogeneity and universality features of the Fraïssé fence and the properties of its spaces and endpoints, and provide some results on the dynamics of its group of homeomorphisms. The dissertation is partially based on [1, 2]. (shrink)

Compact set valued iterations generalize classical point iterations quite naturally by replacing the function f with a tube f in the discrete iterations equation. In Section 3, some bifurcation results about logistic tube iterations are given. In Section 4, an analogous dynamical behaviour for the phase response tube involved in the entrainment of the respiratory rhythm is studied.

We show that for every we ordered cardinal number m the Tychonoff product 2m is a compact space without the use of any choice but in Cohen's Second Mode 2ℝ is not compact.

For a subset K ⊆ [0, 1], the notion of K-satisfiability is a generalization of the usual satisfiability in first order fuzzy logics. A set Γ of closed formulas in a first order language τ is K-satisfiable, if there exists a τ-structure such that ∥ σ ∥ ∈ K, for any σ ∈ Γ. As a consequence, the usual compactness property can be replaced by the K-compactness property. In this paper, the K-compactness property for Łukasiewicz first order (...) logic is investigated. Using the ultraproduct construction, it is proved that for any closed subset K and set Γ of closed formulas, Γ is K-satisfiable if and only if it is finitely K-satisfiable. (shrink)

Though regarded today as one of the most important results in logic, the compactness theorem was largely ignored until nearly two decades after its discovery. This paper describes the vicissitudes of its evolution and transformation during the period 1930-1970, with special attention to the roles of Kurt Gödel, A. I. Maltsev, Leon Henkin, Abraham Robinson, and Alfred Tarski.

We generalize a theorem of Mundici relating compactness of a regular logic L to a strong form of normality of the associated spaces of models. Moreover, it is shown that compactness is in fact equivalent to ordinary normality of the model spaces when L has uniform reduction for infinite disjoint sums of structures. Some applications follow. For example, a countably generated logic is countably compact if and only if every clopen class in the model spaces is elementary. The (...) model spaces of L are not normal for vocabularies of uncountable power ωα. It also follows that first-order logic is the only finite-dependence logic having normal model spaces and satisfying at the same time the downward Löwenheim-Skolem theorem and uniform reduction for pairs. (shrink)

We point out that a certain complex compact manifold constructed by Lieberman has the dimensional order property, and has U-rank different from Morley rank. We also give a sufficient condition for a Kahler manifold to be totally degenerate (that is, to be an indiscernible set, in its canonical language) and point out that there are K3 surfaces which satisfy these conditions.

In the categorical approach to the foundations of quantum theory, one begins with a symmetric monoidal category, the objects of which represent physical systems, and the morphisms of which represent physical processes. Usually, this category is taken to be at least compact closed, and more often, dagger compact, enforcing a certain self-duality, whereby preparation processes (roughly, states) are interconvertible with processes of registration (roughly, measurement outcomes). This is in contrast to the more concrete “operational” approach, in which the states and (...) measurement outcomes associated with a physical system are represented in terms of what we here call a convex operational model: a certain dual pair of ordered linear spaces–generally, not isomorphic to one another. On the other hand, state spaces for which there is such an isomorphism, which we term weakly self-dual, play an important role in reconstructions of various quantum-information theoretic protocols, including teleportation and ensemble steering. In this paper, we characterize compact closure of symmetric monoidal categories of convex operational models in two ways: as a statement about the existence of teleportation protocols, and as the principle that every process allowed by that theory can be realized as an instance of a remote evaluation protocol—hence, as a form of classical probabilistic conditioning. In a large class of cases, which includes both the classical and quantum cases, the relevant compact closed categories are degenerate, in the weak sense that every object is its own dual. We characterize the dagger-compactness of such a category (with respect to the natural adjoint) in terms of the existence, for each system, of a symmetric bipartite state, the associated conditioning map of which is an isomorphism. (shrink)

If [Formula: see text] is regular and [Formula: see text], then the existence of a weakly presaturated ideal on [Formula: see text] implies [Formula: see text]. This partially answers a question of Foreman and Magidor about the approachability ideal on [Formula: see text]. As a corollary, we show that if there is a presaturated ideal [Formula: see text] on [Formula: see text] such that [Formula: see text] is semiproper, then CH holds. We also show some barriers to getting the tree (...) property and a saturated ideal simultaneously on a successor cardinal from conventional forcing methods. (shrink)

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. (...) The basic idea underlying the results and examples presented here is that it is possible to construct a countable first-order theory T such that every model of T has a very rich automorphism group, but every finite subset T′ of T has a model which is rigid. (shrink)

We say that a Hausdorff locale is compactly generated if it is the colimit of the diagram of its compact sublocales connected by inclusions. We show that this is the case if and only if the natural map of its frame of opens into the second Lawson dual is an isomorphism. More generally, for any Hausdorff locale, the second dual of the frame of opens gives the frame of opens of the colimit. In order to arrive at this conclusion, we (...) generalize the Hofmann–Mislove–Johnstone theorem and some results regarding the patch construction for stably locally compact locales. (shrink)

N´emeti remarked that the notion of compactness of cylindric of algebras corresponds to the notion of universality of models in logic [5]. The purpose of this paper is to formulate this correspondence in a purely algebraic setting.

We investigate the interaction between compactness principles and guessing principles in the Radin forcing extensions. In particular, we show that in any Radin forcing extension with respect to a measure sequence on [Formula: see text], if [Formula: see text] is weakly compact, then [Formula: see text] holds. This provides contrast with a well-known theorem of Woodin, who showed that in a certain Radin extension over a suitably prepared ground model relative to the existence of large cardinals, the diamond principle (...) fails at a strongly inaccessible Mahlo cardinal. Refining the analysis of the Radin extensions, we consistently demonstrate a scenario where a compactness principle, stronger than the diagonal stationary reflection principle, holds yet the diamond principle fails at a strongly inaccessible cardinal, improving a result from [O. B. -Neria, Diamonds, compactness, and measure sequences, J. Math. Log. 19(1) (2019) 1950002]. (shrink)

We prove a structure theorem for compact inverse categories. The Ehresmann-Schein-Nambooripad theorem gives a structure theorem for inverse monoids: they are inductive groupoids. A particularly nice case due to Clifford is that commutative inverse monoids become semilattices of abelian groups. It has also been categorified by Hoehnke and DeWolf-Pronk to a structure theorem for inverse categories as locally complete inductive groupoids. We show that in the case of compact inverse categories, this takes the particularly nice form of a semilattice of (...) compact groupoids. Moreover, one-object compact inverse categories are exactly commutative inverse monoids. Compact groupoids, in turn, are determined in particularly simple terms of 3-cocycles by Baez-Lauda. (shrink)

The concept of compactness is a necessary condition of any system that is going to call itself a finitary method of proof. However, it can also apply to predicates of sets of formulas in general and in that manner it can be used in relation to level functions, a flavor of measure functions. In what follows we will tie these concepts of measure and compactness together and expand some concepts which appear in d'Entremont's master's thesis, "Inference and Level." (...) We will also provide some applications of the concept of level to the "preservationist" program of paraconsistent logic. We apply the finite level compactness theorem in this paper to get a Lindenbaum flavor extension lemma and a maximal "forcibility" theorem. Each of these is based on an abstract deductive system X which satisfies minimal conditions of inference and has generalizations of 'and' and 'not' as logical words. (shrink)

Compact quantum systems have underlying compact kinematical Lie algebras, in contrast to familiar noncompact quantum systems built on the Weyl-Heisenberg algebra. Pauli asked in the latter case: to what extent does knowledge of the probability distributions in coordinate and momentum space determine the state vector? The analogous question for compact quantum systems is raised, and some preliminary results are obtained.

In this paper, we discuss some questions about compactness in MV-topological spaces. More precisely, we first present a Tychonoff theorem for such a class of fuzzy topological spaces and some consequence of this result, among which, for example, the existence of products in the category of Stone MV-spaces and, consequently, of coproducts in the one of limit cut complete MV-algebras. Then we show that our Tychonoff theorem is equivalent, in ZF, to the Axiom of Choice, classical Tychonoff theorem, and (...) Lowen’s analogous result for lattice-valued fuzzy topology. Last, we show an extension of the Stone–Čech compactification functor to the category of MV-topological spaces, and we discuss its relationship with previous works on compactification for fuzzy topological spaces. (shrink)