Logic-ml

logic-ml@fos.kuis.kyoto-u.ac.jp

7 participants
1772 discussions

$BCLOC2q$N$40FFb(B [Prof. Yde Venema, 5/25]
by Hasegawa Masahito 23 May '11

23 May '11

$B3'MM!"(B $B:#=5$N?eMK!J#57n#2#5F|!K$K!"5~ETBg3X?tM}2r@O8&5f=j$G0J2<$NCLOC2q$,3+:E(B $B$5$l$^$9!#9V1i<T$O!"8=:_5R0w65<x$H$7$F?tM}8&$KBZ:_$5$l$F$$$k!"%"%`%9%F(B $B%k%@%`Bg$N(BYde Venema$B$5$s$G$9!#$I$&$>$4MhD0$/$@$5$$!#(B $BD9C+@n???M(B $B5~ETBg3X?tM}2r@O8&5f=j(B -- $BCLOC2q$N$40FFb(B $BF|;~(B: $B!!(B5$B7n(B 25$BF|(B($B?e(B) 16:30-17:30 $B>l=j(B: $B!!?tM}8&(B110$B9f<<(B (16:00$B$h$j(B1$B3,%m%S!<$G(Btea) $B9V1i<T(B: Yde Venema $B;a(B $B=jB0(B: $B!!5~Bg!&?tM}8&(B & University of Amsterdam $BBjL\(B: Coalgebra, its Logic, and some of its Mathematical Environments Abstract: Computers and other electronic equipment are becoming more and prominent, both in our daily life, and in society as a whole. When we are confronted with undesired or incomprehensible behavior of for instance our mobile phone, we will naively start reasoning about the system, modelling it as a state-based evolving system, that we can only observe as a black box. Clearly, when it comes to specifying and reasoning about the behavior of critical software systems, a sophisticated mathematical theory is needed. The theory of coalgebra, which has emerged from theoretical computer science in the last two decades, provides a general, mathematical framework for reasoning about such state-based evolving systems. It combines mathematical simplicity with wide applicability, due to its categorical foundations: many features such as input/output, nondeterminism, probability, and interaction can be encoded in the coalgebraic type which formally is a functor over Set (or some other base category). Coalgebra allows us to give precise mathematical definitions of notions such as behavior or observational equivalence of systems. Logic naturally enters the picture since we want to specify and reason about behavior in a formal way. In the talk, we will give a very informal introduction and motivation of coalgebra and coalgebraic logic. We then briefly explain the dualities between algebra and coalgebra, and discuss the principle of coinduction. In the second part of the talk we describe some of the mathematical environments of the theory, and sketch how ideas from coalgebraic logic can be used to generalize results in topology (the Vietoris construction) and automata theory (Rabin's Theorem). $BCLOC2q$N0FFb!'(B http://www.kurims.kyoto-u.ac.jp/ja/seminar/danwakai.html $B?tM}2r@O8&5f=j$X$N%"%/%;%9!'(B http://www.kurims.kyoto-u.ac.jp/ja/access-01.html --

1 0

２２（日）-２５（水）: 国際会議TAMC2011
by arai toshiyasu 20 May '11

20 May '11

みなさま代理投稿します。 -- 新井敏康 --- 電通大の垂井と申します。５月２２日（日）から２５日（水）まで電通大（調布）にて理論計算機科学に関するTAMC2011という国際会議を開催します。 http://www.tamc2011.com/index.html ２２日（日）は３つのチュートリアルのみ開催しこのチュートリアルは、誰でも聴講できると明示的に告知しています。（登録不要。費用不要。）２番目の午後最初のチュートリアルは finite model theoryに関するものです。 (finiteの場合の基本的事項、計算量との関係、0-1 lawなどをカバーしてもらう予定です。）さらに、２３・２４・２５の会議の部分についても聴講だけは登録/費用不要で誰でもできることにしました。（プロシーディングスもらえず、宴会には参加できないですが。）ご興味とご都合に応じて参加検討ください。電気通信大学垂井淳 tarui(a)ice.uec.ac.djp

1 0

CFP: 日本ソフトウェア科学会第28回大会
by Yukiyoshi Kameyama 16 May '11

16 May '11

皆様， 9月に沖縄で開催される日本ソフトウェア科学会第28回大会の発表募集をお送りします．学会誌への同時投稿も可能です．是非，発表・投稿をご検討ください． -- 亀山幸義 (筑波大学) http://logic.cs.tsukuba.ac.jp/~kam -------------------------------------------------------------------------- 日本ソフトウェア科学会第28回大会日時：2011年9月27日(火)〜29日(木) [大会本体] (併設イベントは調整中) 会場：沖縄産業支援センター・沖縄県市町村自治会館 (沖縄県那覇市) http://jssst11.kuis.kyoto-u.ac.jp/ ＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿熱い企画満載です！＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿日本ソフトウェア科学会では第28回大会を9月27日(火)から29日(木)まで沖縄県那覇市で開催します．大会での一般の登壇発表と，大会同時投稿論文としての学会誌への投稿を下記の要領で募集します．発表申込締切は6月24日(金)です．皆様のご発表，ご投稿をお待ちしております． ■一般の登壇発表一般の登壇発表の場を一般セッション，いくつかの研究会セッション，ソフトウェア論文セッションから選ぶことができます．特に優秀な登壇発表に対しては「高橋奨励賞」(故高橋秀俊先生にちなむ賞)が与えられます．・一般セッションソフトウェア科学全般を対象とします．分野横断的な研究，従来の研究分野ではカバーできない新しい発想の研究なども対象に含みます．・研究会セッション以下の研究会と連携して各分野の観点から議論を深めることで，発表者にも聴講者にも有益で楽しめるセッションを実現します． - プログラミング論研究会(PPL) - マルチ・エージェントと協調計算研究会(MACC) - インタラクティブシステムとソフトウェア研究会(ISS) - ソフトウェア工学の基礎研究会(FOSE) - インターネットテクノロジー研究会(ITECH) - ディペンダブルシステム研究会(DSW) - ネットワークが創発する知能研究会(EIN) ただし，MACCについては発表募集をせずに研究会の特色を生かしたセッションが企画されます．・ソフトウェア論文セッション先進的なアイデアを実現したソフトウェアについての成果発表の場を提供します．また，学会誌「コンピュータソフトウェア」のソフトウェア論文特集号(11月初旬頃投稿締切)とリンクも用意されています．さらに登壇発表と同じ内容によるデモ・ポスターセッションでの発表も歓迎します．ポスター掲示に加えて，ノートPC等を持ち込んでのデモも可能です． ■大会同時投稿論文日本ソフトウェア科学会大会では，登壇発表の予稿を学会誌「コンピュータソフトウェア」へ論文として投稿できる「大会同時投稿論文」の仕組みを提供しています．同時投稿の時期は大会前(第1回)と大会後(第2回)のどちらかで，著者自身が大会予稿の提出時に選択できます．また，レター論文の場合，判定結果は2012年1月末までに著者へ通知します． ■スケジュール一般の登壇発表，大会同時投稿論文に関する主なスケジュールは以下の通りです．・6月24日(金) 発表申込締切・8月8日(月) 予稿原稿締切および大会同時投稿論文第1回投稿締切・9月27日(火)〜29日(木) 大会本体 (併設イベントは 9月26日(月)で調整中) ・10月20日(木) 大会同時投稿論文第2回投稿締切 ■発表申込登壇発表者は日本ソフトウェア科学会の正会員または学生会員に限ります．ただし，発表申込時に入会手続き中である場合も含みます．発表申込ページの開設は，しばらくお待ちください． ■詳細について一般の登壇発表，大会同時投稿論文についての詳細は以下の大会ウェブサイトでご確認ください． http://jssst11.kuis.kyoto-u.ac.jp/ ■組織大会委員長遠藤聡志 (琉球大学) 運営委員長河野真治 (琉球大学) プログラム委員長八杉昌宏 (京都大学) プログラム委員会 (5月12日時点) 八杉昌宏 (委員長, 京都大学) 明石修 (NTT未来ねっと研究所) 五十嵐淳 (京都大学) 伊知地宏 (ラムダ数学教育研究所) 岩崎英哉 (電気通信大学) 大沢英一 (はこだて未来大学) 亀山幸義 (筑波大学) 栗原聡 (大阪大学) 河野健二 (慶應義塾大学) 志築文太郎 (筑波大学) 杉山安洋 (日本大学) 中野圭介 (電気通信大学) 並木美太郎 (東京農工大学) 番原睦則 (神戸大学) 細部博史 (国立情報学研究所) 増原英彦 (東京大学) ■お問合せ一般の登壇発表，大会同時投稿論文についてお問合せの際はプログラム委員長 (八杉昌宏)宛てに以下へメールをお送りください． yasugi*ＡＴ*kuis.kyoto-u.ac.jp (*ＡＴ*は@に置き換えてください) --------------------------------------------------------------------------

1 0

第84回プログラミング研究会開催案内
by Takahito Aoto 09 May '11

09 May '11

＊＊＊＊複数受け取られた方はご容赦ください＊＊＊＊情報処理学会第84回プログラミング研究発表会開催のご案内をさせて頂きます． 6月14日(火)・15日(水)に函館にて開催されます．皆様のご参加をお待ちしております．また，第1日目の夜に懇親会を予定しています．懇親会への参加をご希望の方は 6月7日(火)までに下記の要領で青戸までお申し込みください．(発表会への参加自体については事前の申し込みは不要です．) ------------------------------------ To: aoto [at] nue.riec.tohoku.ac.jp Subject: PRO84-party 6月14日(火)の懇親会に参加します．御名前: 御所属: 区別: 学生・一般 (6月7日(火)までにお知らせ下さい．) ------------------------------------ なお，下記のプログラムで，発表の順番につきましては今後変更される可能性がございますのでご了承ください．最新情報は以下のWEBページに掲載致します． http://www.nue.riec.tohoku.ac.jp/pro-2011-1/ --- 担当: 青戸等人(東北大学)，花井亮(東京大学) ================================================================= 情報処理学会第84回プログラミング研究発表会プログラム ================================================================= 日程: 2011年6月14日(火)・15日(水) 会場: サン・リフレ函館 2階視聴覚室　　　〒040-0034 北海道函館市大森町2-14 　　　JR函館駅より徒歩15分詳細情報: http://www.nue.riec.tohoku.ac.jp/pro-2011-1/ ※ 1件あたり45分 (発表25分，質疑・討論20分) ※ 発表の順番につきましてはまだ確定ではありませんのでご了承ください． 6月14日(火) セッション１：14:15-15:45 2011-1-(1)：14:15-15:00 An Annotated Type System for Inlining ○馬雷，佐藤周行(東京大学) 2011-1-(2)：15:00-15:45 コントロールオペレータの表現力の比較 ○高島尚希，亀山幸義(筑波大学) 15:45-16:00 休憩セッション２：16:00-17:30 2011-1-(3)：16:00-16:45 拡張可能な外部識別子の設計と実装 ○倉光君郎(横浜国立大学) 2011-1-(4)：16:45-17:30 SSA形式を用いた動的バイトコード操作器の設計と実装 ○若森拓馬，井出真広，菅谷みどり，倉光君郎(横浜国立大学) 19:30-21:30 懇親会 6月15日(水) セッション３：9:30-11:45 2011-1-(5)：9:30-10:15 書き換え帰納法における文脈探索の有効性について ○佐藤晴彦，栗原正仁(北海道大学) 2011-1-(6)：10:15-11:00 弱単項TRSのE重なり性について ○三橋一郎，大山口通夫，松浦邦博(三重大学) 2011-1-(7)：11:00-11:45 GUIアクセシビリティ技術による網羅的な画面遷移の回帰検査の自動化 ○中島一，増田健，秋山幸生(日本電信電話株式会社) ------------------------------------------------------------------------

1 0

CFP: Special Session on Logic and Knowledge Representation at IICAI-11
by Ken Kaneiwa 06 May '11

06 May '11

---------------------------------------------------------------------------------- Special Session on Logic and Knowledge Representation at The 5th Indian International Conference on Artificial Intelligence (IICAI-11) December 14-16, 2011, Tumkur (near Bangalore), India ---------------------------------------------------------------------------------- A special session on Logic and Knowledge Representation will be held during the 5th Indian International Conference on Artificial Intelligence (IICAI-11). The session invites papers in all areas of Logic and Knowledge Representation . For many years, logic has been studied as an important topic of knowledge representation and reasoning. In fact, many AI researchers use logic for analyzing the problems and for modeling the reasoning process. In addition, the knowledge representation research in AI lead to various extensions of logic in other fields such as philosophy, linguistics, cognitive science, computer science, etc. The special session on Logic and Knowledge Representation provides an ideal platform for exchanging ideas in all the areas related to logic and knowledge representation. The topics covered by the session include but certainly not limited to: * Abduction and Induction * Automated Reasoning * Belief Revision * Complexity of Reasoning * Description Logics * Foundations of Knowledge Representation * Hybrid Reasoning Systems * Knowledge-base Systems * Knowledge Representation and Reasoning * Logic for Databases * Logic for Multi-agent Systems * Logic for the Semantic Web * Logic Programming * Logical Formalisms in AI * Modal Logic * Nonclassical Logic * Nonmonotonic Reasoning * Object-Oriented Deductive Languages * Ontology * Ontology Description Languages * Order-Sorted Logic * Philosophical Logic * Proof Theory * Reasoning About Actions and Change * Temporal Representation and Reasoning Paper Submission and Publication: Authors are encouraged to submit the papers for this session as an email attachment to the Session Chair given below. The papers should be in MSWORD, PDF, or PS format and should be formatted according to the Springer Lecture Notes instructions (click here for instructions/sample paper) . The length of a paper should not exceed 20 pages. Shorter papers or papers on the work currently in progress are also welcome. The first page of the paper should contain the title, name(s) of the authors, affiliations, the postal and email addresses, and at least 3 keywords appropriate to the content of the paper. Further information regarding the paper submission can be obtained from the conference website too. Each paper will be peer reviewed by at least two experts in the topical area. All accepted papers will be published in the conference proceedings, under the title of the session. You may contact the conference chairs at iicai.conference[at]gmail.com for any additional information. Deadlines: Draft paper submission: May 9 , 2011 (extended deadline) June 7, 2011: Notification of acceptance/rejection to authors July 1 2011: Camera ready papers and Pre-registration due. December 14-16, 2011: Special Session and the IICAI-11 Conference Session Chair: Ken Kaneiwa Department of Electrical Engineering and Computer Science, Iwate University 4-3-5 Ueda, Morioka, Iwate 020-8551, Japan Email: kaneiwa(a)cis.iwate-u.ac.jp Tel/Fax: +81 19-621-6430 URL: http://www.ai.cis.iwate-u.ac.jp/kaneiwa/index.html URL of Kaneiwa Lab.: http://www.ai.cis.iwate-u.ac.jp

1 0

*DL Approaching* RIMS Workshop "ACAN: Algebraic and Coalgebraic Approaches to Non-Classical Logics"
by Ichiro Hasuo 28 Apr '11

28 Apr '11

みなさま，以前お知らせした京大数理研の研究集会のご案内ですが（下です），旅費補助，数理研宿舎，講演，懇親会の申込みの締切りが *** 5/1 日曜日 *** です．また， - ちょうど親鸞750回忌と重なって，京都市内のホテルが大混雑です． - 数理研の宿舎「北白川学舎」，残室5室です！という都合もありますので，登録・宿舎の手配，どうか早めにお願いいたします．京都でお会いできるのを楽しみにしていますね．それでは！運営：照井一成，佐藤哲也，蓮尾一郎 ---------- Forwarded message ---------- From: Ichiro Hasuo <ichiro(a)kurims.kyoto-u.ac.jp> Date: 2011/4/5 Subject: Call for Contribution and Participation: RIMS Workshop "ACAN: Algebraic and Coalgebraic Approaches to Non-Classical Logics" To: logic-ml <logic-ml(a)sato.kuis.kyoto-u.ac.jp>, sonoteno <sonoteno(a)m.aist.go.jp>, sigemb-info <sigemb-info(a)ertl.jp>, jssst-ppl(a)kb.ecei.tohoku.ac.jp (English version below) みなさま，（何人かの方々には bcc で失礼します）こんにちは！東京大学コンピュータ科学専攻の蓮尾です．京都大学数理解析研究所で行うワークショップ ACAN: Algebraic and Coalgebraic Approaches to Non-Classical Logics RIMS Workshop, Mon 16 - Wed 18 May 2011 https://sites.google.com/site/acanws/ へのお誘いです．現在（3月から5月まで），アムステルダム大学 ILLC の Yde Venema さんが客員教授として京大数理研に滞在されています．Yde さんは様相論理の教科書 (Blackburn-de Rijke-Venema)などで高名な論理学者で，近年は特に余代数的様相論理 coalgebraic modal logic の分野で活躍なさっています． http://staff.science.uva.nl/~yde/ この機会に，Yde さんのご研究分野である様相論理をはじめとしたさまざまな非古典論理と，彼の最近のアプローチである代数・余代数・圏論的手法とをコアトピックとして，数理研での研究集会を企画しました．まず，講演者として以下のかたがたに参加いただきます： Yde Venema さん，Raul Leal さん (ILLC, University of Amsterdam) Jose Gil-Ferez さん， Milan Petrik さん (JAIST) 佐野勝彦さん，丸山善宏さん（京都大学大学院文学研究科）さらに，オーガナイザーによるチュートリアル Algebraic Approaches to Substructural Logics （照井） Coalgebra for Modal Logic(ians) （蓮尾）も企画しています．みなさま，ぜひご参加ください！ - ぜひ講演をご検討ください．非古典論理・代数・余代数の一つでもかすっていれば大歓迎です！ - 国内からの参加者の方には，旅費の補助があります．(予算が限られています．ごめんなさい) - ちょうど親鸞750回忌と重なって，京都市内のホテルが大混雑です．宿泊の予約はぜひお早めに．また，数理研の宿泊施設「北白川学舎」の予約も受け付けます(部屋数限りあり)．詳しい情報，参加登録，講演登録については，ウェブサイト https://sites.google.com/site/acanws/ をご覧になってください．京都でお会いするのを楽しみにしております．それでは！運営：照井一成，佐藤哲也，蓮尾一郎 ================================================= Dear all, This is Ichiro Hasuo at Dept. CS, Univ. Tokyo. This is an invitation to the workshop ACAN: Algebraic and Coalgebraic Approaches to Non-Classical Logics Mon 16 - Wed 18 May 2011 RIMS, Kyoto University https://sites.google.com/site/acanws/ This workshop is organized on the occasion of the visit of Prof.Dr. Yde Venema, a modal logician from ILLC, University of Amsterdam, as a visiting professor at RIMS, Kyoto University. It will feature Yde's talk and talks by * Jose Gil-Ferez (JAIST) * Raul Leal (ILLC, University of Amsterdam) * Yoshihiro Maruyama (Grad. School of Letters, Kyoto University) * Milan Petrik (JAIST) * Katsuhiko Sano (Grad. School of Letters, Kyoto University) as well as tutorial talks by two organizers: * Kazushige Terui on algebraic approaches to substructural logics * Ichiro Hasuo on coalgebra for modal logic(ians) We solicit your participation (and your contributed talk if possible). Some organizational matters: - We will financially support your trip, if it is from inside Japan and within our budget - The hotel rooms in Kyoto will be tight due to a big Buddhism event. So book in advance! Some rooms at the RIMS accommodation are available, too. Visit the website https://sites.google.com/site/acanws/ for more info and registration. Looking forward to seeing you in Kyoto! Best regards, Organization Committee: Kazushige Terui Tetsuya Sato Ichiro Hasuo

1 1

BLAST 2011
by No-Reply 23 Apr '11

23 Apr '11

** BLAST 2011 ** June 1-5, 2011 Lawrence, Kansas REGISTER NOW! BLAST (Boolean algebras, Lattices, Algebraic logic, Set theory, and Topology; quantum logic and point-free topology have been added to the mix) is a series of annual conferences. The first three BLAST conferences were at the University of Denver, New Mexico State University, and the University of Colorado in Boulder. Go to the BLAST 2011 website for complete details: http://www.math.ku.edu/conferences/blast2011 * Important Deadlines * Early registration: May 15, 2011 Abstracts: May 15, 2011 In order to give a talk, one must submit a title and abstract for the talk by May 15, 2011. Please submit titles and abstracts at the Atlas. Abstracts submitted after May 1, 2011, will not appear in the booklet of abstracts. Abstracts may be viewed here: http://atlas-conferences.com/cgi-bin/abstract/cbbs-01 Hotel Accommodations: April 30, 2011 to guarantee conference rates The conference organizers can be contacted at: blast2011(a)math.ku.edu

1 0

Talk by Michele Basaldella at RIMS, Kyoto U. (4/21)
by Kazushige TERUI 18 Apr '11

18 Apr '11

みなさま今週木曜日に催されるセミナーのご案内をさせていただきます。どうぞお気軽にお越しください。照井 --- RIMS-CS website http://www.kurims.kyoto-u.ac.jp/~cs/ ===== Speaker: Michele Basaldella (RIMS, Kyoto University) Title: A gentle introduction to ludics Date: 11.00 - 12.00, April 21st (Thu) Place: Room 478, "Research Bldg. No. 2 (Sougou Kenkyu 2-Goukan)" http://www.kyoto-u.ac.jp/en/access/campus/main.htm (Next to our CS Lab) 総合研究2号館 478号室 (CS室のとなりです) http://www.kyoto-u.ac.jp/ja/access/campus/map6r_y.htm Abstract: When one is interested in understanding the duality between syntax (proofs) and semantics (models) in logic, a primary obstacle is that proofs are finite and concrete objects, while models are infinite and abstract structures. Since proofs and models are so different by their nature, they hardly interact together. This lack of interaction between the two worlds prevents a deeper analysis of the relations between syntax and semantics. Ludics is a research program started by Girard aimed to explain various logical and computational phenomena from an interactive point of view. The universe of ludics consists of designs: partial and infinitary proofs in which the logical type-information has been almost erased. In this vast universe, both proofs and models can be homogeneously represented as designs. Moreover, since designs come from proofs, we can make them interact together via normalization (cut-elimination). This induces an orthogonality relation, based on the termination of the computation of the normal form, which allows to reconstruct the logical types, as bi-orthogonality-closed sets of designs. In this talk we introduce and discuss the basic concepts of ludics and show some completeness results for proofs. --------------------------------------------------------- Kazushige TERUI Research Institute for Mathematical Sciences, Kyoto University. Kitashirakawa Oiwakecho, Sakyo-ku, Kyoto 606-8502, JAPAN. Phone: +81-75-753-7235 Fax: +81-75-753-7276 terui(a)kurims.kyoto-u.ac.jp http://www.kurims.kyoto-u.ac.jp/~terui/

1 0

The 50th ToPS [Apr. 27]
by Kazuyuki ASADA 18 Apr '11

18 Apr '11

[Apologies for multiple copies] I am pleased to announce the 50th Tokyo Programming Seminar, which will be held at NII on April 27 (Wed). Ichiro Hasuo from University of Tokyo and Yde Venema from University of Amsterdam will be talking about coalgebra theory and automata theory. The programme is attached below. I'm looking forward to meeting you at ToPS. Best regards, Kazuyuki Asada ---- The 50th ToPS http://www.ipl.t.u-tokyo.ac.jp/~tops/upcoming_seminar.html Time: April 27th (Wed) 2011, 15:00--17:00 Place: Rm. 2004 & 2005, 20F, National Institute of Informatics Speaker: (1) Ichiro Hasuo (University of Tokyo) Introduction to Coalgebra, through Final Sequences Abstract: In this talk I wish to deliver an elementary and informal introduction to the theory of coalgebra---a mathematical machinery underlying coinductive datatypes in functional programming---focusing on its aspect of being the categorical dual to algebra. More specifically, I'll first review the categorical "initial sequence" construction of an initial algebra, and then elaborate on its dual--the "final sequence" construction of a final coalgebra. A trip along these sequences is a good way to familiarize ourselves with the essence of induction and coinduction, and the contrast between them. (2) Yde Venema (University of Amsterdam) Coalgebra Automata Abstract: Automata operating on infinite objects provide an invaluable tool for the spcification and verification of programs. Many of the infinite objects studied in this area, such as words/streams, trees, graphs or transition systems, represent ongoing behaviour in some way, and provide key specimens of coalgebras. Hence it make sense to develop a universal theory of coalgebra automata: automata operating on coalgebras. The motivation underlying the introduction of coalgebra automata is to gain a deeper understanding of this branch of automata theory by studying properties of automata in a uniform manner, parametric in the type of the recognized structures. Coalgebraic automata theory thus contributes to Universal Coalgebra as a mathematical theory of state-based evolving systems. In the talk we give a quick introduction to coalgebra, and we introduce the notion of a coalgebra automaton. We will see that in fact a large part of the theory of parity automata can be lifted to a coalgebraic level of generality, and thus indeed belongs to the theory of Universal Coalgebra. More specifically, coalgebra automata satisfy various closure properties: under some conditions on the coalgebraic type, the collection of recognizable languages are closed under taking union, intersection, complementation, and existential projections. Time permitting, we will discuss two kinds of coalgebra automata, corresponding to approaches in coalgebraic logic that are based on, respectively, relation lifting and predicate liftings. Our results have many applications in the theory of coalgebraic fixpoint logics), but these will only be discussed tangentially.

