Rosen's modelling relations constitute a conceptual schema for the understanding of the bidirectional process of correspondence between natural systems and formal symbolic systems. The notion of formal systems used in this study refers to information structures constructed as algebraic rings of observable attributes of natural systems, in which the notion of observable signifies a physical attribute that, in principle, can be measured. Due to the fact that modelling relations are bidirectional by construction, they admit a precise categorical formulation in (...) terms of the category-theoretic syntactic language of adjoint functors, representing the inverse processes of information encoding/decoding via adjunctions. As an application, we construct a topological modelling schema of complex systems. The crucial distinguishing requirement between simple and complex systems in this schema is reflected with respect to their rings of observables by the property of global commutativity. The global information structure representing the behaviour of a complex system is modelled functorially in terms of its spectrum functor. An exact modelling relation is obtained by means of a complex encoding/decoding adjunction restricted to an equivalence between the category of complex information structures and the category of sheaves over a base category of partial or local information carriers equipped with an appropriate topology. (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 first part of this study we analyze the process of representation. Representation constitutes a categorical modeling relation that signifies the semantic bidirectional process of correspondence between natural systems and formal symbolic systems. The notion of formal systems is substantiated by algebraic rings of observable attributes of natural systems. In this perspective, the distinction between simple (...) and complex systems is reflected in the appropriate qualification of their corresponding rings of observables. The crucial distinguishing requirement with respect to the coordinatizing rings of observables has to do with the property of global commutativity. The global information structure representing the behavior of a complex system is modeled functorially in terms of its Spectrum functor. Due to the fact that, the fundamental process of representation is bidirectional by construction, it admits a precise categorical formulation in terms of the syntactic language of adjoint functors, constituting thus, a categorical adjunction. The left adjoint functor of this adjunction signifies the process of encoding the information related with phenomena of natural systems in terms of coordinatizing rings of observables, whereas, the right adjoint functor signifies the inverse process of information decoding, which, can be used for making predictions about the behavior of natural systems. (shrink)

The category-theoretic representation of quantum event structures provides a canonical setting for confronting the fundamental problem of truth valuation in quantum mechanics as exemplified, in particular, by Kochen–Specker’s theorem. In the present study, this is realized on the basis of the existence of a categorical adjunction between the category of sheaves of variable local Boolean frames, constituting a topos, and the category of quantum event algebras. We show explicitly that the latter category is equipped with an object of (...) truth values, or classifying object, which constitutes the appropriate tool for assigning truth values to propositions describing the behavior of quantum systems. Effectively, this category-theoretic representation scheme circumvents consistently the semantic ambiguity with respect to truth valuation that is inherent in conventional quantum mechanics by inducing an objective contextual account of truth in the quantum domain of discourse. The philosophical implications of the resulting account are analyzed. We argue that it subscribes neither to a pragmatic instrumental nor to a relative notion of truth. Such an account essentially denies that there can be a universal context of reference or an Archimedean standpoint from which to evaluate logically the totality of facts of nature. (shrink)

We offer a proof of the duality theorem for finitely presented MV-algebras and rational polyhedra, a folklore and yet fundamental result. Our approach develops first a general dual adjunction between MV-algebras and subspaces of Tychonoff cubes, endowed with the transformations that are definable in the language of MV-algebras. We then show that this dual adjunction restricts to a duality between semisimple MV-algebras and closed subspaces of Tychonoff cubes. The duality theorem for finitely presented objects is obtained by a (...) further specialisation. Our treatment is aimed at showing exactly which parts of the basic theory of MV-algebras are needed in order to establish these results, with an eye towards future generalisations. (shrink)

An algebraization of multi-signature first-order logic without terms is presented. Rather than following the traditional method of choosing a type of algebras and constructing an appropriate variety, as is done in the case of cylindric and polyadic algebras, a new categorical algebraization method is used: The substitutions of formulas of one signature for relation symbols in another are treated in the object language. This enables the automatic generation via an adjunction of an algebraic theory. The algebras of this (...) theory are then used to algebraize first-order logic. (shrink)

We develop a category theoretical scheme for the comprehension of the information structure associated with a complex system, in terms of families of partial or local information carriers. The scheme is based on the existence of a categorical adjunction, that provides a theoretical platform for the descriptive analysis of the complex system as a process of functorial information communication.

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)

