This article proposes to explicate theoretical equivalence by supplementing formal equivalence criteria with preservation conditions concerning interpretation. I argue that both the internal structure of models and choices of morphisms are aspects of formalisms that are relevant when it comes to their interpretation. Hence, a formal criterion suitable for being supplemented with preservation conditions concerning interpretation should take these two aspects into account. The two currently most important criteria—gener-alized definitional equivalence (Morita equivalence) and categorical (...) class='Hi'>equivalence—are not optimal in this respect. I put forward a criterion that takes both aspects into account: the criterion of definable categorical equivalence. (shrink)

A classic result in the foundations of Yang-Mills theory, due to J. W. Barrett ["Holonomy and Path Structures in General Relativity and Yang-Mills Theory." Int. J. Th. Phys. 30, ], establishes that given a "generalized" holonomy map from the space of piece-wise smooth, closed curves based at some point of a manifold to a Lie group, there exists a principal bundle with that group as structure group and a principal connection on that bundle such that the holonomy map corresponds to (...) the holonomies of that connection. Barrett also provided one sense in which this "recovery theorem" yields a unique bundle, up to isomorphism. Here we show that something stronger is true: with an appropriate definition of isomorphism between generalized holonomy maps, there is an equivalence of categories between the category whose objects are generalized holonomy maps on a smooth, connected manifold and whose arrows are holonomy isomorphisms, and the category whose objects are principal connections on principal bundles over a smooth, connected manifold. This result clarifies, and somewhat improves upon, the sense of "unique recovery" in Barrett's theorems; it also makes precise a sense in which there is no loss of structure involved in moving from a principal bundle formulation of Yang-Mills theory to a holonomy, or "loop", formulation. (shrink)

The category \(\mathbb {DRDL}{'}\), whose objects are c-differential residuated distributive lattices satisfying the condition \(\textbf{CK}\), is the image of the category \(\mathbb {RDL}\), whose objects are residuated distributive lattices, under the categorical equivalence \(\textbf{K}\) that is constructed in Castiglioni et al. (Stud Log 90:93–124, 2008). In this paper, we introduce weak monadic residuated lattices and study some of their subvarieties. In particular, we use the functor \(\textbf{K}\) to relate the category \(\mathbb {WMRDL}\), whose objects are weak monadic residuated (...) distributive lattices, and the category \(\mathbb {WMDRDL}{'}\), whose objects are pairs formed by an object of \(\mathbb {DRDL}{'}\) and a center weak universal quantifier. (shrink)

In this paper we provide a categorical equivalence for the category \ of product algebras, with morphisms the homomorphisms. The equivalence is shown with respect to a category whose objects are triplets consisting of a Boolean algebra B, a cancellative hoop C and a map \ from B × C into C satisfying suitable properties. To every product algebra P, the equivalence associates the triplet consisting of the maximum boolean subalgebra B, the maximum cancellative subhoop C, (...) of P, and the restriction of the join operation to B × C. Although several equivalences are known for special subcategories of \ , up to our knowledge, this is the first equivalence theorem which involves the whole category of product algebras. The syntactic counterpart of this equivalence is a syntactic reduction of classical logic CL and of cancellative hoop logic CHL to product logic, and viceversa. (shrink)

In this paper we present a category equivalent to that of tense Nelson algebras. The objects in this new category are pairs consisting of an IKt-algebra and a Boolean IKt-congruence and the morphisms are a special kind of IKt-homomorphisms. This categorical equivalence permits understanding tense Nelson algebras in terms of the better–known IKt-algebras.

An equivalence between the category of MV-algebras and the category \ is given in Castiglioni et al. :67–92, 2014). An integral residuated lattice with bottom is an MV-algebra if and only if it satisfies the equations \ \vee = 1}\) and \ = a \wedge b}\). An object of \ is a residuated lattice which in particular satisfies some equations which correspond to the previous equations. In this paper we extend the equivalence to the category whose objects are (...) pairs, where A is an MV-algebra and I is an ideal of A. (shrink)

