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.     

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.     

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 .     

On the computation of the jdeg of blowup algebras

For a graded algebra , its is a global degree that can be used to study issues of complexity of the normalization . Here some techniques grounded on Rees algebra theory are used to estimate . A closely related notion, of divisorial generation, is introduced to count numbers of generators of .     

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.     

Finite-sample inference with monotone incomplete multivariate normal data, II

We continue our recent work on inference with two-step, monotone incomplete data from a multivariate normal population with mean and covariance matrix . Under the assumption that is block-diagonal when partitioned according to the two-step pattern, we derive the distributions of the diagonal blocks of and of the estimated regression matrix, . We represent in terms of independent matrices; derive its exact distribution, thereby generalizing the Wishart distribution to the setting of monotone incomplete data; and obtain saddlepoint approximations for the distributions of and its partial Iwasawa coordinates. We prove the unbiasedness of a modified likelihood ratio criterion for testing , where is a given matrix, and obtain the null and non-null distributions of the test statistic. In testing , where and are given, we prove that the likelihood ratio criterion is unbiased and obtain its null and non-null distributions. For the sphericity test, , we obtain the null distribution of the likelihood ratio criterion. In testing we show that a modified locally most powerful invariant statistic has the same distribution as a Bartlett-Pillai-Nanda trace statistic in multivariate analysis of variance.     

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 .     

On the Wiener integral with respect to a sub-fractional Brownian motion on an interval

The domain of the Wiener integral with respect to a sub-fractional Brownian motion , , k≠0, is characterized. The set is a Hilbert space which contains the class of elementary functions as a dense subset. If , any element of is a function and if , the domain is a space of distributions.     

On the number of graphs with a given endomorphism monoid

For a given finite monoid , let be the number of graphs on n vertices with endomorphism monoid isomorphic to . For any nontrivial monoid we prove that where and are constants depending only on with .For every k there exists a monoid of size k with , on the other hand if a group of unity of has a size k>2 then .     

Kirillov-Reshetikhin crystals for nonexceptional types

We provide combinatorial models for all Kirillov-Reshetikhin crystals of nonexceptional type, which were recently shown to exist. For types , , we rely on a previous construction using the Dynkin diagram automorphism which interchanges nodes 0 and 1. For type we use a Dynkin diagram folding and for types , a similarity construction. We also show that for types and the analog of the Dynkin diagram automorphism exists on the level of crystals.     

Admissible rules in the implication-negation fragment of intuitionistic logic

Uniform infinite bases are defined for the single-conclusion and multiple-conclusion admissible rules of the implication-negation fragments of intuitionistic logic and its consistent axiomatic extensions (intermediate logics). A Kripke semantics characterization is given for the (hereditarily) structurally complete implication-negation fragments of intermediate logics, and it is shown that the admissible rules of this fragment of form a PSPACE-complete set and have no finite basis.     

Polar syzygies in characteristic zero: The monomial case

Given a set of forms , where k is a field of characteristic zero, we focus on the first syzygy module Z of the transposed Jacobian module , whose elements are called differential syzygies of . There is a distinct submodule P⊂Z coming from the polynomial relations of through its transposed Jacobian matrix, the elements of which are called polar syzygies of . We say that is polarizable if equality P=Z holds. This paper is concerned with the situation where are monomials of degree 2, in which case one can naturally associate to them a graph with loops and translate the problem into a combinatorial one. The main result is a complete combinatorial characterization of polarizability in terms of special configurations in this graph. As a consequence, we show that polarizability implies normality of the subalgebra and that the converse holds provided the graph is free of certain degenerate configurations. One main combinatorial class of polarizability is the class of polymatroidal sets. We also prove that if the edge graph of has diameter at most 2 then is polarizable. We establish a curious connection with birationality of rational maps defined by monomial quadrics.     

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.     

Holomorphy of spectral multipliers of the Ornstein-Uhlenbeck operator

Let γ be the Gauss measure on and the Ornstein-Uhlenbeck operator. For every p in [1,∞)?{2}, set , and consider the sector . The main results of this paper are the following. If p is in (1,∞)?{2}, and , i.e., if M is an Lp(γ)uniform spectral multiplier of in our terminology, and M is continuous on , then M extends to a bounded holomorphic function on the sector . Furthermore, if p=1 a spectral multiplier M, continuous on , satisfies the condition if and only if M extends to a bounded holomorphic function on the right half-plane, and its boundary value M(i·) on the imaginary axis is the Euclidean Fourier transform of a finite Borel measure on the real line. We prove similar results for uniform spectral multipliers of second order elliptic differential operators in divergence form on belonging to a wide class, which contains . From these results we deduce that operators in this class do not admit an H^∞ functional calculus in sectors smaller than .     

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 .     

The Stein phenomenon for monotone incomplete multivariate normal data

We establish the Stein phenomenon in the context of two-step, monotone incomplete data drawn from , a (p+q)-dimensional multivariate normal population with mean and covariance matrix . On the basis of data consisting of n observations on all p+q characteristics and an additional N−n observations on the last q characteristics, where all observations are mutually independent, denote by the maximum likelihood estimator of . We establish criteria which imply that shrinkage estimators of James-Stein type have lower risk than under Euclidean quadratic loss. Further, we show that the corresponding positive-part estimators have lower risk than their unrestricted counterparts, thereby rendering the latter estimators inadmissible. We derive results for the case in which is block-diagonal, the loss function is quadratic and non-spherical, and the shrinkage estimator is constructed by means of a nondecreasing, differentiable function of a quadratic form in . For the problem of shrinking to a vector whose components have a common value constructed from the data, we derive improved shrinkage estimators and again determine conditions under which the positive-part analogs have lower risk than their unrestricted counterparts.