We pursue the idea that predicate logic is a “fibred algebra” while propositional logic is a single algebra; in the context of intuitionism, this algebraic understanding of predicate logic goes back to Lawvere, in particular his concept of hyperdoctrine. Here, we aim at demonstrating that the notion of monad-relativised hyperdoctrines, which are what we call fibred algebras, yields algebraisations of a wide variety of predicate logics. More specifically, we discuss a typed, first-order version of the non-commutative Full Lambek calculus, which (...) has extensively been studied in the past few decades, functioning as a unifying language for different sorts of logical systems (classical, intuitionistic, linear, fuzzy, relevant, etc.). Through the concept of Full Lambek hyperdoctrines, we establish both generic and set-theoretical completeness results for any extension of the base system; the latter arises from a dual adjunction, and is relevant to the tripos-to-topos construction and quantale-valued sets. Furthermore, we give a hyperdoctrinal account of Girard’s and Gödel’s translation. (shrink)

In this paper, we present a categorical model for Multiplicative Additive Polarized Linear Logic , which is the linear fragment of Olivier Laurent’s Polarized Linear Logic. Our model is based on an adjunction between reflective/coreflective full subcategories / of an ambient *-autonomous category . Similar structures were first introduced by M. Barr in the late 1970’s in abstract duality theory and more recently in work on game semantics for linear logic. The paper has two goals: to discuss concrete (...) models and to present various completeness theorems.As concrete examples, we present a hypercoherence model, using Ehrhard’s hereditary/anti-hereditary objects, a Chu-space model, a double gluing model over our categorical framework, and a model based on iterated double gluing over a *-autonomous category.For the multiplicative fragment of. (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)

In this paper a mathematical scheme for the analysis of quantum event structures is being proposed based on category theoretical methods. It is shown that there exists an adjunctive correspondence between Boolean presheaves of event algebras and quantum event algebras. The adjunction permits a characterization of quantum event structures as Boolean manifolds of event structures. -/- .

This paper presents a systematic investigation of fuzzy Galois connections in the sense of R. Bělohlávek [1], from the point of view of enriched category theory. The results obtained show that the theory of enriched categories makes it possible to present the theory of fuzzy Galois connections in a succinct way; and more importantly, it provides a useful method to express and to study the link and the difference between the commutative and the non-commutative worlds.

The category-theoretic representation of quantum event structures provides a canonical setting for confronting the fundamental problem of truth valua- tion in quantum mechanics as exemplified, in particular, by Kochen-Specker’s theorem. In the present study, this is realized on the basis of the existence of a categorical adjunction between the category of sheaves of variable local Boolean frames, constituting a topos, and the category of quantum event al- gebras. We show explicitly that the latter category is equipped with an (...) object of truth values, or classifying object, which constitutes the appropriate tool for assigning truth values to propositions describing the behavior of quantum systems. Effectively, this category-theoretic representation scheme circumvents consistently the semantic ambiguity with respect to truth valuation that is in- herent in conventional quantum mechanics by inducing an objective contextual account of truth in the quantum domain of discourse. The philosophical im- plications of the resulting account are analyzed. We argue that it subscribes neither to a pragmatic instrumental nor to a relative notion of truth. Such an account essentially denies that there can be a universal context of reference or an Archimedean standpoint from which to evaluate logically the totality of facts of nature. In this light, the transcendence condition of the usual concep- tion of correspondence truth is superseded by a reflective-like transcendental reasoning of the proposed account of truth that is suitable to the quantum domain of discourse. (shrink)

We propose a sheaf-theoretic framework for the representation of a quantum observable structure in terms of Boolean information sieves. The algebraic representation of a quantum observable structure in the relational local terms of sheaf theory effectuates a semantic transition from the axiomatic set-theoretic context of orthocomplemented partially ordered sets, la Birkhoff and Von Neumann, to the categorical topos-theoretic context of Boolean information sieves, la Grothendieck. The representation schema is based on the existence of a categorical adjunction, which (...) is used as a theoretical platform for the development of a functorial formulation of information transfer, between quantum observables and Boolean localisation devices in typical quantum measurement situations. We also establish precise criteria of integrability and invariance of quantum information transfer by cohomological means. (shrink)

