Logic-ml November 2010

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

11 participants
15 discussions

東北大学ロジックセミナー
by YOKOYAMA Keita 13 Jan '11

13 Jan '11

皆様，東北大学の横山です．以下の日程でロジックセミナーを行いますので，ご興味のある方は是非ご参加ください．日時：10月29日(金) 場所：東北大学北青葉山キャンパス理学総合棟1201号室１４：４５〜１５：１５木原貴行（東北大学理学研究科）タイトル：Effectiveness for planar dendrites and dendroids １５：３０〜池上大祐（ヘルシンキ大学）タイトル：Infinite games with imperfect information セミナーの詳細につきましては， http://www.math.tohoku.ac.jp/~y-keita/friday-seminar/friday-seminar.html をご参照ください．横山啓太 -- Keita Yokoyama Mathematical Institute, Tohoku University Aoba, Sendai, JAPAN, 980-8578 y-keita(a)math.tohoku.ac.jp

1 4

雑誌（Logica universalis）の宣伝 from Prof. Beziau
by Ichiro Hasuo 29 Nov '10

29 Nov '10

logic-ml のみなさま，上出哲広さんのご依頼により，以下のメッセージを転送します．よろしくお願いいたします．蓮尾一郎 ------------------------------------------------------------ Dear colleagues, the following message is from Prof. Jean-Yves Beziau ("Universal Logic" <universal.logic(a)ufc.br>). --------------------------------------------------------------- Free access to all papers published in Logica Universalis is avalaible up to November 30: http://www.springer.com/birkhauser/mathematics/journal/11787 Last issue of the journal is on the topic "is logic universal?" In the next future there will be special issues of the journal on the following topics: - Logic diagrams - Multimodal logics - Categorical logics - Hexagon of opposition Subscription to the print version (hard copy) of the journal is avalaible at a very good price for individuals (38 euros per year including postage and handling). Among many interesting papers published since the start of the journal - freely downloadable up to November 30 - you can find: Human Rationality Challenges Universal Logic Brian R. Gaines http://www.springerlink.com/content/y7400543luq15pr8/fulltext.pdf Logic and Natural Selection Jaroslav Peregrin http://www.springerlink.com/content/4673765064677577/fulltext.pdf Birkhoff Completeness in Institutions Mihai Codescu and Daniel Gaina http://www.springerlink.com/content/mwjq228g57886234/fulltext.pdf Strong Normalizability of Typed Lambda-Calculi for Substructural Logics Motohiko Mouri and Norihiro Kamide http://www.springerlink.com/content/05vg1q23042737qt/fulltext.pdf Some General Results About Proof Normalization Marc Aiguier and Delphine Longuet http://www.springerlink.com/content/633qp17q6h23u446/fulltext.pdf Many-Place Sequent Calculi for Finitely-Valued Logics Alexej P. Pynko http://www.springerlink.com/content/j74u60v53263gv40/fulltext.pdf Generalized Definitional Reflection and the Inversion Principle Peter Schroeder-Heister http://www.springerlink.com/content/e543v66615054247/fulltext.pdf Structuralist Logic: Implications, Inferences, and Consequences Arnold Koslow http://www.springerlink.com/content/b7115xg144h521g1/fulltext.pdf >From Fibring to Cryptofibring. A Solution to the Collapsing Problem Carlos Caleiro and Jaime Ramos http://www.springerlink.com/content/a46238u2202112k1/fulltext.pdf A New Modal Lindstrom Theorem Johan van Benthem http://www.springerlink.com/content/t26u1781q78508x2/fulltext.pdf Cut-Free Ordinary Sequent Calculi for Logics Having Generalized Finite-Valued Semantics Arnon Avron, Jonathan Ben-Naim and Beata Konikowska http://www.springerlink.com/content/22k5lqggp0641v42/fulltext.pdf Distributive-Lattice Semantics of Sequent Calculi with Structural Rules Alexej P. Pynko http://www.springerlink.com/content/7r5252m4360142w3/fulltext.pdf >------------------ Jean-Yves Beziau Editor-in-Chief Logica Universalis http://www.logica-universalis.org ---------------------------------------------------------------

1 0

Talk by Prof. Sy-David Friedman on Nov.29
by fuchino＠fuchino.ddo.jp 26 Nov '10

26 Nov '10

