We investigate the use of coalgebra to represent quantum systems, thus providing a basis for the use of coalgebraic methods in quantum information and computation. Coalgebras allow the dynamics of repeated measurement to be captured, and provide mathematical tools such as final coalgebras, bisimulation and coalgebraic logic. However, the standard coalgebraic framework does not accommodate contravariance, and is too rigid to allow physical symmetries to be represented. We introduce a fibrational structure on coalgebras in which contravariance is represented by (...) indexing. We use this structure to give a universal semantics for quantum systems based on a final coalgebra construction. We characterize equality in this semantics as projective equivalence. We also define an analogous indexed structure for Chu spaces, and use this to obtain a novel categorical description of the category of Chu spaces. We use the indexed structures of Chu spaces and coalgebras over a common base to define a truncation functor from coalgebras to Chu spaces. This truncation functor is used to lift the full and faithful representation of the groupoid of physical symmetries on Hilbert spaces into Chu spaces, obtained in our previous work, to the coalgebraic semantics. (shrink)

In Computer Science stepwise refinement of algebraic specifications is a well-known formal methodology for rigorous program development. This paper illustrates how techniques from Algebraic Logic, in particular that of interpretation, understood as a multifunction that preserves and reflects logical consequence, capture a number of relevant transformations in the context of software design, reuse, and adaptation, difficult to deal with in classical approaches. Examples include data encapsulation and the decomposition of operations into atomic transactions. But if interpretations open such a new (...) research avenue in program refinement, (conceptual) tools are needed to reason about them. In this line, the paper’s main contribution is a study of the correspondence between logical interpretations and morphisms of a particular kind of coalgebras. This opens way to the use of coalgebraic constructions, such as simulation and bisimulation, in the study of interpretations between (abstract) logics. (shrink)

In this paper the familiar construction of the category of coalgebras for a cartesian comonad is extended to the setting of “algebraic set theory”. In particular, it is shown that, under suitable assumptions, several kinds of categories of classes are stable under the formation of coalgebras for a cartesian comonad, internal presheaves and comma categories.

Frege’s Basic Law V and its successor, Boolos’s New V, are axioms postulating abstraction operators: mappings from the power set of the domain into the domain. Basic Law V proved inconsistent. New V, however, naturally interprets large parts of second-order ZFC via a construction discovered by Boolos in 1989. This paper situates these classic findings about abstraction operators within the general theory of F-algebras and coalgebras. In particular, we show how Boolos’s construction amounts to identifying an initial F-algebra in a (...) certain category, we identify a natural coalgebraic dual to Boolos’s axiom which naturally interprets large parts of Aczel’s non-well-founded set theory via the construction of a certain terminal F-coalgebra, and we suggest a coalgebraic way forward for an abstraction-theoretic axiomatization of the real numbers. (shrink)

The existence of a final coalgebra is equivalent to the existence of a formal logic with a set of formulas that has the Hennessy–Milner property of distinguishing coalgebraic states up to bisimilarity. This applies to coalgebras of any functor on the category of sets for which the bisimilarity relation is transitive. There are cases of functors that do have logics with the Hennessy–Milner property, but the only such logics have a proper class of formulas. The main theorem gives a (...) representation of states of the final coalgebra as certain satisfiable sets of formulas. The key technical fact used is that any function between coalgebras that is truth-preserving and has a simple codomain must be a coalgebraic morphism. (shrink)

We give a coalgebraic view of the restricted Priestley duality between Heyting algebras and Heyting spaces. More precisely, we show that the category of Heyting spaces is isomorphic to a full subcategory of the category of all -coalgebras, based on Boolean spaces, where is the functor which maps a Boolean space to its hyperspace of nonempty closed subsets. As an appendix, we include a proof of the characterization of Heyting spaces and the morphisms between them.

ulations and show that they are definable by a trivial kind of coequation— namely, over one "color". We end with an example of a covariety which is not closed under bisimulations.

We prove that the opposite of the category of coalgebras for the Vietoris endofunctor on the category of compact Hausdorff spaces is monadic over $\mathsf {Set}$. We deliver an analogous result for the upper, lower, and convex Vietoris endofunctors acting on the category of stably compact spaces. We provide axiomatizations of the associated (infinitary) varieties. This can be seen as a version of Jónsson–Tarski duality for modal algebras beyond the zero-dimensional setting.