Motivated by Kalman residuated lattices, Nelson residuated lattices and Nelson paraconsistent residuated lattices, we provide a natural common generalization of them. Nelson conucleus algebras unify these examples and further extend them to the non-commutative setting. We study their structure, establish a representation theorem for them in terms of twist structures and conuclei that results in a categorical adjunction, and explore situations where the representation is actually an isomorphism. In the latter case, the adjunction is elevated to a (...) categorical equivalence. By applying this representation to the original motivating special cases we bring to the surface their underlying similarities. (shrink)

We develop a categorical scheme of interpretation of quantum event structures from the viewpoint of Grothendieck topoi. The construction is based on the existence of an adjunctive correspondence between Boolean presheaves of event algebras and Quantum event algebras, which we construct explicitly. We show that the established adjunction can be transformed to a categorical equivalence if the base category of Boolean event algebras, defining variation, is endowed with a suitable Grothendieck topology of covering systems. The scheme leads (...) to a sheaf theoretical representation of Quantum structure in terms of variation taking place over epimorphic families of Boolean reference frames. (shrink)

Proof theory and category theory were first drawn together by Lambek some 30 years ago but, until now, the most fundamental notions of category theory have not been explained systematically in terms of proof theory. Here it is shown that these notions, in particular the notion of adjunction, can be formulated in such as way as to be characterised by composition elimination. Among the benefits of these composition-free formulations are syntactical and simple model-theoretical, geometrical decision procedures for the commuting (...) of diagrams of arrows. Composition elimination, in the form of Gentzen's cut elimination, takes in categories, and techniques inspired by Gentzen are shown to work even better in a purely categorical context than in logic. An acquaintance with the basic ideas of general proof theory is relied on only for the sake of motivation, however, and the treatment of matters related to categories is also in general self contained. Besides familiar topics, presented in a novel, simple way, the monograph also contains new results. It can be used as an introductory text in categorical proof theory. (shrink)

The starting point of the present study is the interpretation of intuitionistic linear logic in Petri nets proposed by U. Engberg and G. Winskel. We show that several categories of order algebras provide equivalent interpretations of this logic, and identify the category of the so called strongly coherent quantales arising in these interpretations. The equivalence of the interpretations is intimately related to the categorical facts that the aforementioned categories are connected with each other via adjunctions, and the compositions of (...) the connecting functors with co-domain the category of strongly coherent quantales are dense. In particular, each quantale canonically induces a Petri net, and this association gives rise to an adjunction between the category of quantales and a category whose objects are all Petri nets. (shrink)

The transition from Middle English to Modern English in the second half of the 14th century is a turning point in the syntax of the language. It is at once the point when several constraints on nominal arguments that had been gaining ground since Old English become categorical, and the point when a reorganization of the functional category Infl is initiated, whose completion over the next several centuries yields essentially the syntactic system of the present day. From this time (...) on, subjects are obligatory, and they must be placed in Spec-IP position. In the VP, the last traces of OV order disappear, the order of direct and indirect object becomes fixed, the first “recipient passives” enter the language, and objects cease to be separable from the verb by adverbs or adjuncts. The V2 constraint of Old and Middle English is lost, as topicalized constituents cease to trigger verb-fronting. Concurrently, in the Infl system, the first instances of periphrastic do-support begin to replace fronting of the finite main verb, and, with the appearance of split infinitives and pro-infinitives, to starts to pattern as a non-finite Aux rather than, as in earlier stages, as a prefix marking the infinitive. All these changes have been dated to the second half of the 14th century, most of them specifically to the period between 1360 and 1380. (shrink)

The logic of discovering and that of justifying have been a permanent source of debate in mathematics, because of their different and apparently contradictory features within the processes of production of mathematical sentences. In fact, a fundamental unity appears as soon as one investigates deeply the phenomenology of conjecturing and proving using concrete examples. In this paper it is shown that abduction, in the sense of Peirce, is an essential unifying activity, ruling such phenomena. Abduction is the major ingredient in (...) a theoretical model suitable for describing the tran-sition from the conjecturing to the proving phase. In the paper such a model is introduced and worked out to test Lakatos' machinery of proofs and refutations from a new point of view. Abduction and its categorical counter-part, adjunction, allow to explain within a unifying framework most of the phenomenology of conjectures and proofs, encompassing also the method of Greek analysis-synthesis. (shrink)

