Measurable cardinals and the cardinality of Lindelöf spaces

We obtain from the consistency of the existence of a measurable cardinal the consistency of “small” upper bounds on the cardinality of a large class of Lindelöf spaces whose singletons are Gδ sets.     

Proof-theoretic conservations of weak weak intuitionistic constructive set theories

The paper aims to provide precise proof theoretic characterizations of Myhill–Friedman-style “weak” constructive extensional set theories and Aczel–Rathjen analogous constructive set theories both enriched by Mostowski-style collapsing axioms and/or related anti-foundation axioms. The main results include full intuitionistic conservations over the corresponding purely arithmetical formalisms that are well known in the reverse mathematics – which strengthens analogous results obtained by the author in the 80s. The present research was inspired by the more recent Sato-style “weak weak” classical extensional set theories whose proof theoretic strengths are shown to strongly exceed the ones of the intuitionistic counterparts in the presence of the collapsing axioms.     

Covering with universally Baire operators

We introduce a covering conjecture and show that it holds below A_DR+“Θ is regular”$A{D}_{\mathbb{R}}+\text{“}\Theta \text{is regular”}$. We then use it to show that in the presence of mild large cardinal axioms, PFA   implies that there is a transitive model containing the reals and ordinals and satisfying A_DR+“Θ is regular”$A{D}_{\mathbb{R}}+\text{“}\Theta \text{is regular”}$. The method used to prove the Main Theorem of this paper is the core model induction. The paper contains the first application of the core model induction that goes significantly beyond the region of AD⁺+_θ0<Θ$A{D}^{+}+{\theta }_0<\Theta$.     

Lindelöf spaces which are Menger, Hurewicz, Alster, productive, or D

We discuss relationships in Lindelöf spaces among the properties “Menger”, “Hurewicz”, “Alster”, “productive”, and “D”.     

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

Kelley-Morse+Types of well order is not a conservative extension of Kelley Morse

Summary Assuming the consistency ofZF + There is an inaccessible number of inaccessibles, we prove that Kelley Morse theory plus types is not a conservative extension of Kelley-Morse theory.This paper was partially supported by: Dirección de Investigación de la Pontificia Universidad Católica de Chile (DIUC); Fondo Nacional de Desarrollo Científico y Tecnológico (FONDECYT)     

Lindelöf spaces which are indestructible, productive, or D

We discuss relationships in Lindelöf spaces among the properties “indestructible”, “productive”, “D”, and related properties.     

Compact spaces, elementary submodels, and the countable chain condition, II

Given a space 〈X,T〉 in an elementary submodel of H(θ), define XM to be X∩M with the topology generated by . It is established that if XM is compact and satisfies the countable chain condition, while X is not scattered and has cardinality less than the first inaccessible cardinal, then X=XM. If the character of XM is a member of M, then “inaccessible” may be replaced by “1-extendible”.     

The overlap algebra of regular opens

Overlap algebras are complete lattices enriched with an extra primitive relation, called “overlap”. The new notion of overlap relation satisfies a set of axioms intended to capture, in a positive way, the properties which hold for two elements with non-zero infimum. For each set, its powerset is an example of overlap algebra where two subsets overlap each other when their intersection is inhabited. Moreover, atomic overlap algebras are naturally isomorphic to the powerset of the set of their atoms. Overlap algebras can be seen as particular open (or overt) locales and, from a classical point of view, they essentially coincide with complete Boolean algebras. Contrary to the latter, overlap algebras offer a negation-free framework suitable, among other things, for the development of point-free topology. A lot of topology can be done “inside” the language of overlap algebra. In particular, we prove that the collection of all regular open subsets of a topological space is an example of overlap algebra which, under natural hypotheses, is atomless. Since they are a constructive counterpart to complete Boolean algebras and, at the same time, they have a more powerful axiomatization than Heyting algebras, overlap algebras are expected to turn out useful both in constructive mathematics and for applications in computer science.     

Almost disjoint large subsets of semigroups

There are several notions of largeness in a semigroup S that originated in topological dynamics. Among these are thick, central, syndetic and piecewise syndetic. Of these, central sets are especially interesting because they are partition regular and are guaranteed to contain substantial combinatorial structure. It is known that in (N,+) any central set may be partitioned into infinitely many pairwise disjoint central sets. We extend this result to a large class of semigroups (including (N,+)) by showing that if S is a semigroup in this class which has cardinality κ then any central set can be partitioned into κ many pairwise disjoint central sets. We also show that for this same class of semigroups, if there exists a collection of μ almost disjoint subsets of any member S, then any central subset of S contains a collection of μ almost disjoint central sets. The same statement applies if “central” is replaced by “thick”; and in the case that the semigroup is left cancellative, “central” may be replaced by “piecewise syndetic”. The situation with respect to syndetic sets is much more restrictive. For example, there does not exist an uncountable collection of almost disjoint syndetic subsets of N. We investigate the extent to which syndetic sets can be split into disjoint syndetic sets.     