Bisimulations, behavioral equivalence and logical equivalence are investigated for stochastic image-coalgebras that interpret coalgebraic logic which is defined in terms of predicate liftings. We investigate the conditions for the functor under which these notions of equivalence are related by discussing congruences for the underlying stochastic relation. It is demonstrated that logics as diverse as continuous time stochastic logic and general modal logics can be usefully approached through coalgebraic methods.

We generalize stochastic Kripke models and Markov transition systems to stochastic right coalgebras. These are coalgebras for a functor with as an endofunctor on the category of analytic spaces, and is the subprobability functor. The modal operators are generalized through predicate liftings which are set-valued natural transformations involving the functor. Two states are equivalent iff they cannot be separated by a formula. This equivalence relation is used to construct a cospan for logical equivalent coalgebras under a separation condition for the (...) set of predicate liftings. Consequently, behavioral and logical equivalence are really the same. From the cospan we construct a span. The central argument is a selection argument giving us the dynamics of a mediating coalgebra from the domains of the cospan. This construction is used to establish that behavioral equivalent coalgebras are bisimilar, yielding the equivalence of all three characterizations of a coalgebra’s behavior as in the case of Kripke models or Markov transition systems. (shrink)

In this paper we give an account of the rise and development of coalgebraic thinking in mathematics and computer science as an illustration of the way mathematical frameworks may be transformed. Originating in a foundational dispute as to the correct way to characterise sets, logicians and computer scientists came to see maximizing and minimizing extremal axiomatisations as a dual pair, each necessary to represent entities of interest. In particular, many important infinitely large entities can be characterised in terms of such (...) axiomatisations. We consider reasons for the delay in arriving at the coalgebraic framework, despite many unrecognised manifestations occurring years earlier, and discuss an apparent asymmetry in the relationship between algebra and coalgebra. (shrink)

This paper presents a logical characterization of coalgebraic behavioral equivalence. The characterization is given in terms of coalgebraic modal logic, an abstract framework for reasoning about, and specifying properties of, coalgebras, for an endofunctor on the category of sets. Its main feature is the use of predicate liftings which give rise to the interpretation of modal operators on coalgebras. We show that coalgebraic modal logic is adequate for reasoning about coalgebras, that is, behaviorally equivalent states cannot be distinguished by formulas (...) of the logic. Subsequently, we isolate properties which also ensure expressiveness of the logic, that is, logical and behavioral equivalence coincide. (shrink)

Coalgebras of polynomial functors constructed from sets of observable elements have been found useful in modelling various kinds of data types and state-transition systems. This paper continues the study of equational logic and model theory for polynomial coalgebras begun in Goldblatt , where it was shown that Boolean combinations of equations between terms of observable type form a natural language of observable formulas for specifying properties of polynomial coalgebras, and for giving a Hennessy–Milner style logical characterisation of observational indistinguishability of (...) states.Here we give a structural characterisation of classes of coalgebras definable by observable formulas. This is an analogue for polynomial coalgebras of Birkhoff's celebrated characterisation of equationally definable classes of abstract algebras as being those closed under homomorphic images, subalgebras, and direct products. The coalgebraic characterisation involves new notions of observational ultraproduct and ultrapower of coalgebras, obtained from the classical construction of ultraproducts by deleting states that assign “nonstandard” values to terms of observable type. A class of polynomial coalgebras is shown to be the class of all models of a set of observable formulas if, and only if, it is closed under images of bisimulation relations, disjoint unions and observational ultrapowers.Observational ultraproducts are also used to discuss compactness—which holds only under limited conditions; to characterise finitely, axiomatisable classes of polynomial coalgebras; and to show that there are axiomatisable classes that are not finitely axiomatisable. (shrink)