神戸大学システム情報学研究科の渕野昌です． 2010年12月29日（月）に， Kobe Colloquium on Logic, Statistics and Informatics の第4回の講演会として，神戸を通過される Sy-David Friedman 先生の講演を以下のように，予定しております．講演者： Professor Dr. Sy-David Firedman (Kurt Goedel Research Center, 　　　　　University of Vienna) 講演日時： 2010年12月29日（月）17:10 〜講演場所：神戸大学自然科学総合研究棟３号館４階４２１号室　　　　　 (渕野グループプレゼンテーション室) 講演題目： Cardinal Characteristics and Definability Abstract: In this talk I'll discuss ways of mixing coding techniques with both countable and finite support iteration methods to obtain results about cardinal characteristics and maximal almost disjoint families in the presence of a projective wellorder. This is joint work with Fischer and Zdomskyy. Then I'll apply these methods in a large cardinal setting to obtain a definable failure of the Singular Cardinal Hypothesis (joint work with Honzik). -- best regards Saka\'e Fuchino (渕野昌) ------------------------------------------------------------------------- Kobe University Graduate School of System Informatics Rokko-dai 1-1, Nada, Kobe 657-8501 e-mail: fuchino(a)diamond.kobe-u.ac.jp web page: http://kurt.scitec.kobe-u.ac.jp/~fuchino/ -------------------------------------------------------------------------

1 0

Talk by Prof. Sy-David Friedman on Nov.29
by fuchino＠diamond.kobe-u.ac.jp 26 Nov '10

26 Nov '10

1 0

Talk by Kohei Suenaga, Thursday next week (2010.12.2)
by Ichiro Hasuo 25 Nov '10

25 Nov '10

Dear colleagues, Next week on Thursday our guest Kohei Suenaga (U. Lisbon, ex. Tohoku U) is making a talk at RIMS, Kyoto University. No registration necessary. See you there! Best regards, Ichiro Hasuo --- RIMS-CS website http://www.kurims.kyoto-u.ac.jp/~cs/ ===== Speaker: Kohei Suenaga (Universidade de Lisboa, Portugal) Title: Fractional Ownerships for Safe Memory Deallocation Date: 11.00 - 12.00, Thu 2 Dec 2010 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: We propose a type system for a programming language with memory allocation/deallocation primitives, which prevents memory-related errors such as double-frees and memory leaks. The main idea is to augment pointer types with fractional ownerships, which express both capabilities and obligations to access or deallocate memory cells. By assigning an ownership to each pointer type constructor (rather than to a variable), our type system can properly reason about list/tree- manipulating programs. Furthermore, thanks to the use of fractions as ownerships, the type system admits a polynomial-time type inference algorithm, which serves as an algorithm for automatic verification of lack of memory-related errors. A prototype verifier has been implemented and tested for C programs. This is joint work with Naoki Kobayashi.

1 0

大阪府立大学情報数理談話会（12月10日金曜日/立木秀樹先生）
by Masaru Kada 22 Nov '10

22 Nov '10

logic-ml のみなさま：大阪府立大学嘉田です．下記の通り，大阪府立大学理学部情報数理科学科にて，立木秀樹先生（京都大学）を講師にお招きして談話会を実施いたしますので，ご案内申し上げます．学外からのご参加も歓迎です．お近くの方はどうぞお越しください． ======== 第35回大阪府立大学情報数理談話会講演題目：ボトム入り文字列を用いた、位相空間上の計算講師：立木秀樹（京都大学大学院人間・環境学研究科）日時：2010年12月10日（金） 17：00〜18：00 （16:45 から会場で茶菓を用意しています）場所：大阪府立大学中百舌鳥キャンパス A13棟323教室講演概要：実数空間などの1以上の位相次元をもつ可分距離空間は、０１の無限列空間（カントール空間）に埋め込むことはできません。しかし、０，１に加えて ⊥を含んだ無限列空間を考えたら、そこに埋め込むことができます。この埋め込みと、０１⊥無限列を入出力するマシンの概念（あるいは、そのような入出力が可能なプログラミング言語）を用いて、実数空間などの上の計算概念を導入しましょう。 ======== 情報数理談話会ウェブページ http://www.mi.s.osakafu-u.ac.jp/lec-meeting/ 交通案内・キャンパスマップ http://www.osakafu-u.ac.jp/access/index.html お問い合わせ：嘉田勝（大阪府立大学理学部情報数理科学科） kada(a)mi.s.osakafu-u.ac.jp -- -------- Masaru KADA （嘉田勝） kada(a)mi.s.osakafu-u.ac.jp --------

1 0

Fwd: Leo Esakia
by Hiroakira Ono 22 Nov '10

22 Nov '10

> Dear friends, > > Please feel free to forward the letter to any appropriate mailing > lists. > > Thank, Guram > > --------------------------- > > Dear Colleagues, > > It is with great sadness that we announce the passing of Leo Esakia > on November 17, 2010. This is a big loss for all of Leo's friends, > colleagues, and students, but also for the logic community as a whole. > > Leo was the founder and the anchor of the logic school in Georgia. > He was a constant source of wisdom, inspiration, and encouragement > to all of his colleagues and students. Leo made numerous important > contributions to the study of algebraic and topological semantics of > intuitionistic and modal logics. Several landmark theorems in the > field bear his name. He also contributed immensely to establishing a > strong research community working on algebraic, topological, and > categorical methods in logic. > > Leo Esakia was not only a brilliant mathematician, but also an > extraordinary human being. He will stay in our memory as a > wonderful, charming, refined, and attentive person who was always > there to give his support, encouragement, and guidance. He will be > sorely missed. We believe his scientific legacy will be long > remembered, and his ideas will carry forward. > > Our thoughts are with Leo's family at these difficult times. > > Guram Bezhanishvili > Nick Bezhanishvili > David Gabelaia > Mamuka Jibladze > Dimitri Pataraia >

