A non-implication between fragments of Martin’s Axiom related to a property which comes from Aronszajn trees

We introduce a property of forcing notions, called the anti-, which comes from Aronszajn trees. This property canonically defines a new chain condition stronger than the countable chain condition, which is called the property .In this paper, we investigate the property . For example, we show that a forcing notion with the property does not add random reals. We prove that it is consistent that every forcing notion with the property has precaliber ℵ₁ and for forcing notions with the property fails. This negatively answers a part of one of the classical problems about implications between fragments of .     

Club-guessing, stationary reflection, and coloring theorems

We obtain very strong coloring theorems at successors of singular cardinals from failures of certain instances of simultaneous reflection of stationary sets. In particular, the simplest of our results establishes that if μ is singular and , then there is a regular cardinal θ<μ such that any fewer than cf(μ) stationary subsets of must reflect simultaneously.     

The Chase radical and reduced products

Let κ be a regular uncountable cardinal. We shall give a criterion for certain reduced products of torsion-free abelian groups to be ℵ₁-free. As an application we shall show that the norm of the Chase radical is ℵ₁ in ZFC, a result which was previously known only under the assumption of the continuum hypothesis 2^ℵ₀=ℵ₁.     

Forcing absoluteness and regularity properties

For a large natural class of forcing notions, we prove general equivalence theorems between forcing absoluteness statements, regularity properties, and transcendence properties over and the core model . We use our results to answer open questions from set theory of the reals.     

Classical predicative logic-enriched type theories

A logic-enriched type theory (LTT) is a type theory extended with a primitive mechanism for forming and proving propositions. We construct two LTTs, named and , which we claim correspond closely to the classical predicative systems of second order arithmetic and . We justify this claim by translating each second order system into the corresponding LTT, and proving that these translations are conservative. This is part of an ongoing research project to investigate how LTTs may be used to formalise different approaches to the foundations of mathematics.The two LTTs we construct are subsystems of the logic-enriched type theory , which is intended to formalise the classical predicative foundation presented by Herman Weyl in his monograph Das Kontinuum. The system has also been claimed to correspond to Weyl’s foundation. By casting and as LTTs, we are able to compare them with . It is a consequence of the work in this paper that is strictly stronger than .The conservativity proof makes use of a novel technique for proving one LTT conservative over another, involving defining an interpretation of the stronger system out of the expressions of the weaker. This technique should be applicable in a wide variety of different cases outside the present work.     

Completeness for flat modal fixpoint logics

This paper exhibits a general and uniform method to prove axiomatic completeness for certain modal fixpoint logics. Given a set Γ of modal formulas of the form γ(x,p₁,…,p_n), where x occurs only positively in γ, we obtain the flat modal fixpoint language L_?(Γ) by adding to the language of polymodal logic a connective ?_γ for each γ∈Γ. The term ?_γ(φ₁,…,φ_n) is meant to be interpreted as the least fixed point of the functional interpretation of the term γ(x,φ₁,…,φ_n). We consider the following problem: given Γ, construct an axiom system which is sound and complete with respect to the concrete interpretation of the language L_?(Γ) on Kripke structures. We prove two results that solve this problem.First, let be the logic obtained from the basic polymodal by adding a Kozen-Park style fixpoint axiom and a least fixpoint rule, for each fixpoint connective ?_γ. Provided that each indexing formula γ satisfies a certain syntactic criterion, we prove this axiom system to be complete.Second, addressing the general case, we prove the soundness and completeness of an extension of . This extension is obtained via an effective procedure that, given an indexing formula γ as input, returns a finite set of axioms and derivation rules for ?_γ, of size bounded by the length of γ. Thus the axiom system is finite whenever Γ is finite.     

Higher Kurtz randomness

A real x is -Kurtz random (-Kurtz random) if it is in no closed null set ( set). We show that there is a cone of -Kurtz random hyperdegrees. We characterize lowness for -Kurtz randomness as being -dominated and -semi-traceable.     

Elementary differences between the degrees of unsolvability and degrees of compressibility

Given two infinite binary sequences A,B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as much as the prefix-free Kolmogorov complexity relative to A, modulo a constant. This relation, introduced in Nies (2005) [14] and denoted by A≤_LKB, is a measure of relative compressing power of oracles, in the same way that Turing reducibility is a measure of relative information. The equivalence classes induced by ≤_LK are called LK degrees (or degrees of compressibility) and there is a least degree containing the oracles which can only compress as much as a computable oracle, also called the ‘low for K’ sets. A well-known result from Nies (2005) [14] states that these coincide with the K-trivial sets, which are the ones whose initial segments have minimal prefix-free Kolmogorov complexity.We show that with respect to ≤_LK, given any non-trivial sets X,Y there is a computably enumerable set A which is not K-trivial and it is below X,Y. This shows that the local structures of and Turing degrees are not elementarily equivalent to the corresponding local structures in the LK degrees. It also shows that there is no pair of sets computable from the halting problem which forms a minimal pair in the LK degrees; this is sharp in terms of the jump, as it is known that there are sets computable from which form a minimal pair in the LK degrees. We also show that the structure of LK degrees below the LK degree of the halting problem is not elementarily equivalent to the or structures of LK degrees. The proofs introduce a new technique of permitting below a set that is not K-trivial, which is likely to have wider applications.     