An explicit categorical equivalence is defined between a proper subvariety of the class of \-algebras, as defined by Di Nola and Dvurečenskij, to be called \-algebras, and the category of semi-low \-rings. This categorical representation is done using the prime spectrum of the \-algebras, through the equivalence between \-algebras and \-groups established by Mundici, from the perspective of the Dubuc–Poveda approach, that extends the construction defined by Chang on chains. As a particular case, semi-low \-rings associated (...) to Boolean algebras are characterized. (shrink)

An explicit categorical equivalence is defined between a proper subvariety of the class of \-algebras, as defined by Di Nola and Dvurečenskij, to be called \-algebras, and the category of semi-low \-rings. This categorical representation is done using the prime spectrum of the \-algebras, through the equivalence between \-algebras and \-groups established by Mundici, from the perspective of the Dubuc–Poveda approach, that extends the construction defined by Chang on chains. As a particular case, semi-low \-rings associated (...) to Boolean algebras are characterized. (shrink)

We follow the ideas given by Chen and Grätzer to represent Stone algebras and adapt them for the case of Stonean residuated lattices. Given a Stonean residuated lattice, we consider the triple formed by its Boolean skeleton, its algebra of dense elements and a connecting map. We define a category whose objects are these triples and suitably defined morphisms, and prove that we have a categorical equivalence between this category and that of Stonean residuated lattices. We compare our (...) results with other works and show some applications of the equivalence. (shrink)

A commutative BCK-algebra with the relative cancellation property is a commutative BCK-algebra (X;*,0) which satisfies the condition: if a ≤ x, a ≤ y and x * a = y * a, then x = y. Such BCK-algebras form a variety, and the category of these BCK-algebras is categorically equivalent to the category of Abelian ℓ-groups whose objects are pairs (G, G 0), where G is an Abelian ℓ-group, G 0 is a subset of the positive cone generating G + (...) such that if u, v ∈ G 0, then 0 ∨ (u - v) ∈ G 0, and morphisms are ℓ-group homomorphisms h: (G, G 0) → (G′,G′0) with f(G 0) ⫅ G′0. Our methods in particular cases give known categorical equivalences of Cornish for conical BCK-algebras and of Mundici for bounded commutative BCK-algebras (= MV-algebras). (shrink)

An equivalence between the category of MV-algebras and the category $${{\rm MV^{\bullet}}}$$ MV ∙ is given in Castiglioni et al. :67–92, 2014). An integral residuated lattice with bottom is an MV-algebra if and only if it satisfies the equations $${a = \neg \neg a, \vee = 1}$$ a = ¬ ¬ a, ∨ = 1 and $${a \odot = a \wedge b}$$ a ⊙ = a ∧ b. An object of $${{\rm MV^{\bullet}}}$$ MV ∙ is a residuated lattice which (...) in particular satisfies some equations which correspond to the previous equations. In this paper we extend the equivalence to the category whose objects are pairs, where A is an MV-algebra and I is an ideal of A. (shrink)

This paper introduces the notion of logical quantale module. It proves that there is a dual equivalence between the category of logical quantale modules and the category of quantum B‐modules, in the way that every quantum B‐module admits a natural embedding into a logical quantale module, the enveloping quantale module.

In recent years, philosophers of science have explored categorical equivalence as a promising criterion for when two theories are equivalent. On the one hand, philosophers have presented several examples of theories whose relationships seem to be clarified using these categorical methods. On the other hand, philosophers and logicians have studied the relationships, particularly in the first order case, between categorical equivalence and other notions of equivalence of theories, including definitional equivalence and generalized definitional (...) equivalence. In this article, I will express some skepticism about categorical equivalence as a criterion of physical equivalence, both on technical grounds and conceptual ones. I will argue that “category structure” likely does not capture the structure of a theory, and discuss some recent work in light of this claim. (shrink)

