Logic-ml May 2014

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

8 participants
15 discussions

セミナー案内
by KASHIMA Ryo 30 Jun '14

30 Jun '14

数理論理学セミナーのお知らせ日時：5月29日(木) 17:00 から場所：東京工業大学大岡山西８号館Ｗ棟10階 W1008 話者：Florian Pelupessy （東北大学）題目：Weak concrete mathematical independence. 概要： Since Gödels theorems it is known that Peano Arithmetic is incomplete, i.e. there exist sentences in the language of PA which cannot be proven, nor disproven using PA. We will discuss some examples of such statements which can be regarded as being natural, in the sense that they closely resemble theorems from mathematical practice and we will examine these statements, hoping to clarify what makes them independent of PA. ------ 本セミナーは定期的に東工大で開催しているものです。初めて参加を希望される方はご一報ください。なお，前日の水曜まで SLACS・超準解析合同シンポジウムが開催されています。そちらの詳細は下記をご覧下さい： http://www.jaist.ac.jp/~y-keita/2014SLACS-NSA/index.html ----- 鹿島亮東京工業大学大学院情報理工学研究科数理・計算科学専攻 kashima(a)is.titech.ac.jp

1 1

QPL 2014: Final Call for Papers
by Ichiro Hasuo 02 Jun '14

02 Jun '14

[Apologies for multiple copies] CALL FOR PAPERS The 11th workshop on Quantum Physics and Logic (QPL) June 4-6, Kyoto, Japan http://www-mmm.is.s.u-tokyo.ac.jp/qpl2014 The 11th workshop on Quantum Physics and Logic (QPL) will take place at Kyoto University, Japan, from 4th to 6th, JUNE 2014. This workshop will bring together researchers working on mathematical foundations of quantum physics, quantum computing and spatio-temporal causal structures, and in particular those that use logical tools, ordered algebraic and category-theoretic structures, formal languages, semantical methods and other computer science methods for the study of physical behaviour in general. Previous QPL events were held in Ottawa (2003), Turku (2004), Chicago (2005), Oxford (2006),Reykjavik (2008), Oxford (2009), Oxford (2010), Nijmegen (2011), Brussels (2012) and Barcelona (2013). INVITED SPEAKERS Giulio Chiribella (Tsinghua) Masahito "Hassei" Hasegawa (Kyoto) Masanao Ozawa (Nagoya) IMPORTANT DATES Submission Deadline: 13th Apr, 2014 Notification of Acceptance: 4th May Papers Ready: 11th May Workshop: 4th-6th June SUBMISSIONS Prospective speakers are invited to submit a contribution to the workshop. - *Short contributions* consist of a 3 page description of the work, and a link to a paper published elsewhere. - Longer *original contributions* consist of a 5-12 page extended abstract which provides sufficient evidence of results of genuine interest and provides sufficient detail to allow the program committee to assess the merits of the work. Submissions of works in progress are encouraged but must be more substantial than a research proposal. Extended versions of accepted original research contributions will be published in Electronic Proceedings in Theoretical Computer Science (EPTCS) after the workshop. Selected contributions will further be invited to a special issue in the journal New Generation Computing. Submissions should be prepared using LaTeX (use of the EPTCS style is encouraged), and must be submitted in PDF format. Submission is done via EasyChair: https://www.easychair.org/conferences/?conf=qpl2014 TRAVEL SUPPORT We encourage participation by graduate students. Students will pay a reduced registration fee. We will also provide limited financial support to students for travel and accommodations (non-students can also apply but priority is given to students). Further information is found on the workshop website. PROGRAMME COMMITTEE Dan Browne (UCL) Giulio Chiribella (Tsinghua) Bob Coecke (Oxford, co-chair) Ross Duncan (Strathclyde) Simon Gay (Glasgow) Ichiro Hasuo (Tokyo, co-chair) Chris Heunen (Oxford) Matty Hoban (ICFO) Bart Jacobs (Nijmegen) Viv Kendon (Leeds) Prakash Panangaden (McGill, co-chair) Simon Perdrix (CNRS Grenoble) Mehrnoosh Sadrzadeh (QMUL) Peter Selinger (Dalhousie) Rob Spekkens (Perimeter) Bas Spitters (Nijmegen) Jamie Vicary (Oxford & CQT Singapore) Mingsheng Ying (UTS Sydney & Tsinghua) LOCAL ORGANISATION Ichiro Hasuo (Tokyo, chair) Naohiko Hoshino (Kyoto) Yoshihiko Kakutani (Tokyo) Susumu Nishimura (Kyoto) STEERING COMMITTEE Bob Coecke (Oxford) Prakash Panangaden (McGill) Peter Selinger (Dalhousie)

