Publication: Coalgebraic modal logic for Pw
Date
2008-06
Authors
Su, Ezgi Iraz
Journal Title
Journal ISSN
Volume Title
Publisher
İstanbul Kültür Üniversitesi / Fen Bilimleri Enstitüsü / Matematik Bilgisayar Anabilim Dalı
Abstract
Modal mantık bilgisayar biliminin pek cok alanında onemli bir yer tutmaktadır Son yıllarda kocebirler ve bunların bilgisayar bilmine uygulamaları ilgi cekmektedir çünkü kocebirlerin cesitli aktarım sistemlerini modelledikleri gosterilmistir. Evrensel cebir teoerisine dual olarak gelisen kocebir teorisi dogal olarak kategori teoriye dayalıdır. Bu nedenle bu tezde oncelikle modal mantıktan ve kategori teoriden temel bilgiler verilmistir. Sonra kocebirler tanıtılarak bunların temel ozellikleri ile bu ozelliklerin ispatları ve konunun temel ornekleri verilmistir. Son olarak modal operatorlerin yorumlanmasına olanak saglayan dogal donüşümler tanıtılmış, ozelikleri ispatlanmış ve sonlu kuvvet funktoru V?' ya tekabül eden kocebirsel mantık tanımlanmıstır. Anahtar Kelimeler: Modal mantık, kocebir, bisimilasyon, dogal donusum
Modal logic plays an important role in many areas of computer science. In recent years coalgebras and their applications to computer science have attracted a lot of attention because coalgebras have been introduced to model various types of transition systems. In this thesis we study P!-coalgebras and coalgebraic modal logic corresponding to this functor. This thesis begins with some preliminary definitions, examples and propositions about modal logic and category theory. After the notion of coalgebra is introduced, some basic definitions, properties and examples about the subject is given. Then, the concept of predicate lifting is widely mentioned. Next, some propositions and theorems are proven on predicate liftings. Finally, the coalgebraic modal logic corresponding to the finite power set functor is defined. Keywords: Modal logic, Coalgebra, Bisimulation, Predicate lifting
Modal logic plays an important role in many areas of computer science. In recent years coalgebras and their applications to computer science have attracted a lot of attention because coalgebras have been introduced to model various types of transition systems. In this thesis we study P!-coalgebras and coalgebraic modal logic corresponding to this functor. This thesis begins with some preliminary definitions, examples and propositions about modal logic and category theory. After the notion of coalgebra is introduced, some basic definitions, properties and examples about the subject is given. Then, the concept of predicate lifting is widely mentioned. Next, some propositions and theorems are proven on predicate liftings. Finally, the coalgebraic modal logic corresponding to the finite power set functor is defined. Keywords: Modal logic, Coalgebra, Bisimulation, Predicate lifting
Description
Keywords
matematik, mathematics