Closure space has been proven to be a useful tool to restructure lattices and various order structures. This paper aims to provide an approach to characterizing domains by means of closure spaces. The notion of an interpolative generalized closure space is presented and shown to generate exactly domains, and the notion of an approximable mapping between interpolative generalized closure spaces is identified to represent Scott continuous functions between domains. These produce a category equivalent to that of domains with Scott continuous (...) functions. Meanwhile, some important subclasses of domains are discussed, such as algebraic domains, _L_-domains, bounded-complete domains, and continuous lattices. Conditions are presented which, when fulfilled by an interpolative generalized closure space, make the generated domain fulfill some restrictive conditions. (shrink)

In this note we develop a method for constructing finite totally-ordered m-zeroids and prove that there exists a categorical equivalence between the category of finite, totally-ordered m-zeroids and the category of pseudo Łukasiewicz-like implicators.

In this paper we prove that the category of abelianl-groups is equivalent to the category of perfect MV-algebras. Furthermore, we give a finite equational axiomatization of the variety generated by perfect MV-algebras.

In this paper we investigate a categorical equivalence between square root qMV-algehras (a variety of algebras arising from quantum computation) and a category of preordered semigroups.

In this paper we prove that the category of abelian l-groups is equivalent to the category of perfect MV-algebras. Furthermore, we give a finite equational axiomatization of the variety generated by perfect MV-algebras.

Equivalences and translations between consequence relations abound in logic. The notion of equivalence can be defined syntactically, in terms of translations of formulas, and order-theoretically, in terms of the associated lattices of theories. W. Blok and D. Pigozzi proved in [4] that the two definitions coincide in the case of an algebraizable sentential deductive system. A refined treatment of this equivalence was provided by W. Blok and B. Jónsson in [3]. Other authors have extended this result to the (...) cases of k-deductive systems and of consequence relations on associative, commutative, multiple conclusion sequents. Our main result subsumes all existing results in the literature and reveals their common character. The proofs are of order-theoretic and categorical nature. (shrink)

We investigate effective categoricity of computable equivalence structures . We show that is computably categorical if and only if has only finitely many finite equivalence classes, or has only finitely many infinite classes, bounded character, and at most one finite k such that there are infinitely many classes of size k. We also prove that all computably categorical structures are relatively computably categorical, that is, have computably enumerable Scott families of existential formulas. Since all computable (...) equivalence structures are relatively categorical, we further investigate when they are categorical. We also obtain results on the index sets of computable equivalence structures. (shrink)

A category theoretic generalization of the theory of algebraizable deductive systems of Blok and Pigozzi is developed. The theory of institutions of Goguen and Burstall is used to provide the underlying framework which replaces and generalizes the universal algebraic framework based on the notion of a deductive system. The notion of a term -institution is introduced first. Then the notions of quasi-equivalence, strong quasi-equivalence and deductive equivalence are defined for -institutions. Necessary and sufficient conditions are given for (...) the quasi-equivalence and the deductive equivalence of two term -institutions, based on the relationship between their categories of theories. The results carry over without any complications to institutions, via their associated -institutions. The -institution associated with a deductive system and the institution of equational logic are examined in some detail and serve to illustrate the general theory. (shrink)

A category theoretic generalization of the theory of algebraizable deductive systems of Blok and Pigozzi is developed. The theory of institutions of Goguen and Burstall is used to provide the underlying framework which replaces and generalizes the universal algebraic framework based on the notion of a deductive system. The notion of a term π-institution is introduced first. Then the notions of quasi-equivalence, strong quasi-equivalence and deductive equivalence are defined for π-institutions. Necessary and sufficient conditions are given for (...) the quasi-equivalence and the deductive equivalence of two term π-institutions, based on the relationship between their categories of theories. The results carry over without any complications to institutions, via their associated π-institutions. The π-institution associated with a deductive system and the institution of equational logic are examined in some detail and serve to illustrate the general theory. (shrink)