The category-theoretic nature of general frames for modal logic is explored. A new notion of "modal map" between frames is defined, generalizing the usual notion of bounded morphism/p-morphism. The category Fm of all frames and modal maps has reflective subcategories CHFm of compact Hausdorff frames, DFm of descriptive frames, and UEFm of ultrafilter enlargements of frames. All three subcategories are equivalent, and are dual to the category of modal algebras and their homomorphisms. An important example of a modal map that (...) is typically not a bounded morphism is the natural insertion of a frame A into its ultrafilter enlargement EA. This map is used to show that EA is the free compact Hausdorff frame generated by A relative to Fm. The monad E of the resulting adjunction is examined and its Eilenberg-Moore category is shown to be isomorphic to CHFm. A categorical equivalence between the Kleisli category of E and UEFm is defined from a construction that assigns to each frame A a frame A* that is "image-closed" in the sense that every point-image {b : aRb} in A is topologically closed. A* is the unique image-closed frame having the same ultrafilter enlargement as A. (shrink)

This is the first part of a larger project that aims to develop a cross-categorical semantic account of a broad range of _as if_ constructions in English. In this paper, we focus on descriptive uses of _as if_ with regular truth-conditional content. The core proposal is that _as if_-phrases contribute hypothetical (_if_-like) and comparative (_as_-like) properties of situations, which are instantiated by an event, state, or larger situation when it resembles in some relevant respect its counterparts in selected stereotypical (...) worlds described by the clause embedded under _as if_. We motivate and develop this situation-semantic analysis in detail for examples like _Pedro danced as if he was possessed by demons_ where the modifying _as if_-adjunct is used to inferentially convey the manner of a reported activity. We extend this analysis to _as if_-complements of perception verbs in reports like _The soup tastes as if it contains fish sauce_, offering an alternative to conceptually problematic approaches that assimilate such perceptual resemblance reports to propositional attitude ascriptions. We also examine the predicative function of _as if_ in examples like _The state of the house is as if a tornado passed through it_ where the _as if_-phrase denotes a hypothetical comparative property of the nominal subject. (shrink)

We develop a relativistic perspective on structures of quantum observables, in terms of localization systems of Boolean coordinatizing charts. This perspective implies that the quantum world is comprehended via Boolean reference frames for measurement of observables, pasted together along their overlaps. The scheme is formalized categorically, as an instance of the adjunction concept. The latter is used as a framework for the specification of a categorical equivalence signifying an invariance in the translational code of communication between Boolean localizing (...) contexts and quantum systems. Aspects of the scheme semantics are discussed in relation to logic. The interpretation of coordinatizing localization systems, as structure sheaves, provides the basis for the development of an algebraic differential geometric machinery suited to the quantum regime. (shrink)

It is a well-known fact that although the poset of open sets of a topological space is a Heyting algebra, its Heyting implication is not necessarily stable under the inverse image of continuous functions and hence is not a geometric concept. This leaves us wondering if there is any stable family of implications that can be safely called geometric. In this paper, we will first recall the abstract notion of implication as a binary modality introduced in Akbar Tabatabai (Implication via (...) spacetime. In: Mathematics, logic, and their philosophies: essays in honour of Mohammad Ardeshir, pp 161–216, 2021). Then, we will use a weaker version of categorical fibrations to define the geometricity of a category of pairs of spaces and implications over a given category of spaces. We will identify the greatest geometric category over the subcategories of open-irreducible (closed-irreducible) maps as a generalization of the usual injective open (closed) maps. Using this identification, we will then characterize all geometric categories over a given category $${\mathcal {S}}$$ S, provided that $${\mathcal {S}}$$ S has some basic closure properties. Specially, we will show that there is no non-trivial geometric category over the full category of spaces. Finally, as the implications we identified are also interesting in their own right, we will spend some time to investigate their algebraic properties. We will first use a Yoneda-type argument to provide a representation theorem, making the implications a part of an adjunction-style pair. Then, we will use this result to provide a Kripke-style representation for any arbitrary implication. (shrink)

