- Logic-ml - fos.kuis.kyoto-u.ac.jp

“WITTGENSTEIN ON TURING’S DIAGONAL, RULES, AND CONTRADICTION” Mathieu Marion教授講演会(6月26日
by Mitsu Okada 20 Jun '18

20 Jun '18

数学と論理の哲学セミナー Mathieu Marion教授講演会(6月26日) “WITTGENSTEIN ON TURING’S DIAGONAL, RULES, AND CONTRADICTION” の開催を予定しております。参加自由、事前登録なしです。お気軽にお立ち寄りください。慶應義塾大学文学部哲学専攻岡田光弘 ****************************** ***************************************************** 数学と論理の哲学セミナー Mathieu Marion教授講演会(6月26日) “WITTGENSTEIN ON TURING’S DIAGONAL, RULES, AND CONTRADICTION” 6月26日 (火) 18:10-19:30 June 26, Tues. 慶應義塾大学三田キャンパス大学院校舎1階313番教室 Mita Campus, Keio University, Classroom 313, 1F of Graduate School Building （講演会のAbstractは下のweb-siteにあります。。）（Abstractを含む最新情報: https://abelard.flet.keio.ac.jp/seminar/mathieu-marion-2018/ <https://abelard.flet.keio.ac.jp/seminar/mathieu-marion-2018/> ） *********************************************************************************** 場所 / Venue: 慶應義塾大学三田キャンパス大学院校舎1階313番教室（大学院校舎は下記キャンパスマップの8です） Mita Campus, Keio University, Classroom 313, 1F of Graduate School Building (Number 8 of the Campus Map below) 構内図 Campus Map: https://www.keio.ac.jp/en/maps/mita.html <https://www.keio.ac.jp/en/maps/mita.html> 日時 / Date & Time: 6月26日 (火) 18:10-19:30 June 26, Tues. 講演者 / Speaker: Mathieu Marion教授（ケベック大学モントリオール校哲学科教授） Prof. Mathieu Marion (Département　de Philosophie**, Université du Québec à Montréal) 題目 / Title: “WITTGENSTEIN ON TURING’S DIAGONAL, RULES, AND CONTRADICTION” (Joint work with Mitsuhiro Okada, Keio University) （Abstract: https://abelard.flet.keio.ac.jp/seminar/mathieu-marion-2018/ <https://abelard.flet.keio.ac.jp/seminar/mathieu-marion-2018/> ）お問い合わせ先: 慶應義塾大学文学部岡田光弘研究室東京都港区三田２−１５−４５ Email: logic(a)abelard.flet.keio.ac.jp <mailto:logic@abelard.flet.keio.ac.jp> 主催: 慶應義塾大学論理と感性のグローバル研究センター ----------------------------------------------------------

1 0

Talk by Prof. Georgios Fainekos (June 21st, 13:00-)
by Kohei SUENAGA 19 Jun '18

19 Jun '18

皆様，ロボットのパスプランニングの研究に関する講演会を 6月21日の13:00より，京都大学吉田キャンパス総合研究7号館1F講義室3で開催します．話者のGeorgios Fainekosさんは，時相論理式で記述されたシステムの仕様をチェックするツールS-TaLiRoで有名な方です．どうぞご参加ください． Prof. Georgios Fainekos is giving a talk about path planning in robotics on June 21st from 13:00-- at the lecture room 3 in Research Building 7 (Sogo-Kenkyu 7 gou kan) in Yoshida campus of Kyoto University. Georgios is famous for the work on a tool S-TaLiRo, a checker of a system specification written in an extension of temporal logic called metric temporal logic. Looking forward to your participation! Kohei -- Title: Temporal Logic Planning for Mobile Robots: What happens when missions cannot be satisfied? Abstract: Temporal logic planning methods have provided a viable path towards solving the single- and multi-robot path planning, control and coordination problems from high level formal requirements. In the existing frameworks, the prevalent assumptions are (1) that a plan always exists which satisfies the mission requirements, and (2) that there is a single stakeholder with full or partial knowledge of the environment that the robots operate in. In addition, it is typically assumed that the requirements themselves are fixed and do not change over time. However, any of these assumptions may not be valid in both off-line and on-line temporal logic planning problems. That is, multiple stakeholders and inaccurate sources of information may produce unsatisfiable missions or self-contradictory models of the world or the system. Classical temporal logic planning methods cannot handle non-consistent model environments or missions even though such inconsistencies may not affect the planning problem. In this talk, we present how the user feedback problem for unsatisfiable missions can be reduced to searching for an optimal weighted path on a graph. Albeit the general search problem is NP-complete, the graph formulation of the problem opens-up the possibility for the development of efficient approximation algorithms. We present a number of heuristics for quickly computing such user feedback and we present experimental results on the performance and scalability of our solutions. Finally, we show how inconsistencies and conflicts in the mission requirements and the model of the world can be circumvented by utilizing multi-valued temporal logics and system models. Bio: Georgios Fainekos is an Associate Professor at the School of Computing, Informatics and Decision Systems Engineering (SCIDSE) at Arizona State University (ASU). He is director of the Cyber-Physical Systems (CPS) Lab and he is currently affiliated with the NSF I/UCR Center for Embedded Systems (CES) at ASU. He received his Ph.D. in Computer and Information Science from the University of Pennsylvania in 2008 where he was affiliated with the GRASP laboratory. He holds a Diploma degree (B.Sc. & M.Sc.) in Mechanical Engineering from the National Technical University of Athens (NTUA). Before joining ASU, he held a Postdoctoral Researcher position at NEC Laboratories America in the System Analysis & Verification Group. His expertise is on logic, formal verification, testing, control theory, artificial intelligence, and optimization. His research has applications to automotive systems, medical devices, autonomous (ground and aerial) vehicles, and human-robot interaction (HRI). In 2013, Dr. Fainekos received the NSF CAREER award and the ASU SCIDSE Best Researcher Junior Faculty Award. He is also recipient of the 2008 Frank Anger Memorial ACM SIGBED/SIGSOFT Student Award. His software toolbox, S-TaLiRo, for testing and monitoring of CPS has been nominated twice as a technological breakthrough by the industry. In 2016, Dr. Fainekos was the program co-Chair for the ACM International Conference on Hybrid Systems: Computation and Control (HSCC). -- Kohei Suenaga (末永幸平), Ph.D Associate professor (准教授) Graduate School of Informatics, Kyoto University (京都大学情報学研究科) ksuenaga(a)gmail.com http://www.fos.kuis.kyoto-u.ac.jp/~ksuenaga/

1 1

The 21st Japan–Korea Joint Workshop on Algorithms and Computation (WAAC 2018) 福岡8月26～27日
by Akitoshi Kawamura 14 Jun '18

14 Jun '18

皆様九大の河村と申します。メーリングリストをお借りして、本年8月26～27日に福岡で開催される標記研究集会についてお知らせ致します。詳しくはウェブページをご覧ください。 http://www.i.kyushu-u.ac.jp/waac2018/ ウェブページにありますように、投稿は英文8ページ以内（より短くても可）で、投稿締切　7月6日採否通知　7月27日完成稿締切　8月10日となっております。ぜひ発表・参加を御検討ください。 -- 河村彰星九州大学システム情報科学研究院情報学部門〒819-0395　福岡市西区元岡744 092-802-3806 kawamura(a)inf.kyushu-u.ac.jp

1 1

Preliminary announcement of CTFM2018
by Kenshi Miyabe 01 Jun '18

01 Jun '18

Dear all, Let me announce CTFM 2018. Workshop on Computability Theory and Foundations of Mathematics 2018 Date: 13--15 September, 2018 The venue: Surugadai Campus, Meiji University, Tokyo, Invited Speakers George Barmpalias (Chinese Academy of Sciences) Matthew de Brecht (Kyoto University) Bjorn Kjos-Hanssen (University of Hawaii at Manoa) Tomoyuki Miyaji (Meiji University) Igor Potapov (University of Liverpool) Liang Yu (Nanjing University) Organising Committee Akitoshi Kawamura (Kyushu University) Kenshi Miyabe (Meiji University) Computability Theory and Foundations of Mathematics (CTFM) aims to develop computability theory and logical foundations of Mathematics. The scope involves the topics Computability Theory, Reverse Mathematics, Nonstandard Analysis, Proof Theory, Set Theory, Philosophy of Mathematics, Constructive Mathematics, Theory of Randomness and Computational Complexity Theory. We will call for the contributed talks later. For other information, see the following website: http://www.isc.meiji.ac.jp/~random/ctfm2018/ best, Kenshi Miyabe -- Kenshi Miyabe email (research) : research(a)kenshi.miyabe.name email (other) : miyabe(a)meiji.ac.jp Associate Professor Department of Mathematics School of Science and Technology Meiji University Tel: +81-44-934-7460

1 0

Call for Papers: JURISIN-2018
by 藤田恵 01 Jun '18

01 Jun '18

国立情報学研究所の藤田恵と申します。新田克己先生(東工大名誉教授)の代理で投稿いたします。 Call for Paper 12th International Workshop on Juris-informatics (JURISIN 2018) associated with JSAI International Symposia on AI 2018 (isAI 2018) Raiosha, Hiyoshi Campus in Keio University 12 and 13 November 2018 - Yokohama, Japan Juris-informatics is a new research area which studies legal issues from the perspective of informatics. The purpose of this workshop is to discuss both the fundamental and practical issues among people from the various backgrounds such as law, social science, information and intelligent technology, logic and philosophy, including the conventional "AI and law" area. We solicit unpublished papers on theories, technologies and applications on juris-informatics. Relevant topics include, but are not limited to, the following: •Model of legal reasoning •Argumentation / Negotiation / Argumentation agent •Legal term ontology •Formal legal knowledge-base / Intelligent management of legal knowledge-base •Translation of legal documents •Information retrieval of legal texts •Computer-aided law education •Use of Informatics and AI in law •Legal issues on applications of robotics and AI to society •Social implications of use of informatics and AI in law •Natural language processing for legal knowledge •Verification and validation of legal knowledge systems •Normative Systems/Deontic Logic •Any theories and technologies which is not directly related with juris-informatics but has a potential to contribute to this domain We welcome and encourage the submission of high quality, original papers, which are not simultaneously submitted for publication elsewhere except as a submission to JURIX 2018 (The 31th International Conference on Legal Knowledge and Information Systems). The double submission policy with JURIX 2018 is as follows: 1.Papers being submitted both to JURISIN2018 and JURIX2018 must note this on the title page. 2.A paper to be presented at JURISIN2018 must be withdrawn from JURIX2018 and vice versa according to the choice by the authors. 3.If the authors do not follow this double submission policy, the paper by the authors will not be included in the proceedings of JURISIN 2018. Selected papers will be published as a post-proceedings via Springer Verlag LNAI series after the second round of review after the workshop. Invited Speakers Douglas Walton, University of Windsor, Canada Harumichi Yuasa, Institute of Information Security, Japan Important Dates Submission Deadline: August 30, 2018(tentative)( AOE ) Notification: September 30, 2018(tentative) Camera-ready due: October 10, 2018(tentative) ( AOE ) Steering Committee members Takehiko Kasahara, Toin Yokohama University Makoto Nakamura, Niigata Institute of Technology, Japan Katsumi Nitta, Tokyo Institute of Technology, Japan Seiichiro Sakurai, Meiji Gakuin University, Japan Ken Satoh, National Institute of Informatics and Sokendai, Japan Satoshi Tojo, Japan Advanced Institute of Science and Technology(JAIST), Japan Katsuhiko Toyama, Nagoya University, Japan Advisory Committee Members Kevin Ashley, University of Pittsburgh, USA Trevor Bench-Capon, The University of Liverpool, UK Tomas Gordon, Fraunfoher FOKUS, Germany Robert Kowalski, Imperial College London, UK Henry Prakken, University of Utrecht & Groningen, The Netherlands John Zeleznikow, Victoria University, Australia Program Committee Members Thomas Agotnes, University of Bergen, Norway Natasha Alechina, University of Nottingham, UK Ryuta Arisaka, National Institute of Informatics, Japan Kristijonas Cyras, Imperial College London, UK Mehdi Dastani, Utrecht University, The Netherlands Marina De Vos, University of Bath, UK Juergen Dix, Clausthal University of Technology, Germany Phan Minh Dung, AIT, Thailand Randy Goebel, University of Alberta, Canada Guido Governatori, CSIRO, Australia Tatsuhiko Inatani, Kyoto University, Japan Tokuyasu Kakuta, Chuo University, Japan Yoshinobu Kano, Shizuoka University, Japan Tetsuro Kawamoto, AIST, Japan Mi-Young Kim, University of Alberta, Canada Nguyen Le Minh, JAIST, Japan Beishui Liao, Zhejiang University, Chaina Brian Logan, The University of Nottingham, UK Hatsuru Morita, Tohoku University, Japan Yoichi Motomura, AIST, Japan Makoto Nakamura, Niigata Institute of Technology, Japan Yoshiaki Nishigai, Nihon University, Japan Konatsu Nishigai, Tokyo Metropolitan University, Japan Katsumi Nitta, Titech, Japan Paulo Novais, University of Minho, Portugal Julian Padget, University of Bath, UK Monica Palmirani, University of Bologna, Italy Seiichiro Sakurai, Meiji Gakuin University, Japan Katsuhiko Sano, Hokkaido University, Japan Ken Satoh, National Institute of Informatics and Sokendai, Japan Akira Shimazu, JAIST, Japan Fumio Shimpo, Keio University, Japan Kazuko Takahashi, Kansei Gakuin University, Japan Satoshi Tojo, JAIST, Japan Katsuhiko Toyama, Nagoya University, Japan Rob van den Hoven van Genderen, VU University Amsterdam, The Netherlands Leon van der Torre, University of Luxembourg, Luxembourg Bart Verheij, University of Groningen, The Netherlands Masaharu Yoshioka, Hokkaido University, Japan Harumichi Yuasa, Institute of Information Security, Japan Yueh-Hsuan Weng, Tohoku University, Japan COLIEE 2018 This year, JURISIN will co-located with the Fifth Competition on Legal Information Extraction/Entailment (COLIEE-2018). The motivation for the competition is to help create a research community of practice for the capture and use of legal information. Please visit the homepage of COLIEE2018 https://sites.ualberta.ca/~miyoung2/COLIEE2018/ <https://sites.ualberta.ca/~miyoung2/COLIEE2018/> to see the detail of the competition. For further information, please contact Katsumi Nitta, Workshop Chair, Tokyo Institute of Technology nitta 'at' dis.titech.ac.jp <http://dis.titech.ac.jp/>

1 0

AWPL 2018 (deadline extended)
by 小野寛晰 29 May '18

29 May '18

********AWPL CALL FOR PAPERS: Deadline Extended to June 10, 2018********** The 4th Asian Workshop on Philosophical Logic (AWPL), 20-21 October, 2018, Beijing Asian Workshop on Philosophical Logic (AWPL) is an event-series initiated by a group of Asian logicians, and in 2012 the first installment took place at the JAIST in Japan. It is devoted to promote awareness, understanding, and collaborations among researchers in philosophical logic and related fields. The workshop emphasizes the interplay of philosophical ideas and formal theories. Topics of interest include non-classical logics, philosophical logics, algebraic logics, and their applications in computer science, cognitive science, and social sciences. The second and third workshop took place successfully in Guangzhou (2014) and Taipei (2016), respectively. And the two post conference proceedings were published in the Studia Logica book series “Logic in Asia” (http://www.springer.com/series/13080?detailsPage=titles <http://www.springer.com/series/13080?detailsPage=titles>) with Springer. The Fourth Asian Workshop on Philosophical Logic (AWPL 2018) will be held in Beijing, China, on 20-21 October 2018, organized by the Tsinghua-UvA Joint Research Centre for Logic at Tsinghua University. INVITED SPEAKERS – Bo An (Nanyang Technological University, Singapore) – Sergei Artemov (City University of New York, United States) – Kamal Lodaya (The Institute of Mathematical Sciences, India) – Tomoyuki Yamada (Hokkaido University, Japan) INVITED TUTORIAL – Melvin Fitting (City University of New York, United States) SUBMISSION All submissions should present original works not previously published. Submissions should be typeset in English with single-space and 12pt-size, be prepared as a .pdf file with at most 12 (A4-size) pages (including reference list, appendixes, acknowledgements, etc.), and be sent to the workshop electronically via EasyChair (https://easychair.org/conferences/?conf=awpl2018 <https://easychair.org/conferences/?conf=awpl2018>) by the corresponding author on time. It is assumed that, once a submission is accepted, at least one of its authors will attend the workshop and present the accepted work. After the workshop, selected submissions will be invited to revise and submit to a post conference proceedings, to be published in the “Logic in Asia” series. IMPORTANT DATES – Submission deadline: 10 June 2018, 24:00 (UTC -12:00) – Notification: 10 July 2018 – Workshop: 20-21 October 2018 PROGRAM COMMITTEE – Nick Bezhanishvili, University of Amsterdam – Sujata Ghosh, Indian Statistical Institute – Jiahong Guo, Beijing Normal University – Meiyun Guo, South-West University, China – Fengkui Ju, Beijing Normal University – Kok-Yong Lee, National Chung Cheng University – Beishui Liao, Zhejiang University – Hanti Lin, University of California Davis – Fenrong Liu, Tsinghua University, chair – Hu Liu, Sun Yat-Sen University, China – Xinwen Liu, Chinese Academy of Social Sciences – Minghui Ma, Sun Yat-Sen University, China – Hiroakira Ono, JAIST, chair – Eric Pacuit, University of Maryland – Olivier Roy, University of Bayreuth – Katsuhiko Sano, Hokkaido University – Yi N. Wang, Zhejiang University – Chin-Mu Yang, Taiwan National University – Jiji Zhang, Lingnan University, Hong Kong ORGANIZATION COMMITTEE – Yu Chen, Tsinghua University – Haibin Gui, Tsinghua University – Dazhu Li, Tsinghua University – Junhua Yu, Tsinghua University, chair The AWPL is co-located with the workshop “Tsinghua meets CUNY” that will take place on 19 October 2018, all AWPL participants are invited to join that event too.

1 0

Re: [logic-ml] Project colloquium by Tomoo Yokoyama on 30 May
by Kohei SUENAGA 29 May '18

29 May '18

I'd like to attend the talk, but our polycom room is occupied due to another student seminar. Could someone designate a Google hangout connection for me? Thanks! Best, Kohei 2018年5月28日(月) 8:22 David SPRUNGER <sprunger(a)nii.ac.jp>: > Dear all, > This week, Tomoo Yokoyama will be visiting the Tokyo ERATO MMSD site > from the Kyoto University of Education. He will give our project > colloquium at the usual time, Wednesday (30 May) from 16:30-18:00. The > title and abstract for the talk are given below. > You are all warmly invited to join. > Best regards, > David Sprunger > ERATO MMSD > ----------------------------------------------------------------------- > Wed 30 May 2018, 16:30–18:00 > ERATO MMSD Takebashi Site Common Room 3 > http://group-mmm.org/eratommsd/access.html > Tomoo Yokoyama (Kyoto University of Education), > Topological methods for analyzing two dimensional flows > We introduce new topological methods, called a word representation and > a tree representation, for analyzing 2D flows. Applying the > topological methods to a plate in a time-dependent uniform flow under > mild conditions, we can estimate when the lift-to-drag ratios of the > plate are maximal and can determine the intermediate topologies of the > uniform flow. > Our talk consists of three parts. In fact, first we quickly review > topology and dynamical systems. Second, we present applications of our > methods. Finally we introduce the theoretical background and discuss > the relative works and the relations between topological structures > and data structures (e.g. implementation of representation algorithms, > contour extraction of streamlines from image data, generating all word > representation by an automaton, generating all tree representation by > "regular tree grammar + cyclic order", improvement of industrial > machines, possibilities of analyzing ocean phenomena and medical > phenomena). -- Kohei Suenaga (末永幸平), Ph.D Associate professor (准教授) Graduate School of Informatics, Kyoto University (京都大学情報学研究科) ksuenaga(a)gmail.com http://www.fos.kuis.kyoto-u.ac.jp/~ksuenaga/

1 1

特任研究員の募集
by koba＠kb.is.s.u-tokyo.ac.jp 28 May '18

28 May '18

＃複数受け取られましたらご容赦ください．東京大学の小林と申します．当研究室では現在，高階モデル検査（高階再帰スキームのモデル検査）とそのプログラム検証などへの応用をテーマとした研究を精力的に進めており，プロジェクトに携わる特任研究員を探しております．身近にご興味のある方がいらっしゃいましたら，10月20日までに小林 (koba(a)is.s.u-tokyo.ac.jp) までメールでお知らせいただければ幸いです。その際、できれば略歴および論文リスト（フォーマット自由）もメールに添えるかまたは郵送でお送りください。（後日、さらに詳細な資料をお願いする可能性があります）．募集の条件は概ね以下のとおりです。 ================ 着任時期：2018年4月（数ヵ月の前後は応相談）任期：年度単位の更新で、業績により最長2020年3月まで延長可能給与：月額38～45万円　　（大学の規定および本人の実績による．細かい条件は応相談.）研究テーマ：高階モデル検査（高階再帰スキームのモデル検査）および、そのプログラム検証やデータ圧縮、知識発見などへの応用。高階モデル検査については，プロジェクトのページ　　　http://www-kb.is.s.u-tokyo.ac.jp/~koba/hmc/ および下の参考文献をご覧ください。　　本プロジェクトは科学研究費補助金基盤研究(S)：　　　課題名：高階モデル検査の深化と発展　　　研究代表者：小林直樹（東京大学）　　　研究分担者：五十嵐淳（京都大学）、篠原歩（東北大学）　　の支援をいただいており、その補助金で研究員を雇用する予定です。条件： - 着任時に博士号を取得していること - 理論計算機科学全般に明るいこと． - 以下の中の１つ以上のトピックに詳しくプログラミング能力が高いか、　　　２つ以上のトピックに詳しいことモデル検査（特にソフトウェアモデル検査）型システムプログラム意味論プログラム解析・検証・変換オートマトンと形式言語理論自動定理証明　　　　　計算量理論 (可逆)データ圧縮技術自然言語処理ゲノムデータ解析問い合わせ先：　　小林直樹　　東京大学大学院情報理工学系研究科コンピュータ科学専攻　　〒113-0033 東京都文京区本郷7-3-1 　　Phone: 03-5841-4124 　　Fax: 03-5841-4114 　　email: koba(a)is.s.u-tokyo.ac.jp 参考文献の抜粋 ------------- 高階モデル検査の概要： Naoki Kobayashi, "Model Checking Higher-Order Programs", Journal of the ACM, 60(3), 2013. Naoki Kobayashi, "Higher-Order Model Checking: From Theory to Practice", Invited paper in Proceedings of LICS 2011. (A very brief survery of the field) 高階モデル検査/高階言語の理論： Naoki Kobayashi, Etienne Lozes, Florian Bruse, "On the relationship between higher-order recursion schemes and higher-order fixpoint logic", POPL 2017, pp.246-259, 2017 Kazuyuki Asada, Naoki Kobayashi, "Pumping Lemma for Higher-order Languages", ICALP 2017, 97:1-97:14, 2017. Ryoma Sinya, Kazuyuki Asada, Naoki Kobayashi, Takeshi Tsukada, "Almost Every Simply Typed λ-Term Has a Long β-Reduction Sequence", FoSSaCS 2017, pp.53-68 プログラム検証への応用: Naoki Kobayashi, Ryosuke Sato, and Hiroshi Unno, "Predicate Abstraction and CEGAR for Higher-Order Model Checking", Proceedings of PLDI 2011, pp.222-233, 2011. Akihiro Murase, Tachio Terauchi, Naoki Kobayashi, Ryosuke Sato, Hiroshi Unno, "Temporal verification of higher-order functional programs", POPL 2016, pp.57-68 データ圧縮への応用: Naoki Kobayashi, Kazutaka Matsuda, Ayumi Shinohara, Kazuya Yaguchi, "Functional Programs as Compressed Data", Higher-Order and Symbolic Computation, 2(1), pp.39-84, 2012.

1 1

SAML 2018 / Takeuti Memorial Symposium 講演募集
by Teruyuki YORIOKA 21 May '18

21 May '18

皆様，静岡大学の依岡です。先日 logic-ml と kisoron-ml でお送りしました案内と同様のものです。竹内外史先生を追悼するシンポジウムを以下の要領で開催しますのでお知らせします。多くの方々の講演をお待ちしております。レセプションとバンケットを企画しておりますので、参加ご希望の方は申し込みをしてください。よろしくお願いします。 SAML 2018 / Takeuti Memorial Symposium Symposium on Advances in Mathematical Logic 2018 Dedicated to the Memory of Professor Gaisi Takeuti (1926-2017) http://www2.kobe-u.ac.jp/~mkikuchi/saml2018/ 日時：2018年9月18日（火）から20日（木）まで場所：神戸大学六甲台第2キャンパス内瀧川記念学術交流会館プログラム委員：新井敏康，岡田光弘，菊池誠，黒田覚，依岡輝幸言語：英語招待講演者：S. Buss, J.-Y. Girard, W. Sieg, M, Yasugi （他の招待講演者は後にお知らせします）一般講演：領域：数学基礎論のすべての領域（理論計算機科学および哲学を含む）講演時間：30分程度を予定（申込数に応じて変更します）講義録：原則として一般講演に基づく，査読付き論文からなる講義録をシンポジウム後に Springer Proceedings in Mathematics and Statistics から出版します。投稿締切：2019年3月31日，出版：2020年春の予定．詳細は一般講演者にお伝えします。懇親会：レセプション：2018年9月18日夜，会場：瀧川記念交流会館内，会費：4,000円程度バンケット（新井敏康教授還暦祝）：2018年9月19日夜，会場：未定，会費：12,000円程度参加ご希望の方は以下の情報を2018年7月31日までに件名を「SAML2018」として email で依岡輝幸 yorioka(a)shizuoka.ac.jp までお送りください。みなさまのご参加をお待ちしております。 ---ここから--- 氏名：所属：連絡先 (email)：一般講演の希望：有・無（希望有の場合）講演題目：アブストラクト（5行から10行程度）：懇親会：レセプション（参加・不参加），バンケット（参加・不参加） ---ここまで--- 連絡先：会場および懇親会について：菊池誠 mkikuchi(a)kobe-u.ac.jp 講演参加申込およびプログラムについて：依岡輝幸 yorioka(a)shizuoka.ac.jp

1 0

Announcement on SAML 2018 / Takeuti Memorial Symposium
by Teruyuki YORIOKA 17 May '18

17 May '18

Dear all, We are pleased to announce the international conference SAML 2018 / Takeuti Memorial Symposium Symposium on Advances in Mathematical Logic 2018 Dedicated to the Memory of Professor Gaisi Takeuti (1926-2017) http://www2.kobe-u.ac.jp/~mkikuchi/saml2018/ This will take place from September 18th to 20th, 2018, at the Takigawa Memorial Hall, Rokkodai Campus, Kobe University, in Japan. Program comittee: Toshiyasu Arai (Chiba) Makoto Kikuchi (Kobe) Satoru Kuroda (Gunma Prefectural Women’s University) Mitsuhiro Okada (Keio University) Teruyuki Yorioka (Shizuoka) Confirmed invited speakers: Samuel R. Buss (San Diego) Wilfried Sieg (CMU) Mariko Yasugi (Kyoto) (Other invited speakers will be announced later.) Scope: Mathematical logic and related areas including (but not restricted to) proof theory, set theory, computability theory, model theory, philosophical logic, theoretical computer science, philosophy of mathematics. Contributed talks: Each contributed talk is planned to be approx. 30 min (this may change according to the number of talks). Proceedings Volume: The proceedings volume of selected and revised papers based on the talks will be published after the symposium. Important Dates (tentative): Deadline of abstracts for contributed talks: July 31, 2018 Symposium: September 18-20, 2018 Deadline of full papers for the proceedings volume: March, 2019 Publication of the proceedings volume: December 2019 Parties: The reception will be held on September 18th evening at Takigawa Memorial Hall (conference venue). It will cost 4,000JPY (tentative). The banquet (Toshiyasu Arai 60th birthday celebration) will be held on September 19th evening. It will cost 12,000JPY (tentative). The place will be announced later. Registration: Send to Teruyuki Yorioka yorioka(a)shizuoka.ac.jp with subject "SAML2018", and please provide the following information. The deadline of the registration is July 31st, 2018. Name: Affiliation: E-mail: Contributed talk: (yes/no) if yes, please attach title and abstract (about 5 to 10 lines) Parties: Reception (yes/no), Banquet (yes/no) For any inquiry concerning the workshop, please contact for parties: Makoto Kikuchi mkikuchi(a)kobe-u.ac.jp for registration or program: Teruyuki Yorioka yorioka(a)shizuoka.ac.jp

1 0

Announcement on SAML 2018 / Takeuti Memorial Symposium
by Teruyuki YORIOKA 17 May '18

17 May '18

Dear all, We are pleased to announce the international conference SAML 2018 / Takeuti Memorial Symposium Symposium on Advances in Mathematical Logic 2018 Dedicated to the Memory of Professor Gaisi Takeuti (1926-2017) http://www2.kobe-u.ac.jp/~mkikuchi/saml2018/ This will take place from September 18th to 20th, 2018, at the Takigawa Memorial Hall, Rokkodai Campus, Kobe University, in Japan. Program comittee: Toshiyasu Arai (Chiba) Makoto Kikuchi (Kobe) Satoru Kuroda (Gunma Prefectural Women’s University) Mitsuhiro Okada (Keio University) Teruyuki Yorioka (Shizuoka) Confirmed invited speakers: Samuel R. Buss (San Diego) Wilfried Sieg (CMU) Mariko Yasugi (Kyoto) (Other invited speakers will be announced later.) Scope: Mathematical logic and related areas including (but not restricted to) proof theory, set theory, computability theory, model theory, philosophical logic, theoretical computer science, philosophy of mathematics. Contributed talks: Each contributed talk is planned to be approx. 30 min (this may change according to the number of talks). Proceedings Volume: The proceedings volume of selected and revised papers based on the talks will be published after the symposium. Important Dates (tentative): Deadline of abstracts for contributed talks: July 31, 2018 Symposium: September 18-20, 2018 Deadline of full papers for the proceedings volume: March, 2019 Publication of the proceedings volume: December 2019 Parties: The reception will be held on September 18th evening at Takigawa Memorial Hall (conference venue). It will cost 4,000JPY (tentative). The banquet (Toshiyasu Arai 60th birthday celebration) will be held on September 19th evening. It will cost 12,000JPY (tentative). The place will be announced later. Registration: Send to Teruyuki Yorioka yorioka(a)shizuoka.ac.jp with subject "SAML2018", and please provide the following information. The deadline of the registration is July 31st, 2018. Name: Affiliation: E-mail: Contributed talk: (yes/no) if yes, please attach title and abstract (about 5 to 10 lines) Parties: Reception (yes/no), Banquet (yes/no) For any inquiry concerning the workshop, please contact for parties: Makoto Kikuchi mkikuchi(a)kobe-u.ac.jp for registration or program: Teruyuki Yorioka yorioka(a)shizuoka.ac.jp

1 0

SLACS 2018 (8月8-9日) 講演募集のお知らせ
by Katsuhiko Sano 16 May '18

16 May '18

皆様（複数のメイリングリストに送信しています。重複して受信の際はどうぞご容赦ください。） SLACS 2018（記号論理と情報科学）幹事の北海道大学の佐野勝彦です。今年度の講演募集を以下のとおり行います。ご検討よろしくお願いいたします。 SLACS 2018（記号論理と情報科学） https://sites.google.com/view/slacs-2018/home 日時 2018年8月8日（水）（午後1時頃開始）から2018年8月9日（木）場所〒060-0810 北海道札幌市北区北10条西7丁目　北海道大学人文・社会科学総合研究教育棟（W棟）5階 W517教室参加費無料。ただし、懇親会費は別途徴収します（懇親会は初日夕方に開催予定）。幹事北海道大学文学研究科佐野勝彦連絡先 katsuhiko.sano(a)gmail.com SLACSとは以下はSLACSのページの冒頭からの抜粋です。 http://www.math.s.chiba-u.ac.jp/SLACS/ 「SLACS（スラックス）は，記号論理学と情報科学の境界領域に関する研究発表・研究討論の場を提供することを目的にして開催されている研究集会です． 1985年1月に第１回が開催されて以来，毎年１回のペースで開催されています． SLACS は，堅苦しい研究会ではなく，その年の幹事を中心とした参加者自らの手作りによるフレンドリーな雰囲気を持った集会です．気軽に発表できる場ですから，研究が進行中の話題を持ってきて議論したり，学生さんが発表する場としても適当です．もちろん，発展を続けるこの分野の最先端の研究テーマに関する発表も数多く聞くことができます．参加者の資格は問いませんので，原則として，どなたでも講演発表・聴講いただけます．発表はごく少数の例外を除いて日本語です．」より詳しい情報はSLACSのページや最近の開催情報をご確認ください。　SLACS 2017 (千葉工業大学) 　http://super.para.media.kyoto-u.ac.jp/~abet/slacs2017/index.html SLACS 2016 (名古屋大学) http://www.st.nanzan-u.ac.jp/info/sasaki/2016slacs/SLACS2016.html SLACS 2015 (南山大学) https://sites.google.com/site/ptslacs2015/ SLACS 2014 (東京工業大学) http://www.jaist.ac.jp/~y-keita/2014SLACS-NSA/ 講演・懇親会申込方法：講演を希望される方は、幹事に連絡をお願いいたします。その際、以下について回答をお願いいたします。Subject を「SLACS2018講演申込」にしておいていただけるとありがたいです。講演申込期限は **2018年7月24日** としますが、講演する意思があるという方は早目にご連絡いただけると幸いです。講演時間は原則40分を予定しています。 ----- 8< ----- 8< ----- 8< ----- 8< ----- 8< ----- 8< ----- 8< ----- 8< ----- 8< ----- 氏名：（例）佐野勝彦所属：（例）北海道大学文学研究科 e-mail アドレス: 区分：一般/学生 ← プログラム作成・懇親会費設定に利用する場合があります題目：（例）TBA 概要：簡単で結構です。懇親会：参加する/追って連絡する/参加できない要望等：（例）初日しか参加できませんので初日の枠に入れてください ----- 8< ----- 8< ----- 8< ----- 8< ----- 8< ----- 8< ----- 8< ----- 8< ----- 8< ----- 講演を伴わない聴講のみを希望される場合、事前連絡は不要です。当日、会場に直接お越しください。

1 0

Tutorial by William Byrd at Kyoto Univ.
by Atsushi Igarashi 09 May '18

09 May '18

皆様，京都大学の五十嵐です．現在FLOPS2018で来日中の William E. Byrd さんに，来週の水・木の二日間にわたって，京大で relational programming のチュートリアルをして頂くことになりました． Dr. Racket をインストールしたノートＰＣを持ってくると，より楽しめるとのことです :-) 二日間にわたっていますが，二日目も最初に復習から入るようにお願いしました．一部だけでもどうぞ．ふるってご参加ください． ========================================================================== 日時: 5/16(水) 10:30〜15:30 (途中昼休みあり) 5/17(木) 10:30〜15:30 (途中昼休みあり) 会場: 京都大学吉田キャンパス総合研究７号館会議室(１階１２３号室) William E. Byrd Department of Computer Science & Hugh Kaul Precision Medicine Institute University of Alabama at Birmingham Tutorial Title: Relational Programming in miniKanren: an Interactive Tutorial Abstract: Relational Programming is a paradigm in which programs represent mathematical relations (in contrast to functional programming, in which programs represent mathematical functions). Unlike traditional programs, relational programs do not distinguish between inputs and outputs. Instead, *any* argument to a relational program can be treated as either an input or an output. This unusual property makes relational programs extremely flexible, and able to automatically perform tasks that would be complicated to implement using standard techniques. For example, an interpreter written as a relation is able to perform *program synthesis*, automatically generating programs from input/output examples. In this in-depth, interactive, two day tutorial, we will explore the world of relational programming using miniKanren, a language specifically designed for writing interesting programs as relations. Together we will implement the core of the miniKanren relational programming language. We will also implement an interpreter for a subset of Racket, written as a miniKanren relation. We will then use this "relational interpreter" to perform simple program synthesis, and discuss techniques that can speed up synthesis by many orders of magnitude. The tutorial will be highly interactive. We will implement all the code together, using the Racket programming language (a variant of Scheme). We will begin with a short introduction to basics of the Racket language, which can be learned in a few minutes. If you would like to implement all the code yourself, please bring a laptop with DrRacket installed (https://racket-lang.org/). If you don't want to implement the code yourself, you can participate by helping me as I write the code at the projector! :) Topics we will cover in the tutorial: * fundamental concepts of relational programming * a brief introduction to the Racket programming language * introduction to the miniKanren relational programming language * writing recursive relations in miniKanren * writing a simple Racket interpreter as a function in Racket * writing a simple Racket interpreter as a relation in miniKanren * using the relational Racket interpreter to perform simple program synthesis * optimizations and extensions to the relational Racket interpreter * implementing the core of miniKanren (microKanren) * open research problems in relational programming * lots of other interesting related topics -- 五十嵐淳 (IGARASHI Atsushi) E-mail: igarashi(a)kuis.kyoto-u.ac.jp url: http://www.fos.kuis.kyoto-u.ac.jp/~igarashi/

1 0

Talk by Soichiro Fujii (10 May, 11.00-, at Kyoto University)
by Kazushige TERUI 06 May '18

06 May '18

皆様今週木曜日に、京都大学にて藤井宗一郎さんのご講演があります。詳細は以下のとおりです。どうぞお気軽にご参加ください。京都大学数理解析研究所照井一成 ==================== Time: 11:00-12:00, 10 May, 2018 Place: Rm 478, Research Building 2, Main Campus, Kyoto University 京都大学本部構内総合研究2号館 4階478号室 http://www.kyoto-u.ac.jp/en/access/yoshida/main.html (Building 34) Speaker: 藤井宗一郎 Soichiro Fujii (U Tokyo) Title: A unified framework for notions of algebraic theory Abstract: Universal algebra uniformly captures various algebraic structures, by expressing them as equational theories or (abstract) clones. The ubiquity of algebraic structures in mathematics has also given rise to several variants of universal algebra, such as symmetric and non-symmetric operads, clubs, and monads. In this talk, I will present a unified framework for these cousins of universal algebra, or notions of algebraic theory. First I will explain how each notion of algebraic theory can be identified with a certain monoidal category, in such a way that theories correspond to monoids. Then I will introduce a categorical structure underlying the definition of models of theories. In specific examples, it often arises in the form of oplax action or enrichment. Finally I will uniformly characterize categories of models for various notions of algebraic theory, by a double-categorical universal property in the pseudo-double category of profunctors.

1 0

Project colloquium talk by Paolo Arcaini on 9 May
by urabenatsuki＠is.s.u-tokyo.ac.jp 05 May '18

05 May '18

[Apologies for multiple copies] Dear all, Let me advertise our next ERATO MMSD project colloquium talk by Paolo Arcaini on 9th May, 16:30-. Please find the title and the abstract below. You are all invited. Sincerely, -- Natsuki Urabe urabenatsuki(a)is.s.u-tokyo.ac.jp The University of Tokyo, ERATO MMSD ----- Wed 9 May 2018, 16:30–18:00 ERATO MMSD Takebashi Site Common Room 3 http://group-mmm.org/eratommsd/access.html Paolo Arcaini (National Institute of Informatics <http://www.nii.ac.jp/>), Decomposition-Based Approach for Model-Based Test Generation Model-based test generation by model checking is a well-known testing technique that, however, suffers from the state explosion problem of model checking and it is, therefore, not always applicable. In this talk, I present an approach that addresses this issue by decomposing a system model into suitable subsystem models separately analyzable. The technique consists in decomposing that portion of a system model that is of interest for a given testing requirement, into a tree of subsystems by exploiting information on model variable dependency. The technique generates tests for the whole system model by merging tests built from those subsystems. Effectiveness and efficiency of the proposed decomposition-based test generation approach are measured both in terms of coverage and time.

1 0

国際会議AQIS18投稿のご案内
by NISHIMURA Harumichi 27 Apr '18

27 Apr '18

logic-mlの皆様量子情報科学におけるアジア最大の国際会議AQISが今年度は名古屋大学で開催されます．つきましては以下にCFPを送付させていただきます．皆様の積極的な投稿や参加をお待ちしております．名古屋大学大学院情報学研究科西村治道 ******************************* 18th Asian Conference on Quantum Information Science (AQIS'18) http://aqis-conf.org/2018/ 8-12 September 2018 Nagoya University, Nagoya, Japan Apologies if you receive this multiple times. Please forward to interested colleagues. We would like to draw your attention, and that of the quantum information community, to the 18th edition of the Asian Conference on Quantum Information Science (AQIS'18). AQIS is the leading conference in the subject in Asia and one of the longest-running worldwide, its highly successful predecessors having been EQIS'01-05 and AQIS'06-17. The topics covered include (but are not limited to) quantum computing, quantum information processing, quantum communication and cryptography, and foundations of quantum mechanics. This year, the conference goes for the first time to Nagoya. It will be organized by Nagoya University and will take place at the Noyori Conference Hall of Nagoya University, 8-12 September 2018. Details about the conference are to be found on the website http://aqis-conf.org/2018/ . Please check repeatedly as the information there will be updated regularly. Like its previous editions, AQIS'18 will consist of tutorials, invited talk, as well as oral and poster presentations, selected by a high-profile international program committee. Invited speakers are: Ignacio Cirac (MPQ, Garching) Keisuke Fujii (Kyoto U) Nicolas Gisin (U of Geneva) Barbara Kraus (U of Innsbruck) Yasunobu Nakamura (U of Tokyo) Sandu Popescu (U of Bristol) Robert Raussendorf (U of British Columbia) Pascale Senellart (C2N-CNRS) Wolfgang Tittel (Calgary U) Thomas Vidick (Caltech) Howard Wiseman (Griffith U) The submission deadline is 9 June 2018, 23:59 Anywhere on Earth (AoE). All submissions should follow the guidelines specified on the web site: http://aqis-conf.org/2018/submission/ We are looking forward to seeing you in Nagoya! Steering Committee Chairs: Hiroshi Imai (chair, University of Tokyo), Jaewan Kim (co-chair, KIAS) Program Committee Chairs: Antonio Acin (chair, ICFO), Jaewan Kim (co-chair, KIAS), Akihisa Tomita (co-chair, Hokkaido University) Organizing Committee Chairs: Francesco Buscemi and Harumichi Nishimura (co-chairs, Nagoya University) *************************************************

1 0

JAIST Logic Seminar Series
by Hajime Ishihara 21 Apr '18

21 Apr '18

皆様ウィーン工科大学のMatthias Baaz先生の講演のお知らせです。どうぞふるってご参加ください。問合せ先：石原　哉北陸先端科学技術大学院大学情報科学系 e-mail: ishihara(a)jaist.ac.jp ----------------------------------------------- * JAIST Logic Seminar Series * Date: Thursday 26, April, 2018, 11:00-12:30 Place: JAIST, Collaboration room 7 (I-56) (Access: http://www.jaist.ac.jp/english/location/access.html) Speaker: Matthias Baaz (Vienna University of Technology) Title: The concept of proof Abstract: The concept of proof is one of the most fundamental building blocks of mathematics. The Hilbertian revolution at the beginning of the 20th century is based on an atomic notion of proof which is the foundation of the axiomatic method: "A proof is a finite sequence of formulas A1,..,An such that each Ai is instance of an axiom or follows by direct application of a rule from Ai1,..,Aik with all ij<i." No scientific revolution is however total, but there is a trend to disregard all alternatives to the successful method. In this lecture we discuss more global notions of proof, where subproofs are not necessarily proofs themselves. Examples are among others 1.protoproofs in the sense of Euler's famous solution to the Basel problem, which uses analogical reasoning and where additional external justifications are necessary. 2.circular notions of proof, where the concept of proof itself incooperates induction 3.sound proofs based on locally unsound rules 4.proofs based on abstract proof descriptions prominent e.g. in Bourbaki, where only the choice of a suitable result makes a verification possible. We discuss the benefits of these alternative concepts and the possibility that innovative concepts of proof adapted to the problems in question might lead to strong mathematical results and constitute a novel area of Proof Theory.

1 0

Call for Participation: FLOPS 2018 (deadline extended to April 25th)
by Koji Nakazawa 20 Apr '18

20 Apr '18

みなさま，（重複してお受取りの際は御容赦ください） 5月に名大で開催されるFLOPS 2018参加募集です． early registrationの締切が4/25 (水) まで延長されました．みなさまの御参加をお待ちしております． -- 中澤巧爾 ======================= Call For Participation ======================= FLOPS 2018: 14th International Symposium on Functional and Logic Programming In-Cooperation with ACM SIGPLAN =============================== 9-11 May, 2018, Nagoya, Japan Deadline for early registration is extended to 25 April, 2018. Registration for FLOPS 2018 is open. http://www.sqlab.jp/FLOPS2018/#registration FLOPS aims to bring together practitioners, researchers and implementors of the declarative programming, to discuss mutually interesting results and common problems: theoretical advances, their implementations in language systems and tools, and applications of these systems in practice. The scope includes all aspects of the design, semantics, theory, applications, implementations, and teaching of declarative programming. FLOPS specifically aims to promote cross-fertilization between theory and practice and among different styles of declarative programming. The list of accepted papers is at http://www.sqlab.jp/FLOPS2018/accepted.html Invited Speakers William E. Byrd (University of Alabama at Birmingham, USA) Zhenjiang Hu (National Institute of Informatics, SOKENDAI, Japan) Cédric Fournet (Microsoft) Program Committee Andreas Rossberg Google, Germany Atsushi Ohori Tohoku University, Japan Bruno C. D. S. Oliveira The University of Hong Kong, China Carsten Fuhs Birkbeck, University of London, UK Chung-chieh Shan Indiana University, USA Didier Remy INRIA, France Harald Søndergaard The University of Melbourne, Australia Jacques Garrigue Nagoya University, Japan Jan Midtgaard University of Southern Denmark, Denmark Joachim Breitner University of Pennsylvania, USA John Gallagher Roskilde University, Denmark and IMDEA Software Institute, Spain (PC co-chair) Jorge A Navas SRI International, USA Kazunori Ueda Waseda University, Japan Kenny Zhuo Ming Lu School of Information Technology, Nanyang Polytechnic, Singapore María Alpuente Universitat Politécnica de Valéncia, Spain María Garcia De La Banda Monash University, Australia Martin Sulzmann Karlsruhe University of Applied Sciences, Germany (PC co-chair) Meng Wang University of Kent, UK Michael Codish Ben-Gurion University of the Negev, Israel Michael Leuschel University of Düsseldorf, Germany Naoki Kobayashi University of Tokyo, Japan Nikolaj Bjørner Microsoft Research, USA Robert Glück University of Copenhagen, Denmark Samir Genaim Universidad Complutense de Madrid, Spain Siau Cheng Khoo National University of Singapore, Singapore Organizers Martin Sulzmann Karlsruhe University of Applied Sciences (PC co-chair) John Gallagher Roskilde University and IMDEA Software Institute (PC co-chair) Makoto Tatsuta National Institute of Informatics, Japan (General Chair) Koji Nakazawa Nagoya University, Japan (Local Chair)

1 0

Project colloquium talk by Ichiro Hasuo on 25 April
by urabenatsuki＠is.s.u-tokyo.ac.jp 19 Apr '18

19 Apr '18

[Apologies for multiple copies] Dear all, Let me advertise our next ERATO MMSD project colloquium talk by Ichiro Hasuo on 25th April, 16:00-. Please find the title and the abstract below. You are all invited. Sincerely, -- Natsuki Urabe urabenatsuki(a)is.s.u-tokyo.ac.jp The University of Tokyo, ERATO MMSD ----- Wed 25 April 2018, 16:00–17:00 ERATO MMSD Takebashi Site Common Room 3 http://group-mmm.org/eratommsd/access.html Ichiro Hasuo (National Institute of Informatics <http://www.nii.ac.jp/>), Approximating Reachability Probabilities by (Super-)Martingales Reachability is a fundamental problem in the analysis of probabilistic systems. It is well-known that reachability probabilities are efficiently computed for finite-state systems by linear programming. However, this LP method does not apply to systems that have infinitely many configurations, such as probabilistic programs and parametric systems. In such a case, we have to rely on a parametric witness (i.e. a function) for over- or under-approximating reachability probabilities. A well-studied class of such witnesses is that of supermartingales. In this talk I will talk about our recent results that refine existing supermartingale-based methods. The technical keys to those results are: choice of a suitable martingale concentration lemma for over-approximation; and a categorical axiomatization of supermartingales by coalgebras and corecursive algebras. The talk is based on my joint work with Natsuki Urabe, Masaki Hara, Bart Jacobs, Toru Takisaka and Yuichiro Oyabu.

1 0

IWC 2018: Final CfP
by KIKUCHI Kentaro 14 Apr '18

14 Apr '18

皆様、 7月にOxfordで開催される合流性に関する国際ワークショップIWC 2018 の締切が4/22まで延長されましたのでご案内をさせていただきます。ぜひご投稿をご検討ください。菊池健太郎 ----- (* Apologies for any cross-postings. *) ===================================================================== Call for Papers IWC 2018 7th International Workshop on Confluence July 7th, 2018, Oxford, United Kingdom Collocated with FSCD 2018 Part of FLoC 2018 http://cl-informatik.uibk.ac.at/events/iwc-2018/ ===================================================================== Confluence provides a general notion of determinism and is widely viewed as one of the central properties of rewriting. Confluence relates to many topics of rewriting (completion, modularity, termination, commutation, etc.) and has been investigated in many formalisms of rewriting such as first-order rewriting, lambda-calculi, higher-order rewriting, constrained rewriting, conditional rewriting, etc. Recently there is a renewed interest in confluence research, resulting in new techniques, tool support, certification as well as new applications. The International Workshop on Confluence (IWC) aims at promoting further research in confluence and related properties. IWC 2018 is collocated with FSCD 2018. Previous editions of the workshop were held in Nagoya (2012), Eindhoven (2013), Vienna (2014), Berlin (2015), Obergurgl (2016), and Oxford (2017). IMPORTANT DATES: * submission (abstract) Friday, April 20th, 2018 (extended) * submission (paper) Sunday, April 22nd, 2018 (extended) * notification Tuesday, May 15th, 2018 * final version Friday, May 25th, 2018 * workshop Saturday, July 7th, 2018 (deadlines are AoE) TOPICS: Specific topics of interest include: * confluence and related properties (unique normal forms, commutation, ground confluence) * completion * critical pair criteria * decidability issues * complexity issues * system descriptions * certification * applications of confluence INVITED SPEAKERS: * Henning Christiansen and Maja H. Kirkeby (Roskilde University, Denmark) PROGRAM COMMITTEE: * Bertram Felgenhauer (University of Innsbruck) * Jeroen Ketema (TNO-ESI) * Kentaro Kikuchi (Tohoku University) * Samuel Mimram (LIX laboratory, École Polytechnique) * Julian Nagele (Queen Mary University of London) * Jakob Grue Simonsen (University of Copenhagen) SUBMISSION: We solicit short papers or extended abstracts of at most five pages. There will be no formal reviewing. In particular, we welcome short versions of recently published articles and papers submitted elsewhere. The program committee checks relevance and may provide additional feedback. The accepted papers will be made available electronically before the workshop. The page limit for papers is 5 pages in EasyChair style. Short papers or extended abstracts must be submitted electronically through the EasyChair system at: https://www.easychair.org/conferences/?conf=iwc2018 EasyChair style: http://easychair.org/publications/for_authors

1 0

Kobe Colloquium on Logic: a talk by Prof. Philip Welch (18 April, 2018)
by Sakae Fuchino 13 Apr '18

13 Apr '18

----------------------------------------------------- Kobe Colloquium on Logic, Statistics and Informatics: ----------------------------------------------------- 以下の講演を予定しております．奮ってご参加ください． ------------------------------------------------------------------------- 日時: 2018/04/18 (水) 16.00 - 17:30 場所: 神戸大学六甲台第2キャンパス自然科学総合研究棟3号館421室講演者 Professor Philip Welch (University of Bristol) 講演題目: Global Reflection Principles 交通：阪急六甲駅またはJR六甲道駅から神戸市バス36系統「鶴甲団地」行きに乗車，「神大本部工学部前」停留所下車，徒歩すぐ． http://www.kobe-u.ac.jp/guid/access/rokko/rokkodai-dai2.html 連絡先：渕野昌 fuchino(a)diamond.kobe-u.ac.jp --------- Abstract: --------- This talk is based on a paper with Leon Horsten in a recent J.of Phil. and a talk in the Harvard EFI series. We reflect on the ineffability of the Cantorian Absolute. If this is done in the style of Levy and Montague in a first order manner, or Bernays using second or higher order methods this has only resulted in principles that can justify large cardinals that are `intra-constructible', that is they do not contradict the assumption that V, the universe of sets of mathematical discourse, is Gödel's universe of constructible sets, namely L. Peter Koellner has advanced reasons that this style of reflection will only have this rather limited strength. However set theorists would dearly like to have much stronger axioms of infinity. We propose a widened `Global Reflection Principle' that is based on a view of sets and Cantorian absolute infinities that delivers a proper class of Woodin cardinals (and more). A mereological view of classes is used to differentiate between sets and classes. Once allied to a wider view of structural reflection, stronger conclusions are thus possible. ------------------------------------------------------------------------- -- Best regards Sakaé Fuchino (渕野昌, Prof., Dr.rer.nat.) ----------------------------------------------------------------------------- Kobe University Graduate School of System Informatics Rokko-dai 1-1, Nada, Kobe 657-8501 Japan e-mail: fuchino(a)diamond.kobe-u.ac.jp web pages: http://fuchino.ddo.jp/index-j.html (in Japanese) http://fuchino.ddo.jp/index-e.html (in English under construction) -----------------------------------------------------------------------------

1 0

LFMTP'18: Logical Frameworks and Meta Languages: Theory and Practice - Last call for papers
by Makoto Hamana 05 Apr '18

05 Apr '18

皆様、（重複してお受け取りの際は御容赦ください） FLoC併設のLFMTP 2018 ワークショップのご案内です。ぜひ投稿をご検討ください。 -- 浜名誠群馬大学理工学府電子情報部門 ======================================================================= Call for papers Logical Frameworks and Meta-Languages: Theory and Practice LFMTP 2018 Oxford, UK, 7 July 2018 Affiliated with FSCD 2018 (part of FLoC) http://lfmtp.org/workshops/2018/ ======================================================================= Abstract submission deadline: 8 April 2018 Paper submission deadline: 15 April 2018 Logical frameworks and meta-languages form a common substrate for representing, implementing and reasoning about a wide variety of deductive systems of interest in logic and computer science. Their design, implementation and their use in reasoning tasks, ranging from the correctness of software to the properties of formal systems, have been the focus of considerable research over the last two decades. This workshop will bring together designers, implementors and practitioners to discuss various aspects impinging on the structure and utility of logical frameworks, including the treatment of variable binding, inductive and co-inductive reasoning techniques and the expressiveness and lucidity of the reasoning process. LFMTP 2018 will provide researchers a forum to present state-of-the-art techniques and discuss progress in areas such as the following: * Encoding and reasoning about the meta-theory of programming languages, logical systems and related formally specified systems. * Theoretical and practical issues concerning the treatment of variable binding, especially the representation of, and reasoning about, datatypes defined from binding signatures. * Logical treatments of inductive and co-inductive definitions and associated reasoning techniques, including inductive types of higher dimension in homotopy type theory * Graphical languages for building proofs, applications in geometry, equational reasoning and category theory. * New theory contributions: canonical and substructural frameworks, contextual frameworks, proof-theoretic foundations supporting binders, functional programming over logical frameworks, homotopy and cubical type theory. * Applications of logical frameworks: proof-carrying architectures, proof exchange and transformation, program refactoring, etc. * Techniques for programming with binders in functional programming languages such as Haskell, OCaml or Agda, and logic programming languages such as lambda Prolog or Alpha-Prolog. Invited Speakers * Delia Kesner (Universit Paris Diderot, France) * Kuen-Bang Hou, alias Favonia (Institute for Advanced Study, Princeton, USA) * Grigore Rosu (University of Illinois at Urbana-Champaign, USA) Important Dates Abstract submission deadline: Sunday April 8th Submission deadline: Sunday April 15th Notification to authors: Tuesday May 15th Final version due: Friday May 25th Workshop date: Saturday July 7th Submission In addition to regular papers, we accept the submission of "work in progress" reports, in a broad sense. Those do not need to report fully polished research results, but should be of interest for the community at large. Submitted papers should be in PDF, formatted using the EPTCS style guidelines. The length is restricted to 15 pages for regular papers and 8 pages for "Work in Progress" papers. Submission is via EasyChair: https://easychair.org/conferences/?conf=lfmtp18. Proceedings Accepted regular papers will be included in the proceedings of LMFTP 2018, whose mode of publication will be determined shortly. Program Committee * Mara Alpuente (Universitat Politcnica de Valncia, Spain) * Andrej Bauer (University of Ljubljana, Slovenia) * Frdric Blanqui (Inria, France), co-chair * Ana Bove (Chalmers University of Technology, Sweden) * Stphane Graham-Lengrand (CNRS, France) * Makoto Hamana (Gunma University, Japan) * Chantal Keller (Universit Paris-Sud, France) * Carlos Olarte (Universidade Federal do Rio grande do Norte, Brazil) * Giselle Reis (CMU Qatar), co-chair * Aaron Stump (University of Iowa, USA) * Yuting Wang (Yale University, USA)

1 0

(no subject)
by KUSAKARI Keiichirou 05 Apr '18

05 Apr '18

皆様，岐阜大の草刈です．複数受け取られましたらご容赦ください． 7月にイギリスで開催される停止性に関する国際ワークショップ WST(International Workshop on Termination)のCFPをお送りします．積極的な投稿とご参加をお待ちしております． ========================================================================== WST 2018 - Call for Papers 16th International Workshop on Termination July 18-19, 2018, Oxford, United Kingdom http://wst2018.webs.upv.es/ ========================================================================== The Workshop on Termination (WST) traditionally brings together, in an informal setting, researchers interested in all aspects of termination, whether this interest be practical or theoretical, primary or derived. The workshop also provides a ground for cross-fertilization of ideas from the different communities interested in termination (e.g., working on computational mechanisms, programming languages, software engineering, constraint solving, etc.). The friendly atmosphere enables fruitful exchanges leading to joint research and subsequent publications. The workshop is held as part of the 2018 Federated Logic Conference (FLoC 2018) http://www.floc2018.org/ IMPORTANT DATES: * submission deadline: April 15, 2018 * notification: May 15, 2018 * final version due: May 31, 2018 * workshop: July 18-19, 2018 TOPICS: The 16th International Workshop on Termination welcomes contributions on all aspects of termination. In particular, papers investigating applications of termination (for example in complexity analysis, program analysis and transformation, theorem proving, program correctness, modeling computational systems, etc.) are very welcome. Topics of interest include (but are not limited to): * abstraction methods in termination analysis * certification of termination and complexity proofs * challenging termination problems * comparison and classification of termination methods * complexity analysis in any domain * implementation of termination methods * non-termination analysis and loop detection * normalization and infinitary normalization * operational termination of logic-based systems * ordinal notation and subrecursive hierarchies * SAT, SMT, and constraint solving for (non-)termination analysis * scalability and modularity of termination methods * termination analysis in any domain (lambda calculus, declarative programming, rewriting, transition systems, etc.) * well-founded relations and well-quasi-orders COMPETITION: Since 2003, the catalytic effect of WST to stimulate new research on termination has been enhanced by the celebration of the Termination Competition and its continuously developing problem databases containing thousands of programs as challenges for termination analysis in different categories, see http://termination-portal.org/wiki/Termination_Competition In 2018, the Termination Competition will run in parallel with FLoC 2018. More details will be provided in a dedicated announcement on the competition. PROGRAM COMMITTEE: Cristina Borralleras - U. de Vic Ugo Dal Lago - U. degli Studi di Bologna Carsten Fuhs - Birkbeck, U. of London Samir Genaim - U. Complutense de Madrid Juergen Giesl - RWTH Aachen Raul Gutiérrez - U. Politecnica de València Keiichirou Kusakari - Gifu University Salvador Lucas (chair) - U. Politecnica de Valencia Fred Mesnard - U. de La Reunion Aart Middeldorp - U. of Innsbruck Albert Rubio - U. Politecnica de Catalunya Rene Thiemann - U. of Innsbruck Caterina Urban - ETH Zürich INVITED SPEAKERS: tba SUBMISSION: Submissions are short papers/extended abstracts which should not exceed 5 pages. There will be no formal reviewing. In particular, we welcome short versions of recently published articles and papers submitted elsewhere. The program committee checks relevance and provides additional feedback for each submission. The accepted papers will be made available electronically before the workshop. Papers should be submitted electronically via the submission page: https://easychair.org/conferences/?conf=wst2018 Please, use LaTeX and the LIPIcs style file http://drops.dagstuhl.de/styles/lipics/lipics-authors.tgz to prepare your submission.

1 0

Talk by Dieter Spreen (April 4, Fukuoka)
by Akitoshi Kawamura 01 Apr '18

01 Apr '18

皆様九州大学の河村です。ディーター・シュプレーン先生（ジーゲン大）の講演を以下のように開催いたしますので、お近くの方はどうぞお越しください。 http://www.i.kyushu-u.ac.jp/~kawamura/seminar/H300404.html 日時　April 4, 2018, Wednesday, 15:30– 場所　Room 314, Ito Campus West Building II, Kyushu University (九州大学伊都キャンパスウエスト二号館314第四講義室) The continuity problem in computability theory Dieter Spreen (University of Siegen) After the discovery of the paradoxes in Cantor's set theory, mathematics was in a deep foundational crisis. Various suggestions of how to get out of this situation have been made. The more radical among them required that it is no longer sufficient to derive the existence of an object by indirect reasoning, but to present a concrete construction of the object under consideration. Here, the problem is what is meant by a construction. Markov replaced "construction" by "algorithm": only those objects should be considered that are generated by an algorithm. This should in particular be true for functions. So, in the Markov school, also known as Russian Constructivism, a function is given by an algorithm that takes as input an algorithm generating the object the function is applied to, and delivers as output an algorithm generating the function value. This is a rather restrictive concept. When dealing with functions on the real numbers, e.g., we are interested in their computability, but we do not want to restrict the function to only computable real numbers as arguments. Such functions turn out to be computable, if they are continuous with a computable modulus of continuity. In several cases it turned out that Markov computable functions can be extended to computable functions in the sense just mentioned. However, it is known that this is not true in general. The problem in which situations Markov computable functions can be extended to computable functions is known as the continuity problem. It will be discussed in this talk. 皆様のご参加をお待ちしております。 -- 河村彰星九州大学システム情報科学研究院情報学部門〒819-0395　福岡市西区元岡744 092-802-3806 kawamura(a)inf.kyushu-u.ac.jp

1 0

Symposium on Modernism and Modernisation in Mathematics
by 久木田水生 01 Apr '18

01 Apr '18

皆さま、数学史家の Jeremy Gray 先生（The Open University）と林晋先生（京都大学）をお招きして、4月7日、名古屋大学にてシンポジウムを開催いたします。本シンポジウムは応用哲学会の年次大会の一部として開催されますが、シンポジウムのみご参加の方からは参加費をいただきません。どうぞ奮ってご参加ください。また興味を持ちそうな方にお声がけいただけると幸いです。久木田水生 Symposium on Modernism and Modernisation in Mathematics Time: 16:15-18:30, April 7th, 2018 2018年4月7日、16:15-18:30 Place: Room A31, Liberal Arts and Sciences Building A, Higashiyama Campus, Nagoya University. (No. A4(1) of http://www.nagoya-u.ac.jp/access-map/index.html) 名古屋大学東山キャンパス全学教育棟A館A31教室。http://www.nagoya-u.ac.jp/access-map/index.html のA4(1)の建物 Lecture 1: Jeremy Gray, ``Poincaré and Weyl: two dissenters from mathematical modernism'' Around 1900 a characteristic form of modern mathematics took over the subject, which we associate with Georg Cantor, Richard Dedekind, and David Hilbert among others. It sees mathematics as an autonomous system of ideas, emphasises the formal or axiomatic aspects, and brings about a complicated relationship with the sciences. Henri Poincaré (1854-1912) and Hermann Weyl (1885-1955) preferred a much more intimate connection between mathematics and physics and argued in different ways for a symbiotic approach, which they also linked to a broader philosophical vision. Lecture 2: Susumu Hayashi, ``How was Mathematics modernized?'' I have been developing a historical view on the modernization, in the sense of Max Weber sociology, of mathematics for the last 19 years. I will outline it in this presentation. The starting point of my research was an enigmatic (to me) claim by Kurt Godel in his unpublished philosophical essay. His claim may be interpreted as “World-views have been disenchanted (modernized) through the history since the Renaissance. Particularly in physics, this development reached a peak in the 20th century. However, mathematics alone went in the opposite direction as set theory was introduced into it.” My historical view was slightly changed from Godel’s to make it fit into Weber’s modernization theory. I will discuss how important Hilbert’s program and Godel’s incompleteness theorems were for the modernization of mathematics, and how they made the process of modernization of mathematics somewhat different from the process of modernization of physics. Jeremy Gray short bio Jeremy Gray is an Emeritus Professor of The Open University and an Honorary Professor in the Mathematics Department at the University of Warwick. His research interests are in the history of mathematics, specifically the history of algebra, analysis, and geometry, and mathematical modernism in the 19th and early 20th Centuries. The work on mathematical modernism links the history of mathematics with the history of science and issues in mathematical logic and the philosophy of mathematics. He was awarded the Otto Neugebauer Prize of the European Mathematical Society in 2016 for his work in the history of mathematics, and the Albert Leon Whiteman Memorial Prize of the American Mathematical Society in 2009 for his contributions to the study of the history of modern mathematics internationally. In 2012 he was elected an Inaugural Fellow of the American Mathematical Society. In 2010 he was one of the nine founder members of the Association for the Philosophy of Mathematical Practice (APMP). He is the author of eleven books, of which among the most recent are Plato’s Ghost: The Modernist Transformation of Mathematics (Princeton U.P. 2008), Henri Poincaré: a scientific biography (Princeton 2012), and The Real and the Complex (Springer 2015). Two more books are to be published in 2018: Under the Banner of Number: A History of Abstract Algebra, by Springer, and Simply Riemann in the Simply Charly series of e-books. Susumu Hayashi short bio Susumu Hayashi is a professor of Kyoto university and an emeritus professor of Kobe university. He started his academic career in mathematics, and then moved to other research areas including computer science, software engineering, science and technology policy research for Japanese goverment, history of mathematics, digital humanities, and history of ideas. His current research interests are mainly the history of the foundations of mathematics, the history of Kyoto school of philosophy, and digital humanities. He is the author of ten books and over fifty academic articles. He is now working on a book of Iwanami Shinsho series on Godel's incompleteness theorems and the history of the foundations of mathematics based on the sociological modernization theory. Contact Information: Minao Kukita (久木田水生), minao.kukita(a)i.nagoya-u.ac.jp

1 0

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Logic-ml