2 4

Kobe Colloquium (June 3, 2014, Hirao)
by Makoto Kikuchi 30 May '14

30 May '14

Kobe Colloquium on Logic, Statistics and Informatics 以下の要領でコロキウムを開催します。日時：2014年6月3日（火）15:40-16:40 場所：神戸大学自然科学総合研究棟3号館4階421室（プレゼンテーション室）講演者：平尾将剛 (愛知県立大) 題目：最適実験計画の設計問題とcubature公式についてアブストラクト: 実験計画法とは，実験対象の特徴を的確に捉えたデータを取得するための方法論のひとつである．本講演では特に球面や球といった回転不変性を持つ領域上でデータ解析を取得する際に，どこに観測所を配置すれば良いか，また，その各観測所においてどれだけの回数の測定をすれば良いかを問題としたい．近年，この問題に対し， Hirao-Sawa-Jimbo(2014), Sawa-Hirao(2014+)ではある統計的最適性を持つ実験計画の設計問題をcubature公式(立体求積公式)と呼ばれる積分近似公式の構成問題と捉える直すことにより，最適計画の設計法を提案してきた．本講演ではそれらの設計法についての解説を行い，また時間があれば今後の課題についても幾つか説明する．交通：阪急六甲駅またはJR六甲道駅から神戸市バス36系統「鶴甲団地」行きに乗車，「神大本部工学部前」停留所下車，徒歩すぐ． http://www.kobe-u.ac.jp/guid/access/rokko/rokkodai-dai2.html 連絡先：菊池誠　mkikuchi(a)kobe-u.ac.jp

1 0

APLAS 2014: Extended deadline
by Jacques Garrigue 27 May '14

27 May '14

APLAS 2014の〆切を約一週間延ばしました。ぜひご検討下さい。 Jacques Garrigue =============================================================== APLAS 2014 12th Asian Symposium on Programming Languages and Systems http://www.math.nagoya-u.ac.jp/~garrigue/APLAS2014/ 17-19 November 2014, Singapore CALL FOR PAPERS Abstracts due June 2 (full paper by June 8) =============================================================== ================ INVITED SPEAKERS ================ Zhenjiang Hu (NII, Japan) Dexter Kozen (Cornell University, USA) Julien Verlaguet (Facebook, USA) ========== BACKGROUND ========== APLAS aims to stimulate programming language research by providing a forum for the presentation of latest results and the exchange of ideas in programming languages and systems. APLAS is based in Asia, but is an international forum that serves the worldwide programming language community. APLAS is sponsored by the Asian Association for Foundation of Software (AAFS) founded by Asian researchers in cooperation with many researchers from Europe and the USA. Past APLAS symposiums were successfully held in Melbourne ('13), Kyoto ('12), Kenting ('11), Shanghai ('10), Seoul ('09), Bangalore ('08), Singapore ('07), Sydney ('06), Tsukuba ('05), Taipei ('04) and Beijing ('03) after three informal workshops. Proceedings of the past symposiums were published in Springer's LNCS. ====== TOPICS ====== The symposium is devoted to foundational and practical issues in programming languages and systems. Papers are solicited on topics such as * semantics, logics, foundational theory; * design of languages, type systems and foundational calculi; * domain-specific languages; * compilers, interpreters, abstract machines; * program derivation, synthesis and transformation; * program analysis, verification, model-checking; * logic, constraint, probabilistic and quantum programming; * software security; * concurrency and parallelism; * tools and environments for programming and implementation. Topics are not limited to those discussed in previous symposiums. Papers identifying future directions of programming and those addressing the rapid changes of the underlying computing platforms are especially welcome. Demonstration of systems and tools in the scope of APLAS are welcome to the System and Tool presentations category. Authors concerned about the appropriateness of a topic are welcome to consult with the program chair prior to submission. ========== SUBMISSION ========== We solicit submissions in two categories: *Regular research papers* describing original scientific research results, including tool development and case studies. Regular research papers should not exceed 18 pages in the Springer LNCS format, including bibliography and figures. They should clearly identify what has been accomplished and why it is significant. Submissions will be judged on the basis of significance, relevance, correctness, originality, and clarity. In case of lack of space, proofs, experimental results, or any information supporting the technical results of the paper could be provided as an appendix or a link to a web page, but reviewers are not obliged to read them. *System and Tool presentations* describing systems or tools that support theory, program construction, reasoning, or program execution in the scope of APLAS. System and Tool presentations are expected to be centered around a demonstration. The paper and the demonstration should identify the novelties of the tools and use motivating examples. System and Tool papers should not exceed 8 pages in the Springer LNCS format, including bibliography and figures. Submissions will be judged based on both the papers and the described systems or tools. It is highly desirable that the tools are available on the web. Papers should be submitted electronically via the submission web page: https://www.easychair.org/conferences/?conf=aplas2014 Acceptable formats are PostScript or PDF. Submitted papers must be unpublished and not submitted for publication elsewhere. Papers must be written in English. The proceedings will be published as a volume in Springer's LNCS series. Accepted papers must be presented at the conference. ===== DATES ===== Abstracts due: June 2, 2014 (Monday) 23:59 UTC-11 Submission due: June 8, 2014 (Sunday) 23:59 UTC-11 Notification: August 6, 2014 (Wednesday) Final paper due: September 1, 2014 (Monday) Conference: November 17-19, 2014 (Monday-Wednesday) ========== ORGANIZERS ========== General chair: Wei-Ngan Chin (National University of Singapore) Program chair: Jacques Garrigue (Nagoya University) Program committee: Xiaojuan Cai (Shanghai Jiao Tong University, China) James Chapman (Institute of Cybernetics, Estonia) Cristian Gherghina (Singapore University of Technology and Design) Eric Goubault (CEA LIST and Ecole Polytechnique, France) Fei He (Tsinghua University, China) Gerwin Klein (NICTA and UNSW, Australia) Raghavan Komondoor (Indian Institute of Science, Bangalore) Paddy Krishnan (Oracle, Australia) Daan Leijen (Microsoft Research, USA) Yasuhiko Minamide (University of Tsukuba, Japan) Shin-Cheng Mu (Academia Sinica, Taiwan) Sungwoo Park (Pohang University of Science and Technology, Korea) Julian Rathke (University of Southampton, UK) Sukyoung Ryu (KAIST, Korea) Alexandra Silva (Radboud University Nijmegen, Netherlands) Martin Sulzmann (Karlsruhe University of Applied Sciences, Germany) Munehiro Takimoto (Tokyo University of Science, Japan) Jan Vitek (Purdue University, USA) Hongwei Xi (Boston University, USA) ======= CONTACT ======= aplas2014 at easychair.org

