Equality of proofs for linear equality

This paper is about equality of proofs in which a binary predicate formalizing properties of equality occurs, besides conjunction and the constant true proposition. The properties of equality in question are those of a preordering relation, those of an equivalence relation, and other properties appropriate for an equality relation in linear logic. The guiding idea is that equality of proofs is induced by coherence, understood as the existence of a faithful functor from a syntactical category into a category whose arrows correspond to diagrams. Edges in these diagrams join occurrences of variables that must remain the same in every generalization of the proof. It is found that assumptions about equality of proofs for equality are parallel to standard assumptions about equality of arrows in categories. They reproduce standard categorial assumptions on a different level. It is also found that assumptions for a preordering relation involve an adjoint situation.      

Fuzzy sets: A topos-logical point of view

Bénabou deduction-categories are defined, with a set of additional assumptions that define categories with formal finite limits (resp. formal regular categories, formal logoi, formal topoi). They are shown to be generalized structures in which higher-order many-sorted languages can be realized. The corresponding Gentzen-type higher-order calculus of sequents is explicited and the soundness theorem is formulated. A construction is given, which associates to each deduction category with formal properties a real category with the corresponding real properties, in a universal way. The corresponding sounddess and completeness properties are formulated for the real categories thus obtained. Fuzzy sets, as generalized by Goguen are introduced, considered as the objects of a category Fuz(H), which turns out to be the real category associated to a very simple formal topos, and thus to be itself a topos: furthermore this is proved to be a Grothendieck topos which is a strictly full epireflective subcategory of Higgs' category of ‘H-valued sets’. Topoi are proposed as generalized fuzzy sets, and deductio0-categories as generalized² fuzzy sets. Some related topics such as Arbib-Manes fuzzy theories, probability, many-valued and fuzzy logics, intensional logic are very briefly touched upon.     

CONCRETE CATEGORIES FOR WHICH FIBRE COMPLETIONS INDUCE TOPOLOGICAL COMPLETIONS

Abstract

Every topological category over an arbitrary base category X may be considered as a category of T-models with respect to some theory (i.e., functor) T from X into a category of complete lattices. Using this model-theoretic correspondence as our basic tool, we study initial and final completions of (co)fibration complete categories. For an arbitrary concrete category (A, U) over X, the process of order-theoretically completing each fibre does not usually yield an initial/final completion of (A, U). It is shown in this paper that for concrete categories which are assumed to be fibration and/or cofibration complete, initial and final completions can be constructed by completing the fibres. These completions are further shown to exhibit some interesting external properties.     

Variation homological diagrams,¶and corner singularities

We describe the general homological framework (the variation arrays and variation homological diagrams) in which can be studied hypersurface isolated singularities as well as boundary singularities and corner singularities from the point of view of duality. We then show that any corner singularity is extension, in a sense which is defined, of the corner singularities of less dimension on which it is built. This framework is also used to rewrite Thom–Sebastiani type properties for isolated singularities and to establish them for boundary singularities. Received: 27 June 2000 / Revised version: 18 October 2000     

Recovering a Logic from Its Fragments by Meta-Fibring

In this paper we address the question of recovering a logic system by combining two or more fragments of it. We show that, in general, by fibring two or more fragments of a given logic the resulting logic is weaker than the original one, because some meta-properties of the connectives are lost after the combination process. In order to overcome this problem, the categories Mcon and Seq of multiple-conclusion consequence relations and sequent calculi, respectively, are introduced. The main feature of these categories is the preservation, by morphisms, of meta-properties of the consequence relations, which allows, in several cases, to recover a logic by fibring of its fragments. The fibring in this categories is called meta−fibring. Several examples of well-known logics which can be recovered by meta-fibring its fragments (in opposition to fibring in the usual categories) are given. Finally, a general semantics for objects in Seq (and, in particular, for objects in Mcon) is proposed, obtaining a category of logic systems called Log. A general theorem of preservation of completeness by fibring in Log is also obtained.     

Applications of Category Theory to the Area of Algebraic Specification in Computer Science