Using Butz and Moerdijk's topological groupoid representation of a topos with enough points, a ‘syntax-semantics’ duality for geometric theories is constructed. The emphasis is on a logical presentation, starting with a description of the semantic topological groupoid of models and isomorphisms of a theory. It is then shown how to extract a theory from equivariant sheaves on a topological groupoid in such a way that the result is a contravariant adjunction between theories and groupoids, the restriction of which is (...) a duality between theories with enough models and semantic groupoids. Technically a variant of the syntax-semantics duality constructed in 1 for first-order logic, the construction here works for arbitrary geometric theories and uses a slice construction on the side of groupoids—reflecting the use of ‘indexed’ models in the representation theorem—which in several respects simplifies the construction and the characterization of semantic groupoids. (shrink)

Samson Abramsky’s wide-ranging contributions to logical and structural aspects of Computer Science have had a major influence on the field. This book is a rich collection of papers, inspired by and extending Abramsky’s work. It contains both survey material and new results, organised around six major themes: domains and duality, game semantics, contextuality and quantum computation, comonads and descriptive complexity, categorical and logical semantics, and probabilistic computation. These relate to different stages and aspects of Abramsky’s work, reflecting its exceptionally (...) broad scope and his ability to illuminate and unify diverse topics. Chapters in the volume include a review of his entire body of work, spanning from philosophical aspects to logic, programming language theory, quantum theory, economics and psychology, and relating it to a theory of unification of sciences using dual adjunctions. The section on game semantics shows how Abramsky’s work has led to a powerful new paradigm for the semantics of computation. The work on contextuality and categorical quantum mechanics has been highly influential, and provides the foundation for increasingly widely used methods in quantum computing. The work on comonads and descriptive complexity is building bridges between currently disjoint research areas in computer science, relating Structure to Power. The volume also includes a scientific autobiography, and an overview of the contributions. The outstanding set of contributors to this volume, including both senior and early career academics, serve as testament to Samson Abramsky’s enduring influence. It will provide an invaluable and unique resource for both students and established researchers. (shrink)

The article focuses on representing different forms of non-adjunctive inference as sub-Kripkean systems of classical modal logic, where the inference from □A and □B to □A ∧ B fails. In particular we prove a completeness result showing that the modal system that Schotch and Jennings derive from a form of non-adjunctive inference in (Schotch and Jennings, 1980) is a classical system strictly stronger than EMN and weaker than K (following the notation for classical modalities presented in Chellas, 1980). The unified (...) semantical characterization in terms of neighborhoods permits comparisons between different forms of non-adjunctive inference. For example, we show that the non-adjunctive logic proposed in (Schotch and Jennings, 1980) is not adequate in general for representing the logic of high probability operators. An alternative interpretation of the forcing relation of Schotch and Jennings is derived from the proposed unified semantics and utilized in order to propose a more fine-grained measure of epistemic coherence than the one presented in (Schotch and Jennings, 1980). Finally we propose a syntactic translation of the purely implicative part of Jaśkowski's system D₂ into a classical system preserving all the theorems (and non-theorems) explicilty mentioned in (Jaśkowski, 1969). The translation method can be used in order to develop epistemic semantics for a larger class of non-adjunctive (discursive) logics than the ones historically investigated by Jaśkowski. (shrink)

The rule of adjunction is intuitively appealing and uncontroversial for deductive inference, but in situations where information can be uncertain, the rule is neither needed nor wanted for rational acceptance, as illustrated by the lottery paradox. Practical certainty is the acceptance of statements whose chances of error are smaller than a prescribed threshold parameter, when evaluated against an evidential corpus. We examine the failure of adjunction in relation to the threshold parameter for practical certainty, with an eye towards (...) reinstating the rule of adjunction in some restricted forms, by observing the conditions under which the overall chance of error of the joint statements can be variously bounded. (shrink)

The event analysis of action sentences seems to be at odds with plausible (Davidsonian) views about how to count actions. If Booth pulled a certain trigger, and thereby shot Lincoln, there is good reason for identifying Booths' action of pulling the trigger with his action of shooting Lincoln; but given truth conditions of certain sentences involving adjuncts, the event analysis requires that the pulling and the shooting be distinct events. So I propose that event sortals like 'shooting' and 'pulling' are (...) true of complex events that have actions (and various effects of actions) as parts. Combining this view with some facts about so-called causative verbs, I then argue that paradigmatic actions are best viewed as tryings, where tryings are taken to be intentionally characterized events that typically cause peripheral bodily motions. The proposal turns on a certain conception of what it is to be the Agent of an event; and I conclude by elaborating this conception in the context of some recent discussions about the relation of thematic roles to grammatical categories. (shrink)