1 0

Talks by Georg Struth (29 May) & by Bart Jacobs (2 Jun) at U Tokyo
by Ichiro Hasuo 22 May '14

22 May '14

Dear colleagues, Let me advertise talks given by our guests: Georg Struth on algebraic techniques in program analysis; and Bart Jacobs on categorical quantum logic. No registration is necessary; see you there! Best regards, Ichiro Hasuo Group website: http://www-mmm.is.s.u-tokyo.ac.jp/ ________________________________ Thu 29 May 2014, 16:30-18:00 Georg Struth (U. Sheffield), Build Your Own Program Analysis Tool 理学部7号館2階 214教室 Room 214, School of Science Bldg. No. 7 アクセス： https://www-mmm.is.s.u-tokyo.ac.jp/indexj.html （一番下） Access: http://www-mmm.is.s.u-tokyo.ac.jp/ (see bottom) We present a principled way of designing program analysis tools within interactive proof assistants such as Coq or Isabelle; inparticular tools for the construction and verification of sequential and concurrent programs. We use algebras of programs to capture the control flow of programs and to derive Hoare-style inference rules, verification conditions, or transformation and refinement laws. We model their data flow by linking these algebras with denotational models of programs, including relations, predicate transformers, or sets of traces and by enriching these with notions of store and state, with data types, assignment and process interference. This separation of concern makes the approach open, modular and highly automatic. Its implementation in Isabelle/HOL is particularly simple. It yields lightweight tools which are themselves correct by construction and can be combined with various programming languages and integrated into different formal methods. We illustrate the approach through three examples: a verification tool for while programs based on Kleene algebra with tests, its extension to a Morgan-style program refinement tool, and a prototype for verifying and constructing shared variable concurrent programs based on a new variant of concurrent Kleene algebra. Time permitting, we will outline how more powerful program analysis tools can be obtained from more expressive algebras. ________________________________ Mon 2 Jun 2014, 15:30-17:00 Bart Jacobs (Radboud U. Njimegen), Axiomatising categorical quantum logic 化学東館 236教室（理学部7号館の隣．ご存知ない方は先に理学部7号館415へお越しください） Room 236, Chemistry Building East (“Kagaku-Higashikan”). If not familiar come first to Rm 415, School of Science Bldg. No. 7 アクセス： https://www-mmm.is.s.u-tokyo.ac.jp/indexj.html （一番下） Access: http://www-mmm.is.s.u-tokyo.ac.jp/ (see bottom) This talk describes several assumptions on a category that together yield a proposal for a categorical structure for quantum logic. The assumptions and consequences describe the differences and similarities between classical, probabilistic, and quantum logic. The leading examples are the category Sets, the Kleisli category of the distribution monad, and the opposite of the category of C*-algebras and (completely) positive unital maps.