1 0

Talk by Kazushige Terui, next Thursday
by Ichiro Hasuo 20 Nov '10

20 Nov '10

Dear colleagues, Next Thursday our colleague Kazushige Terui is speaking on his recent work about implicit complexity. You're all welcome; no registration necessary. See you there! Best regards, Ichiro Hasuo --- RIMS-CS website http://www.kurims.kyoto-u.ac.jp/~cs/ ===== Speaker: Kazushige Terui (RIMS, Kyoto U.) Title: Church => Scott = Ptime: an application of resource sensitive realizability Date: 11.00 - 12.00, Thu 25 Nov 2010 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: We introduce a variant of linear logic with second order quantifiers and type fixpoints, both restricted to purely linear formulas. The Church encodings of binary words are typed by a standard non-linear type `Church,' while the Scott encodings (purely linear representations of words) are by a linear type `Scott.' We then give a characterization of polynomial time functions, which is derived from (Leivant and Marion 93): a function is computable in polynomial time if and only if it can be represented by a term of type Church => Scott. To prove soundness, we employ a resource sensitive realizability technique developed by Hofmann and Dal Lago. This is a joint work with Alois Brunel.

1 0

Kobe Colloquium on Logic, Statistics and Informatics のお知らせ
by SAKAI Hiroshi 18 Nov '10

18 Nov '10

皆様：神戸大学の酒井拓史と申します．以下の要領で Kobe Colloquium on Logic, Statistics and Informatics を開催します．直前のアナウンスで申し訳ありませんが，ご興味のある方は是非ご参加下さい：講演者：藤田博司氏 (愛媛大学) タイトル：不連続関数の微分可能点について日時：１１月１８日(木) 13:30 〜 15:00 場所：神戸大学自然科学総合研究棟３号館４階４２１号室 (渕野グループプレゼンテーション室) http://www.kobe-u.ac.jp/info/access/rokko/rokkodai-dai2.htm よろしくお願いいたします． -------------------------------- 酒井拓史神戸大学大学院システム情報学研究科 Tel： 078-803-6242 e-mail： hsakai(a)people.kobe-u.ac.jp --------------------------------

1 0

数学基礎論若手の会2010 プログラム
by leibniz 15 Nov '10

15 Nov '10

logic-mlの皆様， 2010年度数学基礎論若手の会の幹事をしております愛知学院大学の山下と申します．大変遅れて申し訳ありませんが、本年度の若手の会（11月19日−21日）の講演プログラムができましたので、ご案内申し上げます．詳細は数学基礎論若手の会2010ホームページ http://www.aichi-gakuin.ac.jp/~yamasita/wakate-no-kai2010.html をご覧ください。なお，宿泊を伴う参加者は締め切りましたが，宿泊を伴わない参加者はまだ受け付けますので，ご検討いただければ幸いです． ----------- 11/19 （第３研修室） 13:30-14:00 朝比奈佑樹 (名古屋大学) Kripke models とScott-Montague semanticsについて 14:00-14:40 井澤昇平 (東北大学理学研究科数学専攻) 高階算術における抽象論 14:40-15:10 岩波克 (東京工業大学数理計算科学専攻) 未定 15:40-16:10 嘉田勝 (大阪府立大学大学院理学系研究科) 未定 16:10-16:40 上條良介 (早稲田大学　基幹理工学部) homeomorphisms on generalized planes 16:40-17:40 木原貴行 (東北大学大学院理学研究科) 未定 11/20 （第１研修室） 09:20-10:20 倉橋太志 (神戸大学) First-order provability logic 10:30-11:10 小島健介 (京都大学情報学研究科) 未定 11:10-11:50 竹内耕太 (筑波大学数理物質科学研究科) 未定 13:30-14:10 田中　勇一 (神戸大学大学院) モデル論における独立性について 14:10-14:40 中村　順 (早稲田大学　基幹理工学研究科) Uncountable Specker phenomenon and n-slender groups 14:50-15:30 石田和 (京都大学数理解析研究所) 未定 15:30-16:10 樋口幸治郎 (東北大学大学院理学研究科) 未定 16:20-17:20 藤原誠 (東北大学理学研究科) Satisfiability problem and resolution principle 11/21 （第１研修室） 09:30-10:30 渕野昌 (神戸大学大学院システム情報学研究科) Mystery train 10:40-11:40 松尾亮太 (名古屋大学情報科学研究科) ロジックのゲーム理論への応用 =========================================== 愛知学院大学教養部山下秀康 email: yamasita(a)dpc.aichi-gakuin.ac.jp leibniz7(a)gmail.com

1 0

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Logic-ml November 2010