Equivalent deductive systems were introduced in [4] with the goal of treating 1-deductive systems and algebraic 2-deductive systems in a uniform way. Results of [3], appropriately translated and strengthened, show that two deductive systems over the same language type are equivalent if and only if their lattices of theories are isomorphic via an isomorphism that commutes with substitutions. Deductive equivalence of π-institutions [14, 15] generalizes the notion of equivalence of deductive systems. In [15, Theorem 10.26] this criterion for (...) the equivalence of deductive systems was generalized to a criterion for the deductive equivalence of term π-institutions, forming a subclass of all π-institutions that contains those π-institutions directly corresponding to deductive systems. This criterion is generalized here to cover the case of arbitrary π-institutions. (shrink)

Equivalent deductive systems were introduced in [4] with the goal of treating 1‐deductive systems and algebraic 2‐deductive systems in a uniform way. Results of [3], appropriately translated and strengthened, show that two deductive systems over the same language type are equivalent if and only if their lattices of theories are isomorphic via an isomorphism that commutes with substitutions. Deductive equivalence of π‐institutions [14, 15] generalizes the notion of equivalence of deductive systems. In [15, Theorem 10.26] this criterion for (...) the equivalence of deductive systems was generalized to a criterion for the deductive equivalence of term π‐institutions, forming a subclass of all π‐institutions that contains those π‐institutions directly corresponding to deductive systems. This criterion is generalized here to cover the case of arbitrary π‐institutions. (shrink)

We study the algorithmic complexity of embeddings between bi-embeddable equivalence structures. We define the notions of computable bi-embeddable categoricity, \ bi-embeddable categoricity, and degrees of bi-embeddable categoricity. These notions mirror the classical notions used to study the complexity of isomorphisms between structures. We show that the notions of \ bi-embeddable categoricity and relative \ bi-embeddable categoricity coincide for equivalence structures for \. We also prove that computable equivalence structures have degree of bi-embeddable categoricity \, or \. We (...) furthermore obtain results on the index set complexity of computable equivalence structure with respect to bi-embeddability. (shrink)

The paper is devoted to applications of algebraic logic to databases. In databases a query is represented by a formula of first order logic. The same query can be associated with different formulas. Thus, a query is a class of equivalent formulae: equivalence here being similar to that in the transition to the Lindenbaum-Tarski algebra. An algebra of queries is identified with the corresponding algebra of logic. An algebra of replies to the queries is also associated with algebraic logic. (...) These relations lie at the core of the applications.In this paper it is shown how the theory of Halmos (polyadic) algebras (a notion introduced by Halmos as a tool in the algebraization of the first order predicate calculus) is used to create the algebraic model of a relational data base. The model allows us, in particular, to solve the problem of databases equivalence as well as develop a formal algebraic definition of a database's state description. In this paper we use the term "state description" for the logical description of the model. This description is based on the notion of filters in Halmos algebras. When speaking of a state description, we mean the description of a function which realizes the symbols of relations as real relations in the given system of data. (shrink)

We give a correction to the paper [2] mentioned in the title.

Logicians and philosophers of science have proposed various formal criteria for theoretical equivalence. In this paper, we examine two such proposals: definitional equivalence and categorical equivalence. In order to show precisely how these two well-known criteria are related to one another, we investigate an intermediate criterion called Morita equivalence.

I review the philosophical literature on the question of when two physical theories are equivalent. This includes a discussion of empirical equivalence, which is often taken to be necessary, and sometimes taken to be sufficient, for theoretical equivalence; and "interpretational" equivalence, which is the idea that two theories are equivalent just in case they have the same interpretation. It also includes a discussion of several formal notions of equivalence that have been considered in the recent philosophical (...) literature, including definitional equivalence and categorical equivalence. The article concludes with a brief discussion of the relationship between equivalence and duality. (shrink)