The third author has shown that Shelah's eventual categoricity conjecture holds in universal classes: class of structures closed under isomorphisms, substructures, and unions of chains. We extend this result to the framework of multiuniversal classes. Roughly speaking, these are classes with a closure operator that is essentially algebraic closure (instead of, in the universal case, being essentially definable closure). Along the way, we prove in particular that Galois (orbital) types in multiuniversal classes are determined by their finite restrictions, generalizing a (...) result of the second author. (shrink)

We prove that each ω-categorical, generically stable group is solvable-by-finite.

We investigate effective categoricity for polymodal algebras. We prove that the class of polymodal algebras is complete with respect to degree spectra of nontrivial structures, effective dimensions, expansion by constants, and degree spectra of relations. In particular, this implies that every categoricity spectrum is the categoricity spectrum of a polymodal algebra.

Husserl's two notions of "definiteness" enabled him to clarify the problem of imaginary numbers. The exact meaning of these notions is a topic of much controversy. A "definite" axiom system has been interpreted as a syntactically complete theory, and also as a categorical one. I discuss whether and how far these readings manage to capture Husserl's goal of elucidating the problem of imaginary numbers, raising objections to both positions. Then, I suggest an interpretation of "absolute definiteness" as semantic completeness (...) and argue that this notion does not suffice to explain Husserl's solution to the problem of imaginary numbers. (shrink)

