On the free implicative semilattice extension of a Hilbert algebra

Hilbert algebras provide the equivalent algebraic semantics in the sense of Blok and Pigozzi to the implication fragment of intuitionistic logic. They are closely related to implicative semilattices. Porta proved that every Hilbert algebra has a free implicative semilattice extension. In this paper we introduce the notion of an optimal deductive filter of a Hilbert algebra and use it to provide a different proof of the existence of the free implicative semilattice extension of a Hilbert algebra as well as a simplified characterization of it. The optimal deductive filters turn out to be the traces in the Hilbert algebra of the prime filters of the distributive lattice free extension of the free implicative semilattice extension of the Hilbert algebra. To define the concept of optimal deductive filter we need to introduce the concept of a strong Frink ideal for Hilbert algebras which generalizes the concept of a Frink ideal for posets.     

Relative homological algebra in the category of quasi-coherent sheaves

In this paper, we prove the existence of a flat cover and of a cotorsion envelope for any quasi-coherent sheaf over a scheme (X,O_X). Indeed we prove something more general. We define what it is understood by the category of quasi-coherent R-modules, where R is a representation by rings of a quiver Q, and we prove the existence of a flat cover and a cotorsion envelope for quasi-coherent R-modules. Then we use the fact that the category of quasi-coherent sheaves on (X,O_X) is equivalent to the category of quasi-coherent R-modules for some Q and R to get our result.     

The Eilenberg-Watts theorem over schemes

We study obstructions to a direct limit preserving right exact functor F between categories of quasi-coherent sheaves on schemes being isomorphic to tensoring with a bimodule. When the domain scheme is affine, or if F is exact, all obstructions vanish and we recover the Eilenberg-Watts Theorem. This result is crucial to the proof that the noncommutative Hirzebruch surfaces constructed in C. Ingalls, D. Patrick (2002) [6] are noncommutative P¹-bundles in the sense of M. Van den Bergh [10].     

Finiteness conditions on the Yoneda algebra of a monomial algebra

Let A$A$ be a connected graded noncommutative monomial algebra. We associate to A$A$ a finite graph Γ(A)$\Gamma \left(A\right)$ called the CPS graph of A$A$. Finiteness properties of the Yoneda algebra Ext_A(k,k)${\text{Ext}}_A(k,k)$ including Noetherianity, finite GK dimension, and finite generation are characterized in terms of Γ(A)$\Gamma \left(A\right)$. We show that these properties, notably finite generation, can be checked by means of a terminating algorithm.     

A preliminary test procedure for the scale parameter of exponential distribution when the selection parameter is unknown

Summary A preliminary test estimator is considered for the scale parameter of the two-parameter exponential distribution with unknown selection parameter, where the distribution does not satisfy the regularity condition of Wilks' theorem—the density is not differentiable. A method of specifying the level of significance of the preliminary test based on is proposed AIC. This work was partly supported by Scientific Research Fund No. 58450058 from the Ministry of Education of Japan. The Institute of Statistical Mathematics     

Analysis of a problem of Raikov with applications to barreled and bornological spaces

Raikov’s conjecture states that semi-abelian categories are quasi-abelian. A first counterexample is contained in a paper of Bonet and Dierolf who considered the category of bornological locally convex spaces. We prove that every semi-abelian category I admits a left essential embedding into a quasi-abelian category K_l(I) such that I can be recovered from K_l(I) by localization. Conversely, it is shown that left essential full subcategories I of a quasi-abelian category are semi-abelian, and a criterion for I to be quasi-abelian is given. Applied to categories of locally convex spaces, the criterion shows that barreled or bornological spaces are natural counterexamples to Raikov’s conjecture. Using a dual argument, the criterion leads to a simplification of Bonet and Dierolf’s example.     

A comment on the joint embedding property

The paper presents an alternative proof of the known result that no recursively enumerable number theory has the joint embedding property. Presented at the Conference on Ordered structures and Universal Algebra — in Honor of László Fuchs, Budapest, 1994.     

