Kisoron-ml May 2017

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

5 participants
5 discussions

秋季総合分科会 / Asian Logic Conference / 数学会各賞について
by Makoto Kikuchi 01 Jun '17

01 Jun '17

数学基礎論および歴史分科会の皆様連絡責任評議員を仰せつかっている神戸大の菊池です．１）今年度の秋季総合分科会は9月11日（月）から14日（木）まで，山形大学で開催されます．講演申込締切は6月16日（金）です．最近の日本数学会の年会および秋季総合分科会における数学基礎論および歴史分科会の一般講演数は，以前と比較すると，かなり増えていますが，研究集会等での活動実績を考えると，もっと多くても良いように思われます．是非，今回も積極的な講演申込をお願いします．なお，今回の秋季総合分科会から，数学基礎論および歴史分科会では，アブストラクトの事後公開を開始することになりました．今回から事後公開をする分科会は5つです．春の分科会総会で議論になったアブストラクトの事後訂正は，一切認められないことになりました．詳細は追って日本数学会の HP で連絡されます．２）今年度の Asian Logic Conference は7月10日（月）から14日（金）まで，韓国のテジョンで開催されます．https://alc15korea.wixsite.com/alckorea 一般講演の申込数がかなり少なく，締切が5月31日（水）まで延長されています．一般講演者は参加費（会議中の昼食費とバンケット料金を含む）が免除になり，学生の旅費援助にも余裕があるとのことです．ご検討中の方があれば，ぜひ，お申し込みをお願いいたします．なお，次回2019年の Asian Logic Conference はカザフスタンで開催されます．３）日本数学会には研究者（グループ）を表彰する賞として，春季賞，秋季賞，建部賢弘賞があります．春季賞は弥永賞が前身で，40歳未満を対象とし毎年秋に募集があります．秋季賞は年齢制限がなく，研究者または研究グループを対象とし毎年春に募集があります．春季賞，秋季賞は評議員，受賞候補推薦委員等の推薦に基づいて選考されます．数学基礎論および歴史分科会において，春季賞および秋季賞にふさわしい研究者または研究グループがあれば，評議員までご連絡ください．なお，建部賢弘賞は30歳以下を対象とする奨励賞（5名程度）と， 35歳以下を対象とする特別賞（3名程度）があり，自薦，他薦による推薦に基づいて選考されます．推薦に評議員の了解は必要ありませんが，もしも推薦される場合は，評議員までご一報いただければ幸いです．菊池誠

1 1

名古屋ロジックセミナー (UC Berkeley校Antonio Montalban氏の講演 6/12)
by Takayuki Kihara 26 May '17

26 May '17

皆様，名古屋大学の木原貴行です．この度，UC BerkeleyのAntonio Montalban氏の日本訪問の折に，下記の要領で名古屋ロジックセミナーを開催することとなりました．多数のご参加をお待ちしております．名古屋ロジックセミナー http://www.math.mi.i.nagoya-u.ac.jp/~kihara/logic-seminar.html 日時：6月12日 (月) 15:00〜場所：名古屋大学大学院情報学研究科棟 322号室講演者：Antonio Montalbán (カリフォルニア大学バークレー校) 題目：A classification of the natural many-one degrees アブストラクト： A common phenomenon in mathematics is that naturally-occurring objects behave better than general objects. This is definitely the case of the many-one degrees within Computability Theory. Our theorem, in a sense, completely classifies the natural many-one degrees and sets them apart from the non-natural ones. The theorem is a version of the uniform Martin's conjecture, but for the case of the many-one degrees. 講演終了後に夕食会を予定しています．夕食会にご参加いただける方は木原貴行 kihara(a)i.nagoya-u.ac.jp <mailto:kihara@i.nagoya-u.ac.jp> までご一報お願い致します． -------- Takayuki Kihara Graduate School of Informatics, Nagoya University, Japan URL: http://math.mi.i.nagoya-u.ac.jp/~kihara/ Email: kihara(a)i.nagoya-u.ac.jp

1 0

LFCS 2018 Call for Papers
by Hajime Ishihara 23 May '17

23 May '17

