Different versions of a first countable space without choice

We show that two versions of a first countable topological space which are equivalent in ZFC set theory split in the absence of the Axiom of Choice AC. This answers in the negative a related question from Gutierres “What is a first countable space?”.     

Canonical subbase-compactness of topological products

For topological products the concept of canonical subbase-compactness is introduced, and the question analyzed under what conditions such products are canonically subbase-compact in ZF-set theory.Results: (1) Products of finite spaces are canonically subbase-compact iff AC(fin), the axiom of choice for finite sets, holds.(2) Products of n-element spaces are canonically subbase-compact iff AC(<n), the axiom of choice for sets with less than n elements, holds.(3) Products of compact spaces are canonically subbase-compact iff AC, the axiom of choice, holds.(4) All powers XI of a compact space X are canonically subbase compact iff X is a Loeb-space.These results imply that in ZF the implications

     

Function spaces and one point extensions for the construct of metered spaces

The construct M of metered spaces and contractions is known to be a superconstruct in which all metrically generated constructs can be fully embedded. We show that M has one point extensions and that quotients in M are productive. We construct a Cartesian closed topological extension of M and characterize the canonical function spaces with underlying sets Hom(X,Y) for metered spaces X and Y. Finally we obtain an internal characterization of the objects in the Cartesian closed topological hull of M.     

Invariance properties of a triple matrix product involving generalized inverses

Given complex-valued matrices A, B and C of appropriate dimensions, this paper investigates certain invariance properties of the product AXC with respect to the choice of X, where X is a generalized inverse of B. Different types of generalized inverses are taken into account. The purpose of the paper is three-fold: First, to review known results scattered in the literature, second, to demonstrate the connection between invariance properties and the concept of extremal ranks of matrices, and third, to add new results related to the topic.     

Kripke semantics for provability logic GLP

A well-known polymodal provability logic due to Japaridze is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in arithmetic. This system plays an important role in some recent applications of provability algebras in proof theory. However, an obstacle in the study of is that it is incomplete w.r.t. any class of Kripke frames. In this paper we provide a complete Kripke semantics for . First, we isolate a certain subsystem of that is sound and complete w.r.t. a nice class of finite frames. Second, appropriate models for are defined as the limits of chains of finite expansions of models for . The techniques involves unions of n-elementary chains and inverse limits of Kripke models. All the results are obtained by purely modal-logical methods formalizable in elementary arithmetic.     

On the complexity of the closed fragment of Japaridze’s provability logic

We consider the well-known provability logic GLP. We prove that the GLP-provability problem for polymodal formulas without variables is PSPACE-complete. For a number n, let \({L^{n}_0}\) denote the class of all polymodal variable-free formulas without modalities \({\langle n \rangle,\langle n+1\rangle,...}\) . We show that, for every number n, the GLP-provability problem for formulas from \({L^{n}_0}\) is in PTIME.     

A homeomorphism between strong measure zero sets whose graph is not of strong measure zero

Assuming Martin's axiom MA, we define a homeomorphism between two strong measure zero sets in the real line whose graph in not of strong measure zero in the plane. Using Michael's concentrated sets, we give also some refinements of this result, and we describe some singular subgroups of the group ZN.     

Glivenko theorems revisited

Glivenko-type theorems for substructural logics (over FL) are comprehensively studied in the paper [N. Galatos, H. Ono, Glivenko theorems for substructural logics over FL, Journal of Symbolic Logic 71 (2006) 1353-1384]. Arguments used there are fully algebraic, and based on the fact that all substructural logics are algebraizable (see [N. Galatos, H. Ono, Algebraization, parametrized local deduction theorem and interpolation for substructural logics over FL, Studia Logica 83 (2006) 279-308] and also [N. Galatos, P. Jipsen, T. Kowalski, H. Ono, Residuated Lattices: An Algebraic Glimpse at Substructural Logics, in: Studies in Logic and the Foundations of Mathematics, vol. 151, Elsevier, 2007] for the details).As a complementary work to the algebraic approach developed in [N. Galatos, H. Ono, Glivenko theorems for substructural logics over FL, Journal of Symbolic Logic 71 (2006) 1353-1384], we present here a concise, proof-theoretic approach to Glivenko theorems for substructural logics. This will show different features of these two approaches.     

Exponentially closed fields and the conjecture on intersections with tori

We give an axiomatization of the class ECF of exponentially closed fields, which includes the pseudo-exponential fields previously introduced by the second author, and show that it is superstable over its interpretation of arithmetic. Furthermore, ECF is exactly the elementary class of the pseudo-exponential fields if and only if the Diophantine conjecture CIT on atypical intersections of tori with subvarieties is true.     

On the positive fragment of the polymodal provability logic GLP

The fragment of the polymodal provability logic GLP in the language with connectives ┬, Λ, and 〈n〉 for all n ∈ ω is considered. For this fragment, a deductive system is constructed, a Kripke semantics is proposed, and a polynomial bound for the complexity of a decision procedure is obtained.     