A categorical structure suitable for interpreting polymorphic lambda calculus (PLC) is defined, providing an algebraic semantics for PLC which is sound and complete. In fact, there is an equivalence between the theories and the categories. Also presented is a definitional extension of PLC including "subtypes", for example, equality subtypes, together with a construction providing models of the extended language, and a context for Girard's extension of the Dialectica interpretation.

If categorical equivalence is a good criterion of theoretical equivalence, then it would seem that if some class of mathematical structures is represented as a category, then any other class of structures categorically equivalent to it will have the same representational capacities. Hudetz (2019a) has presented an apparent counterexample to this claim; in this note, I argue that the counterexample fails.

We characterize the structure of computably categorical trees of finite height, and prove that our criterion is both necessary and sufficient. Intuitively, the characterization is easiest to express in terms of isomorphisms of (possibly infinite) trees, but in fact it is equivalent to a Σ03-condition. We show that all trees which are not computably categorical have computable dimension ω. Finally, we prove that for every n≥ 1 in ω, there exists a computable tree of finite height which is (...) δ0n+1-categorical but not δ0n-categorical. (shrink)

We describe punctual categoricity in several natural classes, including binary relational structures and mono-unary functional structures. We prove that every punctually categorical structure in a finite unary language is${\text {PA}}(0')$-categorical, and we show that this upper bound is tight. We also construct an example of a punctually categorical structure whose degree of categoricity is$0''$. We also prove that, with a bit of work, the latter result can be pushed beyond$\Delta ^1_1$, thus showing that punctually categorical structures (...) can possess arbitrarily complex automorphism orbits.As a consequence, it follows that binary relational structures and unary structures are not universal with respect to primitive recursive interpretations; equivalently, in these classes every rich enough interpretation technique must necessarily involve unbounded existential quantification or infinite disjunction. In contrast, it is well-known that both classes are universal for Turing computability. (shrink)

An important part of the theory of algebraizable sentential logics consists of studying the algebraic semantics of these logics. As developed by Czelakowski, Blok, and Pigozzi and Font and Jansana, among others, it includes studying the properties of logical matrices serving as models of deductive systems and the properties of abstract logics serving as models of sentential logics. The present paper contributes to the development of the categorical theory by abstracting some of these model theoretic aspects and results from (...) the level of sentential logics to the level of π-institutions. (shrink)

Protoalgebraic logics are characterized by the monotonicity of the Leibniz operator on their theory lattices and are at the lower end of the Leibniz hierarchy of abstract algebraic logic. They have been shown to be the most primitive among those logics with a strong enough algebraic character to be amenable to algebraic study techniques. Protoalgebraic π-institutions were introduced recently as an analog of protoalgebraic sentential logics with the goal of extending the Leibniz hierarchy from the sentential framework to the π-institution (...) framework. Many properties of protoalgebraic logics, studied in the sentential logic framework by Blok and Pigozzi, Czelakowski, and Font and Jansana, among others, have already been adapted in previous work by the author to the categorical level. This work aims at further advancing that study by exploring in this new level some more properties of protoalgebraic sentential logics. (shrink)

We continue our study of finitary abstract elementary classes, defined in [7]. In this paper, we prove a categoricity transfer theorem for a case of simple finitary AECs. We introduce the concepts of weak κ-categoricity and f-primary models to the framework of א₀-stable simple finitary AECs with the extension property, whereby we gain the following theorem: Let (������, ≼ ������ ) be a simple finitary AEC, weakly categorical in some uncountable κ. Then (������, ≼ ������ ) is weakly (...) class='Hi'>categorical in each λ ≥ min { \group{ \{\kappa,\beth_{ \group{ (2^{ \aleph_{ 0 _} ^});^{ + ^} \group} _}\}; \group} . If the class (������, ≼ ������ ) is also LS(������)-tame, weak κ-categoricity is equivalent with κ-categoricity in the usual sense. We also discuss the relation between finitary AECs and some other non-elementary frameworks and give several examples. (shrink)

The paper argues against an intuitive reading of the Stone-von Neumann theorem as a categoricity result, thereby pointing out that this theorem does not entail any model-theoretical difference between the theories that validate it and those that don't.

I review the philosophical literature on the question of when two physical theories are equivalent. This includes a discussion of empirical equivalence, which is often taken to be necessary, and sometimes taken to be sufficient, for theoretical equivalence; and “interpretational” equivalence, which is the idea that two theories are equivalent just in case they have the same interpretation. It also includes a discussion of several formal notions of equivalence that have been considered in the recent philosophical (...) literature, including (generalized) definitional equivalence and categorical equivalence. The article concludes with a brief discussion of the relationship between equivalence and duality. The article is in two parts; this is Part 1, which addresses empirical equivalence and definitional equivalence. (shrink)

We consider two categorical syllogisms, valid or invalid, to be equivalent if they can be transformed into each other by certain transformations, going back to Aristotle, that preserve validity. It is shown that two syllogisms are equivalent if and only if they have the same models. Counts are obtained for the number of syllogisms in each equivalence class. For a more natural development, using group-theoretic methods, the space of syllogisms is enlarged to include nonstandard syllogisms, and various groups (...) of transformations on that space are studied. (shrink)

I review the philosophical literature on the question of when two physical theories are equivalent. This includes a discussion of empirical equivalence, which is often taken to be necessary, and sometimes taken to be sufficient, for theoretical equivalence; and “interpretational” equivalence, which is the idea that two theories are equivalent just in case they have the same interpretation. It also includes a discussion of several formal notions of equivalence that have been considered in the recent philosophical (...) literature, including (generalized) definitional equivalence and categorical equivalence. The article concludes with a brief discussion of the relationship between equivalence and duality. The article is in two parts; this is Part 2, which addresses categorical equivalence, interpretational equivalence, and duality. (shrink)

Two first-order logic theories are definitionally equivalent if and only if there is a bijection between their model classes that preserves isomorphisms and ultraproducts (Theorem 2). This is a variant of a prior theorem of van Benthem and Pearce. In Example 2, uncountably many pairs of definitionally inequivalent theories are given such that their model categories are concretely isomorphic via bijections that preserve ultraproducts in the model categories up to isomorphism. Based on these results, we settle several conjectures of Barrett, (...) Glymour and Halvorson. (shrink)

We develop a general covariant categorical modeling theory of natural systems' behavior based on the fundamental functorial processes of representation and localization-globalization. In the second part of this study we analyze the semantic bidirectional process of localization-globalization. The notion of a localization system of a complex information structure bears a dual role: Firstly, it determines the appropriate categorical environment of base reference contexts for considering the operational modeling of a complex system's behavior, and secondly, it specifies the global (...) compatibility conditions of local contextual information. A localization system acts on the global information structure of a complex system, partitions it into sorts, and eventually, forces the consistent sheaf-theoretic fibering of the latter over the base category of commutative reference contexts. In this manner, the sheafification of the Spectrum functor of a complex information structure takes place by imposing on the uniform and homologous fibered structure of elements of the Spectrum presheaf the following two requirements of coherence in relation to the localization-globalization process: [i]. Compatibility of information under restriction from the global to the local level, and [ii]. Compatibility of information under extension from the local to the global level. Correspondingly, the options of local and global receive a concrete mathematical meaning with respect to a suitable notion of topology (categorical Grothendieck topology) defined on the base category of commutative reference contexts. Finally, the accurate functorial process modeling of a complex system's behavior, respecting the processes of representation and localization-globalization, is being effectuated by means of establishing a categorical dual equivalence between the category of complex information structures, and the topes of sheaves over the base category of partial or local information carriers, equipped with the categorical topology of epimorphosis families. (shrink)