Streams and Coalgebra Lecture 2

Size: px
Start display at page:

Download "Streams and Coalgebra Lecture 2"

Transcription

1 Streams and Coalgebra Lecture 2 Helle Hvid Hansen and Jan Rutten Radboud University Nijmegen & CWI Amsterdam Representing Streams II, Lorentz Center, Leiden, January 2014

2 Tutorial Overview Lecture 1 (Hansen): Coalgebra as a Unifying Framework Introduction and motivation Examples: Streams and languages Universal coalgebra: basic concepts Lecture 2 (Hansen): The Coinduction Principle Coinductive definitions: Behavioural differential equations Definition format: Syntactic method. Coinductive proofs: Bisimulations Exercises (Hansen/Rutten) Lecture 3 (Rutten): Newton Series and Shuffle Product

3 Specifying Streams Methods: pointwise: σ(n) =..., n N fixed point of substitution φ: A A (morphic sequence) generated by deterministic automaton with output (DAO). Today: Coinduction (behavioural differential equations). Idea: Use universal property of final (Z, ζ) to define maps into Z. A final coalgebra yields a coinduction principle. Coinduction wrt final DSO (B ω, ( )(0), ( ) ). Coinduction wrt final DAO (B ω, ( )(0), unzip k ).

4 Example: Binary operation on Streams Define a binary operation on streams B ω B ω B ω : B ω B ω o,d B (B ω B ω ) B ω B B ω ( )(0),( )

5 Example: Binary operation on Streams Define a binary operation on streams B ω B ω B ω : B ω B ω o,d B (B ω B ω ) B ω B B ω ( )(0),( ) by taking as coalgebra structure on B ω B ω : σ, τ B ω, o(σ, τ) = σ(0), d(σ, τ) = τ, σ

6 Example: Binary operation on Streams Define a binary operation on streams B ω B ω B ω : B ω B ω o,d B (B ω B ω ) zip id B zip B ω B B ω ( )(0),( ) by taking as coalgebra structure on B ω B ω : σ, τ B ω, o(σ, τ) = σ(0), d(σ, τ) = τ, σ Operation zip is defined by coinduction.

7 Example: Binary operation on Streams Define a binary operation on streams B ω B ω B ω : B ω B ω o,d B (B ω B ω ) zip id B zip B ω B B ω ( )(0),( ) by taking as coalgebra structure on B ω B ω : σ, τ B ω, o(σ, τ) = σ(0), d(σ, τ) = τ, σ Operation zip is defined by coinduction. Commutativity of the diagram means that σ, τ B ω, zip(σ, τ)(0) = σ(0), zip(σ, τ) = zip(τ, σ ) (1) zip is a solution to the stream differential equation (SDE) (1).

8 Behavioural Differential Equations (BDEs) Define elements of and operations on a final F -coalgebra (Z, ζ) by specifying the behavioural equations it must satisfy. More examples on N ω : σ = σ + σ, σ(0) = 0, σ (0) = 1 defines Fibonacci σ = (0, 1, 1, 2, 3, 5, 8,...). σ = σ + (σ σ), σ(0) = 1 defines σ = (1, 2, 6, 22, 90, 394, 1806, 8558, 41586,...) of (large) Schröder numbers (sequence A in OEIS), cf. [Winter-Bonsangue-Rutten 12] (n σ) = n σ (n σ)(0) = n σ(0) n N defines scalar product.

9 Example: Hamming Numbers Stream H N ω of Hamming numbers H = (1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, 16,...) consists of natural numbers of the form 2 i 3 j 5 k for i, j, k 0 in increasing order (cf. Dijkstra 81, Yuen 92).