1 0

Talk by Michele Basaldella at RIMS, Kyoto U. (4/21)
by Kazushige TERUI 17 Apr '11

17 Apr '11

みなさま今週木曜日に催されるセミナーのご案内をさせていただきます。どうぞお気軽にお越しください。照井 --- RIMS-CS website http://www.kurims.kyoto-u.ac.jp/~cs/ ===== Speaker: Michele Basaldella (RIMS, Kyoto University) Title: A gentle introduction to ludics Date: 11.00 - 12.00, April 21st (Thu) Place: Room 478, "Research Bldg. No. 2 (Sougou Kenkyu 2-Goukan)" http://www.kyoto-u.ac.jp/en/access/campus/main.htm (Next to our CS Lab) 総合研究2号館 478号室 (CS室のとなりです) http://www.kyoto-u.ac.jp/ja/access/campus/map6r_y.htm Abstract: When one is interested in understanding the duality between syntax (proofs) and semantics (models) in logic, a primary obstacle is that proofs are finite and concrete objects, while models are infinite and abstract structures. Since proofs and models are so different by their nature, they hardly interact together. This lack of interaction between the two worlds prevents a deeper analysis of the relations between syntax and semantics. Ludics is a research program started by Girard aimed to explain various logical and computational phenomena from an interactive point of view. The universe of ludics consists of designs: partial and infinitary proofs in which the logical type-information has been almost erased. In this vast universe, both proofs and models can be homogeneously represented as designs. Moreover, since designs come from proofs, we can make them interact together via normalization (cut-elimination). This induces an orthogonality relation, based on the termination of the computation of the normal form, which allows to reconstruct the logical types, as bi-orthogonality-closed sets of designs. In this talk we introduce and discuss the basic concepts of ludics and show some completeness results for proofs. ------------------------------------------ Kazushige TERUI Research Institute for Mathematical Sciences, Kyoto University. Kitashirakawa Oiwakecho, Sakyo-ku, Kyoto 606-8502, JAPAN. Phone: +81-75-753-7235 Fax: +81-75-753-7276 terui(a)kurims.kyoto-u.ac.jp http://www.kurims.kyoto-u.ac.jp/~terui/

1 0

Jump to page:

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Logic-ml