1 0

Program of SLACS 2014 / 2014 Nonstandard Analysis Symposium
by YOKOYAMA Keita 20 May '14

20 May '14

皆様、北陸先端大の横山です。以前にもご案内いたしました2014年度のSLACS及び超準解析シンポジウムのプログラムを公開いたしました。 http://www.jaist.ac.jp/~y-keita/2014SLACS-NSA/speakers.html 27日には・斉藤正彦先生の特別講演、・小澤正直先生、蓮尾一郎先生の基調講演がございます。貴重な機会かと存じます、奮ってご参加ください。また、27日には両研究集会合同の懇親会を行います。お店のスペースの関係上、席の残りが少なくなっておりますので、参加をご検討の方はお早めにお申し込みください。どうぞよろしくお願いいたします。 For the information in English, please see the following web page. http://www.jaist.ac.jp/~y-keita/2014SLACS-NSA/index-e.html 以下、研究集会の情報です。 *************************** SLACS 2014 / 2014年度超準解析シンポジウム日時：5月26日（月）～5月28日（水）（但し、原則として、SLACSの講演は26,27日、超準解析シンポジウムの講演は27,28日とし、27日は一部交流形式を取る。）場所：東京工業大学大岡山キャンパス、西８号館Ｅ棟10階大会議室 ※合同懇親会を5月27日に行う予定です。ホームページ http://www.jaist.ac.jp/~y-keita/2014SLACS-NSA/index.html 27日には、2つの研究集会の交流の一環として、次の二つの基調講演を予定しております。・蓮尾一郎先生（東京大学、SLACSより）・小澤正直先生（名古屋大学、超準解析シンポジウムより）さらに、特別講演として、東京大学名誉教授の斉藤正彦先生より、超準解析学や周辺分野の日本における発展の歴史などについてお話をいただける予定です。 === 参加登録・講演の申し込みについて===================== 参加登録は、以下のフォームを横山までお送りください。送り先：y-keita(a)jaist.ac.jp ===以下フォーム=== 1. お名前 2. 所属 3. 参加日程 4. 懇親会(5月27日): 参加 / 不参加 5. 連絡先 E-mail 6. その他リクエスト等 ===以上フォーム=== ご登録されなくても当日の参加は可能ですが、準備の都合上できるだけ事前にご登録頂けますと助かります。また、懇親会につきましては、会場の状況次第で満席で受付を締め切る可能性があります。あらかじめご了承ください。 *************************** -- Keita Yokoyama y-keita(a)jaist.ac.jp

1 0

千葉 logic seminar
by arai toshiyasu 20 May '14

20 May '14

みなさま新井@千葉大学です。千葉 logic seminar の第2回のお知らせです。どなたでも参加できますのでどうぞ気軽にいらっしゃって下さい。問合せ先新井敏康（千葉大学） tosarai(a)faculty.chiba-u.jp ------------------------------------------ 日時：6月4日(水)15:00-16:30 場所：千葉大学理学部2号館105号室アクセスは http://www.chiba-u.ac.jp/campus_map/nishichiba/index.html の地図の黄色い理学部の中で数字2が付いている建物の1階です。講演者：倉橋太志（木更津工業高等専門学校）タイトル：算術の超準モデルにおける証明可能性（菊池誠（神戸大学）との共同研究）アブストラクト：第二不完全性定理の帰結として，0=1 の証明をもつようなペアノ算術 PA の超準モデルの存在がいえる．そのような超準的な証明の構造は十分には理解されていないため，PA の超準モデルにおける可証性述語の振る舞いを調べることによって超準的な証明の性質の解明を試みている．本発表では，次の内容について，今までに得られている結果の紹介を行う： 1. PA + Con(PA) の超準モデルにおける証明可能性 2. どれだけ短く切っても証明できるものが実際より増えている PA + not Con(PA) のモデル 3. PA + not Con(PA) のモデルにおける Rosser 可証性述語の振る舞い ------------------------------------------