FIRST CALL FOR PAPERS Symposium on LOGICAL FOUNDATIONS OF COMPUTER SCIENCE (LFCS '18), Deerfield Beach, Florida, January 8-11, 2018. LFCS GENERAL CHAIR: Anil Nerode. LFCS STEERING COMMITTEE: Anil Nerode, (Ithaca); Stephen Cook (Toronto); Dirk van Dalen (Utrecht); Yuri Matiyasevich (St. Petersburg); Samuel Buss (San Diego); Gerald Sacks (Cambridge, MA); Dana Scott, (Pittsburgh, PA - Berkeley, CA). LFCS ’18 PROGRAM COMMITTEE: Sergei Artemov (New York, NY) - PC Chair; Eugene Asarin (Paris); Steve Awodey (Pittsburgh, PA); Matthias Baaz (Vienna); Lev Beklemishev (Moscow); Andreas Blass (Ann Arbor, MI); Samuel Buss (San Diego, CA); Robert Constable (Ithaca, NY); Thierry Coquand (Göteborg); Michael Fellows (Bergen), Melvin Fitting (New York); Sergey Goncharov (Novosibirsk); Denis Hirschfeldt (Chicago, IL); Martin Hyland (Cambridge); Rosalie Iemhoff (Utrecht); Hajime Ishihara (JAIST - Kanazawa); Bakhadyr Khoussainov (Auckland); Roman Kuznets (Vienna); Daniel Leivant (Bloomington, IN); Robert Lubarsky (Boca Raton, FL); Victor Marek (Lexington, KY); Lawrence Moss (Bloomington, IN); Anil Nerode (Ithaca, NY) - General LFCS Chair; Hiroakira Ono (JAIST - Kanazawa); Alessandra Palmigiano (Delft); Ramaswamy Ramanujam (Chennai); Michael Rathjen (Leeds); Jeffrey Remmel (San Diego); Andre Scedrov (UPenn); Helmut Schwichtenberg (Munich); Philip Scott (Ottawa); Alex Simpson (Ljubljana); Sonja Smets (Amsterdam); Sebastiaan Terwijn(Nijmegen). LFCS ’18 LOCAL ORGANIZING COMMITTEE CHAIR: Robert Lubarsky. LFCS TOPICS of interest include, but are not limited to: constructive mathematics and type theory; homotopy type theory; logic, automata, and automatic structures; computability and randomness; logical foundations of programming; logical aspects of computational complexity; parameterized complexity; logic programming and constraints; automated deduction and interactive theorem proving; logical methods in protocol and program verification; logical methods in program specification and extraction; domain theory logics; logical foundations of database theory; equational logic and term rewriting; lambda and combinatory calculi; categorical logic and topological semantics; linear logic; epistemic and temporal logics; intelligent and multiple agent system logics; logics of proof and justification; nonmonotonic reasoning; logic in game theory and social software; logic of hybrid systems; distributed system logics; mathematical fuzzy logic; system design logics; other logics in computer science. SUBMISSION DETAILS. Proceedings will be published in the Springer LNCS series. There will be a post-conference volume of selected works published. Submissions should be made electronically via http://www.easychair.org/LFCS18/. Submitted papers must be in pdf/12pt format and of no more than 15 pages, present work not previously published, and must not be submitted concurrently to another conference with refereed proceedings. LFCS issues the BEST STUDENT PAPER AWARD named after John Barkley Rosser Sr. (1907-1989), a prominent American logician with fundamental contributions in both Mathematics and Computer Science. IMPORTANT DATES. Submissions deadline: September 10, 2017, any time zone. Notification: October 10, 2017. LOCAL ARRANGEMENTS. The venue of LFCS ’18 will be the spectacular Wyndham Deerfield Beach Resort, 2096 NE 2nd Street, Deerfield Beach, Florida 33441. Website: http://www.wyndhamdeerfieldresort.com Further Information about LFCS symposia: http://lfcs.ws.gc.cuny.edu/ About LFCS. The LFCS series provides an outlet for the fast-growing body of work in the logical foundations of computer science, e.g., areas of fundamental theoretical logic related to computer science. The LFCS series began with Logic at Botik, Pereslavl-Zalessky, 1989 and was co-organized by Albert R. Meyer (MIT) and Michael Taitslin (Tver), after which organization passed to Anil Nerode in 1992. LFCS has enjoyed support and endorsements from a number of bodies, including the US National Science Foundation (NSF) and the City University of New York Research Foundation.

1 0

2017年度数学基礎論サマースクール案内第１報
by Toshio Suzuki 19 May '17

19 May '17

皆様首都大学東京の鈴木登志雄です。 2017年度数学基礎論サマースクールの案内第１報です。今年度のテーマは「計算理論」です。日時：８月５日（土）から７日（月）初日午後、２日目以降午前・午後（時間割は後日、ウェブに掲載）会場：明治大学駿河台キャンパス　リバティタワー1073 http://www.meiji.ac.jp/koho/campus_guide/suruga/access.html 世話人：鈴木登志雄（首都大学東京），隈部正博（放送大学），河村彰星（東京大学），宮部賢志（明治大学）参加費：無料講師・テーマ：河村彰星「はじめての計算可能性」，宮部賢志「チューリング次数」，隈部正博「ジェネリック次数」，鈴木登志雄「ＨＦデルタ１関係」ウェブサイト： toshio-suzuki-logic.jp/meeting/summer2017.html 近い日程の集会：サマースクールの翌日から，SLACS 2017（記号論理と情報科学）が開催されます（千葉工業大学）。 -- 鈴木登志雄首都大学東京理工学研究科　数理情報科学専攻 toshio-suzuki(a)tmu.ac.jp

1 0

JAIST Logic Seminar Series
by Takako Nemoto 15 May '17

15 May '17

皆様インスブリア大学（イタリア）の Marco Benini 先生の講演のお知らせです。どうぞふるってご参加ください。問い合わせ先：根元　多佳子北陸先端科学技術大学院大学　情報科学系 email: t-nemoto(a)jaist.ac.jp --------------------------------------------- *JAIST Logic Seminar Series* Date: Tuesday, 6 June, 2017, 15:30-17:00 Place: JAIST, Collaboration room 7 (I-56) (Access: http://www.jaist.ac.jp/english/location/access.html) Speaker: Marco Benini (Università degli Studi dell'Insubria) Title: The Graph Minor Theorem: a walk on the wild side of graphs Abstract: The Graph Minor Theorem says that the collection of finite graphs ordered by the minor relation is a well quasi order. This apparently innocent statement hides a monstrous proof: the original result by Robertson and Seymour is about 500 pages and twenty articles, in which a new and deep branch of Graph Theory has been developed. The theorem is famous and full of consequences both on the theoretical side of Mathematics and in applications, e.g., to Computer Science. But there is no concise proof available, although many attempts have been made. In this talk, arising from one such failed attempts, an analysis of the Graph Minor Theorem is presented. Why is it so hard? Assuming to use the by-now standard Nash-Williams's approach to prove it, we will illustrate a number of methods which allow to solve or circumvent some of the difficulties. Finally, we will show that the core of this line of thought lies in a coherence question which is common to many parts of Mathematics: elsewhere it has been solved, although we were unable to adapt those solutions to the present framework. So, there is hope for a short proof of the Graph Minor Theorem but it will not be elementary.

1 0

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Kisoron-ml May 2017