In a recent article, Alexander Kurz and Yde Venema establish a Lindström theorem for coalgebraic modal logic that is shown to imply a modal Lindström theorem by Maarten de Rijke. A later modal Lindström theorem has been established by Johan van Benthem, and this result still lacks a coalgebraic formulation. The main obstacle has so far been the lack of a suitable notion of ‘submodels’ in coalgebraic semantics, and the problem is left open by Kurz and Venema. In this article, (...) we propose a solution to this problem and derive a general coalgebraic Lindström theorem along the lines of van Benthem's result. We provide several applications of the result. (shrink)

This thesis is intended t0 help develop the theory 0f coalgebras by, Hrst, taking classic theorems in the theory 0f universal algebras amd dualizing them and, second, developing an interna] 10gic for categories 0f coalgebras. We begin with an introduction t0 the categorical approach t0 algebras and the dual 110tion 0f coalgebras. Following this, we discuss (c0)a,lg€bra.s for 2. (c0)monad and develop 2. theory 0f regular subcoalgebras which will be used in the interna] logic. We also prove that categories 0f (...) coalgebras are completc, under reasonably weak conditions, and simultaneously prove the wellknown dual result for categories 0f algebras. We dose the second chapter with 2. discussion 0f bisimulations in which we introduce a weaker 110tion 0f bisimulaticn than is current in the literature, but which is w€H—b€ha.v€d and reduces t0 the standard defmition under the assumption 0f choice. (shrink)

The reductive, as opposed to deductive, view of logic is the form of logic that is, perhaps, most widely employed in practical reasoning. In particular, it is the basis of logic programming. Here, building on the idea of uniform proof in reductive logic, we give a treatment of logic programming for BI, the logic of bunched implications, giving both operational and denotational semantics, together with soundness and completeness theorems, all couched in terms of the resource interpretation of BI’s semantics. We (...) use this set-up as a basis for exploring how coalgebraic semantics can, in contrast to the basic denotational semantics, be used to describe the concrete operational choices that are an essential part of proof-search. The overall aim, toward which this paper can be seen as an initial step, is to develop a uniform, generic, mathematical framework for understanding the relationship between the deductive structure of logics and the control structures of the corresponding reductive paradigm. (shrink)

In this paper we study iterated circular multisets in a coalgebraic framework. We will produce two essentially different universes of such sets. The unisets of the first universe will be shown to be precisely the sets of the Scott universe. The unisets of the second universe will be precisely the sets of the AFA-universe. We will have a closer look into the connection of the iterated circular multisets and arbitrary trees. RID=""ID="" Mathematics Subject Classification (2000): 03B45, 03E65, 03E70, 18A15, 18A22, (...) 18B05, 68Q85 RID=""ID="" Key words or phrases: Multiset – Non-wellfounded set – Scott-universe – AFA – Coalgebra – Modal logic – Graded modalities. (shrink)

The paper uses the formalism of indexed categories to recover the proof of a standard final coalgebra theorem, thus showing existence of final coalgebras for a special class of functors on finitely complete and cocomplete categories. As an instance of this result, we build the final coalgebra for the powerclass functor, in the context of a Heyting pretopos with a class of small maps. This is then proved to provide models for various non-well-founded set theories, depending on the (...) chosen axiomatisation for the class of small maps. (shrink)