1 0

Kobe Colloquium (May 20, 2014, Sawa)
by Makoto Kikuchi 19 May '14

19 May '14

Kobe Colloquium on Logic, Statistics and Informatics 以下の要領でコロキウムを開催します。日時：2014年5月20日（火）16:00-17:30 場所：神戸大学自然科学総合研究棟3号館4階421室（プレゼンテーション室）講演者：澤正憲 (神戸) 題目：Hilbert identity and Cubature formula 交通：阪急六甲駅またはJR六甲道駅から神戸市バス36系統「鶴甲団地」行きに乗車，「神大本部工学部前」停留所下車，徒歩すぐ． http://www.kobe-u.ac.jp/guid/access/rokko/rokkodai-dai2.html 連絡先：菊池誠　mkikuchi(a)kobe-u.ac.jp

1 0

CCC 2014; second call for papers
by Hajime Ishihara 19 May '14

19 May '14

*Continuity, Computability, Constructivity -- From Logic to Algorithms (CCC 2014)* *University of Ljubljana, 15-19 September 2014* *Second call for papers* http://ccc2014.fmf.uni-lj.si/ CCC is a workshop series bringing together researchers from realanalysis, computability theory, and constructive mathematics. The overall aim is to apply logical methods in these disciplines to provide a sound foundation for obtaining exact and provably correctalgorithms for computations with real numbers and related analytical data, which are of increasing importance in safety critical applications and scientific computation. Previous workshops have been held in Cologne CCC 2009, Trier CCC 2012, and Gregynog 2013. One outcome of the 2009 workshop series is the creation of the EU funded research network COMPUTAL (Computable analysis -- theoretical and applied aspects) which supports research visits from Europe to Russia, South-Africa, and Japan and vice versa. This workshop also hosts the third COMPUTAL workshop, but is open to all researchers in the area. The workshop will take place in Ljubljana, Slovenia. *Scope: *The workshop specifically invites contributions in the areas of * exact real number computation, * effective topology, * Scott's domain theory, * Weihrauch's type two theory of effectivity, * category-theoretic approaches to computation on infinite data, * hierarchies of unsolvability, * and related areas. *Invited Speakers:* * Thierry Coquand (Gothenburg) * Dirk Pattinson (Canberra) * Paul Potgieter (Pretoria) * Robert Rettinger (Hagen) * Hideki Tsuiki (Kyoto) * … (tba) *Tutorial Speakers:* * Andrej Bauer (Ljubljana) * Martin Ziegler (Darmstadt) *Abstract submission deadline:* *10 June 2014* ** *Upload your submission via EasyChair* https://www.easychair.org/conferences/?conf=ccc20140 <https://www.easychair.org/conferences/?conf=ccc20140> *Programme Committee:* * Andrej Bauer(Ljubljana) * Willem Fouche' (Pretoria) * Hajime Ishihara (Nomi, Ishikawa) * Margarita Korovina (Novosibirsk) * Davorin Lesnik (Darmstadt) * Norbert Mueller (Trier) * Robert Rettinger (Hagen) * Monika Seisenberger (Swansea) * Dieter Spreen (Siegen and Pretoria) (chair) * Martin Ziegler (Darmstadt). *Organizing Committee:* * Andrej Bauer (Ljubljana)

1 0

JAIST Logic Seminar Series
by Takako Nemoto 16 May '14

16 May '14

皆様インスブリア大学のMarco Benini 先生の講演のお知らせです。ふるってご参加ください。問い合わせ先：根元多佳子北陸先端科学技術大学院大学情報科学研究科 e-mail: t-nemoto(a)jaist.ac.jp ------------------------------ -------------------- * JAIST Logic Seminar Series * * This seminar is held as a part of the EU FP7 Marie Curie Actions IRSES project CORCON. Date: Thursday 22, May, 2014 15:30-17:00 Place: JAIST Collaboration Room 6 (I57-g) (Access:http://www.jaist.ac.jp/english/location/access.html) Speaker: Dr. Marco Benini Title: Point-free foundations of Mathematics Abstract: Is it possible to work with logical theories without assuming the existence of a universe where to interpret terms? This talk will positively answer to the above question in the case of first-order, intuitionistic-based theories by providing a class of models, defined inside Category Theory, such that they allow to interpret theories in a sound and complete way. Furthermore, the models explain the computational meaning of the corresponding theories via a semantic version of the Curry-Howard isomorphism. And their peculiar aspect is that they provide no universe where to interpret terms.

1 0

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Logic-ml May 2014