Sequences of semicontinuous functions accompanying continuous functions

A space X is said to have property (USC) (resp. (LSC)) if whenever is a sequence of upper (resp. lower) semicontinuous functions from X into the closed unit interval [0,1] converging pointwise to the constant function 0 with the value 0, there is a sequence of continuous functions from X into [0,1] such that fn?gn (n∈ω) and converges pointwise to 0. In this paper, we study spaces having these properties and related ones. In particular, we show that (a) for a subset X of the real line, X has property (USC) if and only if it is a σ-set; (b) if X is a space of non-measurable cardinal and has property (LSC), then it is discrete. Our research comes of Scheepers' conjecture on properties S₁(Γ,Γ) and wQN.     

Projective sup-algebras: a general view

We begin with the notion of K-flat projectivity. For each sup-algebra L we then introduce a binary relation L_? on it. The K-flat projective sup-algebras are exactly such sup-algebras with each element a approximated by the element x, xL_?a and the relation L_? being stable with respect to the operations on L. Further on, we introduce the notion of a K-comonad and characterize K-flat projective sup-algebras as such sup-algebras having a coalgebra structure for the K-comonad.     

The omega-rule interpretation of transfinite provability logic

Given a computable ordinal Λ, the transfinite provability logic ${\mathsf{GLP}}_{\mathrm{\Lambda }}$ has for each $\xi <\mathrm{\Lambda }$ a modality $[\xi ]$ intended to represent a provability predicate within a chain of increasing strength. One possibility is to read $[\xi ]?$ as ? is provable in T using ω-rules of depth at most ξ, where T is a second-order theory extending ${\mathrm{ACA}}_0$.In this paper we will formalize such iterations of ω-rules in second-order arithmetic and show how it is a special case of what we call uniform provability predicates. Uniform provability predicates are similar to Ignatiev's strong provability predicates except that they can be iterated transfinitely. Finally, we show that ${\mathsf{GLP}}_{\mathrm{\Lambda }}$ is sound and complete for any uniform provability predicate.     

Topological sums and products in ZF-set theory

In ZF, i.e., Zermelo-Fraenkel set theory without the axiom of choice, the category Top of topological spaces and continuous maps is well-behaved. In particular, Top has sums (=coproducts) and products. However, it may happen that for families (Xi)_i∈I and (Yi)_i∈I with the property that each Xi is homeomorphic to the corresponding Yi neither their sums _⊕i∈IXi and _⊕i∈IYi nor their products _∏i∈IXi and _∏i∈IYi are homeomorphic. It will be shown that the axiom of choice is not only sufficient but also necessary to rectify this defect.     

A remark on conservative cocompletions of categories

For a set F of small categories, F-conservative cocompletions of a category are cocompletions preserving all existing colimits of type F. We prove that every category has a free F-conservative cocompletion. However, unless F is trivial, this cocompletion fails in general to be locally small.     

Some explicit solutions of the additive Deligne-Simpson problem and their applications

In this paper we construct three infinite series and two extra triples (E₈ and ) of complex matrices B, C, and A=B+C of special spectral types associated to Simpson's classification in Amer. Math. Soc. Proc. 1 (1992) 157 and Magyar et al. classification in Adv. Math. 141 (1999) 97. This enables us to construct Fuchsian systems of differential equations which generalize the hypergeometric equation of Gauss-Riemann. In a sense, they are the closest relatives of the famous equation, because their triples of spectral flags have finitely many orbits for the diagonal action of the general linear group in the space of solutions. In all the cases except for E₈, we also explicitly construct scalar products such that A, B, and C are self-adjoint with respect to them. In the context of Fuchsian systems, these scalar products become monodromy invariant complex symmetric bilinear forms in the spaces of solutions.When the eigenvalues of A, B, and C are real, the matrices and the scalar products become real as well. We find inequalities on the eigenvalues of A, B, and C which make the scalar products positive-definite.As proved by Klyachko, spectra of three hermitian (or real symmetric) matrices B, C, and A=B+C form a polyhedral convex cone in the space of triple spectra. He also gave a recursive algorithm to generate inequalities describing the cone. The inequalities we obtain describe non-recursively some faces of the Klyachko cone.     

On finite unions of certain D-spaces

In this note, we show that if X is the union of a finite collection of strong Σ-spaces, then X is a D-space. As a corollary, we get a conclusion that if X is the union of a finite collection of Moore spaces, then X is a D-space. This gives a positive answer to one of Arhangel'skii's problems [A.V. Arhangel'skii, D-spaces and finite unions, Proc. AMS 132 (7) (2004) 2163-2170]. In the last part of the note, we show that if X is the union of a finite collection of DC-like spaces, then X is a D-space, where DC is the class of all discrete unions of compact spaces. As a corollary, we show that if X is the union of a finite collection of regular subparacompact C-scattered spaces, then X is a D-space.