This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. I examine the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable propositions, (...) and abstraction principles in the philosophy of mathematics; to the modal and hyperintensional profiles of the logic of rational intuition; and to the types of intention, when the latter is interpreted as a hyperintensional mental state. Chapter 2 argues for a novel type of expressivism based on the duality between the categories of coalgebras and algebras, and argues that the duality permits of the reconciliation between modal cognitivism and modal expressivism. I also develop a novel topic-sensitive truthmaker semantics for dynamic epistemic logic, and develop a novel dynamic epistemic two-dimensional hyperintensional semantics. Chapter 3 provides an abstraction principle for epistemic (hyper-)intensions. Chapter 4 advances a topic-sensitive two-dimensional truthmaker semantics, and provides three novel interpretations of the framework along with the epistemic and metasemantic. Chapter 5 applies the fixed points of the modal μ-calculus in order to account for the iteration of epistemic states in a single agent, by contrast to availing of modal axiom 4 (i.e. the KK principle). The fixed point operators in the modal μ-calculus are rendered hyperintensional, which yields the first hyperintensional construal of the modal μ-calculus in the literature and the first application of the calculus to the iteration of epistemic states in a single agent instead of the common knowledge of a group of agents. Chapter 6 advances a solution to the Julius Caesar problem based on Fine's `criterial' identity conditions which incorporate conditions on essentiality and grounding. Chapter 7 provides a ground-theoretic regimentation of the proposals in the metaphysics of consciousness and examines its bearing on the two-dimensional conceivability argument against physicalism. The topic-sensitive epistemic two-dimensional truthmaker semantics developed in chapters 2 and 4 are availed of in order for epistemic states to be a guide to metaphysical states in the hyperintensional setting. -/- Chapters 8-12 provide cases demonstrating how the two-dimensional hyperintensions of hyperintensional, i.e. topic-sensitive epistemic two-dimensional truthmaker, semantics, solve the access problem in the epistemology of mathematics. Chapter 8 examines the interaction between my hyperintensional semantics and the axioms of epistemic set theory, large cardinal axioms, the Epistemic Church-Turing Thesis, the modal axioms governing the modal profile of Ω-logic, Orey sentences such as the Generalized Continuum Hypothesis, and absolute decidability. These results yield inter alia the first hyperintensional Epistemic Church-Turing Thesis and hyperintensional epistemic set theories in the literature. Chapter 9 examines the modal and hyperintensional commitments of abstractionism, in particular necessitism, and epistemic hyperintensionality, epistemic utility theory, and the epistemology of abstraction. I countenance a hyperintensional semantics for novel epistemic abstractionist modalities. I suggest, too, that observational type theory can be applied to first-order abstraction principles in order to make first-order abstraction principles recursively enumerable, i.e. Turing machine computable, and that the truth of the first-order abstraction principle for hyperintensions is grounded in its being possibly recursively enumerable and the machine being physically implementable. Chapter 10 examines the philosophical significance of hyperintensional Ω-logic in set theory and discusses the hyperintensionality of metamathematics. Chapter 11 provides a modal logic for rational intuition and provides a hyperintensional semantics. Chapter 12 avails of modal coalgebras to interpret the defining properties of indefinite extensibility, and avails of hyperintensional epistemic two-dimensional semantics in order to account for the interaction between the interpretational and objective modalities and truthmakers thereof. This yields the first hyperintensional category theory in the literature. I invent a new mathematical trick in which first order structures are treated as categories, and Vopenka's principle can be satisfied because of the elementary embeddings between the categories and generate Vopenka cardinals while bypassing the category of Set in category theory. Chapter 13 examines modal responses to the alethic paradoxes. Chapter 14 examines, finally, the modal and hyperintensional semantics for the different types of intention and the relation of the latter to evidential decision theory. (shrink)

This paper explores a new language of neighbourhood structures where existential information can be given about what kind of worlds occur in a neighbourhood of a current world. The resulting system of ‘instantial neighbourhood logic’ INL has a nontrivial mix of features from relational semantics and from neighbourhood semantics. We explore some basic model-theoretic behavior, including a matching notion of bisimulation, and give a complete axiom system for which we prove completeness by a new normal form technique. In addition, we (...) relate INL to other modal logics by means of translations, and determine its precise SAT complexity. Finally, we discuss proof-theoretic fine-structure of INL in terms of semantic tableaux and some expressive fine-structure in terms of fragments, while discussing concrete illustrations of the instantial neighborhood language in topological spaces, in games with powers for players construed in a new way, as well as in dynamic logics of acquiring or deleting evidence. We conclude with some coalgebraic perspectives on what is achieved in this paper. Many of these final themes suggest follow-up work of independent interest. (shrink)

This paper aims to provide a mathematically tractable background against which to model both modal cognitivism and modal expressivism. I argue that epistemic modal algebras, endowed with a hyperintensional, topic-sensitive epistemic two-dimensional truthmaker semantics, comprise a materially adequate fragment of the language of thought. I demonstrate, then, how modal expressivism can be regimented by modal coalgebraic automata, to which the above epistemic modal algebras are categorically dual. I examine five methods for modeling the dynamics of conceptual engineering for intensions and (...) hyperintensions. I develop a novel topic-sensitive truthmaker semantics for dynamic epistemic logic, and develop a novel dynamic epistemic two-dimensional hyperintensional semantics. I examine then the virtues unique to the modal expressivist approach here proffered in the setting of the foundations of mathematics, by contrast to competing approaches based upon both the inferentialist approach to concept-individuation and the codification of speech acts via intensional semantics. (shrink)

