Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Coalgebra (13)
- Modal logic (6)
- Deep learning (4)
- Coalgebraic logic (3)
- Coalgebras (3)
-
- Display calculus (3)
- Accessibility (2)
- Assistive technology (2)
- Autism spectrum disorder (2)
- Computer vision (2)
- Cover modality (2)
- Descriptive general frames (2)
- Duality (2)
- Dynamic epistemic logic (2)
- Feedback control (2)
- Inclusion (2)
- Kripke polynomial functors (2)
- Machine Learning (2)
- Machine learning (2)
- Modal Logic (2)
- Modularity (2)
- Neurodiversity (2)
- Nominal sets (2)
- Positive modal logic (2)
- Relation lifting (2)
- Sensory processing (2)
- Stone duality (2)
- Stone spaces (2)
- Variety (2)
- Vietoris topology (2)
- Publication Year
Articles 61 - 73 of 73
Full-Text Articles in Computer Engineering
Pi-Calculus In Logical Form, Marcello M. Bonsangue, Alexander Kurz
Pi-Calculus In Logical Form, Marcello M. Bonsangue, Alexander Kurz
Engineering Faculty Articles and Research
Abramsky’s logical formulation of domain theory is extended to encompass the domain theoretic model for picalculus processes of Stark and of Fiore, Moggi and Sangiorgi. This is done by defining a logical counterpart of categorical constructions including dynamic name allocation and name exponentiation, and showing that they are dual to standard constructs in functor categories. We show that initial algebras of functors defined in terms of these constructs give rise to a logic that is sound, complete, and characterises bisimilarity. The approach is modular, and we apply it to derive a logical formulation of pi-calculus. The resulting logic is a …
Coalgebras And Their Logics, Alexander Kurz
Coalgebras And Their Logics, Alexander Kurz
Engineering Faculty Articles and Research
"Transition systems pervade much of computer science. This article outlines the beginnings of a general theory of specification languages for transition systems. More specifically, transition systems are generalised to coalgebras. Specification languages together with their proof systems, in the following called (logical or modal) calculi, are presented by the associated classes of algebras (e.g., classical propositional logic by Boolean algebras). Stone duality will be used to relate the logics and their coalgebraic semantics."
Weak Factorizations, Fractions And Homotopies, Alexander Kurz, Jiří Rosický
Weak Factorizations, Fractions And Homotopies, Alexander Kurz, Jiří Rosický
Engineering Faculty Articles and Research
We show that the homotopy category can be assigned to any category equipped with a weak factorization system. A classical example of this construction is the stable category of modules. We discuss a connection with the open map approach to bisimulations proposed by Joyal, Nielsen and Winskel.
Preface, Thomas Hildebrandt, Alexander Kurz
Preface, Thomas Hildebrandt, Alexander Kurz
Engineering Faculty Articles and Research
No abstract provided.
Algebraic Semantics For Coalgebraic Logics, Clemens Kupke, Alexander Kurz, Dirk Pattinson
Algebraic Semantics For Coalgebraic Logics, Clemens Kupke, Alexander Kurz, Dirk Pattinson
Engineering Faculty Articles and Research
With coalgebras usually being defined in terms of an endofunctor T on sets, this paper shows that modal logics for T-coalgebras can be naturally described as functors L on boolean algebras. Building on this idea, we study soundness, completeness and expressiveness of coalgebraic logics from the perspective of duality theory. That is, given a logic L for coalgebras of an endofunctor T, we construct an endofunctor L such that L-algebras provide a sound and complete (algebraic) semantics of the logic. We show that if L is dual to T, then soundness and completeness of the algebraic semantics immediately yield the …
Coalgebras And Modal Expansions Of Logics, Alexander Kurz, Alessandra Palmigiano
Coalgebras And Modal Expansions Of Logics, Alexander Kurz, Alessandra Palmigiano
Engineering Faculty Articles and Research
In this paper we construct a setting in which the question of when a logic supports a classical modal expansion can be made precise. Given a fully selfextensional logic S, we find sufficient conditions under which the Vietoris endofunctor V on S-referential algebras can be defined and we propose to define the modal expansions of S as the logic that arises from the V-coalgebras. As an example, we also show how the Vietoris endofunctor on referential algebras extends the Vietoris endofunctor on Stone spaces. From another point of view, we examine when a category of ‘spaces’ (X,A), ie sets X …
Stone Coalgebras, Clemens Kupke, Alexander Kurz, Yde Venema
Stone Coalgebras, Clemens Kupke, Alexander Kurz, Yde Venema
Engineering Faculty Articles and Research
In this paper we argue that the category of Stone spaces forms an interesting base category for coalgebras, in particular, if one considers the Vietoris functor as an analogue to the power set functor. We prove that the so-called descriptive general frames, which play a fundamental role in the semantics of modal logics, can be seen as Stone coalgebras in a natural way. This yields a duality between the category of modal algebras and that of coalgebras over the Vietoris functor. Building on this idea, we introduce the notion of a Vietoris polynomial functor over the category of Stone spaces. …
Definability, Canonical Models, And Compactness For Finitary Coalgebraic Modal Logic, Alexander Kurz, Dirk Pattinson
Definability, Canonical Models, And Compactness For Finitary Coalgebraic Modal Logic, Alexander Kurz, Dirk Pattinson
Engineering Faculty Articles and Research
This paper studies coalgebras from the perspective of the finitary observations that can be made of their behaviours. Based on the terminal sequence, notions of finitary behaviours and finitary predicates are introduced. A category Behω(T) of coalgebras with morphisms preserving finitary behaviours is defined. We then investigate definability and compactness for finitary coalgebraic modal logic, show that the final object in Behω(T) generalises the notion of a canonical model in modal logic, and study the topology induced on a coalgebra by the finitary part of the terminal sequence.
Modal Predicates And Coequations, Alexander Kurz, Jiří Rosický
Modal Predicates And Coequations, Alexander Kurz, Jiří Rosický
Engineering Faculty Articles and Research
We show how coalgebras can be presented by operations and equations. This is a special case of Linton’s approach to algebras over a general base category X, namely where X is taken as the dual of sets. Since the resulting equations generalise coalgebraic coequations to situations without cofree coalgebras, we call them coequations. We prove a general co-Birkhoff theorem describing covarieties of coalgebras by means of coequations. We argue that the resulting coequational logic generalises modal logic.
Preface, Alexander Kurz
Preface, Alexander Kurz
Engineering Faculty Articles and Research
No abstract provided.
Modal Rules Are Co-Implications, Alexander Kurz
Modal Rules Are Co-Implications, Alexander Kurz
Engineering Faculty Articles and Research
In [13], it was shown that modal logic for coalgebras dualises—concerning definability— equational logic for algebras. This paper establishes that, similarly, modal rules dualise implications:It is shown that a class of coalgebras is definable by modal rules iff it is closed under H (images) and Σ (disjoint unions). As a corollary the expressive power of rules of infinitary modal logic on Kripke frames is characterised.
Notes On Coalgebras, Cofibrations And Concurrency, Alexander Kurz, Dirk Pattinson
Notes On Coalgebras, Cofibrations And Concurrency, Alexander Kurz, Dirk Pattinson
Engineering Faculty Articles and Research
We consider categories of coalgebras as (co)-fibred over a base category of parameters and analyse categorical constructions in the total category of deterministic and non-deterministic coalgebras.
(Ω, Ξ)-Logic: On The Algebraic Extension Of Coalgebraic Specifications, Rolf Hennicker, Alexander Kurz
(Ω, Ξ)-Logic: On The Algebraic Extension Of Coalgebraic Specifications, Rolf Hennicker, Alexander Kurz
Engineering Faculty Articles and Research
We present an extension of standard coalgebraic specification techniques for statebased systems which allows us to integrate constants and n-ary operations in a smooth way and, moreover, leads to a simplification of the coalgebraic structure of the models of a specification. The framework of (Ω,Ξ)-logic can be considered as the result of a translation of concepts of observational logic (cf. [9]) into the coalgebraic world. As a particular outcome we obtain the notion of an (Ω, Ξ)- structure and a sound and complete proof system for (first-order) observational properties of specifications.