The categorical dualities presented are: (first) for the category of bi-algebraic lattices that belong to the variety generated by the smallest non-modular lattice with complete (0,1)-lattice homomorphisms as morphisms, and (second) for the category of non-trivial (0,1)-lattices belonging to the same variety with (0,1)-lattice homomorphisms as morphisms. Although the two categories coincide on their finite objects, the presented dualities essentially differ mostly but not only by the fact that the duality for the second category uses topology. Using the presented (...) dualities and some known in the literature results we prove that the Q-lattice of any non-trivial variety of (0,1)-lattices is either a 2-element chain or is uncountable and non-distributive. (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 long series of conversations interweaving mathematical, historical and philosophical aspects of categoricity in model theory took place between the author and Saharon Shelah in 2016 and 2017. In this excerpt of that long conversation, we explore the relationship between explicit and implicit aspects of categoricity. We also discuss the connection with definability issues.

Let $\varSigma $ be a signature without $0$-ary operation symbols and $\textsf{Sl}$ the category of semilattices. Then, after defining and investigating the categories $\int ^{\textsf{Sl}}\textrm{Isys}_{\varSigma }$, of inductive systems of $\varSigma $-algebras over all semilattices, which are ordered pairs $\boldsymbol{\mathscr{A}}= (\textbf{I},\mathscr{A})$ where $\textbf{I}$ is a semilattice and $\mathscr{A}$ an inductive system of $\varSigma $-algebras relative to $\textbf{I}$, and PłAlg$(\varSigma )$, of Płonka $\varSigma $-algebras, which are ordered pairs $(\textbf{A},D)$ where $\textbf{A}$ is a $\varSigma $-algebra and $D$ a Płonka operator for (...) $\textbf{A}$, i.e. in the traditional terminology, a partition function for $\textbf{A}$, we prove the main result of the paper: There exists an adjunction, which we call the Płonka adjunction, from $\int ^{\textsf{Sl}}\textrm{Isys}_{\varSigma }$ to PłAlg$(\varSigma )$. (shrink)

ZusammenfassungIm Zuge des „empirical turn“ der Medizin- und Bioethik ist von verschiedenen Autoren in den vergangenen Jahren die Idee einer „evidenzbasierten Ethik“ diskutiert worden. Die Analogie zwischen evidenzbasierter Medizin und „evidenzbasierter Ethik“ soll in diesem Beitrag kritisch diskutiert und dabei gezeigt werden, dass der Ausdruck „evidenzbasierte Ethik“ irreführend ist. Zentraler Ausgangspunkt der Kritik ist die unterschiedliche Bedeutung, die empirische Informationen für das medizinisch-klinische Urteil zum einen und das ethische Urteil in der Medizin zum anderen haben. Im medizinisch-klinischen Urteil können mit (...) Hilfe empirischer Informationen hypothetische Handlungsnormen generiert werden, welche auf den der Medizin inhärenten Zwecksetzungen basieren. Bei Fragen der Ethik in der Medizin hingegen sind die Handlungsziele selbst Gegenstand des Urteils; diese aber können allein aus empirischem Wissen heraus nicht zureichend bestimmt werden. Die Diskussion um die Möglichkeit einer „evidenzbasierten Ethik“ eröffnet weiterhin aufschlussreiche Perspektiven in Bezug auf empirische Forschung und den Umgang mit empirischen Informationen in der Angewandten Ethik und das Aufgabenfeld der Medizinethik. (shrink)

For a computable structure $\mathcal {M}$, the categoricity spectrum is the set of all Turing degrees capable of computing isomorphisms among arbitrary computable copies of $\mathcal {M}$. If the spectrum has a least degree, this degree is called the degree of categoricity of $\mathcal {M}$. In this paper we investigate spectra of categoricity for computable rigid structures. In particular, we give examples of rigid structures without degrees of categoricity.

We prove that from categoricity in λ+ we can get categoricity in all cardinals ≥ λ+ in a χ-tame abstract elementary classe [Formula: see text] which has arbitrarily large models and satisfies the amalgamation and joint embedding properties, provided [Formula: see text] and λ ≥ χ. For the missing case when [Formula: see text], we prove that [Formula: see text] is totally categorical provided that [Formula: see text] is categorical in [Formula: see text] and [Formula: see text].

On a widespread naturalist view, the meanings of mathematical terms are determined, and can only be determined, by the way we use mathematical language—in particular, by the basic mathematical principles we’re disposed to accept. But it’s mysterious how this can be so, since, as is well known, minimally strong first-order theories are non-categorical and so are compatible with countless non-isomorphic interpretations. As for second-order theories: though they typically enjoy categoricity results—for instance, Dedekind’s categoricity theorem for second-order and Zermelo’s quasi-categoricity (...) theorem for second-order —these results require full second-order logic. So appealing to these results seems only to push the problem back, since the principles of second-order logic are themselves non-categorical: those principles are compatible with restricted interpretations of the second-order quantifiers on which Dedekind’s and Zermelo’s results are no longer available. In this paper, we provide a naturalist-friendly, non-revisionary solution to an analogous but seemingly more basic problem—Carnap’s Categoricity Problem for propositional and first-order logic—and show that our solution generalizes, giving us full second-order logic and thereby securing the categoricity or quasi-categoricity of second-order mathematical theories. Briefly, the first-order quantifiers have their intended interpretation, we claim, because we’re disposed to follow the quantifier rules in an open-ended way. As we show, given this open-endedness, the interpretation of the quantifiers must be permutation-invariant and so, by a theorem recently proved by Bonnay and Westerståhl, must be the standard interpretation. Analogously for the second-order case: we prove, by generalizing Bonnay and Westerståhl’s theorem, that the permutation invariance of the interpretation of the second-order quantifiers, guaranteed once again by the open-endedness of our inferential dispositions, suffices to yield full second-order logic. (shrink)

Two models of second-order ZFC need not be isomorphic to each other, but at least one is isomorphic to an initial segment of the other. The situation is subtler for impure set theory, but Vann McGee has recently proved a categoricity result for second-order ZFCU plus the axiom that the urelements form a set. Two models of this theory with the same universe of discourse need not be isomorphic to each other, but the pure sets of one are isomorphic to (...) the pure sets of the other. This paper argues that similar results obtain for considerably weaker second-order axiomatizations of impure set theory that are in line with two different conceptions of set, the iterative conception and the limitation of size doctrine. (shrink)

Vann McGee has recently argued that Belnap’s criteria constrain the formal rules of classical natural deduction to uniquely determine the semantic values of the propositional logical connectives and quantifiers if the rules are taken to be open-ended, i.e., if they are truth-preserving within any mathematically possible extension of the original language. The main assumption of his argument is that for any class of models there is a mathematically possible language in which there is a sentence true in just those models. (...) I show that this assumption does not hold for the class of models of classical propositional logic. In particular, I show that the existence of non-normal models for negation undermines McGee’s argument. (shrink)