Compositionality is a principle used in logic, philosophy, mathematics, linguistics, and computer science for assigning meanings to language expressions in a systematic manner following syntactic construction, thereby allowing for a perspicuous algebraic view of the syntax-semantics interface. Yet the status of the principle remains under debate, with positions ranging from compositionality always being achievable to its having genuine empirical content. This paper attempts to sort out some major issues in all this from a logical perspective. First, we stress the fundamental (...) harmony between Compositionality and its apparent antipode of Contextuality that locates meaning in interaction with other linguistic expressions and in other settings than the actual one. Next, we discuss basic further desiderata in designing and adjudicating a compositional semantics for a given language in harmony with relevant contextual syntactic and semantic cues. In particular, in a series of concrete examples in the realm of logic, we point out the dangers of over-interpreting compositional solutions, the ubiquitous entanglement of assigning meanings and the key task of explaining given target inferences, and the dynamics of new language design, illustrating how even established compositional semantics can be rethought in a fruitful manner. Finally, we discuss some fresh perspectives from the realm of game semantics for natural and formal languages, the general setting for Samson Abramsky’s influential work on programming languages and process logics. We highlight outside-in coalgebraic perspectives on meanings as finite or infinitely unfolding behavior that might challenge and enrich current discussions of compositionality. (shrink)

We investigate the role of coalgebraic predicate logic, a logic for neighborhood frames first proposed by Chang, in the study of monotonic modal logics. We prove analogues of the Goldblatt–Thomason theorem and Fine’s canonicity theorem for classes of monotonic neighborhood frames closed under elementary equivalence in coalgebraic predicate logic. The elementary equivalence here can be relativized to the classes of monotonic, quasi-filter, augmented quasi-filter, filter, or augmented filter neighborhood frames, respectively. The original, Kripke-semantic versions of the theorems follow as a (...) special case concerning the classes of augmented filter neighborhood frames. (shrink)