The theory of algebraic specifications – one of the most important mathematical approaches to the specification of abstract data types and software systems – is reviewed from a mathematical and a computer science point of view. The important role of category theory in this area is discussed and it is shown how the following selected problems are treated using category theory: First, a unified framework for specification logics, second compositional semantics, third partial algebras and their specification, and fourth specifications and models for concurrent systems. For the solution of two of the problems classifying categories are used. They allow to present categories of algebras as functor categories and to derive a number of important properties from well known results for functor categories.     

Bounds for non‐periodic mixtures of infinitely many materials

We prove bounds on the homogenized coefficients for general non‐periodic mixtures of an arbitrary number of isotropic materials, in the heat conduction framework. The component materials and their proportions are given through the Young measure associated to the sequence of coefficient functions. Upper and lower bounds inequalities are deduced in terms of algebraic relations between this Young measure and the eigenvalues of the H‐limit matrix. The proofs employ arguments of compensated compactness and fine properties of Young measures. When restricted to the periodic case, we recover known bounds. Copyright © 2005 John Wiley & Sons, Ltd.     

From triangulated categories to cluster algebras II

In the acyclic case, we establish a one-to-one correspondence between the tilting objects of the cluster category and the clusters of the associated cluster algebra. This correspondence enables us to solve conjectures on cluster algebras. We prove a multiplicativity theorem, a denominator theorem, and some conjectures on properties of the mutation graph. As in the previous article, the proofs rely on the Calabi-Yau property of the cluster category.     

An approximate logic for measures

We present a logical framework for formalizing connections between finitary combinatorics and measure theory or ergodic theory that have appeared in various places throughout the literature. We develop the basic syntax and semantics of this logic and give applications, showing that the method can express the classic Furstenberg correspondence and to give short proofs of the Szemerédi Regularity Lemma and the hypergraph removal lemma. We also derive some connections between the modeltheoretic notion of stability and the Gowers uniformity norms from combinatorics.     

s-homotopy for finite graphs

We introduce the notion of “s-dismantlability” which will give in the category of finite graphs an analogue of formal deformations defining the simple-homotopy type in the category of finite simplicial complexes. More precisely, s-dismantlability allows us to define an equivalence relation whose equivalence classes are called “s-homotopy types” and we get a correspondence between s-homotopy types in the category of graphs and simple-homotopy types in the category of simplicial complexes by the way of classical functors between these two categories (theorem 3.6). Next, we relate these results to similar results obtained by Barmak and Minian (2006) within the framework of posets (theorem 4.2).     

A logic of implications in algebra and coalgebra

Implications in a category can be presented as epimorphisms: an object satisfies the implication iff it is injective with respect to that epimorphism. G. Ro?u formulated a logic for deriving an implication from other implications. We present two versions of implicational logics: a general one and a finitary one (for epimorphisms with finitely presentable domains and codomains). In categories Alg Σ of algebras on a given signature our logic specializes to the implicational logic of R. Quackenbush. In categories Coalg H of coalgebras for a given accessible endofunctor H of sets we derive a logic for implications in the sense of P. Gumm.     

A Non-Standard Analysis of a Cultural Icon: The Case of Paul Halmos

We examine Paul Halmos’ comments on category theory, Dedekind cuts, devil worship, logic, and Robinson’s infinitesimals. Halmos’ scepticism about category theory derives from his philosophical position of naive set-theoretic realism. In the words of an MAA biography, Halmos thought that mathematics is “certainty” and “architecture” yet 20th century logic teaches us is that mathematics is full of uncertainty or more precisely incompleteness. If the term architecture meant to imply that mathematics is one great solid castle, then modern logic tends to teach us the opposite lesson, namely that the castle is floating in midair. Halmos’ realism tends to color his judgment of purely scientific aspects of logic and the way it is practiced and applied. He often expressed distaste for nonstandard models, and made a sustained effort to eliminate first-order logic, the logicians’ concept of interpretation, and the syntactic vs semantic distinction. He felt that these were vague, and sought to replace them all by his polyadic algebra. Halmos claimed that Robinson’s framework is “unnecessary” but Henson and Keisler argue that Robinson’s framework allows one to dig deeper into set-theoretic resources than is common in Archimedean mathematics. This can potentially prove theorems not accessible by standard methods, undermining Halmos’ criticisms.     