A minimal classical sequent calculus free of structural rules

Gentzen’s classical sequent calculus has explicit structural rules for contraction and weakening. They can be absorbed (in a right-sided formulation) by replacing the axiom P,¬P by Γ,P,¬P for any context Γ, and replacing the original disjunction rule with Γ,A,B implies Γ,A∨B.This paper presents a classical sequent calculus which is also free of contraction and weakening, but more symmetrically: both contraction and weakening are absorbed into conjunction, leaving the axiom rule intact. It uses a blended conjunction rule, combining the standard context-sharing and context-splitting rules: Γ,Δ,A and Γ,Σ,B implies Γ,Δ,Σ,A∧B. We refer to this system as minimal sequent calculus.We prove a minimality theorem for the propositional fragment : any propositional sequent calculus S (within a standard class of right-sided calculi) is complete if and only ifS contains (that is, each rule of is derivable in S). Thus one can view as a minimal complete core of Gentzen’s .     

Games with 1-backtracking

We associate with any game G another game, which is a variant of it, and which we call . Winning strategies for have a lower recursive degree than winning strategies for G: if a player has a winning strategy of recursive degree 1 over G, then it has a recursive winning strategy over , and vice versa. Through we can express in algorithmic form, as a recursive winning strategy, many (but not all) common proofs of non-constructive Mathematics, namely exactly the theorems of the sub-classical logic Limit Computable Mathematics (Hayashi (2006) [6], Hayashi and Nakata (2001) [7]).     

Nonstandard arithmetic and recursive comprehension

First order reasoning about hyperintegers can prove things about sets of integers. In the author’s paper Nonstandard Arithmetic and Reverse Mathematics, Bulletin of Symbolic Logic 12 (2006) 100-125, it was shown that each of the “big five” theories in reverse mathematics, including the base theory , has a natural nonstandard counterpart. But the counterpart of has a defect: it does not imply the Standard Part Principle that a set exists if and only if it is coded by a hyperinteger. In this paper we find another nonstandard counterpart, , that does imply the Standard Part Principle.     

Stability to the global large solutions of 3-D Navier-Stokes equations

In this paper, we consider the stability to the global large solutions of 3-D incompressible Navier-Stokes equations in the anisotropic Sobolev spaces. In particular, we proved that for any , given a global large solution v∈C([0,∞);H0,s₀(R³)∩L³(R³)) of (1.1) with and a divergence free vector satisfying for some sufficiently small constant depending on , v, and , (1.1) supplemented with initial data v(0)+w₀ has a unique global solution in u∈C([0,∞);H0,s₀(R³)) with ∇u∈L²(R⁺,H0,s₀(R³)). Furthermore, uh is close enough to vh in C([0,∞);H0,s(R³)).     

The double negation of the intermediate value theorem

In the context of intuitionistic analysis, we consider the set F consisting of all continuous functions ? from [0,1] to R such that ?(0)=0 and ?(1)=1, and the set I₀ consisting of ?’s in F where there exists x∈[0,1] such that . It is well-known that there are weak counterexamples to the intermediate value theorem, and with Brouwer’s continuity principle we have I₀≠F. However, there exists no satisfying answer to . We try to answer to this question by reducing it to a schema (which we call ) about intuitionistic decidability that asserts “there exists an intuitionistically enumerable set that is not intuitionistically decidable”. We also introduce the notion of strong Specker double sequence, and prove that the existence of such a double sequence is equivalent to the existence of a function ?∈F_mon where .     

On conjugacy classes in metaplectic groups

Let E be a finite dimensional symplectic space over a local field of characteristic zero. We show that for every element in the metaplectic double cover of the symplectic group Sp(E), and are conjugate by an element of GSp(E) with similitude −1.     

Projective mad families

Using almost disjoint coding we prove the consistency of the existence of a definable ω-mad family of infinite subsets of ω (resp. functions from ω to ω) together with b=2^ω=ω₂.     

On the relation between cluster and classical tilting

Let be a triangulated category with a cluster tilting subcategory U. The quotient category is abelian; suppose that it has finite global dimension.We show that projection from to sends cluster tilting subcategories of to support tilting subcategories of , and that, in turn, support tilting subcategories of can be lifted uniquely to weak cluster tilting subcategories of .     

Homology of artinian and Matlis reflexive modules, I

Let R be a commutative local noetherian ring, and let L and L^′ be R-modules. We investigate the properties of the functors and . For instance, we show the following:

(a)

if L and L^′ are artinian, then is artinian, and is noetherian over the completion ;

(b)

if L is artinian and L^′ is Matlis reflexive, then , , and are Matlis reflexive.

Also, we study the vanishing behavior of these functors, and we include computations demonstrating the sharpness of our results.