This paper examines the philosophical significance of the consequence relation defined in the $\Omega$-logic for set-theoretic languages. I argue that, as with second-order logic, the hyperintensional profile of validity in $\Omega$-Logic enables the property to be epistemically tractable. Because of the duality between coalgebras and algebras, Boolean-valued models of set theory can be interpreted as coalgebras. In Section \textbf{2}, I demonstrate how the hyperintensional profile of $\Omega$-logical validity can be countenanced within a coalgebraic logic. Finally, in Section \textbf{3}, the philosophical (...) significance of the characterization of the hyperintensional profile of $\Omega$-logical validity for the philosophy of mathematics is examined. I argue (i) that $\Omega$-logical validity is genuinely logical, and (ii) that it provides a hyperintensional account of formal grasp of the concept of `set'. Section \textbf{4} provides concluding remarks. (shrink)

We present a formal analysis of Douglas Hofstadter’s concept of superrationality. We start by defining superrationally justifiable actions, and study them in symmetric games. We then model the beliefs of the players, in a way that leads them to different choices than the usual assumption of rationality by restricting the range of conceivable choices. These beliefs are captured in the formal notion of type drawn from epistemic game theory. The theory of coalgebras is used to frame type spaces and to (...) account for the existence of some of them. We find conditions that guarantee superrational outcomes. (shrink)

Positive monotone modal logic is the negation- and implication-free fragment of monotone modal logic, i.e., the fragment with connectives and. We axiomatise positive monotone modal logic, give monotone neighbourhood semantics based on posets, and prove soundness and completeness. The latter follows from the main result of this paper: a duality between so-called \-spaces and the algebraic semantics of positive monotone modal logic. The main technical tool is the use of coalgebra.

Building on previous work by Mints, Buchholz and Schwichtenberg, a simplified version of continuous normalization for the untyped λ-calculus and Gödel’s is presented and analysed in the coalgebraic framework of non-wellfounded terms with so-called repetition constructors.The primitive recursive normalization function is uniformly continuous w.r.t. the natural metric on non-wellfounded terms. Furthermore, the number of necessary repetition constructors is locally related to the number of reduction steps needed to reach the normal form and its size.It is also shown how continuous normal (...) forms relate to derivations of strong normalizability in the typed λ-calculus and how this leads to new bounds for the sum of the height of the reduction tree and the size of the normal form.Finally, the methods are extended to an infinitary λ-calculus with ω-rule and permutative conversions and this is used to derive a strong form of normalization for an iterative version of Gödel’s system , leading to a value table semantics for number-theoretic functions. (shrink)

Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data structures. Categorically, they arise as final coalgebras for polynomial endofunctors, which we call M-types. We derive existence results for M-types in locally cartesian closed pretoposes with a natural numbers object, using their internal logic. These are then used to prove stability of such categories with M-types under various topos-theoretic constructions; namely, slicing, formation of coalgebras , and sheaves for an (...) internal site. (shrink)

We present an analysis of the game semantics of general references introduced by Abramsky, Honda and McCusker which exposes the algebraic structure of the model. Using the notion of sequoidal category, we give a coalgebraic definition of the denotational semantics of storage cells of arbitrary type. We identify further conditions on the model which allow an axiomatic presentation of the proof that finite elements of the model are definable by programs, in the style of Abramsky’s Axioms for Definability.

We prove a generalization of Alex Heller's existence theorem for recursion categories; this generalization was suggested by work of Di Paola and Montagna on syntactic P-recursion categories arising from consistent extensions of Peano Arithmetic, and by the examples of recursion categories of coalgebras. Let B=BX be a uniformly generated isotypical B#-subcategory of an iteration category C, where X is an isotypical object of C. We give calculations for the existence of a weak Turing morphism in the Turing completion Tur of (...) B when C is separated; i.e., when connected domains in C are jointly epimorphic. Our proof generalizes as follows. Let D be a separated iteration category and let L : C → D be an iteration functor; i.e., a functor which preserves domains, coproducts, zero morphisms and the iteration operator; it is crucial for the generalization that an iteration functor need not preserve products. If L is faithful, then Tur is a recursion category. (shrink)

We consider foundational questions related to the definition of functions by corecursion. This method is especially suited to functions into the greatest fixed point of some monotone operator, and it is most applicable in the context of non-wellfounded sets. We review the work on the Special Final Coalgebra Theorem of Aczel [1] and the Corecursion Theorem of Barwise and Moss [4]. We offer a condition weaker than Aczel's condition of uniformity on maps, and then we prove a result relating (...) the operators satisfying the new condition to the smooth operators of [4]. (shrink)

Compositionality is a principle used in logic, philosophy, mathematics, linguistics, and computer science for assigning meanings to language expressions in a systematic manner following syntactic construction, thereby allowing for a perspicuous algebraic view of the syntax-semantics interface. Yet the status of the principle remains under debate, with positions ranging from compositionality always being achievable to its having genuine empirical content. This paper attempts to sort out some major issues in all this from a logical perspective. First, we stress the fundamental (...) harmony between Compositionality and its apparent antipode of Contextuality that locates meaning in interaction with other linguistic expressions and in other settings than the actual one. Next, we discuss basic further desiderata in designing and adjudicating a compositional semantics for a given language in harmony with relevant contextual syntactic and semantic cues. In particular, in a series of concrete examples in the realm of logic, we point out the dangers of over-interpreting compositional solutions, the ubiquitous entanglement of assigning meanings and the key task of explaining given target inferences, and the dynamics of new language design, illustrating how even established compositional semantics can be rethought in a fruitful manner. Finally, we discuss some fresh perspectives from the realm of game semantics for natural and formal languages, the general setting for Samson Abramsky’s influential work on programming languages and process logics. We highlight outside-in coalgebraic perspectives on meanings as finite or infinitely unfolding behavior that might challenge and enrich current discussions of compositionality. (shrink)

This essay endeavors to define the concept of indefinite extensibility in the setting of category theory. I argue that the generative property of indefinite extensibility for set-theoretic truths in category theory is identifiable with the Grothendieck Universe Axiom and the elementary embeddings in Vopenka's principle. The interaction between the interpretational and objective modalities of indefinite extensibility is defined via the epistemic interpretation of two-dimensional semantics. The semantics can be defined intensionally or hyperintensionally. By characterizing the modal profile of $\Omega$-logical validity, (...) and thus the generic invariance of mathematical truth, modal coalgebras are further capable of capturing the notion of definiteness for set-theoretic truths, in order to yield a non-circular definition of indefinite extensibility. (shrink)

This paper aims to provide a mathematically tractable background against which to model both modal cognitivism and modal expressivism. I argue that epistemic modal algebras comprise a materially adequate fragment of the language of thought. I demonstrate, then, how modal expressivism can be regimented by modal coalgebraic automata, to which the above epistemic modal algebras are dual. I examine, in particular, the virtues unique to the modal expressivist approach here proffered in the setting of the foundations of mathematics, by contrast (...) to competing approaches based upon both the inferentialist approach to concept-individuation and the codification of speech acts via intensional semantics. (shrink)

This paper aims to provide a mathematically tractable background against which to model both modal cognitivism and modal expressivism. I argue that epistemic modal algebras comprise a materially adequate fragment of the language of thought, and endeavor to show how such algebras provide the resources necessary to resolve Russell's paradox of propositions. I demonstrate, then, how modal expressivism can be regimented by modal coalgebraic automata, to which the above epistemic modal algebras are dually isomorphic. I examine, in particular, the virtues (...) unique to the modal expressivist approach here proffered in the setting of the foundations of mathematics, by contrast to competing approaches based upon both the inferentialist approach to concept-individuation and the codification of speech acts via intensional semantics. (shrink)

Recently, two apparently quite different duality-based approaches to automata minimisation have appeared. One is based on ideas that originated from the controllability-observability duality from systems theory, and the other is based on ideas derived from Stone-type dualities specifically linking coalgebras with algebraic structures derived from modal logics. In the present paper, we develop a more abstract view and unify the two approaches. We show that dualities, or more generally dual adjunctions, between categories can be lifted to dual adjunctions between categories (...) of coalgebras and algebras, and from there to automata with initial as well as final states. As in the Stone-duality approach, algebras are essentially logics for reasoning about the automata. By exploiting the ability to pass between these categories, we show that one can minimize the corresponding automata. We give an abstract minimisation algorithm that has several instances, including the celebrated Brzozowski minimisation algorithm. We further develop three examples that have been treated in previous works: deterministic Kripke frames based on a Stone-type duality, weighted automata based on the self-duality of semimodules, and topological automata based on Gelfand duality. As a new example, we develop alternating automata based on the discrete duality between sets and complete atomic Boolean algebras. (shrink)

We propose a probabilistic interpretation of Propositional Dynamic Logic (PDL). We show that logical and behavioral equivalence are equivalent over general measurable spaces. This is done first for the fragment of straight line programs and then extended to cater for the nondeterministic nature of choice and iteration, expanded to PDL as a whole. Bisimilarity is also discussed and shown to be equivalent to logical and behavioral equivalence, provided the base spaces are Polish spaces. We adapt techniques from coalgebraic stochastic logic (...) and point out some connections to Souslin's operation A from descriptive set theory. This leads to a discussion of complete stochastic Kripke models and model completion, which permits an adequate treatment of the test operator. (shrink)

This contribution is an essay of formal philosophy—and more specifically of formal ontology and formal epistemology—applied, respectively, to the philosophy of nature and to the philosophy of sciences, interpreted the former as the ontology and the latter as the epistemology of the modern mathematical, natural, and artificial sciences, the theoretical computer science included. I present the formal philosophy in the framework of the category theory (CT) as an axiomatic metalanguage—in many senses “wider” than set theory (ST)—of mathematics and logic, both (...) of the “extensional” logics of the pure and applied mathematical sciences (=mathematical logic), and the “intensional” modal logics of the philosophical disciplines (=philosophical logic). It is particularly significant in this categorical framework the possibility of extending the operator algebra formalism from (quantum and classical) physics to logic, via the so-called “Boolean algebras with operators” (BAOs), with this extension being the core of our formal ontology. In this context, I discuss the relevance of the algebraic Hopf coproduct and colimit operations, and then of the category of coalgebras in the computations over lattices of quantum numbers in the quantum field theory (QFT), interpreted as the fundamental physics. This coalgebraic formalism is particularly relevant for modeling the notion of the “quantum vacuum foliation” in QFT of dissipative systems, as a foundation of the notion of “complexity” in physics, and “memory” in biological and neural systems, using the powerful “colimit” operators. Finally, I suggest that in the CT logic, the relational semantics of BAOs, applied to the modal coalgebraic relational logic of the “possible worlds” in Kripke’s model theory, is the proper logic of the formal ontology and epistemology of the natural realism, as a formalized philosophy of nature and sciences. (shrink)

In this paper we explore the possibility of giving a justification of the “semantic information” content and measure, in the framework of the recent coalgebraic approach to quantum systems and quantum computation, extended to QFT systems. In QFT, indeed, any quantum system has to be considered as an “open” system, because it is always interacting with the background fluctuations of the quantum vacuum. Namely, the Hamiltonian in QFT always includes the quantum system and its inseparable thermal bath, formally “entangled” like (...) an algebra with its coalgebra, according to the principle of the “doubling” of the degrees of freedom between them. This is the core of the representation theory of cognitive neuroscience based on QFT. Moreover, in QFT, the probabilities of the quantum states follow a Wigner distribution, based on the notion and measure of quasiprobability, where regions integrated under given expectation values do not represent mutually exclusive states. This means that a computing agent, either natural or artificial, in QFT, against the quantum Turing machine paradigm, is able to change dynamically the representation space of its computations. This depends on the possibility of interpreting QFT system computations within the framework of category theory logic and its principle of duality between opposed categories, such as the algebra and coalgebra categories of QFT. This allows us to justify and not only to suppose, like in the “theory of strong semantic information” of L. Floridi, the definition of modal “local truth” and the notion of semantic information as a measure of it, despite both measures being defined on quasiprobability distributions. (shrink)

This book concerns the foundations of epistemic modality. I examine the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality relates to the computational theory of mind; metaphysical modality; the types of mathematical modality; to the epistemic status of large cardinal axioms, undecidable propositions, and abstraction principles in the philosophy of mathematics; to the modal profile of rational intuition; and (...) to the types of intention, when the latter is interpreted as a modal mental state. Chapter 2 argues for a novel type of expressivism based on the duality between the categories of coalgebras and algebras, and argues that the duality permits of the reconciliation between modal cognitivism and modal expressivism. Chapter 3 provides an abstraction principle for epistemic intensions. Chapter 4 advances a two-dimensional truthmaker semantics, and provides three novel interpretations of the framework along with the epistemic and metasemantic. Chapter 5 applies the fixed points of the modal $\mu$-calculus in order to account for the iteration of epistemic states, by contrast to availing of modal axiom 4. Chapter 6 advances a solution to the Julius Caesar problem based on Fine's "criterial" identity conditions which incorporate conditions on essentiality and grounding. Chapter 7 provides a ground-theoretic regimentation of the proposals in the metaphysics of consciousness and examines its bearing on the two-dimensional conceivability argument against physicalism. The epistemic two-dimensional truthmaker semantics developed in chapter 4 is availed of in order for epistemic states to be a guide to metaphysical states in the hyperintensional setting. Chapter 8 examines the modal commitments of abstractionism, in particular necessitism, and epistemic modality and the epistemology of abstraction. Chapter 9 examines the modal profile of $\Omega$-logic in set theory. Chapter 10 examines the interaction between epistemic two-dimensional semantics and absolute decidability. Chapter 11 avails of modal coalgebraic automata to interpret the defining properties of indefinite extensibility, and avails of epistemic two-dimensional semantics in order to account for the interaction of the interpretational and objective modalities thereof. The hyperintensional, epistemic two-dimensional truthmaker semantics developed in chapter 4 is applied in chapters 8, 10, and 11. Chapter 12 provides a modal logic for rational intuition. Chapter 13 examines modal responses to the alethic paradoxes. Chapter 14 examines, finally, the modal semantics for the different types of intention and the relation of the latter to evidential decision theory. (shrink)