Preservation of the Borel class under countable-compact-covering mappings

The aim of this note is to prove the following result: “Assume that X is a metric Borel space of class ξ, that is continuous, that every fiber f⁻¹(y) is complete and that every countable compact subset of Y is the image by f of some compact subset of X. Then Y is Borel and moreover of class ξ”. We give also an extension to the case where the fibers are only assumed to be Polish.     

Constructibility in higher order arithmetics

Summary We define and investigate constructibility in higher order arithmetics. In particular we get an interpretation ofn-order arithmetic inn-order arithmetic without the scheme of choice such that and the property to be a well-ordering are absolute in it and such that this interpretation is minimal among such interpretations.     

Cantor families of periodic solutions for wave equations via a variational principle

We prove existence of small amplitude periodic solutions of completely resonant wave equations with frequencies in a Cantor set of asymptotically full measure, via a variational principle. A Lyapunov-Schmidt decomposition reduces the problem to a finite dimensional bifurcation equation—variational in nature—defined on a Cantor set of non-resonant parameters. The Cantor gaps are due to “small divisors” phenomena. To solve the bifurcation equation we develop a suitable variational method. In particular, we do not require the typical “Arnold non-degeneracy condition” of the known theory on the nonlinear terms. As a consequence our existence results hold for new generic sets of nonlinearities.     

The Logic of Uncertain Justifications

In Artemov?s Justification Logic, one can make statements interpreted as “t is evidence for the truth of formula F.” We propose a variant of this logic in which one can say “I have degree r of confidence that t is evidence for the truth of formula F.” After defining both an axiomatic approach and a semantics for this Logic of Uncertain Justifications, we will prove the usual soundness and completeness theorems.     

The strength of extensionality II — Weak weak set theories without infinity

By obtaining several new results on Cook-style two-sorted bounded arithmetic, this paper measures the strengths of the axiom of extensionality and of other weak fundamental set-theoretic axioms in the absence of the axiom of infinity, following the author’s previous work [K. Sato, The strength of extensionality I — weak weak set theories with infinity, Annals of Pure and Applied Logic 157 (2009) 234-268] which measures them in the presence. These investigations provide a uniform framework in which three different kinds of reverse mathematics-Friedman-Simpson’s “orthodox” reverse mathematics, Cook’s bounded reverse mathematics and large cardinal theory-can be reformulated within one language so that we can compare them more directly.     

A constructive investigation of satisfiability

We present a constructive analysis of the logical notions of satisfiability and consistency for first-order intuitionistic formulae. In particular, we use formal topology theory to provide a positive semantics for satisfiability. Then we propose a “co-inductive” logical calculus, which captures the positive content of consistency.     

How ordinary elimination became Gaussian elimination

Newton, in notes that he would rather not have seen published, described a process for solving simultaneous equations that later authors applied specifically to linear equations. This method — which Euler did not recommend, which Legendre called “ordinary,” and which Gauss called “common” — is now named after Gauss: “Gaussian” elimination. Gauss’s name became associated with elimination through the adoption, by professional computers, of a specialized notation that Gauss devised for his own least-squares calculations. The notation allowed elimination to be viewed as a sequence of arithmetic operations that were repeatedly optimized for hand computing and eventually were described by matrices.     

Lifting Lévy processes to hyperfinite random walks

An internal lifting for an arbitrary measurable Lévy process is constructed. This lifting reflects our intuitive notion of a process which is the infinitesimal sum of its infinitesimal increments, those in turn being independent from and closely related to each other - for short, the process can be regarded as some kind of random walk (where the step size generically will vary). The proof uses the existence of càdlàg modifications of Lévy processes and certain features of hyperfinite adapted probability spaces, commonly known as the “model theory of stochastic processes”.     

Polylogarithms,functional equations and more: The elusive essays of William Spence (1777–1815)

The little-known Scottish mathematician William Spence was an able analyst, one of the first in Britain to be conversant with recent continental advances, and having original views. His major work on “logarithmic transcendents” gives the first detailed account of polylogarithms and related functions. A theory of algebraic equations was published just after his early death; and further essays, edited by John Herschel, were published posthumously. The most substantial of these concern an extension of his work on “logarithmic transcendents”, and the general solution of linear differential and difference equations. But awareness of Spence?s works was long delayed by their supposed unavailability. Spence?s life, the story of his “lost” publications, and a summary of all his essays are here described.     

Interpretations of the alternative set theory

Summary We show an axiom A such that there is no nontrivial interpretation of the alternative set theory (AST) inAST+A keeping , sets and the class of all standard natural numbers. Furthermore, there is no interpretation ofAST inAST without the prolongation axiom, but there is an interpretation ofAST in the theory having the prolongation axiom and the basic set-theoretical axioms only.