Cartesian Differential Categories as Skew Enriched Categories

We exhibit the cartesian differential categories of Blute, Cockett and Seely as a particular kind of enriched category. The base for the enrichment is the category of commutative monoids—or in a straightforward generalisation, the category of modules over a commutative rig k. However, the tensor product on this category is not the usual one, but rather a warping of it by a certain monoidal comonad Q. Thus the enrichment base is not a monoidal category in the usual sense, but rather a skew monoidal category in the sense of Szlachányi. Our first main result is that cartesian differential categories are the same as categories with finite products enriched over this skew monoidal base. The comonad Q involved is, in fact, an example of a differential modality. Differential modalities are a kind of comonad on a symmetric monoidal k-linear category with the characteristic feature that their co-Kleisli categories are cartesian differential categories. Using our first main result, we are able to prove our second one: that every small cartesian differential category admits a full, structure-preserving embedding into the cartesian differential category induced by a differential modality (in fact, a monoidal differential modality on a monoidal closed category—thus, a model of intuitionistic differential linear logic). This resolves an important open question in this area.

     

Categories with sums and right distributive tensor product

Models for parallel and concurrent processes lead quite naturally to the study of monoidal categories (Inform. Comput. 88 (2) (1990) 105). In particular a category Tree of trees, equipped with a non-symmetric tensor product, interpreted as a concatenation, seems to be very useful to represent (local) behavior of non-deterministic agents able to communicate (Enriched Categories for Local and Interaction Calculi, Lecture Notes in Computer Science, Vol. 283, Springer, Berlin, 1987, pp. 57-70). The category Tree is also provided with a coproduct (corresponding to choice between behaviors) and the tensor product is only partially distributive w.r.t. it, in order to preserve non-determinism. Such a category can be properly defined as the category of the (finite) symmetric categories on a free monoid, when this free monoid is considered as a 2-category. The monoidal structure is inherited from the concatenation in the monoid. In this paper we prove that for every alphabet A, Tree(A), the category of finite A-labeled trees is equivalent to the free category which is generated by A and enjoys the afore-mentioned properties. The related category Beh(A), corresponding to global behaviors is also proven to be equivalent to the free category which is generated by A and enjoys a smaller set of properties.     

Interpolation property for bicartesian closed categories

Summary We show that proofs in the intuitionistic propositional logic factor through interpolants-in this way we prove a stronger interpolation property than the usual one which gives only the existence of interpolants.Translating that to categorical terms, we show that Pushouts (bipushouts) of bicartesian closed categories have the interpolation property (Theorem 3.2).     

Correspondences of ribbon categories

Much of algebra and representation theory can be formulated in the general framework of tensor categories. The aim of this paper is to further develop this theory for braided tensor categories. Several results are established that do not have a substantial counterpart for symmetric tensor categories. In particular, we exhibit various equivalences involving categories of modules over algebras in ribbon categories. Finally, we establish a correspondence of ribbon categories that can be applied to, and is in fact motivated by, the coset construction in conformal quantum field theory.     

Quantaloid-enriched 范畴上的闭包算子与闭包系统

In this paper, we introduce the fundamental notions of closure operator and closure system in the framework of quantaloid-enriched category. We mainly discuss the relationship between closure operators and adjunctions and establish the one-to-one correspondence between closure operators and closure systems on quantaloid-enriched categories.     

Fermat–Reyes method in the ring of Fermat reals

To discover derivatives, Pierre de Fermat used to assume a non-zero increment h in the incremental ratio and, after some calculations, to set h=0 in the final result. This method, which sounds as inconsistent, can be perfectly formalized with the Fermat–Reyes theorem about existence and uniqueness of a smooth incremental ratio. In the present work, we will introduce the cartesian closed category where to study and prove this theorem and describe in general the Fermat method. The framework is the theory of Fermat reals, an extension of the real field containing nilpotent infinitesimals which does not need any knowledge of mathematical logic. This key theorem will be essential in the development of differential and integral calculus for smooth functions defined on the ring of Fermat reals and also for infinite-dimensional operators like derivatives and integrals.