10 Example: Hamming Numbers Stream H N ω of Hamming numbers H = (1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, 16,...) consists of natural numbers of the form 2 i 3 j 5 k for i, j, k 0 in increasing order (cf. Dijkstra 81, Yuen 92). We define H by the following SDEs: H(0) = 1, H = (2 H) ((3 H) (5 H)) { σ(0) if σ(0) < τ(0) and (σ τ)(0) = τ(0) if σ(0) τ(0) σ τ if σ(0) < τ(0) (σ τ) = σ τ if σ(0) = τ(0) σ τ if σ(0) > τ(0) That is, merges two streams by taking smallest initial values first, and removing duplicates. Scalar product defined as before.

11 Ensuring Unique Solutions SDEs as specification language for streams We want unique solutions. Do all SDEs have unique solutions?

12 Ensuring Unique Solutions SDEs as specification language for streams We want unique solutions. Do all SDEs have unique solutions? σ(0) = 1, σ = σ has many solutions. even(σ)(0) = σ(0), even(σ) = even(σ ) has unique solution, even(σ) = (σ(0), σ(2), σ(4),...) but σ(0) = 1, σ = even(σ) has no unique solution. How can we guarantee unique solutions? When is a stream definition productive?

13 A Syntactic Format for SDEs Signature Σ: collection of operation symbols with arities. E.g. (B ω = R ω operation [r], r R X + ) arity T Σ (V ) = Σ-terms over (set of generators) V : T Σ (V ) t ::= v V [r], r R X t + t t t t

14 A Syntactic Format for SDEs Signature Σ: collection of operation symbols with arities. E.g. (B ω = R ω operation [r], r R X + ) arity T Σ (V ) = Σ-terms over (set of generators) V : T Σ (V ) t ::= v V [r], r R X t + t t t t Def. A stream definition for Σ is a set of SDEs, one for each Σ-operation f Σ of arity k of the form: f (σ 1,..., σ k )(0) = o f (σ 1 (0),..., σ k (0)) f (σ 1,..., σ k ) = d f (σ 1 (0),..., σ k (0)) where o f (σ 1 (0),..., σ k (0)) B d f (σ 1 (0),..., σ k (0)) T Σ (σ 1,..., σ k, σ 1,..., σ k ).

15 A Syntactic Format for SDEs (II) Example: Stream definition for stream calculus signature: [r](0) = r, [r] = [0] r R X(0) = 0, X = [1] (σ + τ)(0) = σ(0) + τ(0), (σ + τ) = σ + τ ( σ)(0) = σ(0), ( σ) = σ (σ τ)(0) = σ(0) τ(0), (σ τ) = (σ τ) + ([σ(0)] τ ) Example: Definition of Hamming numbers. The syntactic format is also known as the stream GSOS format due to analogy with GSOS format from structural operational semantics (cf. [Bartels], [Klin], [Turi-Plotkin]). Generalisations for other coalgebra types immediate from categorical framework.

16 A Syntactic Format for SDEs (III) Theorem: [Kupke-Niqui-Rutten 11][Bartels][Klin] Given a signature Σ, any Σ-definition in the stream GSOS format has a unique solution, i.e., defines a unique interpretation of operation symbols as stream operations. Proof sketch: A stream GSOS definition induces a coalgebra structure δ on terms: T Σ (B ω ) δ B T Σ (B ω ) α id B α B ω = B B ω By coinduction, we obtain a unique term interpretation α which corresponds to unique interpretation of Σ-operations.

17 A Syntactic Format for SDEs (IV) Examples not in the stream GSOS format: c(0) = 1, c = c, since d c = c / T Σ ( ). even(σ) = σ(0), even(σ) = even(σ ), since even(σ ) / T Σ (σ, σ ). (Note: d(0) = 1, d = even(d) is in stream GSOS format.)

18 A Syntactic Format for SDEs (IV) Examples not in the stream GSOS format: c(0) = 1, c = c, since d c = c / T Σ ( ). even(σ) = σ(0), even(σ) = even(σ ), since even(σ ) / T Σ (σ, σ ). (Note: d(0) = 1, d = even(d) is in stream GSOS format.) Remark on causal operations: All operations defined in the stream GSOS format are causal: The n th element of output stream f (σ 1,..., σ k ) is determined by the first n elements of the input streams σ 1,..., σ k. Operation even is not causal. Conversely, all causal stream operations can be defined by a (possibly infinite) stream GSOS definition (cf. [KNR 11]).

19 Beyond Causality Endrullis,Grabmayer,Hendriks,Isihara & Klop. Productivity of stream definitions. Theor.Comp.Sci. 411, Ghani,Hancock & Pattinson. Representations of stream processors using nested fixed points. Logical Methods in Computer Science, 5(3), Abel & Pientka. Well-founded recursion with copatterns. Int. Conf. on Functional Programming (ICFP 2013).

20 Coinduction wrt final DAO of Streams Recall the final DAO (output in B, alphabet A = {1, 2, 3}) of streams: β = ( )(0), unzip 3 (( ) ) : B ω B (B ω ) {1,2,3}

21 Coinduction wrt final DAO of Streams Recall the final DAO (output in B, alphabet A = {1, 2, 3}) of streams: β = ( )(0), unzip 3 (( ) ) : B ω B (B ω ) {1,2,3} Behaviour map [[ ]]: (X, o, d ) (B ω, α) is coalgebra morphism: x X : [[x]](0) = o(x) unzip 0,3 ([[x]] ) = [[d(x)(1)]] unzip 1,3 ([[x]] ) = [[d(x)(2)]] unzip 2,3 ([[x]] ) = [[d(x)(3)]] using zip 3 unzip 3 = id B ω, this is equivalent with x X : [[x]](0) = o(x) [[x]] = zip 3 ([[d(x)(1)]], [[d(x)(2)]], [[d(x)(3)]])

22 Zip-SDEs Example of a (finite) system of zip 3 -SDEs over X = {x, y, z} with B = {a, b}: x(0) = a, x = zip 3 (y, x, x), y(0) = b, y = zip 3 (x, y, x), z(0) = b, z = zip 3 (y, z, y), Every system of zip k -SDEs has a unique stream solution [[ ]]: X B ω. TFAE (cf. [Endrullis-Grabmayer-Hendriks-Klop-Moss 11]): σ B ω is k-automatic σ is in the solution to a finite system of zip k -SDEs.

23 Stream Calculus Recall the SDEs defining stream calculus operations on R ω : [r](0) = r, [r] = [0] r R X(0) = 0, X = [1] (σ + τ)(0) = σ(0) + τ(0), (σ + τ) = σ + τ ( σ)(0) = σ(0), ( σ) = σ (σ τ)(0) = σ(0) τ(0), (σ τ) = (σ τ) + ([σ(0)] τ ) (R ω, +,,, 0, 1) is an integral domain. Fundamental theorem: σ = σ(0) + X σ for all σ R ω. Convolution inverse: σ 1 (0) = σ(0) 1, (σ 1 ) = (σ(0) σ ) σ 1 under condition σ(0) 0 (partial operation). We write: rσ = [r] σ, 1 σ = 1/σ = σ 1 and σ τ = σ τ 1.

24 Polynomial and Rational Streams Polynomial stream σ = a 0 + a 1 X + a 2 X 2 + a 3 X a n X n Rational stream σ = ρ π where ρ, π polynomial, and π(0) 0. Stream calculus operations will come back in several talks.

25 How to prove stream identities? (R ω, +,,, 0, 1) is a commutative ring. Can we prove this using only the SDE definitions?

26 Equivalence When are two systems the same? When their states encode the same set of behaviours. When do two states have the same behaviour? When [[x]] = [[y]].

27 Equivalence When are two systems the same? When their states encode the same set of behaviours. When do two states have the same behaviour? When [[x]] = [[y]]. More generally, two states x (X, γ) and y (Y, δ) are behaviourally equivalent if there exist morphisms (X, γ) f g (Z, ζ) (Y, δ) such that f (x) = g(y). How do we prove it? We build a bisimulation.

28 Coalgebraic Bisimulation Coalgebra morphism = structure-respecting function Coalgebra bisimulation = structure-respecting relation

29 Coalgebraic Bisimulation Coalgebra morphism = structure-respecting function Coalgebra bisimulation = structure-respecting relation Def. (Aczel-Mendler) A bisimulation between F -coalgebras (X, γ) and (Y, δ) is a relation R X Y such that there is a coalgebra structure ρ: R F (R) such that the projections π X : (R, ρ) (X, γ) and π Y : (R, ρ) (Y, δ) are coalgebra morphisms: X γ F (X ) π X F (π X ) R ρ π Y Y F (π Y ) F (R) F (Y ) δ

30 Bisimulation for DSOs Bisimulation diagram: X π X R π Y Y o X,d X B X id B π X ρ B R id B π Y B Y o Y,d Y Concretely: x, y R : o X (x) = o Y (y) and d X (x), d Y (y) R. Stream bisimulation (bisimulation on (B ω, ( )(0), ( ) ): σ, τ R : σ(0) = τ(0) and σ, τ R.

31 Basic Facts about Bisimulations A map f : X Y is a coalgebra morphism f : (X, γ) (Y, δ) iff Graph(f ) = { x, f (x) x X } is a bisimulation. Bisimulations are closed under arbitrary unions. Hence the largest bisimulation ( bisimilarity, ) between two coalgebras exists: x y iff there is a bisimulation R s.t. x, y R. Coalgebra morphisms preserve bisimilarity: x y f (x) g(y) if f, g are coalgebra morphims. Bisimilarity on a single coalgebra is an equivalence relation. For all (X, γ) there is a coalgebra map γ : X / F (X / ) s.t. the quotient map q : X X / is a coalgebra morphism. Generalises existing notions from process theory and modal logic.

32 Coinductive Proof Principle Let (Z, ζ) be a final F -coalgebra. id Z : (Z, ζ) (Z, ζ) is the unique F -coalgebra morphism. q Hence: (Z, ζ) (Z/, ζ )!h (Z, ζ) = id Z hence q is injective, and = Z (identity relation).

33 Coinductive Proof Principle Let (Z, ζ) be a final F -coalgebra. id Z : (Z, ζ) (Z, ζ) is the unique F -coalgebra morphism. q Hence: (Z, ζ) (Z/, ζ )!h (Z, ζ) = id Z hence q is injective, and = Z (identity relation). A final coalgebra (Z, ζ) satisfies the Coinductive Proof Principle: x, y (Z, ζ) : x y x = y. By preservation of bisimilarity under morphisms, we have: For all x (X, γ) and y (Y, δ): x y [[x]] = [[y]]. A bisimulation is a proof of behavioural equivalence.

34 Stream Bisimulation Example Prove that: σ + τ = τ + σ for all σ, τ B ω.

35 Stream Bisimulation Example Prove that: σ + τ = τ + σ for all σ, τ B ω. Take R is a stream bisimulation: R = { σ + τ, τ + σ σ, τ B ω }. (σ + τ)(0) = σ(0) + τ(0) = τ(0) + σ(0) = (τ + σ)(0) (σ + τ) = σ + τ R τ + σ = (τ + σ)

36 Stream Bisimulation Example Consider shuffle product defined by SDE (σ τ)(0) = σ(0) τ(0), (σ τ) = (σ τ) + (σ τ ) Prove that : σ τ = τ σ.

37 Stream Bisimulation Example Consider shuffle product defined by SDE (σ τ)(0) = σ(0) τ(0), (σ τ) = (σ τ) + (σ τ ) Prove that : σ τ = τ σ. Compute: (σ τ) = (σ τ) + (σ τ ) (τ σ) = (τ σ) + (τ σ ) (σ τ) = ((σ τ) + (σ τ )) + ((σ τ ) + (σ τ ) (τ σ) = ((τ σ) + (τ σ )) + ((τ σ ) + (τ σ ) Problem: derivatives keep growing.

38 Bisimulation-up-to Def. Let Σ denote a collection of stream operations. A relation R B ω B ω is a stream bisimulation-up-to-σ if for all σ, τ R: σ(0) = τ(0) and σ, τ R, where R B ω B ω is the smallest relation such that 1. R R 2. { σ, σ σ B ω } R 3. R is closed under the (element-wise application of) operations in Σ. For instance, if Σ contains addition and α, β, γ, δ R then α + γ, β + δ R. Lemma: If R is a bisimulation-up-to-σ then R is a bisimulation. (Bisimulation-up-to-Σ is sound)

39 Bisimulation-up-to Example Back to commutativity of shuffle product: Observe: So is a bisimulation-up-to addition. (σ τ) = (σ τ) + (σ τ ) = (σ τ ) + (σ τ) (τ σ) = (τ σ) + (τ σ ) R = { σ τ, τ σ σ, τ R ω } Note: Symbolic reasoning, algorithmic. No knowledge of binomial coefficients needed.

40 Summary Coalgebra is a uniform framework of state-based systems. final coalgebras characterise observable behaviour. final coalgebras yield a coinduction principle (proof and definition). Coinductive definitions are behavioural differential equations. streams are a final DSO stream differential eqs (SDEs). streams are a final DAO zip-sdes. stream GSOS format ensures unique solutions to SDEs. Coinductive proofs are bisimulations (up-to), circular proofs. can be constructed as a greatest fixed point.

41 Selected Coalgebra References Universal Coalgebra: J.J.M.M. Rutten. Universal coalgebra: a theory of systems. Theoretical Computer Science, 249(1):380, B. Jacobs and J.J.M.M. Rutten. An introduction to (co)algebras and (co)induction. In: Advanced topics in bisimulation and coinduction, Cambridge Tracts in Theor. Comp. Science Volume 52, CUP Stream Differential Equations: J.J.M.M. Rutten. Behavioural differential equations: a coinductive calculus of streams, automata, and power series. Theoretical Computer Science Volume 308(1 3), pp. 1 53, C. Kupke, M. Niqui, J. Rutten. Stream Differential Equations: concrete formats for coinductive definitions. Technical Report No. RR-11-10, Oxford University, J. Winter, M. Bonsangue and J. Rutten. Coalgebraic characterizations of context-free languages. Logical Methods in Computer Science, Vol. 9 (3:14), H.H. Hansen, C. Kupke and J. Rutten. Stream differential equations, an overview. In preparation.

42 Selected Coalgebra References Automatic Sequences: C. Grabmayer, J. Endrullis, D. Hendriks, J.W. Klop, and L.S. Moss. Automatic sequences and zip-specifications. Proceedings of LICS, C. Kupke and J. Rutten. On the final coalgebra of automatic sequences. Logic and Program Semantics, volume 7230 of LNCS, Springer, Automata and Formal Languages: F. Bonchi, M. Bonsangue, H.H. Hansen, P. Panangaden, J. Rutten, A. Silva. Algebra-coalgebra duality in Brzozowski s minimization algorithm. ACM Transactions on Computational Logic, to appear. A. Silva, F. Bonchi, M. Bonsangue, and J. Rutten. Generalizing determinization from automata to coalgebras. Logical Methods in Computer Science, 9(1), Coinductive proofs: J. Rot, M. Bonsangue, J. Rutten. Coinductive Proof Techniques for Language Equivalence. 7th International Conference on Language and Automata Theory and Applications (LATA 2013). LNCS 7810, Springer. J. Endrullis, D. Hendriks and M. Bodin Circular Coinduction in Coq Using Bisimulation-Up-To Techniques Proc. 4th Int. Conf. on Interactive Theorem Proving (ITP 2013), volume 7998 of LNCS, Springer, 2013.

Streams and Coalgebra Lecture 1

Streams and Coalgebra Lecture 1 Streams and Coalgebra Lecture 1 Helle Hvid Hansen and Jan Rutten Radboud University Nijmegen & CWI Amsterdam Representing Streams II, Lorentz Center, Leiden, January 2014 Tutorial Overview Lecture 1 (Hansen):

More information

The Final Deterministic Automaton on Streams

The Final Deterministic Automaton on Streams The Final Deterministic Automaton on Streams Helle Hvid Hansen Clemens Kupke Jan Rutten Joost Winter Radboud Universiteit Nijmegen & CWI Amsterdam Brouwer seminar, 29 April 2014 Overview 1. Automata, streams

More information

Lecture three: Automata and the algebra-coalgebra duality

Lecture three: Automata and the algebra-coalgebra duality Lecture three: Automata and the algebra-coalgebra duality Jan Rutten CWI Amsterdam & Radboud University Nijmegen IPM, Tehran - 13 January 2016 This lecture will explain two diagrams: 1 x c ε σ A r x X

More information

(2017) : 13 (1) ISSN , /LMCS-13(1:3)2017

(2017) : 13 (1) ISSN , /LMCS-13(1:3)2017 Hansen, Helle Hvid and Kupke, Clemens and Rutten, Jan (2017) Stream differential equations : specification formats and solution methods. Logical Methods in Computer Science, 13 (1). pp. 1-52. ISSN 1860-5974,

More information

Weighted automata coalgebraically

Weighted automata coalgebraically Weighted automata coalgebraically Filippo Bonchi 4 Michele Boreale 5 Marcello Bonsangue,2 Jan Rutten,3 Alexandra Silva Centrum Wiskunde en Informatica 2 LIACS - Leiden University 3 Radboud Universiteit

More information

Stream Differential Equations: concrete formats for coinductive definitions

Stream Differential Equations: concrete formats for coinductive definitions Stream Differential Equations: concrete formats for coinductive definitions Clemens Kupke 1, Milad Niqui 2 and Jan Rutten 2,3 1 University of Oxford, 2 Centrum Wiskunde & Informatica, Amsterdam, 3 Radboud

More information

Coinductive Proof Techniques for Language Equivalence

Coinductive Proof Techniques for Language Equivalence Coinductive Proof Techniques for Language Equivalence Jurriaan Rot 1,2,, Marcello Bonsangue 1,2, and Jan Rutten 2,3 1 LIACS Leiden University, Niels Bohrweg 1, Leiden, Netherlands 2 Centrum Wiskunde en

More information

Productive functions as Term-coalgebra anamorphisms in Coq

Productive functions as Term-coalgebra anamorphisms in Coq Productive functions as Term-coalgebra anamorphisms in Coq Clemens Kupke, Milad Niqui and Jan Rutten April 26, 2010 Abstract We present a method for implementing a class of productive functions in Coq.

More information

Realization of Coinductive Types

Realization of Coinductive Types MFPS 2011 Realization of Coinductive Types Dexter Kozen 1,2 Department of Computer Science Cornell University Ithaca, New York 14853 7501, USA Abstract We give an explicit combinatorial construction of

More information

Bisimulation for Neighbourhood Structures

Bisimulation for Neighbourhood Structures Bisimulation for Neighbourhood Structures Helle Hvid Hansen 1,2 Clemens Kupke 2 Eric Pacuit 3 1 Vrije Universiteit Amsterdam (VUA) 2 Centrum voor Wiskunde en Informatica (CWI) 3 Universiteit van Amsterdam

More information

1. The Method of Coalgebra

1. The Method of Coalgebra 1. The Method of Coalgebra Jan Rutten CWI Amsterdam & Radboud University Nijmegen IMS, Singapore - 15 September 2016 Overview of Lecture one 1. Category theory (where coalgebra comes from) 2. Algebras

More information

(Co)Algebraic Characterizations of Signal Flow Graphs

(Co)Algebraic Characterizations of Signal Flow Graphs (Co)Algebraic Characterizations of Signal Flow Graphs Henning Basold 1,3, Marcello Bonsangue 2,3, Helle H. Hansen 1,3, Jan Rutten 3,1 1 Radboud University Nijmegen 2 Leiden University 3 CWI Amsterdam Abstract

More information

Bisimulation for Neighbourhood Structures

Bisimulation for Neighbourhood Structures Bisimulation for Neighbourhood Structures Helle Hvid Hansen 1,2 Clemens Kupke 2 Eric Pacuit 3 1 Vrije Universiteit Amsterdam (VUA) 2 Centrum voor Wiskunde en Informatica (CWI) 3 Universiteit van Amsterdam

More information

Context-Free Languages, Coalgebraically

Context-Free Languages, Coalgebraically Context-Free Languages, Coalgebraically Joost Winter 1, Marcello M. Bonsangue 2,1, and Jan Rutten 1,3 1 Centrum Wiskunde & Informatica (CWI) 2 LIACS Leiden University 3 Radboud University Nijmegen Abstract.

More information

A note on coinduction and weak bisimilarity for while programs

A note on coinduction and weak bisimilarity for while programs Centrum voor Wiskunde en Informatica A note on coinduction and weak bisimilarity for while programs J.J.M.M. Rutten Software Engineering (SEN) SEN-R9826 October 31, 1998 Report SEN-R9826 ISSN 1386-369X

More information

(Co-)algebraic Automata Theory

(Co-)algebraic Automata Theory (Co-)algebraic Automata Theory Sergey Goncharov, Stefan Milius, Alexandra Silva Erlangen, 5.11.2013 Chair 8 (Theoretical Computer Science) Short Histrory of Coalgebraic Invasion to Automata Theory Deterministic

More information

Newton series, coinductively

Newton series, coinductively Newton series, coinductively Henning Basold, Helle Hvid Hansen, Jean-Eric Pin, Jan Rutten To cite this version: Henning Basold, Helle Hvid Hansen, Jean-Eric Pin, Jan Rutten. Newton series, coinductively.

More information

Coalgebra, lecture 10: Algebra and Coalgebra for Regular Expressions

Coalgebra, lecture 10: Algebra and Coalgebra for Regular Expressions Coalgebra, lecture 10: Algebra and Coalgebra for Regular Expressions Jurriaan Rot November 19, 2018 By now we ve been talking a lot about coalgebras and coinduction, as well as algebras and induction.

More information

Bialgebraic Methods in Structural Operational Semantics

Bialgebraic Methods in Structural Operational Semantics SOS 2006 Preliminary Version Bialgebraic Methods in Structural Operational Semantics (Invited Talk) Bartek 1,2 Warsaw University, Edinburgh University Abstract Bialgebraic semantics, invented a decade

More information

Degrees of Streams. Jörg Endrullis Dimitri Hendriks Jan Willem Klop. Streams Seminar Nijmegen, 20th April Vrije Universiteit Amsterdam

Degrees of Streams. Jörg Endrullis Dimitri Hendriks Jan Willem Klop. Streams Seminar Nijmegen, 20th April Vrije Universiteit Amsterdam Degrees of Streams Jörg Endrullis Dimitri Hendriks Jan Willem Klop Vrije Universiteit Amsterdam Streams Seminar Nijmegen, 20th April 2010 Complexity of streams Complexity measures for infinite streams:

More information

Simulations and Bisimulations for Coalgebraic Modal Logics

Simulations and Bisimulations for Coalgebraic Modal Logics Simulations and Bisimulations for Coalgebraic Modal Logics Daniel Gorín and Lutz Schröder Department of Computer Science, Universität Erlangen-Nürnberg Abstract. Simulations serve as a proof tool to compare

More information

Combining Bialgebraic Semantics and Equations

Combining Bialgebraic Semantics and Equations Combining Bialgebraic Semantics and Equations Jurriaan Rot 1 and Marcello Bonsangue 2 1 LIACS Leiden University, Niels Bohrweg 1, Leiden, The Netherlands 2 Centrum Wiskunde en Informatica, Science Park

More information

Stream automata are coalgebras

Stream automata are coalgebras Stream automata are coalgebras Vincenzo Ciancia, Yde Venema Institute of Logic, Language and Computation, University of Amsterdam Abstract. Stream automata (also called ω-automata) and ω-regular languages

More information

Coalgebraic Lindström Theorems

Coalgebraic Lindström Theorems Coalgebraic Lindström Theorems Alexander Kurz University of Leicester, UK Yde Venema ILLC, Amsterdam, The Netherlands Abstract We study modal Lindström theorems from a coalgebraic perspective. We provide

More information

Modular Construction of Modal Logics

Modular Construction of Modal Logics Modular Construction of Modal Logics Corina Cîrstea 1 and Dirk Pattinson 2 1 School of Electronics and Computer Science, University of Southampton, UK cc2@ecs.soton.ac.uk 2 Institut für Informatik, LMU

More information

Monoidal Categories, Bialgebras, and Automata

Monoidal Categories, Bialgebras, and Automata Monoidal Categories, Bialgebras, and Automata James Worthington Mathematics Department Cornell University Binghamton University Geometry/Topology Seminar October 29, 2009 Background: Automata Finite automata

More information

Bringing class diagrams to life

Bringing class diagrams to life Bringing class diagrams to life Luis S. Barbosa & Sun Meng DI-CCTC, Minho University, Braga & CWI, Amsterdam UML & FM Workshop 2009 Rio de Janeiro 8 December, 2009 Formal Methods proofs problems structures

More information

Step-Indexed Biorthogonality: a Tutorial Example

Step-Indexed Biorthogonality: a Tutorial Example Step-Indexed Biorthogonality: a Tutorial Example Andrew Pitts University of Cambridge Computer Laboratory 1 Introduction The purpose of this note is to illustrate the use of step-indexing [2] combined

More information

Duality in Probabilistic Automata

Duality in Probabilistic Automata Duality in Probabilistic Automata Chris Hundt Prakash Panangaden Joelle Pineau Doina Precup Gavin Seal McGill University MFPS May 2006 Genoa p.1/40 Overview We have discovered an - apparently - new kind

More information

arxiv: v1 [cs.lo] 29 May 2014

arxiv: v1 [cs.lo] 29 May 2014 An Introduction to the Clocked Lambda Calculus Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, and Andrew Polonsky VU University Amsterdam, The Netherlands Abstract We give a brief introduction to the

More information

On the coinductive nature of centralizers

On the coinductive nature of centralizers On the coinductive nature of centralizers Charles Grellois INRIA & University of Bologna Séminaire du LIFO Jan 16, 2017 Charles Grellois (INRIA & Bologna) On the coinductive nature of centralizers Jan

More information

Mix-Automatic Sequences

Mix-Automatic Sequences Mix-Automatic Sequences Jörg Endrullis 1, Clemens Grabmayer 2, and Dimitri Hendriks 1 1 VU University Amsterdam 2 Utrecht University Abstract. Mix-automatic sequences form a proper extension of the class

More information

Distributive laws for the Coinductive Solution of Recursive Equations

Distributive laws for the Coinductive Solution of Recursive Equations Distributive laws for the Coinductive Solution of Recursive Equations Bart Jacobs Institute for Computing and Information Sciences, Radboud University Nijmegen P.O. Box 9010, 6500 GL Nijmegen, The Netherlands

More information

Preliminaries. Chapter 3

Preliminaries. Chapter 3 Chapter 3 Preliminaries In the previous chapter, we studied coinduction for languages and deterministic automata. Deterministic automata are a special case of the theory of coalgebras, which encompasses

More information

Transformation of Corecursive Graphs

Transformation of Corecursive Graphs Transformation of Corecursive Graphs Towards M-Adhesive Categories of Corecursive Graphs Julia Padberg 10.2.2017 Padberg Transformation of Corecursive Graphs 10.2.2017 1 Motivation Table of Contents 1

More information

On a Categorical Framework for Coalgebraic Modal Logic

On a Categorical Framework for Coalgebraic Modal Logic On a Categorical Framework for Coalgebraic Modal Logic Liang-Ting Chen 1 Achim Jung 2 1 Institute of Information Science, Academia Sinica 2 School of Computer Science, University of Birmingham MFPS XXX

More information

Product rules and distributive laws

Product rules and distributive laws Product rules and distributive laws Joost Winter University of Warsaw April 2, 2016 Overview Main goal of this paper: a categorical framework for a two-step determinization process in which product rules,

More information

Lax Extensions of Coalgebra Functors and Their Logic

Lax Extensions of Coalgebra Functors and Their Logic Lax Extensions of Coalgebra Functors and Their Logic Johannes Marti, Yde Venema ILLC, University of Amsterdam Abstract We discuss the use of relation lifting in the theory of set-based coalgebra and coalgebraic

More information

Duality in Logic and Computation

Duality in Logic and Computation Duality in Logic and Computation Prakash Panangaden 1 1 School of Computer Science McGill University IEEE Symposium On Logic In Computer Science, June 2013 Panangaden (McGill University) Duality in Logic

More information

Neighborhood Semantics for Modal Logic Lecture 5

Neighborhood Semantics for Modal Logic Lecture 5 Neighborhood Semantics for Modal Logic Lecture 5 Eric Pacuit ILLC, Universiteit van Amsterdam staff.science.uva.nl/ epacuit August 17, 2007 Eric Pacuit: Neighborhood Semantics, Lecture 5 1 Plan for the

More information

Universal Algebra for Logics

Universal Algebra for Logics Universal Algebra for Logics Joanna GRYGIEL University of Czestochowa Poland j.grygiel@ajd.czest.pl 2005 These notes form Lecture Notes of a short course which I will give at 1st School on Universal Logic

More information

Logical connections in the many-sorted setting

Logical connections in the many-sorted setting Logical connections in the many-sorted setting Jiří Velebil Czech Technical University in Prague Czech Republic joint work with Alexander Kurz University of Leicester United Kingdom AK & JV AsubL4 1/24

More information

Neighborhood Semantics for Modal Logic Lecture 4

Neighborhood Semantics for Modal Logic Lecture 4 Neighborhood Semantics for Modal Logic Lecture 4 Eric Pacuit ILLC, Universiteit van Amsterdam staff.science.uva.nl/ epacuit August 16, 2007 Eric Pacuit: Neighborhood Semantics, Lecture 4 1 Plan for the

More information

Semantical Principles in the Modal Logic of Coalgebras

Semantical Principles in the Modal Logic of Coalgebras Semantical Principles in the Modal Logic of Coalgebras Dirk Pattinson Institut für Informatik, Ludwig-Maximilians-Universität München Abstract. Coalgebras for a functor on the category of sets subsume

More information

Games for topological fixpoint logics

Games for topological fixpoint logics Games for topological fixpoint logics Clemens Kupke University of Strathclyde, Glasgow Scotland, UK & EU joint work with Nick Bezhanishvili University of Amsterdam The Netherlands Categories, Logic & Physics,

More information

Obtaining the syntactic monoid via duality

Obtaining the syntactic monoid via duality Radboud University Nijmegen MLNL Groningen May 19th, 2011 Formal languages An alphabet is a non-empty finite set of symbols. If Σ is an alphabet, then Σ denotes the set of all words over Σ. The set Σ forms

More information

Applied Logic. Lecture 1 - Propositional logic. Marcin Szczuka. Institute of Informatics, The University of Warsaw

Applied Logic. Lecture 1 - Propositional logic. Marcin Szczuka. Institute of Informatics, The University of Warsaw Applied Logic Lecture 1 - Propositional logic Marcin Szczuka Institute of Informatics, The University of Warsaw Monographic lecture, Spring semester 2017/2018 Marcin Szczuka (MIMUW) Applied Logic 2018

More information

A Weak Bisimulation for Weighted Automata

A Weak Bisimulation for Weighted Automata Weak Bisimulation for Weighted utomata Peter Kemper College of William and Mary Weighted utomata and Semirings here focus on commutative & idempotent semirings Weak Bisimulation Composition operators Congruence

More information

Towards Trace Metrics via Functor Lifting

Towards Trace Metrics via Functor Lifting Towards Trace Metrics via Functor Lifting Paolo Baldan 1,Filippo Bonchi 2, Henning Kerstan 3 and Barbara König 3 1 Università di Padova, Italy 2 CNRS, ENS Lyon, Université de Lyon, France 3 Universität

More information

Vietoris bisimulations

Vietoris bisimulations Vietoris bisimulations N. Bezhanishvili, G. Fontaine and Y. Venema July 17, 2008 Abstract Building on the fact that descriptive frames are coalgebras for the Vietoris functor on the category of Stone spaces,

More information

Monoidal Company for Accessible Functors *

Monoidal Company for Accessible Functors * Monoidal Company for Accessible Functors * Henning Basold, Damien Pous, Jurriaan Rot To cite this version: Henning Basold, Damien Pous, Jurriaan Rot. Monoidal Company for Accessible Functors *. CALCO,

More information

Coalgebraic Logic and Synthesis of Mealy Machines

Coalgebraic Logic and Synthesis of Mealy Machines Coalgebraic Logic and Synthesis of Mealy Machines M.M. Bonsangue 1,2, Jan Rutten 2,3,, and Alexandra Silva 2, 1 LIACS - Leiden University 2 Centrum voor Wiskunde en Informatica (CWI) 3 Vrije Universiteit

More information

Data-Oblivious Stream Productivity

Data-Oblivious Stream Productivity Jörg Endrullis Clemens Grabmayer Dimitri Hendriks Vrije Universiteit Universiteit Utrecht Vrije Universiteit NWO Projects Infinity and ProvCyc PAM, CWI May 7, 2008 Outline 1. Introduction Productivity.

More information

Structural Operational Semantics for Weighted Transition Systems

Structural Operational Semantics for Weighted Transition Systems Structural Operational Semantics for Weighted Transition Systems Bartek Klin Warsaw University, University of Cambridge Abstract. Weighted transition systems are defined, parametrized by a commutative

More information

An introduction to (co)algebra and (co)induction

An introduction to (co)algebra and (co)induction 1 An introduction to (co)algebra and (co)induction 1.1 Introduction Algebra is a well-established part of mathematics, dealing with sets with operations satisfying certain properties, like groups, rings,

More information

The Many Faces of Modal Logic Day 4: Structural Proof Theory

The Many Faces of Modal Logic Day 4: Structural Proof Theory The Many Faces of Modal Logic Day 4: Structural Proof Theory Dirk Pattinson Australian National University, Canberra (Slides based on a NASSLLI 2014 Tutorial and are joint work with Lutz Schröder) LAC

More information

Duality in Logic and Computation

Duality in Logic and Computation Duality in Logic and Computation Prakash Panangaden 1 1 School of Computer Science McGill University IEEE Symposium On Logic In Computer Science, June 2013 Panangaden (McGill University) Duality in Logic

More information

Simulations in Coalgebra

Simulations in Coalgebra Simulations in Coalgebra Jesse Hughes Dept. Philosophy, Technical Univ. Eindhoven, P.O. Box 513, 5600 MB Eindhoven, The Netherlands. J.Hughes@tm.tue.nl Bart Jacobs Dept. Computer Science, Univ. Nijmegen,

More information

arxiv: v2 [cs.lo] 10 Apr 2014

arxiv: v2 [cs.lo] 10 Apr 2014 A Coinductive Treatment of Infinitary Rewriting Jörg Endrullis 1, Helle Hvid Hansen 2,3, Dimitri Hendriks 1, Andrew Polonsky 1, and Alexandra Silva 2 arxiv:1306.6224v2 [cs.lo] 10 Apr 2014 1 VU University

More information

Sampling, splitting and merging in coinductive stream calculus

Sampling, splitting and merging in coinductive stream calculus Sampling, splitting and merging in coinductive stream calculus M. Niqui, J.J.M.M. Rutten SEN-E0904 Centrum Wiskunde & Informatica Centrum Wiskunde & Informatica (CWI) is the national research institute

More information

Weak bisimulations for coalgebras over ordered functors

Weak bisimulations for coalgebras over ordered functors Weak bisimulations or coalgebras over ordered unctors Tomasz Brengos Faculty o Mathematics and Inormation Sciences Warsaw University o Technology Koszykowa 75 00-662 Warszawa, Poland t.brengos@mini.pw.edu.pl

More information

Proof systems for Moss coalgebraic logic

Proof systems for Moss coalgebraic logic Proof systems for Moss coalgebraic logic Marta Bílková, Alessandra Palmigiano, Yde Venema March 30, 2014 Abstract We study Gentzen-style proof theory of the finitary version of the coalgebraic logic introduced

More information

Binary positivity in the language of locales

Binary positivity in the language of locales Binary positivity in the language of locales Francesco Ciraulo Department of Mathematics University of Padua 4 th Workshop on Formal Topology June 15-20 2012, Ljubljana Francesco Ciraulo (Padua) Binary

More information

Definability, Canonical Models, Compactness for Finitary Coalgebraic Modal Logic

Definability, Canonical Models, Compactness for Finitary Coalgebraic Modal Logic Electronic Notes in Theoretical Computer Science 65 No. 1 (2002) URL: http://www.elsevier.nl/locate/entcs/volume65.html 21 pages Definability, Canonical Models, Compactness for Finitary Coalgebraic Modal

More information

A Coinductive Framework for Infinitary Rewriting and Equational Reasoning

A Coinductive Framework for Infinitary Rewriting and Equational Reasoning A Coinductive Framework for Infinitary Rewriting and Equational Reasoning Jörg Endrullis, Helle Hvid Hansen, Dimitri Hendriks, Andrew Polonsky, and Alexandra Silva Abstract We present a coinductive framework

More information

Logic for Computational Effects: work in progress

Logic for Computational Effects: work in progress 1 Logic for Computational Effects: work in progress Gordon Plotkin and John Power School of Informatics University of Edinburgh King s Buildings Mayfield Road Edinburgh EH9 3JZ Scotland gdp@inf.ed.ac.uk,

More information

Correspondence between Kripke Structures and Labeled Transition Systems for Model Minimization

Correspondence between Kripke Structures and Labeled Transition Systems for Model Minimization Correspondence between Kripke Structures and Labeled Transition Systems for Model Minimization Rob Schoren Abstract This document is mainly an extension of the work of Michel Reniers and Tim Willemse,

More information

Algebraic Semantics for Coalgebraic Logics

Algebraic Semantics for Coalgebraic Logics CMCS 04 Preliminary Version Algebraic Semantics for Coalgebraic Logics Clemens Kupke a Alexander Kurz b,1 Dirk Pattinson c a CWI/Universiteit van Amsterdam b University of Leicester c LMU München Abstract

More information

The State Explosion Problem

The State Explosion Problem The State Explosion Problem Martin Kot August 16, 2003 1 Introduction One from main approaches to checking correctness of a concurrent system are state space methods. They are suitable for automatic analysis

More information

arxiv: v1 [cs.lo] 5 May 2015

arxiv: v1 [cs.lo] 5 May 2015 A Coinductive Framework for Infinitary Rewriting and Equational Reasoning (Extended Version ) Jörg Endrullis 1, Helle Hvid Hansen 2, Dimitri Hendriks 1, Andrew Polonsky 3, and Alexandra Silva 4 1 Department

More information

INFORMATIQUE THÉORIQUE ET APPLICATIONS

INFORMATIQUE THÉORIQUE ET APPLICATIONS INFORMATIQUE THÉORIQUE ET APPLICATIONS J. J. M. M. RUTTEN A note on coinduction and weak bisimilarity for while programs Informatique théorique et applications, tome 33, n o 4-5 (1999), p. 393-400

More information

6 Coalgebraic modalities via predicate liftings

6 Coalgebraic modalities via predicate liftings 6 Coalgebraic modalities via predicate liftings In this chapter we take an approach to coalgebraic modal logic where the modalities are in 1-1 correspondence with so-called predicate liftings for the functor

More information

Presenting Functors by Operations and Equations

Presenting Functors by Operations and Equations j ) v Presenting Functors by Operations and Equations Marcello M. Bonsangue 1? Alexander Kurz 2?? 1 LIACS, Leiden University, The Netherlands 2 Department of Computer Science, University of Leicester,

More information

Categorical logics for contravariant simulations, partial bisimulations, modal refinements and mixed transition systems

Categorical logics for contravariant simulations, partial bisimulations, modal refinements and mixed transition systems Categorical logics for contravariant simulations, partial bisimulations, modal refinements and mixed transition systems Ignacio Fábregas, Miguel Palomino, and David de Frutos-Escrig Departamento de Sistemas

More information

An Introduction to the Theory of Coalgebras

An Introduction to the Theory of Coalgebras An Introduction to the Theory of Coalgebras Dirk Pattinson Institut für Informatik, LMU München 2 Contents 1 Introduction 7 1.1 State Based Systems....................... 7 1.1.1 Informal Denition....................

More information

Abstract model theory for extensions of modal logic

Abstract model theory for extensions of modal logic Abstract model theory for extensions of modal logic Balder ten Cate Stanford, May 13, 2008 Largely based on joint work with Johan van Benthem and Jouko Väänänen Balder ten Cate Abstract model theory for

More information

Property Checking of Safety- Critical Systems Mathematical Foundations and Concrete Algorithms

Property Checking of Safety- Critical Systems Mathematical Foundations and Concrete Algorithms Property Checking of Safety- Critical Systems Mathematical Foundations and Concrete Algorithms Wen-ling Huang and Jan Peleska University of Bremen {huang,jp}@cs.uni-bremen.de MBT-Paradigm Model Is a partial

More information

A few bridges between operational and denotational semantics of programming languages

A few bridges between operational and denotational semantics of programming languages A few bridges between operational and denotational semantics of programming languages Soutenance d habilitation à diriger les recherches Tom Hirschowitz November 17, 2017 Hirschowitz Bridges between operational

More information

The Measurable Space of Stochastic Processes

The Measurable Space of Stochastic Processes The Measurable Space of Stochastic Processes Luca Cardelli Microsoft Research Cambridge, UK Email: luca@microsoft.com Radu Mardare The Microsoft Research-University of Trento Centre for Computational and

More information

On the Origins of Bisimulation and Coinduction

On the Origins of Bisimulation and Coinduction On the Origins of Bisimulation and Coinduction DAVIDE SANGIORGI University of Bologna, Italy The origins of bisimulation and bisimilarity are examined, in the three fields where they have been independently

More information

CS 6110 S16 Lecture 33 Testing Equirecursive Equality 27 April 2016

CS 6110 S16 Lecture 33 Testing Equirecursive Equality 27 April 2016 CS 6110 S16 Lecture 33 Testing Equirecursive Equality 27 April 2016 1 Equirecursive Equality In the equirecursive view of recursive types, types are regular labeled trees, possibly infinite. However, we

More information

Coalgebraic Semantics of Modal Logics: an Overview

Coalgebraic Semantics of Modal Logics: an Overview Coalgebraic Semantics of Modal Logics: an Overview Clemens Kupke and Dirk Pattinson Department of Computing, Imperial College London 180 Queen s Gate, London SW7 2AZ, UK c.kupke@imperial.ac.uk, d.pattinson@imperial.ac.uk

More information

Extended Abstract: Reconsidering Intuitionistic Duality

Extended Abstract: Reconsidering Intuitionistic Duality Extended Abstract: Reconsidering Intuitionistic Duality Aaron Stump, Harley Eades III, Ryan McCleeary Computer Science The University of Iowa 1 Introduction This paper proposes a new syntax and proof system

More information

Conceptual Connections of Circularity and Category Theory

Conceptual Connections of Circularity and Category Theory 1/64 Conceptual Connections of Circularity and Category Theory Larry Moss Indiana University, Bloomington ESSLLI 2012, Opole 2/64 The conceptual comparison chart Filling out the details is my goal for

More information

Operational Semantics Using the Partiality Monad

Operational Semantics Using the Partiality Monad page.1 Operational Semantics Using the Partiality Monad Nils Anders Danielsson (Göteborg) Shonan Meeting 026: Coinduction for computation structures and programming languages The research leading to these

More information

Reflection and preservation of properties in coalgebraic (bi)simulations

Reflection and preservation of properties in coalgebraic (bi)simulations Reflection and preservation of properties in coalgebraic (bi)simulations Ignacio Fábregas, Miguel Palomino, and David de Frutos Escrig Departamento de Sistemas Informáticos y Computación, UCM fabregas@fdi.ucm.es

More information

Nabla Algebras and Chu Spaces

Nabla Algebras and Chu Spaces Nabla Algebras and Chu Spaces Alessandra Palmigiano and Yde Venema Universiteit van Amsterdam, ILLC Plantage Muidergracht 24 1018 TV Amsterdam, Netherlands Abstract. This paper is a study into some properties

More information

Bounded Stacks, Bags and Queues

Bounded Stacks, Bags and Queues Bounded Stacks, Bags and Queues J.C.M. Baeten 1 and J.A. Bergstra 2,3 1 Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands,

More information

CHURCH SYNTHESIS PROBLEM and GAMES

CHURCH SYNTHESIS PROBLEM and GAMES p. 1/? CHURCH SYNTHESIS PROBLEM and GAMES Alexander Rabinovich Tel-Aviv University, Israel http://www.tau.ac.il/ rabinoa p. 2/? Plan of the Course 1. The Church problem - logic and automata. 2. Games -

More information

PDF hosted at the Radboud Repository of the Radboud University Nijmegen

PDF hosted at the Radboud Repository of the Radboud University Nijmegen PDF hosted at the Radboud Repository of the Radboud University Nijmegen The following full text is a preprint version which may differ from the publisher's version. For additional information about this

More information

On the Duality between Observability and Reachability

On the Duality between Observability and Reachability On the Duality between Observability and Reachability Michel Bidoit 1, Rolf Hennicker 2, and Alexander Kurz 3 1 Laboratoire Spécification et Vérification (LSV), CNRS & ENS de Cachan, France 2 Institut

More information

An introduction to process calculi: Calculus of Communicating Systems (CCS)

An introduction to process calculi: Calculus of Communicating Systems (CCS) An introduction to process calculi: Calculus of Communicating Systems (CCS) Lecture 2 of Modelli Matematici dei Processi Concorrenti Paweł Sobociński University of Southampton, UK Intro to process calculi:

More information

Model Theory of Modal Logic Lecture 5. Valentin Goranko Technical University of Denmark

Model Theory of Modal Logic Lecture 5. Valentin Goranko Technical University of Denmark Model Theory of Modal Logic Lecture 5 Valentin Goranko Technical University of Denmark Third Indian School on Logic and its Applications Hyderabad, January 29, 2010 Model Theory of Modal Logic Lecture

More information

A Behavioral Congruence for Concurrent Constraint Programming with Nondeterministic Choice

A Behavioral Congruence for Concurrent Constraint Programming with Nondeterministic Choice A Behavioral Congruence for Concurrent Constraint Programming with Nondeterministic Choice Luis Pino*, Filippo Bonchi** and Frank Valencia* (Presented by: Jorge A. Pe rez) *E quipe Come te, LIX, Laboratoire

More information

De Jongh s characterization of intuitionistic propositional calculus

De Jongh s characterization of intuitionistic propositional calculus De Jongh s characterization of intuitionistic propositional calculus Nick Bezhanishvili Abstract In his PhD thesis [10] Dick de Jongh proved a syntactic characterization of intuitionistic propositional

More information

Introduction to Logic in Computer Science: Autumn 2006

Introduction to Logic in Computer Science: Autumn 2006 Introduction to Logic in Computer Science: Autumn 2006 Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam Ulle Endriss 1 Plan for Today Today s class will be an introduction

More information

Automata and Fixed Point Logic: a Coalgebraic Perspective

Automata and Fixed Point Logic: a Coalgebraic Perspective Automata and Fixed Point Logic: a Coalgebraic Perspective Yde Venema Abstract This paper generalizes existing connections between automata and logic to a coalgebraic abstraction level. Let F : Set Set

More information

On a Purely Categorical Framework for Coalgebraic Modal Logic

On a Purely Categorical Framework for Coalgebraic Modal Logic On a Purely Categorical Framework for Coalgebraic Modal Logic by Liang-Ting Chen A thesis submitted to the University of Birmingham for the degree of DOCTOR OF PHILOSOPHY School of Computer Science University

More information

Subsumption of concepts in FL 0 for (cyclic) terminologies with respect to descriptive semantics is PSPACE-complete.

Subsumption of concepts in FL 0 for (cyclic) terminologies with respect to descriptive semantics is PSPACE-complete. Subsumption of concepts in FL 0 for (cyclic) terminologies with respect to descriptive semantics is PSPACE-complete. Yevgeny Kazakov and Hans de Nivelle MPI für Informatik, Saarbrücken, Germany E-mail:

More information

From Algebras and Coalgebras to Dialgebras

From Algebras and Coalgebras to Dialgebras From Algebras and Coalgebras to Dialgebras Erik Poll and Jan Zwanenburg University of Nijmegen Toernooiveld 1, 6525 ED Nijmegen, The Netherlands http://www.cs.kun.nl/~{erikpoll,janz} {erikpoll,janz}@cs.kun.nl

More information