Grammar can be formulated as a kind of substructural propositional logic. In support of this claim, we survey bare Gentzen style deductive systems and two kinds of non-commutative linear logic: intuitionistic and compact bilinear logic. We also glance at their categorical refinements.

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 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)

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)

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)

The aim of the present paper is to analyse compactness properties of nonmonotonic inference operations within the framework of model theory. For this purpose the concepts of a deductive frame and its semantical counterpart, a semantical frame are introduced. Compactness properties play a fundamental in the study of non-monotonic inference, and in the paper several new versions of compactness are studied.

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)

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)

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 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.

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 →.

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.

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)

Combining techniques of the first author and Shelah with ideas of Magidor, we show how to get a model in which, for fixed but arbitrary finite n, the first n strongly compact cardinals κ 1 ,..., κ n are so that κ i for i = 1,..., n is both the i th measurable cardinal and κ + i supercompact. This generalizes an unpublished theorem of Magidor and answers a question of Apter and Shelah.

Given a space in an elementary submodel M of H, define XM to be X∩M with the topology generated by . It is established, using anti-large-cardinals assumptions, that if XM is compact and its regular open algebra is isomorphic to that of a continuous image of some power of the two-point discrete space, then X=XM. Assuming in addition, the result holds for any compact XM satisfying the countable chain condition.

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)

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.

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.

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.

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.

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)

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)

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.

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

We develop some parts of the theory of compact operators from the point of view of computable analysis. While computable compact operators on Hilbert spaces are easy to understand, it turns out that these operators on Banach spaces are harder to handle. Classically, the theory of compact operators on Banach spaces is developed with the help of the non-constructive tool of sequential compactness. We demonstrate that a substantial amount of this theory can be developed computably on Banach (...) spaces with computable Schauder bases that are well-behaved. The conditions imposed on the bases are such that they generalize the Hilbert space case. In particular, we prove that the space of compact operators on Banach spaces with monotone, computably shrinking, and computable bases is a computable Banach space itself and operations such as composition with bounded linear operators from left are computable. Moreover, we provide a computable version of the Theorem of Schauder on adjoints in this framework and we discuss a non-uniform result on composition with bounded linear operators from right. (shrink)

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)

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 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 author focuses attention on some of the historical antecedents of the United Nations Global Compact. Developments such as the Global Compact do not arrive “whole cloth” but require people and institutions to be in a “state of readiness” for the idea. The article discusses Secretary-General Annan’s challenge to action, the historical background of three stages of corporate social responsibility, and the future of global corporate responsibility.

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.

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.

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.

In this paper we construct a continuum of logics, extensions of the modal logic T2 = KTB ⊕ □2p → □3p, which are non-compact and hence Kripke incomplete.

In this paper, we deal with compact operators on a Hilbert space, within the framework of Bishop's constructive mathematics. We characterize the compactness of a bounded linear mapping of a Hilbert space into C n , and prove the theorems: Let A and B be compact operators on a Hilbert space H , let C be an operator on H and let α ϵ C . Then α A is compact, A + B is compact, A (...) ∗ is compact, CA is compact and if C ∗ exists, then AC is compact; An operator on a Hilbert space has an adjoint if and only if it is weakly compact. (shrink)

Starting with a model in which κ is the least inaccessible limit of cardinals δ which are δ+ strongly compact, we force and construct a model in which κ remains inaccessible and in which, for every cardinal γ < κ, □γ+ω fails but □γ+ω, ω holds. This generalizes a result of Ben-David and Magidor and provides an analogue in the context of strong compactness to a result of the author and Cummings in the context of supercompactness.

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 show the consistency, relative to the appropriate supercompactness or strong compactness assumptions, of the existence of a non-supercompact strongly compact cardinal $\kappa _0$ (the least measurable cardinal) exhibiting properties which are impossible when $\kappa _0$ is supercompact. In particular, we construct models in which $\square _{\kappa ^+}$ holds for every inaccessible cardinal $\kappa $ except $\kappa _0$, GCH fails at every inaccessible cardinal except $\kappa _0$, and $\kappa _0$ is less than the least Woodin cardinal.

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)

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)

In landscape ecology spatial descriptors (or indices) can be used to characterize habitats. Some of these descriptors can be used for habitat's ranking; this ranking is very important for conservation purposes. We would like to show that two traditional descriptors, namely the compactness and interior-to-edge ratio can give contradictory results. Being the second one is a more relevant descriptor, we would like to propose to avoid the further use the compactness in habitat's ranking.

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)

In [16], Peterzil and Steinhorn proved that if a group G definable in an o-minimal structure is not definably compact, then G contains a definable torsion-free subgroup of dimension 1. We prove here a p-adic analogue of the Peterzil–Steinhorn theorem, in the special case of abelian groups. Let G be an abelian group definable in a p-adically closed field M. If G is not definably compact then there is a definable subgroup H of dimension 1 which is not (...) definably compact. In a future paper we will generalize this to non-abelian G. (shrink)

For n<ω, we say that theΠn1-reflection principle holds at κ and write Refln if and only if κ is a Πn1-indescribable cardinal and every Πn1-indescribable subset of κ has a Πn1-indescribable proper initial segment. The Πn1-reflection principle Refln generalizes a certain stationary reflection principle and implies that κ is Πn1-indescribable of order ω. We define a forcing which shows that the converse of this implication can be false in the case n=1; that is, we show that κ being Π11-indescribable of (...) order ω need not imply Refl1. Moreover, we prove that if κ is -weakly compact where α<κ+, then there is a forcing extension in which there is a weakly compact set W⊆κ having no weakly compact proper initial segment, the class of weakly compact cardinals is preserved and κ remains -weakly compact. We also formulate several open problems and highlight places in which standard arguments seem to break down. (shrink)

This communication deals with positive model theory, a non first order model theoretic setting which preserves compactness at the cost of giving up negation. Positive model theory deals transparently with hyperimaginaries, and accommodates various analytic structures which defy direct first order treatment. We describe the development of simplicity theory in this setting, and an application to the lovely pairs of models of simple theories without the weak non finite cover property.

In this paper, the Executive Head of the Global Compact shares some of his own reflections on the evolution of the Global Compact initiative – United Nations Secretary-General Kofi Annan’s voluntary corporate citizenship initiative in the area of human rights, labor, the environment and anti-corruption. Two main themes are addressed. The first considers the Global Compact’s institutional context, examining how such an initiative is even possible in the historically hierarchical and traditionally business-unfriendly UN. The second concerns the (...) voluntary nature of the initiative and how it interacts with regulatory approaches. It explains what the Global Compact has to offer as a voluntary initiative, as well as how it can make a unique and complementary contribution to regulation-backed initiatives. The paper concludes with a brief consideration of what the future holds for the Global Compact. (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 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)

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 →.