On the combinatorial rank of a graded braided bialgebra

Let B be a graded braided bialgebra. Let S(B) denote the algebra obtained dividing out B by the two sided ideal generated by homogeneous primitive elements in B of degree at least two. We prove that S(B) is indeed a graded braided bialgebra quotient of B. It is then natural to compute S(S(B)), S(S(S(B))) and so on. This process yields a direct system whose direct limit comes out to be a graded braided bialgebra which is strongly N-graded as a coalgebra. Following V.K. Kharchenko, if the direct system is stationary exactly after n steps, we say that B has combinatorial rank n and we write κ(B)=n. We investigate conditions guaranteeing that κ(B) is finite. In particular, we focus on the case when B is the braided tensor algebra T(V,c) associated to a braided vector space (V,c), providing meaningful examples such that κ(T(V,c))≤1.     

Proper bayes minimax estimators for a multivariate normal mean with unknown common variance under a convex loss function

Summary Let X ∼ N_p(μ,σ²I_p) and let s/σ² ∼ χ _n ² , independent ofX, where μ and σ² are unknown. This paper considers the estimation of μ (by δ) relative to a convex loss function given by (δ−μ)′[(1−α)I_p/σ²+αQ](δ−μ)/[(1−α)p/σ²+α tr (Q)], whereQ is a knownp×p diagonal matrix and 0≦α≦1. Two classes of minimax estimators are obtained for μ whenp≦3; the first is a new result and the second is a generalization of a result of Strawderman (1973,Ann. Statist.,1, 1189–1194). A proper Bayes estimator is also obtained which is shown to satisfy the conditions of the second class of minimax estimators. The paper concludes by discussing the estimation of μ relative to another convex loss function. This work was supported by the Army, Navy and Air Force under Office of Naval Research Contract No. N00014-80-C-0093. Reproduction in whole or in part is permitted for any purpose of the United States Government.     

Sacks forcing and the total failure of Martin's Axiom

Using side-by-side Sacks forcing, it is proved relatively consistent that the continuum is large and Martin's Axiom fails totally, that is, every c.c.c. space is the union of ?₁ nowhere dense sets (equivelently, if P is a nontrivial partial ordering with the countable chain condition, then there are ?₁ dense sets in P such that no filter in P meets them all).     

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.     

Cohomology rings and formality properties of nilpotent groups

We analyze k-stage formality and relate resonance with this type of formality properties. For instance, we show that, for a finitely generated nilpotent group that is k-stage formal, the resonance varieties are trivial up to degree k. We also show that the cohomology ring, truncated up to degree k+1, of a finitely generated nilpotent, k-stage formal group is generated in degree 1; this criterion is necessary and sufficient for a finitely generated, 2-step nilpotent group to be k-stage formal. We compute resonance varieties for Heisenberg-type groups and deduce the degree of partial formality for this class of groups.     

Elementary axioms for local maps of toposes

We present a complete elementary axiomatization of local maps of toposes.     

Structure sheaves of definable additive categories

We prove that the 2-category of small abelian categories with exact functors is anti-equivalent to the 2-category of definable additive categories. We define and compare sheaves of localisations associated to the objects of these categories. We investigate the natural image of the free abelian category over a ring in the module category over that ring and use this to describe a basis for the Ziegler topology on injectives; the last can be viewed model-theoretically as an elimination of imaginaries result.     

Non-Traditional Squares of Predication and Quantification

Three logical squares of predication or quantification, which one can even extend to logical hexagons, will be presented and analyzed. All three squares are based on ideas of the non-traditional theory of predication developed by Sinowjew and Wessel. The authors also designed a non-traditional theory of quantification. It will be shown that this theory is superfluous, since it is based on an obscure difference between two kinds of quantification and one pays a high price for differentiating in this way: losing the definability between the existence- and all-quantifier. Therefore, a combination of non-traditional predication and classical quantification is preferred here.