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

Call for Participation: FLOPS 2018
by Koji Nakazawa 30 Mar '18

30 Mar '18

みなさま，（重複してお受け取りの際は御容赦ください） 5月に名大で開催されるFLOPS 2018参加募集です．みなさまの御参加をお待ちしております． -- 中澤巧爾 (NAKAZAWA Koji) 名古屋大学大学院情報科学研究科情報システム学専攻 mail: knak(a)i.nagoya-u.ac.jp ======================= Call For Participation ======================= FLOPS 2018: 14th International Symposium on Functional and Logic Programming In-Cooperation with ACM SIGPLAN =============================== 9-11 May, 2018, Nagoya, Japan Registration is now open for FLOPS 2018. http://www.sqlab.jp/FLOPS2018/#registration Deadline for early registration is 20 April, 2018. 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

The Fourth Taiwan Philosophical Logic Colloquium (TPLC 2018)
by 小野寛晰 28 Mar '18

28 Mar '18

[Please circulate. Apologies for multiple copies.] The Fourth Taiwan Philosophical Logic Colloquium (TPLC 2018) With a main theme: “Conditionals: Truth-Conditions, Probability, and Causality” Call for Papers 15th (Thursday) - 17th (Saturday) of November, 2018 Department of Philosophy, National Taiwan University, Taipei, Taiwan. http://www.philo.ntu.edu.tw/lmmgroup <http://www.philo.ntu.edu.tw/lmmgroup> We are pleased to invite you to submit an abstract of a contributed talk to TPLC 2018. Deadline of the submission: 31 July, 2018 Notification of accepted contributed talk: 20 August, 2018 DESCRIPTION OF TPLC 2018 The Taiwan Philosophical Logic Colloquium (TPLC-series, TPLCs for short) is one of two series of biennial conferences established since 2012 and is hosted by Department of Philosophy, National Taiwan University, Taiwan. (The other is the series of Taiwan Metaphysics Colloquium (TMC-series, TMCs for short), established since 2013). Funding is mainly sourced from annual donation by Ms. Wendy Huang and Shun Yih Ltd. The primary concern of this funding is to enhance the research of logic and analytic philosophy in Taiwan. The aim of TPLCs is to provide a forum for dialogues amongst philosophers and logicians with regard to a variety of significant issues and topics from philosophical and logical perspectives. We intend to bring together a group of logic-minded philosophers and philosophically oriented logicians. We hope that TPLCs and TMCs will become a series of inspiring events so as to promote the development of logic and analytic philosophy, especially philosophical logic and metaphysics in Asian area, especially in Taiwan. In order to bring in more philosophical discussions in TPLCs, the organizing committee has decided that for each TPLC, henceforth, a particular topic/issue/problem, which has involved some philosophical debates, will be set as the main theme. We are hoping that, apart from the general topics in philosophical logic, there could be a certain portion (say, half) of talks focusing on the main theme. The main theme of TPLC 2018 will be “Conditionals: Truth-Conditions, Probability and Causality”. Conditional is undoubtedly one of the most important, and yet controversial, philosophical topics in philosophy. What is the nature of conditionals? Specifically, what is the difference between indicative conditionals and subjunctive ones? Do either indicative conditionals or subjunctive conditionals have truth conditions? If either do, what are their truth conditions? While enormous efforts have been devoted to these questions (and more others), there is undoubtedly plenty of room for further exploration. This year, the Fourth Taiwan Philosophical Logic Colloquium (TPLC 2018) will set the research of conditionals as its main theme. We are hoping that apart from non-classical logics, the philosophy of logic and mathematics, and general topics in philosophical logic, more and more attention can be paid to the study of conditionals. KEYNOTE SPEAKERS: Dorothy Edgington (FBA, Birkbeck College, University of London) Alan Hajek (FAAH, School of Philosophy, RSSS, Australian National University) INVITED SPEAKERS Churn-Jung Liau (Academia Sinica) Edwin Mares (Victoria University of Wellington) Hiroakira Ono (Japan Advanced Institute of Science and Technology) Katie Steele (Australian National University) Jiji Zhang (Lingnan University) And more to come. SUBMISSION OF ABSTRACTS FOR CONTRIBUTED TALKS All researchers working on various aspects of conditionals and general topics in philosophical logic are cordially invited to submit their abstracts by 31 July, 2018. Authors should submit an extended abstract, which is no less than one page but no more than four pages (A4 size, single space). Please put on a separate page with the details of (all) authors, including full names, titles, affiliations, email addresses. By convention, the first author will be the corresponding author, unless special notification is added. Each submission will be reviewed. Abstracts and cover letters must be submitted as PDF files and sent to Hsuan-Chih Lin [azurviolet(a)gmail.com <mailto:azurviolet@gmail.com>] POST-CONFERENCE PUBLICATION: TPLCs has been flourishing since 2012 and we have had several successful events, including TPLC 2014, AWPL-TPLC 2016. We have published two volumes of post-conference proceedings: Structural Analysis of Nonclassical Logics (Proceedings of TPLC 2014), and Philosophical Logic: Current Trends in Asia (Proceedings of AWPL-TPLC 2016), in the ‘Logic in Asia’ (LIAA) Book Series, which is one of sub-series of Studia Logica Library, by Springer in October 2015 and December 2017 respectively. Following this tradition, we are planning to publish a post-conference proceedings for TPLCIV-2018 as a new volume of the LIAA Book Series by Springer, or some other publisher. All authors of papers presented at the conference are encouraged to submit a full paper. All papers submitted will be refereed to high journal standards, and thus acceptance as a presentation is no guarantee that the post-conference paper will be published. A formal schedule concerning the submission of manuscripts and some other details will be announced after the conference. Based on our previous experience, the deadline of the submission of manuscripts is more likely to be around the end of April. TRAVEL GRANTS FOR GRADUATES AND JUNIOR RESEARCHERS Free accommodation and travel awards for graduates and junior researchers have been made available by the organizing committee. In some cases, full compensation of expenses is possible. The details, including general information about the awards and the instructions of application, will be announced later on the website. A NOTE ON HOTEL-ROOM BOOKING As the hotel rooms are usually in high demand, it is strongly recommended that as long as you intend to submit an abstract, please send us a note at your convenience: the earlier we get your note, the easier we can secure the room-booking for you. ORGANIZATION COMMITTEE (in alphabetical order): Duen-Min Deng (National Taiwan University) Kok Yong Lee (National Chung Cheng University) Churn-Jung Liau (Academia Sinica) Hsuan-Chih Lin (Birkbeck, University of London) Hiroakira Ono (Japan Advanced Institute of Science and Technology) Shih-Ping Tung (Chung Yuan Christian University) Syraya Chin-Mu Yang (National Taiwan University) Jiji Zhang (Lingnan University) FURTHER CONTACT: Hsuan-Chih Lin [azurviolet(a)gmail.com <mailto:azurviolet@gmail.com>] Duen-Min Deng [dmdeng(a)ntu.edu.tw <mailto:dmdeng@ntu.edu.tw>] Kok Yong Lee [kokyonglee.mu(a)gmail.com <mailto:kokyonglee.mu@gmail.com>]

1 0

Prof. Helmut Schwichtenberg at NII Logic Seminar
by Makoto Tatsuta 27 Mar '18

27 Mar '18

Prof. Helmut Schwichtenberg at NII Logic Seminar Date: April 2, 2018, 14:00--16:00 Place: National Institute of Informatics, Room 1208 (12th floor) 場所: 国立情報学研究所 12階 1208室 (半蔵門線,都営地下鉄三田線・新宿線神保町駅または東西線竹橋駅より徒歩5分) (地図 http://www.nii.ac.jp/about/access/) Speaker: Helmut Schwichtenberg (Munchen University) Title: Logic for exact real arithmetic Abstract: Real numbers in the exact (as opposed to floating-point) sense can be given in different formats, for instance as Cauchy sequences (of rationals, with Cauchy modulus), or else as infinite sequences (streams) of (i) signed digits -1, 0, 1 or (ii) -1, 1, bot containing at most one copy of bot (meaning undefinedness), so-called Gray code (di Gianantonio 1999, Tsuiki 2002). We are interested in formally verified algorithms on real numbers given as streams. To this end we consider formal (constructive) existence proofs M and apply a proof theoretic method (realizability) to extract their computational content. We switch between different representations of reals by labelling universal quantifiers on reals x as non-computational and then relativising x to a predicate CoI coinductively defined in such a way that the computational content of x in CoI is a stream representing x. The desired algorithm is obtained as the extracted term of the existence proof M, and the required verification is provided by a formal soundness proof of the realizability interpretation. As an example we consider multiplication of reals. This is a joint work with Ulrich Berger, Kenji Miyamoto and Hideki Tsuiki. 問合せ先: 龍田真 (国立情報学研究所) e-mail: tatsuta(a)nii.ac.jp http://research.nii.ac.jp/~tatsuta

1 0

CFP: 49th TRS Meeting at Ikaho
by Fujita Kenetsu 16 Mar '18

16 Mar '18

皆様，第49回TRS Meetingのご案内をさせて頂きます．どうぞよろしくお願いいたします．藤田憲悦（群馬大学） ============================================================== Call For Participation 49th TRS Meeting September 25 -- 27, 2018 Ikaho, Gunma * About TRS meeting Term Rewriting Meeting (TRS Meeting) is a biannual informal workshop that aims at promoting the research on rewriting and related areas. Participants are requested to give a talk(s) of approximately 15 - 60 minutes in English on their research activities. See also Rewriting Researchers Forum for further information: http://www.jaist.ac.jp/~hirokawa/trs-meeting/ We should like to invite all of you to the upcoming TRS Meeting at Ikaho, Gunma. * Information Date: September 25 (Tues) -- 27 (Thur), 2018 Venue: Ikaho Onsen, Nagomigokoro No Yado Omori: http://www.ikaho-omori.com/eng/ 58 Ikaho, Shibukawa city, Gunma 371-0102 Access: http://www.ikaho-omori.com/eng/ * Schedule Opening: 14:00 on Sept 25 (Tues) Closing: 12:00 on Sept 27 (Thur) * Fee Registration for meeting room fee, tea and snacks at breaks: 4,000 JPY Accommodation fee including breakfasts and dinners (lunches are not included): A shared room with four (10,950　JPY per night) A shared room with three (11,490　JPY per night) (A six-mat single room (12,030 JPY per night) but limited to several) * Registration form Please send the registration form below to Ken-etsu Fujita (mailto: fujita at cs.gunma-u.ac.jp) no later than August 24, 2018. Registration after the deadline is subject to room availability. ------------------------------------------------------------------------------------------------------------- Registration Form of the 49th TRS meeting name: affiliation: [male / female] (leave one) special room request: [single room / shared room / none] (leave one) -------------------------------------------------------------------------------------------------------------- Japanese style shared rooms are default, but several single are also available. If you prefer a single, let me know at your earliest convenience. In the latter case, let me also know your roommate. * Contact Ken-etsu Fujita (mailto: fujita at cs.gunma-u.ac.jp) ==============================================================

1 0

「ポアンカレとワイルの数学の哲学」Gray教授連続講義と討論会　慶応大三田キャンパス（3月28日）
by Yuta Takahashi 14 Mar '18

14 Mar '18

みなさま、重複して受け取られた場合はどうかご容赦願います。名古屋大学・JSPSの高橋優太と申します。 3月28日に、Jeremy Gray教授による以下の連続講義及び討論会が、慶応大学三田キャンパスにて開催されます。どうぞご参加ください。高橋優太 yuuta.taka84(a)gmail.com ************************************************************ *********************** 「ポアンカレとワイルの数学の哲学」Gray教授連続講義と討論会（3月28日） Philosophy of Mathematics of Poincare and Weyl Two lectures by Professor Jeremy Gray and Discussion 3月28日 (水) 15:00-18:00 Wed., Mar. 28th 慶應大三田キャンパス東館4階セミナー室（オープンラボ） Mita Campus, Keio University, Meeting Room, 4F of East Research Building （Gray教授のBiographyおよびAbstractsは下にあります。）（最新情報 http://abelard.flet.keio.ac.jp/seminar/poincare-and-weyl-2018/ ） ************************************************************ *********************** 場所 Venue: 慶應義塾大学三田キャンパス東館4階セミナー室（オープンラボ）（東館は下記キャンパスマップの3です） Mita Campus, Keio University, Meeting Room, 4F of East Research Building (Number 3 of the Campus Map below) 構内図 Campus Map: https://www.keio.ac.jp/en/maps/mita.html 日時 Date & Time: 3月28日（水） 15:00-18:00 Wed., Mar. 28th プログラム Program: 15:00-16:00 The philosophy of mathematics of Henri Poincaré 16:00-17:00 The philosophy of mathematics of Hermann Weyl 17:00-18:00 Discussion Gray教授プロフィールと各講義のアブストラクトが下にあります。このMeetingは名古屋大学情報学研究科・久木田水生先生のご協力により実現いたしました。最新情報は http://abelard.flet.keio.ac.jp/seminar/poincare-and-weyl-2018/ 及び http://www.carls.keio.ac.jp/gcarls/ にあります。問い合わせ先：慶應義塾大学文学部哲学専攻岡田光弘研究室事務局アドレス logic(a)abelard.flet.keio.ac.jp 主催：慶應義塾大学論理と感性のグローバル研究センター 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. Abstracts: Poincaré on proof and understanding Poincaré has an exaggerated reputation not being rigorous in his work. In this talk I shall show that he cared about rigour in mathematics, but had justified criticisms of it. However, the more important task was to understand mathematics and physics, and this meant to be enabled to discover new ideas. Certainty in abstract mathematics was provided by the principle of recurrence, which imposed limits on any theory of sets. Thereafter, a pragmatic sense of certainty was provided in applied mathematics and physics by the use of conventions. Conventions, he believed, govern our choice of a geometry for space and the choice of the laws of mechanics and other branches of physics. Objectivity, he said, depended on discourse, and I shall argue that Poincaré’s fundamental position is that the use of mathematics in science is close to Wittgenstein’s idea of a language game. The philosophy of Hermann Weyl By 1910, the year he turned 25, Weyl was developing a finitist philosophy of mathematics, based on a logical theory of relations. He also believed that the human mind can understand ideas only sequentially. He developed this approach on his book The Continuum (1918), and for a time came close to agreeing with Brouwer’s intuitionism, but he abandoned them in the mid-1920s when he became involved in exploring the theory of Lie groups. He then had to turn back towards Hilbert’s ideas about mathematics and physics, and developed his own theory of what he called the symbolic universe in which mathematics and physics supported each other in complementary ways. Weyl sought a unified philosophy that would govern not only his scientific practice but be rooted in a theory of knowledge and an understanding of how it is acquired. Jeremy Gray Open University, Milton Keynes, MK7 6AA, U.K. and University of Warwick, Coventry, CV4 7AL, U.K.

1 0

Lectures by Prof. Jeremy Gray
by 久木田水生 13 Mar '18

13 Mar '18

皆さま、重複して受け取られた方はご容赦願います。名古屋大学情報学研究科の久木田水生です。数学者であり数学史研究家の Jeremy Gray 教授の講演が3月28日に慶應大学、4月2日に京都大学、4月7日に名古屋大学にて開催されます。いずれも参加費無料、事前登録は不要です。どうぞ奮ってご参加ください。時間・場所、タイトル、要旨、プロフィールなどはこちらのウェブページ http://www.is.nagoya-u.ac.jp/dep-ss/phil/kukita/seminars/jeremy-gray.html または本メールの末尾をご覧ください。なお4月7日の講演は応用哲学会年次大会の中のシンポジウムとして開催され、大会には参加費がかかりますが、シンポジウムのみの聴講は無料です。このシンポジウムでは Gray 教授に加え、林晋教授（京都大学文学研究科）も登壇されます。どうぞよろしくお願いいたします。久木田水生ーーーーーーーーーーーーーーーーー Lectures by Prof. Jeremy Gray March 28th, 2018, Keio University Time: 15:00-18:00 Place: Meeting room, 4F of East Research Building, Keio University Mita Campus. (Building No. 3 of this map: https://www.keio.ac.jp/en/maps/mita.html) Lecture 1 (15:00-16:00): ``Poincaré on proof and understanding'' Poincaré has an exaggerated reputation not being rigorous in his work. In this talk I shall show that he cared about rigour in mathematics,but had justified criticisms of it. However, the more important task was to understand mathematics and physics, and this meant to be enabled to discover new ideas. Certainty in abstract mathematics was provided by the principle of recurrence, which imposed limits on any theory of sets. Thereafter, a pragmatic sense of certainty was provided in applied mathematics and physics by the use of conventions. Conventions, he believed, govern our choice of a geometry for space and the choice of the laws of mechanics and other branches of physics. Objectivity, he said, depended on discourse, and I shall argue that Poincaré’s fundamental position is that the use of mathematics in science is close to Wittgenstein’s idea of a language game. Lecture 2 (16:00-17:00): ``The philosophy of Hermann Weyl'' By 1910, the year he turned 25, Weyl was developing a finitist philosophy of mathematics, based on a logical theory of relations. He also believed that the human mind can understand ideas only sequentially. He developed this approach on his book The Continuum (1918), and for a time came close to agreeing with Brouwer’s intuitionism, but he abandoned them in the mid-1920s when he became involved in exploring the theory of Lie groups. He then had to turn back towards Hilbert’s ideas about mathematics and physics, and developed his own theory of what he called the symbolic universe in which mathematics and physics supported each other in complementary ways. Weyl sought a unified philosophy that would govern not only his scientific practice but be rooted in a theory of knowledge and an understanding of how it is acquired. April 2nd, 2018, Kyoto University Time: 16:30-18:00 Place: Large conference room in the basement, Faculty of Letters Main Building, Yoshida Campus, Kyoto University. (No. 8 of this map: http://www.kyoto-u.ac.jp/en/access/yoshida/main.html) ``The philosophy of Hermann Weyl'' By 1910, the year he turned 25, Weyl was developing a finitist philosophy of mathematics, based on a logical theory of relations. He also believed that the human mind can understand ideas only sequentially. He developed this approach on his book The Continuum (1918), and for a time came close to agreeing with Brouwer’s intuitionism, but he abandoned them in the mid-1920s when he became involved in exploring the theory of Lie groups. He then had to turn back towards Hilbert’s ideas about mathematics and physics, and developed his own theory of what he called the symbolic universe in which mathematics and physics supported each other in complementary ways. Weyl sought a unified philosophy that would govern not only his scientific practice but be rooted in a theory of knowledge and an understanding of how it is acquired. April 7th, Nagoya University: Symposium on Modernism and Modernisation of Mathematics Time: 16:15-18:35 Place: Room A31, Liberal Arts and Sciences Building A, Higashiyama Campus, Nagoya University. (No. A4(1) of this map: http://en.nagoya-u.ac.jp/map/index.html) 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 20 th 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. Contact Information Minao Kukita (久木田水生), minao.kukita(a)i.nagoya-u.ac.jp

1 0

Project colloquium talk by Thorsten Wissman on 15 March
by urabenatsuki＠is.s.u-tokyo.ac.jp 13 Mar '18

13 Mar '18

[Apologies for multiple copies] Dear all, Let me advertise our next ERATO MMSD project colloquium talk by Thorsten Wissman on 15 March, 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 ----- Thu 15 March 2017, 16:30–18:00 ERATO MMSD Takebashi Site Common Room 3 http://group-mmm.org/eratommsd/access.html Thorsten Wissman (FAU Erlangen-Nürnberg), Efficient Coalgebraic Partition Refinement This talk presents a generic partition refinement algorithm that quotients coalgebraic systems by behavioural equivalence. Coalgebraic generality implies in particular that not only classical relational systems are covered but also various forms of weighted systems. Under assumptions on the type functor that allow representing its finite coalgebras in terms of nodes and edges, the generic algorithm runs in time O(m⋅log n) where n and m are the numbers of nodes and edges, respectively. Instances of the generic algorithm thus match the runtime of the best known algorithms for unlabelled transition systems, Markov chains, and deterministic automata (with fixed alphabets), and improve the best known algorithms for Segala systems.

1 0

25th WoLLIC 2018 (Bogotá, Colombia) - DEADLINE EXTENDED
by 小野寛晰 12 Mar '18

12 Mar '18

[Apologies for multiple copies.] DEADLINE EXTENDED WoLLIC 2018 25th Workshop on Logic, Language, Information and Computation July 24th to 27th, 2018 Bogotá, Colombia SCIENTIFIC SPONSORSHIP Interest Group in Pure and Applied Logics (IGPL) The Association for Logic, Language and Information (FoLLI) Association for Symbolic Logic (ASL) European Association for Theoretical Computer Science (EATCS) European Association for Computer Science Logic (EACSL) ACM Special Interest Group on Logic and Computation (ACM-SIGLOG) (TBC) Sociedade Brasileira de Computação (SBC) Sociedade Brasileira de Lógica (SBL) ORGANISATION Departamento de Matemáticas, Universidad de los Andes, Colombia Centro de Informática, Universidade Federal de Pernambuco, Brazil HOSTED BY Departamento de Matemáticas, Universidad de los Andes, Colombia CALL FOR PAPERS WoLLIC is an annual international forum on inter-disciplinary research involving formal logic, computing and programming theory, and natural language and reasoning. Each meeting includes invited talks and tutorials as well as contributed papers. The twenty-fifth WoLLIC will be held at the Departamento de Matemáticas of the Universidad de los Andes, Bogotá, Colombia, from July 24th to 27th, 2018. It is sponsored by the Association for Symbolic Logic (ASL), the Interest Group in Pure and Applied Logics (IGPL), the The Association for Logic, Language and Information (FoLLI), the European Association for Theoretical Computer Science (EATCS), the European Association for Computer Science Logic (EACSL), ACM Special Interest Group on Logic and Computation (ACM-SIGLOG) (TBC), the Sociedade Brasileira de Computação (SBC), and the Sociedade Brasileira de Lógica (SBL). PAPER SUBMISSION Contributions are invited on all pertinent subjects, with particular interest in cross-disciplinary topics. Typical but not exclusive areas of interest are: foundations of computing and programming; novel computation models and paradigms; broad notions of proof and belief; proof mining, type theory, effective learnability; formal methods in software and hardware development; logical approach to natural language and reasoning; logics of programs, actions and resources; foundational aspects of information organization, search, flow, sharing, and protection; foundations of mathematics; philosophy of mathematics; philosophical logic; philosophy of language. Proposed contributions should be in English, and consist of a scholarly exposition accessible to the non-specialist, including motivation, background, and comparison with related works. Articles should be written in the LaTeX format of LNCS by Springer (see authors instructions at http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0 <http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0>). They must not exceed 12 pages, with up to 5 additional pages for references and technical appendices. The paper's main results must not be published or submitted for publication in refereed venues, including journals and other scientific meetings. It is expected that each accepted paper be presented at the meeting by one of its authors. (At least one author is required to pay the registration fee before granting that the paper will be published in the proceedings.) Papers must be submitted electronically at the WoLLIC 2018 EasyChair website. (Please go to http://wollic.org/wollic2018/instructions.html <http://wollic.org/wollic2018/instructions.html> for instructions.) A title and single-paragraph abstract should be submitted by Mar 18, 2018, and the full paper by Mar 25, 2018 (firm date). Notifications are expected by Apr 15, 2018, and final papers for the proceedings will be due by Apr 22, 2018 (firm date). PROCEEDINGS The proceedings of WoLLIC 2018, including both invited and contributed papers, will be published in advance of the meeting as a volume in Springer's LNCS series. In addition, abstracts will be published in the Conference Report section of the Logic Journal of the IGPL, and selected contributions will be published (after a new round of reviewing) as a special post-conference WoLLIC 2018 issue of a scientific journal (to be confirmed). INVITED SPEAKERS Katalin Bimbo (Univ of Alberta, Canada) Xavier Caicedo (Univ de Los Andes, Colombia) José Meseguer (Univ of Illinois, Urbana-Champaign, USA) Elaine Pimentel (Univ Federal do Rio Grande do Norte, Brazil) Guillermo Simari (Univ Nacional del Sur, Argentina) Renata Wassermann (Univ de São Paulo, Brazil) SPECIAL SCREENING - A TRIBUTE TO THE MEMORY AND LEGACY OF RAYMOND SMULLYAN As a tribute to the memory and legacy of the late Raymond Smullyan, who passed away in February 2017, there will be a special session with a screening of the documentary film "This Film Needs No Title: A Portrait of Raymond Smullyan" (Dir. Tao Ruspoli, 2006, 30min), as well as short testimonies by experts. STUDENT GRANTS ASL sponsorship of WoLLIC 2018 will permit ASL student members to apply for a modest travel grant (deadline: May 1st, 2018). See http://www.aslonline.org/studenttravelawards.html <http://www.aslonline.org/studenttravelawards.html> for details. IMPORTANT DATES Mar 18, 2018: Paper title and abstract deadline (EXTENDED) Mar 25, 2018: Full paper deadline (EXTENDED) Apr 15, 2018: Author notification Apr 22, 2018: Final version deadline (firm) PROGRAMME COMMITTEE Siddharth Bhaskar (Haverford College, USA) Torben Braüner (Roskilde University, Denmark) Hazel Brickhill (University of Bristol, UK) Michael Detlefsen (University of Notre Dame, USA) Juliette Kennedy (University of Helsinki, Finland) Sophia Knight (Uppsala University, Sweden) Alex Kruckman (Indiana University, USA) Maricarmen Martinez Baldares (Universidad de los Andes, Colombia) Frederike Moltmann (CNRS, France) Lawrence Moss (Indiana University, USA) (CHAIR) Cláudia Nalon (University of Brasília, Brazil) Valeria de Paiva (Nuance Comms, USA, and University of Birmingham, UK) Sophie Pinchinat (IRISA Rennes, France) David Pym (University College London, UK) Ruy de Queiroz (Univ Federal de Pernambuco, Brazil) Revantha Ramanayake (Vienna University of Technology, Austria) Giselle Reis (Carnegie Mellon University, Qatar) Jeremy Seligman (The University of Auckland, New Zealand) Yanjing Wang (Peking University, China) Fan Yang (Delft University of Technology, The Netherlands) STEERING COMMITTEE Samson Abramsky, Johan van Benthem, Anuj Dawar, Joe Halpern, Wilfrid Hodges, Juliette Kennedy, Ulrich Kohlenbach, Daniel Leivant, Leonid Libkin, Angus Macintyre, Luke Ong, Hiroakira Ono, Valeria de Paiva, Ruy de Queiroz, Jouko Väänänen. (Former Member: Grigori Mints (deceased).) ORGANISING COMMITTEE Jaime A. Bohórquez (Escuela Colombiana de Ingeniería, Bogotá, Colombia) Xavier Caicedo (Universidad de los Andes, Colombia) (Local co-chair) Nicolás Cardozo (Universidad de los Andes, Bogotá, Colombia) Maricarmen Martínez (Universidad de los Andes, Colombia) (Local co-chair) Anjolina G. de Oliveira (Univ Federal de Pernambuco, Brasil) Ruy de Queiroz (Univ Federal de Pernambuco, Brasil) (co-chair) Camilo Rocha (Universidad Javeriana, Cali, Colombia) FURTHER INFORMATION Contact one of the Co-Chairs of the Organising Committee. WEB PAGE http://wollic.org/wollic2018/ <http://wollic.org/wollic2018/>

1 0

名古屋ロジックセミナー (3/12) のお知らせ
by Takayuki Kihara 10 Mar '18

10 Mar '18

皆様名古屋大学の木原貴行です．以下の要領で名古屋ロジックセミナーを開催します．多数のご参加をお待ちしております．名古屋ロジックセミナー http://www.math.mi.i.nagoya-u.ac.jp/~kihara/logic-seminar.html 日時：3月12日 (月) 15:30〜場所：名古屋大学大学院情報学研究科棟 314室講演者：Vassilios Gregoriades (トリノ大学) 題目： The Preiss Separation Theorem uniformly アブストラクト： The typical example of a uniformity-type result in descriptive set theory is the Souslin-Kleene Theorem, which says that the separation property of the class of analytic sets can be witnessed by a recursive function in the codes. An important consequence of the latter is the extension of the result HYP = effectively bi-analytic, in all recursive Polish spaces. In this talk we present the uniform version of a separation result by Preiss that deals with the convex analytic subsets of the Euclidean space. We show that the separation can be realized by a HYP function in the codes. Similarly to the case of the Souslin-Kleene Theorem, we conclude that every HYP convex subset of the Euclidean space can be obtained from the class of HYP compact convex sets by taking HYP increasing unions and HYP intersections. -------- Takayuki Kihara Graduate School of Informatics, Nagoya University, Japan URL: http://math.mi.i.nagoya-u.ac.jp/~kihara/index-j.html Email: kihara(a)i.nagoya-u.ac.jp

1 0

Asian Workshop on Philosophical Logic (AWPL 2018)
by 小野寛晰 10 Mar '18

10 Mar '18

CFP – AWPL 2018 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: 1 June 2018, 24:00 (UTC -12:00) Notification: 1 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.

2 1

QIT38のご案内
by NISHIMURA Harumichi 07 Mar '18

07 Mar '18

logic-mlの皆さま名古屋大学の西村です．第38回量子情報技術研究会(QIT38)の会告を代理投稿させていただきます．どうぞ宜しくお願いいたします．名古屋大学大学院情報学研究科西村治道 ------------------ QIT38会告文 ------------------------------- 第38回量子情報技術研究会(QIT38) 研究会の内容：情報科学と量子力学を融合させた新しい分野、量子情報科学に関する研究会です．情報を担う物理系の量子力学的側面を積極的に活かした新しい情報処理原理の研究とそこから開かれる新しい学問体系の構築および新しい情報技術パラダイムの創生を目指して，情報科学，物理学，光エレクトロニクスを含む理学，工学，数理科学に携わる研究者間に自由な討論の場を提供し，この研究分野の発展を図ることを目的としています．第38回研究会を下記のように開催いたします．現在この分野で活躍する研究者は勿論，自分の研究資産が何らかの形で使えそうだと予感している研究者・技術者など，広く関連する分野の研究者・技術者からの発表を募集致します．聴講のみの参加も歓迎致しますので，奮ってお申し込みください．なお本研究会から学生発表賞を創設いたしました．応募方法等詳細は下記QITウェブサイトをご確認下さい．日時: 2018年6月4日(月)-5日(火) 会場: 広島国際会議場小会議室ラン (〒730-0811広島市中区中島町1-5 <https://maps.google.com/?q=730-0811%E5%BA%83%E5%B3%B6%E5%B8%82%E4%B8%AD%E5%…> 平和記念公園内) 発表募集分野 (申し込み状況によっては査読の可能性あり)：量子情報，量子計算，量子暗号など広く量子情報技術に関わる理論的研究，実験的研究，計算機科学的研究，数学的研究，および，その他関連分野．定員: 150名参加費: 事前振込み一般4,000円，学生3,000円 (当日会場払いは一般5,000円，学生4,000円) (懇親会は別途) 研究会参加申込要領：参加申込は下記 Web にて受付けます： http://staff.aist.go.jp/s-kawabata/qit/ 講演 (口頭，ポスター) の申込，予稿集原稿 PDF の提出は，電子情報通信学会の Web システムを使用する予定．【口頭講演申込締切】2018年4月6日(金) 【ポスター講演申込締切】2018年4月20日(金) 【予稿原稿提出締切】2018年4月25日(水) 【参加申込締切】2018年5月7日(火) 【問合せ先】飯沼昌隆(広島大学先端物質科学研究科) 石坂智(広島大学総合科学研究科) 廣川真男(広島大学工学研究科) ホフマンホルガ(広島大学先端物質研究科) Email: qit38(a)ml.hiroshima-u.ac.jp 主催: 量子情報技術特別研究専門委員会 (委員長: 竹内繁樹(京都大学)) 共催: 応用物理学会量子エレクトロニクス研究会助成: 中国電力技術研究財団 ------------------------------------------------------------ -------------------------------

1 0

Int. Workshop on External and Internal Calculi for Non Classical Logics (EICNCL 2018, Deadline for submission: 23 April 2018)
by Katsuhiko Sano 07 Mar '18

07 Mar '18

-------------------------------------------------------------------------------------- Call For Papers Int. Workshop on External and Internal Calculi for Non Classical Logics (EICNCL 2018) Oxford, UK, 19 July 2018 (affiliated with IJCAR 2018 in FLOC 2018) http://weic2018.loria.fr/ Deadline for submission: 23 April 2018 ---------------------------------------------------------------------- ------------------- A one day workshop on External and Internal Calculi for Non Classical Logics will be held the 19 July 2018 in conjunction with the IJCAR 2018 Conference during FLOC 2018 in Oxford, UK. The purpose of this workshop would be to discuss recent results on analytic (external or internal) calculi for non-classical logics like intuitionistic, modal, epistemic logics, conditional logics, substructural, resouce logics, and other logical systems. Among some key points we can mention the relationships between internal and external calculi for such logics and also their use for studying proof-search, automated deduction (proof-theory and implementation) and also logical properties like decidability, conservativity, axiomatisations and interpolation. The workshop is intended to provide a forum for discussion between researchers interested in topics including, but not limited to, the following areas: - External and internal calculi for non-classical logics - Relationships and embeddings (translations) between calculi, interactions between syntax and semantics - New calculi for studying problems like decidability, conservativity and interpolation - Proof-search and countermodel generation - Methodologies and tools for translations between calculi - Implementations of analytic calculi, proof assistants We envisage a range of perspectives: proof-theoretic foundations, including decidability and complexity; model-theoretic, including semantic foundations (e.g., new semantics), modelling and verification of programs and systems. SUBMISSIONS Researchers interested in presenting their works are invited to submit an extended abstract (up to 10 pages) through Easychair : https://easychair.org/conferences/?conf=eicncl2018 by 23 April 2018. Papers will be reviewed by peers, typically members of the Programme Committee. A Special Issue of a Journal on these topics is expected after the workshop. PROGRAM COMMITTEE J. Brotherston (University College, London, UK) A. Ciabattoni (TU Vienna, Austria - co-chair) D. Galmiche (Lorraine University, CNRS, LORIA, France - co-chair) R. Goré (Australian National University, Australia) D. Larchey-Wendling (Lorraine University, CNRS, LORIA, France) G. Metcalfe (University of Bern, Switzerland) S. Negri (University of Helsinki, Finland) N. Olivetti (LSIS, Aix-Marseille University, France - co-chair) J. Otten (University of Oslo, Norway) V. de Paiva (Nuance communications, USA) R. Ramanayake (TU Vienna, Austria - co-chair) K. Sano (Hokkaido University, Japan) L. Santocanale (LIF, Aix-Marseille University, France) S. Smets (ILLC, Amsterdam University, Netherlands) L. Vigano (King's College London, UK) IMPORTANT DATES Submission deadline: 23 April 2018 Notification to authors: 9 May 2018 Final versions due: 21 May 2018 Workshop date: 19 July 2018 Additional information will be available through WWW address: http://weic2018.loria.fr/ The workshop is co-organized by A. Ciabattoni, R. Ramanayake (TU Vienna), N. Olivetti (LSIS, Aix-marseille University) and D. Galmiche (LORIA - Lorraine University)

1 0

名古屋ロジックセミナー (3/9) のお知らせ
by Takayuki Kihara 05 Mar '18

05 Mar '18

皆様名古屋大学の木原貴行です．以下の要領で名古屋ロジックセミナーを開催します．多数のご参加をお待ちしております．名古屋ロジックセミナー http://www.math.mi.i.nagoya-u.ac.jp/~kihara/logic-seminar.html 日時：3月9日 (金) 15:30〜場所：名古屋大学大学院情報学研究科棟 314室講演者：薄葉季路 (早稲田大学)　題目： Extendible cardinals and the mantle アブストラクト： Mantle は V のすべての ground model の共通部分として定義される inner model であるが、mantle 自身は ground model である必要はない。一方で、ある超巨大基数が存在するならば mantle 自身が ground model になることが知られている。本講演では、巨大基数の仮定を弱めて、 extendible cardinal の存在から mantle が ground model になることを証明する。 -------- Takayuki Kihara Graduate School of Informatics, Nagoya University, Japan URL: http://math.mi.i.nagoya-u.ac.jp/~kihara/index-j,html Email: kihara(a)i.nagoya-u.ac.jp

1 0

25th WoLLIC 2018 (Bogotá, Colombia) - DEADLINE APPROACHING
by 小野寛晰 05 Mar '18

05 Mar '18

[Apologies for multiple copies.] DEADLINE APPROACHING WoLLIC 2018 25th Workshop on Logic, Language, Information and Computation July 24th to 27th, 2018 Bogotá, Colombia SCIENTIFIC SPONSORSHIP Interest Group in Pure and Applied Logics (IGPL) The Association for Logic, Language and Information (FoLLI) Association for Symbolic Logic (ASL) European Association for Theoretical Computer Science (EATCS) European Association for Computer Science Logic (EACSL) ACM Special Interest Group on Logic and Computation (ACM-SIGLOG) (TBC) Sociedade Brasileira de Computação (SBC) Sociedade Brasileira de Lógica (SBL) ORGANISATION Departamento de Matemáticas, Universidad de los Andes, Colombia Centro de Informática, Universidade Federal de Pernambuco, Brazil HOSTED BY Departamento de Matemáticas, Universidad de los Andes, Colombia CALL FOR PAPERS WoLLIC is an annual international forum on inter-disciplinary research involving formal logic, computing and programming theory, and natural language and reasoning. Each meeting includes invited talks and tutorials as well as contributed papers. The twenty-fifth WoLLIC will be held at the Departamento de Matemáticas of the Universidad de los Andes, Bogotá, Colombia, from July 24th to 27th, 2018. It is sponsored by the Association for Symbolic Logic (ASL), the Interest Group in Pure and Applied Logics (IGPL), the The Association for Logic, Language and Information (FoLLI), the European Association for Theoretical Computer Science (EATCS), the European Association for Computer Science Logic (EACSL), ACM Special Interest Group on Logic and Computation (ACM-SIGLOG) (TBC), the Sociedade Brasileira de Computação (SBC), and the Sociedade Brasileira de Lógica (SBL). PAPER SUBMISSION Contributions are invited on all pertinent subjects, with particular interest in cross-disciplinary topics. Typical but not exclusive areas of interest are: foundations of computing and programming; novel computation models and paradigms; broad notions of proof and belief; proof mining, type theory, effective learnability; formal methods in software and hardware development; logical approach to natural language and reasoning; logics of programs, actions and resources; foundational aspects of information organization, search, flow, sharing, and protection; foundations of mathematics; philosophy of mathematics; philosophical logic; philosophy of language. Proposed contributions should be in English, and consist of a scholarly exposition accessible to the non-specialist, including motivation, background, and comparison with related works. Articles should be written in the LaTeX format of LNCS by Springer (see authors instructions at http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0 <http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0>). They must not exceed 12 pages, with up to 5 additional pages for references and technical appendices. The paper's main results must not be published or submitted for publication in refereed venues, including journals and other scientific meetings. It is expected that each accepted paper be presented at the meeting by one of its authors. (At least one author is required to pay the registration fee before granting that the paper will be published in the proceedings.) Papers must be submitted electronically at the WoLLIC 2018 EasyChair website. (Please go to http://wollic.org/wollic2018/instructions.html <http://wollic.org/wollic2018/instructions.html> for instructions.) A title and single-paragraph abstract should be submitted by Mar 11, 2018, and the full paper by Mar 18, 2018 (firm date). Notifications are expected by Apr 15, 2018, and final papers for the proceedings will be due by Apr 22, 2018 (firm date). PROCEEDINGS The proceedings of WoLLIC 2018, including both invited and contributed papers, will be published in advance of the meeting as a volume in Springer's LNCS series. In addition, abstracts will be published in the Conference Report section of the Logic Journal of the IGPL, and selected contributions will be published (after a new round of reviewing) as a special post-conference WoLLIC 2018 issue of a scientific journal (to be confirmed). INVITED SPEAKERS Katalin Bimbo (Univ of Alberta, Canada) Xavier Caicedo (Univ de Los Andes, Colombia) José Meseguer (Univ of Illinois, Urbana-Champaign, USA) Elaine Pimentel (Univ Federal do Rio Grande do Norte, Brazil) Guillermo Simari (Univ Nacional del Sur, Argentina) Renata Wassermann (Univ de São Paulo, Brazil) SPECIAL SCREENING - A TRIBUTE TO THE MEMORY AND LEGACY OF RAYMOND SMULLYAN As a tribute to the memory and legacy of the late Raymond Smullyan, who passed away in February 2017, there will be a special session with a screening of the documentary film "This Film Needs No Title: A Portrait of Raymond Smullyan" (Dir. Tao Ruspoli, 2006, 30min), as well as short testimonies by experts. STUDENT GRANTS ASL sponsorship of WoLLIC 2018 will permit ASL student members to apply for a modest travel grant (deadline: May 1st, 2018). See http://www.aslonline.org/studenttravelawards.html <http://www.aslonline.org/studenttravelawards.html> for details. IMPORTANT DATES Mar 11, 2018: Paper title and abstract deadline Mar 18, 2018: Full paper deadline Apr 15, 2018: Author notification Apr 22, 2018: Final version deadline (firm) PROGRAMME COMMITTEE Siddharth Bhaskar (Haverford College, USA) Torben Braüner (Roskilde University, Denmark) Hazel Brickhill (University of Bristol, UK) Michael Detlefsen (University of Notre Dame, USA) Juliette Kennedy (University of Helsinki, Finland) Sophia Knight (Uppsala University, Sweden) Alex Kruckman (Indiana University, USA) Maricarmen Martinez Baldares (Universidad de los Andes, Colombia) Frederike Moltmann (CNRS, France) Lawrence Moss (Indiana University, USA) (CHAIR) Cláudia Nalon (University of Brasília, Brazil) Valeria de Paiva (Nuance Comms, USA, and University of Birmingham, UK) Sophie Pinchinat (IRISA Rennes, France) David Pym (University College London, UK) Ruy de Queiroz (Univ Federal de Pernambuco, Brazil) Revantha Ramanayake (Vienna University of Technology, Austria) Giselle Reis (Carnegie Mellon University, Qatar) Jeremy Seligman (The University of Auckland, New Zealand) Yanjing Wang (Peking University, China) Fan Yang (Delft University of Technology, The Netherlands) STEERING COMMITTEE Samson Abramsky, Johan van Benthem, Anuj Dawar, Joe Halpern, Wilfrid Hodges, Juliette Kennedy, Ulrich Kohlenbach, Daniel Leivant, Leonid Libkin, Angus Macintyre, Luke Ong, Hiroakira Ono, Valeria de Paiva, Ruy de Queiroz, Jouko Väänänen. (Former Member: Grigori Mints (deceased).) ORGANISING COMMITTEE Jaime A. Bohórquez (Escuela Colombiana de Ingeniería, Bogotá, Colombia) Xavier Caicedo (Universidad de los Andes, Colombia) (Local co-chair) Nicolás Cardozo (Universidad de los Andes, Bogotá, Colombia) Maricarmen Martínez (Universidad de los Andes, Colombia) (Local co-chair) Anjolina G. de Oliveira (Univ Federal de Pernambuco, Brasil) Ruy de Queiroz (Univ Federal de Pernambuco, Brasil) (co-chair) Camilo Rocha (Universidad Javeriana, Cali, Colombia) FURTHER INFORMATION Contact one of the Co-Chairs of the Organising Committee. WEB PAGE http://wollic.org/wollic2018/ <http://wollic.org/wollic2018/>

1 0

CFP: Workshop on Mathematically Structured Functional Programming
by Shinya KATSUMATA 04 Mar '18

04 Mar '18

国立情報学研究所の勝股です。数学的構造に基づく関数型プログラミング研究のワークショップ MSFP に関してご案内いたします。今回は、6月に開催されるFSCDに併設される形で行われます。ぜひ投稿をご検討ください。 Seventh Workshop on MATHEMATICALLY STRUCTURED FUNCTIONAL PROGRAMMING Sunday 8th July 2018, Oxford, UK A satellite workshop of FSCD 2018 http://msfp2018.bentnib.org/ ** New this time: additional talk proposal category ** ** Deadline: 5th April (abstract), 12th April (paper) ** The seventh workshop on Mathematically Structured Functional Programming is devoted to the derivation of functionality from structure. It is a celebration of the direct impact of Theoretical Computer Science on programs as we write them today. Modern programming languages, and in particular functional languages, support the direct expression of mathematical structures, equipping programmers with tools of remarkable power and abstraction. Where would Haskell be without monads? Functional reactive programming without temporal logic? Call-by-push-value without adjunctions? The list goes on. This workshop is a forum for researchers who seek to reflect mathematical phenomena in data and control. The first MSFP workshop was held in Kuressaare, Estonia, in July 2006, affiliated with MPC 2006 and AMAST 2006. The second MSFP workshop was held in Reykjavik, Iceland as part of ICALP 2008. The third MSFP workshop was held in Baltimore, USA, as part of ICFP 2010. The fourth workshop was held in Tallinn, Estonia, as part of ETAPS 2012. The fifth workshop was held in Grenoble, France, as part of ETAPS 2014. The sixth MSFP Workshop was held in April 2016, in Eindhoven, Netherlands, just after ETAPS 2016. Important Dates: ================ Abstract deadline: 5th April (Thursday) Paper deadline: 12th April (Thursday) Notification: 17th May (Thursday) Final version: 14th June (Thursday) Workshop: 8th July (Sunday) Invited Speakers: ================= - Tamara von Glehn, University of Cambridge, UK - Didier Remy, INRIA, France Program Committee: ================== Andreas Abel - Chalmers, Sweden Danel Ahman - INRIA Paris, France Robert Atkey - University of Strathclyde, UK (co-chair) Jeremy Gibbons - University of Oxford, UK Jennifer Hackett - University of Nottingham, UK Mauro Jaskelioff - Universidad Nacional de Rosario, Argentina Shin-ya Katsumata - National Institute of Informatics, Japan Sam Lindley - University of Edinburgh, UK (co-chair) Clare Martin - Oxford Brookes University, UK Shin-Cheng Mu - Academia Sinica, Taiwan Valeria de Paiva - Nuance Communications, US Alexandra Silva - University College London, UK Submission: =========== Submissions are welcomed on, but by no means restricted to, topics such as: structured effectful computation structured recursion structured corecursion structured tree and graph operations structured syntax with variable binding structured datatype-genericity structured search structured representations of functions structured quantum computation structure directed optimizations structured types structure derived from programs and data Please contact the programme chairs Robert Atkey and Sam Lindley if you have any questions about the scope of the workshop. (New this time) We accept two categories of submission: full papers of no more than 15 pages that will appear in the proceedings, and extended abstracts of no more than 2 pages which we will post on the website, but which do not constitute formal publications and will not appear in the proceedings. References and appendices are not included in page limits. Appendices may not be read by reviewers. Full papers (not two page talk abstracts) must report previously unpublished work and not be submitted concurrently to another conference with refereed proceedings. Accepted papers and talks must be presented at the workshop by at least one of the authors. The proceedings will be published under the auspices of EPTCS with a Creative Commons license. We are using EasyChair to manage submissions. To submit a paper, use this link: https://easychair.org/conferences/?conf=msfp2018.

1 0

Re: [logic-ml] 「ラムダ計算と論理の早春セミナー」開催のお知らせ(3/22~3/25@TUFS田沢湖ロッジ)
by "新屋良磨(秋田大)" 02 Mar '18

02 Mar '18

皆様，秋田大の新屋です．下記の要項で開催する「ラムダ計算と論理の早春セミナー」ですが，まだ田沢湖ロッジでの宿泊人数に余裕があるため，宿泊申し込みを3月9日(金)まで延長したいと思います．参加のご検討のほど，どうぞよろしくお願いします．秋田大学数理科学コース新屋良磨 > On Feb 1, 2018, at 14:41, Ryoma Sin'ya <ryoma(a)math.akita-u.ac.jp> wrote: > > 皆様， > > 秋田大の新屋です． > > 3月22日(木)〜3月25日(日)の期間で田沢湖にて，恒例の「ラムダ計算と論理の早春セミナー」を行うこととなりました． > > 過去のセミナーと同様に「ラムダ計算と論理およびその周辺分野」に関してなごやかな雰囲気で議論できる場としたいと思っております． > 本セミナーは成果発表の場というより成果を挙げる場となっており，講演件数を抑え，残りの時間は個人やグループで柔軟に研究計画をしてもらうようになっています． > 色々な方と交流を持つためにも丁度よいと思いますので，形式等はあまり気にせず，気軽に参加いただけますと幸いです． > > 会場詳細や参加申し込みの方法は以下のWebページを御覧ください． > http://www.math.akita-u.ac.jp/~ryoma/workshop/lls_spring_2018/ <http://www.math.akita-u.ac.jp/~ryoma/workshop/lls_spring_2018/> > > どうぞ，よろしくお願いします． > > 秋田大学数理科学コース新屋良磨

1 0

IWC 2018 (Part of FLoC 2018 at Oxford)
by KIKUCHI Kentaro 02 Mar '18

02 Mar '18

皆様、東北大学の菊池健太郎です。7月にOxfordで開催される合流性に関する国際ワークショップIWC 2018のご案内をさせていただきます。どうぞよろしくお願いいたします。 ----- (* 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 2017. Previous editions of the workshop were held in Nagoya (2012), Eindhoven (2013), Vienna (2014), Berlin (2015), Obergurgl (2016), and Oxford (2017). IMPORTANT DATES: * submission Sunday, April 15th, 2018 * notification Tuesday, May 15th, 2018 * final version Tuesday, May 29th, 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: tba 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

リマインダー：Sakarovitch先生講演会
by "新屋良磨(秋田大)" 28 Feb '18

28 Feb '18

【明日，明後日および明々後日の講演会のリマインダーです】皆様， 2月28日(水)~3月1日(木)，東工大にて両日16:30からSakarovitch先生による連続講演会があります．水曜と木曜で会場が異なりますのでご注意ください． 3月2日(金)にも東大にて13:30からSakarovitch先生の講演会が開催されます．参加のご検討，どうぞよろしくお願いします．秋田大学数理科学コース新屋良磨 > On Feb 9, 2018, at 9:04, 新屋良磨(秋田大) <ryoma(a)math.akita-u.ac.jp <mailto:ryoma@math.akita-u.ac.jp>> wrote: > > (重複で受け取られた方はご容赦ください) > 皆様， > > 秋田大の新屋です． > > 2月28日〜3月1日の東工大でのJacques Sakarovitch先生の連続講演会について，開催時間が変更されましたので， > 概要を改めて再通知させていただきます． > > 同日に東工大にて行われるプログラミング研究会と時間が重なっていたため，開始時刻を遅らせて > Lecture/Seminar ともに16:30からの開始とさせていただきました．＊会場は変更ありません． > > > ========== Lecture ========== > Time: > 16:30 ~ 17:30, February 28, 2018 (Wed.) > > > Venue: > Room W935, West Bldg. 9, Tokyo Institute of Technology (Ookayama Campus) > 　東京工業大学大岡山キャンパス西9号館 W935講義室 (西9号館東側(芝生スロープ側)入口を入って階段を1階上がって左側) > > > Title: > Automata and expressions > > Jacques Sakarovitch > CNRS / Paris Diderot University and Telecom ParisTech > > > Abstract: > Not many results in Computer Science are recognised to be as basic and > fundamental as Kleene Theorem. It states the equality of two sets of > objects that we now call languages. > > In this lecture, I propose a slight change of focus on this result and show > how it is mainly the combination of two families of algorithms: > algorithms that transform an automaton into an expression on one hand > and algorithms that build an automaton from an expression on the other. > > The first purpose is to compare the results of these algorithms, > in order to understand they are indeed not so different. > And also to devise means to keep these results as small as possible. > > The second benefit of isolating this part of Kleene Theorem is to allow > its extension much beyond languages: to subsets of arbitrary monoids > first, and then, with some precaution, to subsets with multiplicity, > that is, to formal power series. > =========================== > > > ========== Seminar ========== > Time: > 16:30 ~ 17:30, March 1, 2018 (Thu.) > > > Venue: > Multi-Purpose Digital Hall, West Bldg. 9, Tokyo Institute of Technology (Ookayama Campus) > 　東京工業大学大岡山キャンパス西9号館ディジタル多目的ホール (西9号館東側(芝生スロープ側)入口を入ってすぐ) > > > Title: > Conjugacy and equivalence of weighted automata > > Jacques Sakarovitch > CNRS / Paris Diderot University and Telecom ParisTech > > > Abstract: > As a main thread of this talk, I present the proof of the following result: > > If two regular languages $L$ and $K$ have the same generating > functions, that is, for every integer $n$ they have the same number of > words of length $n$, there exists a rational bijection realised by a > letter-to-letter transducer that maps $L$ onto $K$. > > This statement is a consequence of a refinement of the decidability of > the equivalence of two automata with multiplicity in $N$. It gives us > the opportunity to review first the basic definitions and results on > weighted finite automata, and second to revisit the `classical' theory > of reduction of automata with two notions borrowed to symbolic > dynamics: conjugacy and the Finite Equivalence Theorem. > =========================== > > > 大岡山キャンパスまでの行き方は以下をご覧ください： > https://www.titech.ac.jp/maps/ <https://www.titech.ac.jp/maps/> > 西9号館までの行き方は > http://www.dst.titech.ac.jp/outline/facility/hall.html <http://www.dst.titech.ac.jp/outline/facility/hall.html> > の中の地図をご覧ください。 > > 以上，どうぞよろしくお願いします． > > 秋田大学数理科学コース新屋良磨 ryoma(a)math.akita-u.ac.jp <mailto:ryoma@math.akita-u.ac.jp> > (共催：東京工業大学情報理工学院鹿島亮) > Begin forwarded message: > > From: "新屋良磨(秋田大)" <ryoma(a)math.akita-u.ac.jp <mailto:ryoma@math.akita-u.ac.jp>> > Subject: [jssst-ppl] Talk by Prof. Jacques Sakarovitch (March 2, 2018) > Date: February 16, 2018 12:14:47 JST > To: logic-ml(a)fos.kuis.kyoto-u.ac.jp <mailto:logic-ml@fos.kuis.kyoto-u.ac.jp>, jssst-ppl(a)fos.kuis.kyoto-u.ac.jp <mailto:jssst-ppl@fos.kuis.kyoto-u.ac.jp> > > (重複で受け取られた方はご容赦ください) > 皆様， > > 秋田大学の新屋です． > > 以下の要領で3/2(金)に東大にてJacques Sakarovitch先生の講演会が開催されます． > > なお，前日(2/28~3/1)の東工大でのSakarovitch先生の連続講演会とは講演内容が別の > 新規なものとなっております．どうぞふるってご参加ください． > > 秋田大学数理科学コース新屋良磨 ryoma(a)math.akita-u.ac.jp <mailto:ryoma@math.akita-u.ac.jp> > > ========== > Time: > 1:30pm, March. 2, 2018 > > > Venue: > Room 236, East Building of Department of Chemistry, Faculty of Science(化学東館), University of Tokyo > > > Title: > Mysteries and marvels of rational base numeration systems > > Jacques Sakarovitch > CNRS / Paris Diderot University and Telecom ParisTech > > > Abstract: > The definition of numeration systems with rational base, in a joint > work with S. Akiyama and Ch. Frougny (Israel J. Math., 2008), > has allowed to make some progress in a number theoretic problem, > by means of automata theory and combinatorics of words. > At the same time, it raised the problem of understanding the > structure of the sets of the representations of the integers in these > systems from the point of view of formal language theory. > > At first sight, these sets look rather chaotic and do not fit well > in the classical Chomsky hierarchy of languages. They all enjoy a > property that makes them defeat, so to speak, any kind of iteration > lemma. On the other hand, these sets also exhibit remarkable > regularity properties. > > During the recent years, these regularities have been studied in a > series of joint papers with my student V. Marsault. In particular, we > have shown that periodic signatures are characteristic of the > representation languages in rational base numeration systems and > studied, jointly with S. Akiyama, a kind of autosimilarity property > that also leads to the construction of Cantor-like sets. > > These languages still keep most of their mystery. The partial results > which will be presented call for further investigations on the subject > even stronger. > ========== > _______________________________________________ > jssst-ppl mailing list > jssst-ppl(a)fos.kuis.kyoto-u.ac.jp <mailto:jssst-ppl@fos.kuis.kyoto-u.ac.jp> > http://www.fos.kuis.kyoto-u.ac.jp/cgi-bin/mailman/listinfo/jssst-ppl <http://www.fos.kuis.kyoto-u.ac.jp/cgi-bin/mailman/listinfo/jssst-ppl>

1 0

ワークショップのお知らせ(3/26~3/29@秋田大)
by Ryoma Sin'ya 26 Feb '18

26 Feb '18

(重複で受け取られた方はご容赦ください) 皆様，秋田大の新屋です．以下の要項で3月末に秋田大にてワークショップを開催いたします．参加申し込みなどは不要ですので，どうぞお気軽にご参加ください．期間： 3月26日のお昼後から3月29日のお昼前まで会場：〒010-8502 秋田市手形学園町1番1号秋田大学手形キャンパス総合研究棟 1階講義室 (学内地図 http://www.akita-u.ac.jp/honbu/info/magazine/outline/pdf/2011/46.pdf <http://www.akita-u.ac.jp/honbu/info/magazine/outline/pdf/2011/46.pdf> ) 講演予定者リスト(敬称略，決定順)：　　根元多佳子 (JAIST)，石原哉 (JAIST)，木原貴行 (名古屋大)，鹿島亮 (東工大)，照井一成 (京大)，　　薄葉季路 (早稲田大)，坪井明人 (筑波大)，金沢誠 (NII)，中野圭介 (電通大) 講演予定者リストは今後更新される可能性があります．また，若干名ですが学生さんにも講演を依頼しているところです． 2月中旬にワークショップのWebページと仮プログラムを公開したいと思います．また，本ワークショップの前日(3/22~3/25)までには秋田県仙北市田沢湖にて「ラムダ計算と論理の早春セミナー」も開催されますので，そちらへのご参加もご一考ください．以上，どうぞよろしくお願いします．秋田大学数理科学コース新屋良磨 ryoma(a)math.akita-u.ac.jp <mailto:ryoma@math.akita-u.ac.jp>

1 1

Project colloquium talk by Étienne André and Bart Jacobs on 1 March
by urabenatsuki＠is.s.u-tokyo.ac.jp 26 Feb '18

26 Feb '18

[Apologies for multiple copies] Dear all, Let me advertise our next ERATO MMSD project colloquium talk by Étienne André and Bart Jacobs on 1 March, 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 ---- Thu 1 March 2018, 16:00–18:00 ERATO MMSD Takebashi Site Common Room 3 http://group-mmm.org/eratommsd/access.html 16:00–17:00 Étienne André (University Paris 13), Parametric timed automata: theory and applications Critical real-time systems must be formally verified to prevent any undesired behavior. When some timing constants are known with only a limited precision, traditional timed model-checking techniques may not apply anymore. We use here the formalism of parametric timed automata. Parametric timed automata are very expressive, and decision problems are notoriously very hard (in fact most interesting decision problems are undecidable). On the one hand, we review decidability results, and propose new decidable subclasses. On the other hand, we adopt a more pragmatic approach, and show that parametric timed automata allow us to model and verify distributed real-time systems; using the IMITATOR software, we derive best- and worst-case execution times for a real-time system designed by Thales, and subject to uncertainty in some tasks periods. We also briefly report on recent techniques to speed-up the verification time using abstractions, and on distributed parametric model checking. 17:00–18:00 Bart Jacobs (Radboud University), Privacy and Security in Identity Management and Medical Research This talk will given an overview of the ideas behind two practically oriented security and privacy projects at Nijmegen, NL: 1. Attribute-based identity management via the IRMA platform, see https://privacybydesign.foundation/en/ If interested, you can before the talk already install the IRMA app on your (Android or iOS) phone and collect some attributes yourself. 2. Polymorphic encryption and Pseudonymisation for a large scale Parkinson research study, see: https://pep.cs.ru.nl/

1 0

Project colloquium talk by Takeo Uramoto on 22 February
by urabenatsuki＠is.s.u-tokyo.ac.jp 21 Feb '18

21 Feb '18

[Apologies for multiple copies] Dear all, Let me advertise our next ERATO MMSD project colloquium talk by Takeo Uramoto on 22 February, 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 ----- Thu 22 February 2018, 16:30–18:00 ERATO MMSD Takebashi Site Common Room 3 http://group-mmm.org/eratommsd/access.html Takeo Uramoto (Tohoku University), Recent developments in algebraic language theory The purpose of this talk is to introduce a recent (2008~) active research trend in algebraic language theory. This field, among other approaches to formal languages, is characterized by its methodology: one reduces combinatorial / logical problems on formal languages (say, regular languages) into some tractable problems on algebraic structures (resp., finite semigroups). Recent works in the last decade shed new lights on this field (or its methodology) from the viewpoint of Stone-type duality theorem; and most importantly, indicated several new research directions extending classical frameworks. In this talk, based on our own works, we introduce this research trend (and its background motivation) and then carefully discuss its possible future directions.

1 0

WIAS Seminar "Type Theory and Proof Theory"(3/16) 及び WIAS Top Runners’ Lecture Collection “Proof Theory and Computation"(3/16, 17) のご案内
by Makoto Fujiwara 21 Feb '18

21 Feb '18

皆様， (重複して受け取られた場合はご容赦ください) 早稲田大学の藤原誠です．以下の通り，3月16日-17日(日本数学会2018年度年会@東京大学の直前)に早稲田大学早稲田キャンパスにて 1. WIAS Seminar "Type Theory and Proof Theory” https://www.waseda.jp/inst/wias/news/2018/01/26/4899/ 及び 2. WIAS Top Runners’ Lecture Collection “Proof Theory and Computation” https://www.waseda.jp/inst/wias/news/2018/01/16/4868/ を開催いたします． 1. WIAS Seminar "Type Theory and Proof Theory” 日程：2018年3月16日(金)13:20-15:30 場所：早稲田大学早稲田キャンパス 26号館 11階 1102教室講演者及び講演題目：・Chuangjie Xu (LMU Munchen), The computer as referee in mathematics ・山﨑紗紀子 (首都大学東京), An attempt at a new embedding of intuitionistic logic into linear logic －via multi-succedent G3-style sequent calculus for intuitionistic logic－ 2. WIAS Top Runners’ Lecture Collection “Proof Theory and Computation” (Helmut Schwichtenberg先生による2日間のチュートリアル講演です．) 日程：2018年3月16日(金)16:00-18:00, 3月17日(土)16:00-18:00 場所：早稲田大学早稲田キャンパス 26号館 11階 1102教室 (初日は1のWIAS Seminarに引き続き同じ会場で行われます．) 講演者：Helmut Schwichtenberg (LMU Munchen, Emeritus Professor) 講演題目：Proof Theory and Computation 講演要旨含め，詳細は上記webページをご覧下さい．たくさんの方々のご参加をお待ちしております．世話人：藤原誠，秋吉亮太 (早稲田大学高等研究所) 問合せ先：makoto_fujiwara(a)aoni.waseda.jp (藤原誠)

1 0

【参加募集(締切延長・最終案内)】第20回プログラミングおよびプログラミング言語ワークショップ（PPL2018）
by 安部達也 19 Feb '18

19 Feb '18

千葉工大の安部です． 3月5日(月)～7日(水)に鳥取県米子市で開催される，第20回プログラミングおよびプログラミング言語ワークショップ (PPL2018) の招待講演の詳細およびプログラムが確定いたしましたので，参加の最終案内をさせていただきます．なお，参加登録の締切を2月20日(火)に延長いたしました．締切までのお申し込みおよび参加費等のお支払いを忘れずにお願いいたします． -------------------------------------------------------------------------- 第20回プログラミングおよびプログラミング言語ワークショップ（PPL2018） https://jssst-ppl.org/workshop/2018/ 参加登録のご案内主催: 日本ソフトウェア科学会プログラミング論研究会日程: 2018年3月5日(月)～3月7日(水) 会場: 鳥取県米子市皆生温泉「皆生グランドホテル天水」 PPL2018は，プログラミングとプログラミング言語に関連する幅広い分野の研究者・技術者・学生が一堂に会し，最新の研究成果の発表や，新たな研究課題の提案・討論・アイディア交換を行うことを目的とした，合宿形式の研究集会です．参加登録ならびに宿泊予約を日本旅行のウェブサービスにて受け付けております．参加費および参加登録方法については次のウェブページをご参照ください． https://jssst-ppl.org/workshop/2018/registration.html 参加登録締切：2018年2月20日(火)【延長しました】問い合わせ先： ppl2018-oc(a)googlegroups.xn--com()-m53d8hra6b34cycyguk0hje6i3045cmp3h ppl2018-pc-chair(a)jssst-ppl.xn--org(/)-043e5ita1c46ctozdpfoc1401qpyjc ================================================================ ・プログラム委員会西崎真也 (東京工業大)[プログラム共同委員長] 松崎公紀 (高知工科大)[プログラム共同委員長] 上野雄大 (東北大) 鵜川始陽 (高知工科大) 海野広志 (筑波大学) 江本健斗 (九州工業大) 勝股審也 (NII) 河内谷清久仁 (日本IBM) 倉光君郎 (横浜国立大) 光来健一 (九州工業大) 櫻井孝平 (金沢大) 笹田耕一 (クックパッド) 新屋良磨 (秋田大学) 澄川靖信 (東京理科大) 田辺良則 (鶴見大) 対馬かなえ (NII) 土屋達弘 (大阪大) 鍋島英知 (山梨大) 浜名誠 (群馬大) 星野直彦 (京都大) 堀江倫大 (日本IBM) 前田敦司 (筑波大) 増原英彦 (東京工業大) 松田一孝 (東北大) 南出靖彦 (東京工業大) 森畑明昌 (東京大学) 結縁祥治 (名古屋大) ・組織委員会平石拓 (京都大)[組織委員長] 江本健斗 (九州工業大) 森口草介 (関西学院大) 佐藤重幸 (高知工科大) 安部達也 (千葉工業大) 西崎真也 (東京工業大)[プログラム共同委員長] 松崎公紀 (高知工科大)[プログラム共同委員長] ================================================================

1 0

Talk by Prof. Jacques Sakarovitch (March 2, 2018)
by "新屋良磨(秋田大)" 16 Feb '18

16 Feb '18

(重複で受け取られた方はご容赦ください) 皆様，秋田大学の新屋です．以下の要領で3/2(金)に東大にてJacques Sakarovitch先生の講演会が開催されます．なお，前日(2/28~3/1)の東工大でのSakarovitch先生の連続講演会とは講演内容が別の新規なものとなっております．どうぞふるってご参加ください．秋田大学数理科学コース新屋良磨 ryoma(a)math.akita-u.ac.jp <mailto:ryoma@math.akita-u.ac.jp> ========== Time: 1:30pm, March. 2, 2018 Venue: Room 236, East Building of Department of Chemistry, Faculty of Science(化学東館), University of Tokyo Title: Mysteries and marvels of rational base numeration systems Jacques Sakarovitch CNRS / Paris Diderot University and Telecom ParisTech Abstract: The definition of numeration systems with rational base, in a joint work with S. Akiyama and Ch. Frougny (Israel J. Math., 2008), has allowed to make some progress in a number theoretic problem, by means of automata theory and combinatorics of words. At the same time, it raised the problem of understanding the structure of the sets of the representations of the integers in these systems from the point of view of formal language theory. At first sight, these sets look rather chaotic and do not fit well in the classical Chomsky hierarchy of languages. They all enjoy a property that makes them defeat, so to speak, any kind of iteration lemma. On the other hand, these sets also exhibit remarkable regularity properties. During the recent years, these regularities have been studied in a series of joint papers with my student V. Marsault. In particular, we have shown that periodic signatures are characteristic of the representation languages in rational base numeration systems and studied, jointly with S. Akiyama, a kind of autosimilarity property that also leads to the construction of Cantor-like sets. These languages still keep most of their mystery. The partial results which will be presented call for further investigations on the subject even stronger. ==========

1 0

CALL FOR PARTICIPATION: Second Workshop on Mathematical Logic and its Applications
by YOKOYAMA Keita 14 Feb '18

14 Feb '18

みなさま、 3月に金沢にて開催予定の Second Workshop on Mathematical Logic and its Applications につきまして、現在参加登録を受け付けております。ご参加いただける方は2月18日までに参加登録をいただけますと幸いです。ご検討の程よろしくお願い致します。横山啓太 CALL FOR PARTICIPATION Second Workshop on Mathematical Logic and its Applications Kanazawa, Japan 5 - 9 March 2018 http://www.jaist.ac.jp/is/labs/ishihara-lab/mla2018/ Description ----------- The workshop brings together researchers of mathematical logic and its related areas, and would provide a forum for interplay between these areas. This workshop will be held as a part of the JSPS Core-to-Core Program "Mathematical Logic and its Applications", which is led by Japan Advanced Institute of Science and Technology (JAIST) in cooperation with several institutes both in Japan and abroad. We welcome submissions from anyone, not restricted to the members of the project, within the scope described below. Scope ------ Includes (but not limited to) the following topics and their application: * Intuitionistic logic * Type theory * Proof theory * Constructive analysis/topology * Program extraction * Reverse mathematics * Computable analysis/topology * Recursion theory (Computability theory) * Non-classical logic * Computational complexity Invited speakers ----------------- * Andrew Arana (Universite Paris 1) * Urlich Berger (Swansea University) * Douglas Bridges (University of Canterbury) * Laura Crosilla (University of Birmingham) * Akitoshi Kawamura (Kyushu University) * Hidenori Kurokawa (Kanazawa University) * Maria Emilia Maietti (University of Padova) * Norbert Preining (Accelia Inc.) * Helmut Schwichtenberg (LMU Muenchen) * Kazushige Terui (Kyoto University) * Wim Veldman (Radboud University Nijmegen) * Andreas Weiermann (Ghent University) Registration (deadline: 18 February 2018) ------------------------ Registrations after the deadline, or participantions without registrations will be accepted as much as possible. But if you wish to have an abstract booklet or to join the banquet, please register before the deadline from below. Programme Committee -------------------- * Ryota Akiyoshi (Waseda, Japan) * Josef Berger (LMU Muenchen, Germany) * Makoto Fujiwara (Waseda, Japan) * Tatsuji Kawai (Padova, Italy) * Katsuhiko Sano (Hokkaido, Japan) * Keita Yokoyama (JAIST, Japan) * Martin Ziegler (KAIST, Korea) Organizers ----------------- * Ryota Akiyoshi (Waseda, Japan) * Makoto Fujiwara (Waseda, Japan) * Tatsuji Kawai (Padova, Italy) * Takako Nemoto (JAIST, Japan) * Keita Yokoyama (JAIST, Japan) Contact address: organizers-jsps2nd(a)jaist.ac.jp -- Keita Yokoyama y-keita(a)jaist.ac.jp

1 0

Summer School in Dynamic Epistemic Logic, Sapporo (Japan), 20-31 Aug 2018
by Katsuhiko Sano 11 Feb '18

11 Feb '18

Dear all, The Department of Philosophy at Hokkaido University (Sapporo, Japan) will hold a two-week summer school in dynamic epistemic logic and its applications, jointly with two guest lecturers from University of Auckland and ILLC (University of Amsterdam) from August 20 to August 31 as part of Hokkaido Summer Institute (HSI) 2018. The following two intensive courses are scheduled to be offered during the summer school. Course 1 (20/Aug/2018 - 24/Aug/2018): Introduction to Logic (For details, see http://hokkaidosummerinstitute.oia.hokudai.ac.jp/courses/CourseDetail=G093) Course 2 (27/Aug/2018 - 31/Aug/2018): Dynamic Epistemic Logic and its Applications (For details, see http://hokkaidosummerinstitute.oia.hokudai.ac.jp/courses/CourseDetail=G102) The main lecturer of Course 1 is Katsuhiko Sano (Department of Philosophy, Hokkaido University). The main lecturer of Course 2 is Jeremy Seligman (Faculty of Arts, School of Humanities, the University of Auckland). There will be a special live on-line lecture by Johan van Benthem (University of Amsterdam, Stanford University, and Tsinghua University) during Course 2. Tomoyuki Yamada and Yasushi Nomura (Hokkaido University) will also join the classes to help students follow the lectures, and communicate with the lecturers. The courses are intended for graduate students. Course 1 is meant for students without prior knowledge of logic and will prepare them for Course 2. Each course is designed to be independent from the other course. Those students who have some familiarity with basics of propositional logic, first-order logic, and modal logic can skip Course 1, and those who wish to take only Course 1 can learn basics of logic. An application period for students from universities other than Hokkaido University is ** from February 1 to February 28 2018.** For more details about applications, please check the HSI official website: https://hokkaidosummerinstitute.oia.hokudai.ac.jp/applications/ As the summer in Sapporo is beautiful and pleasant, it's a good idea to learn logic this summer in Sapporo. Tomoyuki Yamada Department of Philosophy Hokkaido University

1 0

Jacques Sakarovitch先生による連続講演会のお知らせ(2/28~3/1＠東工大)
by Ryoma Sin'ya 09 Feb '18

09 Feb '18

(重複で受け取られた方はご容赦ください) 皆様，秋田大の新屋です．下記の要領にて，フランスからJacques Sakarovitch先生を東工大にお招きしSeminar および Lecture を実施いたします．＊SeminarとLectureで日時・会場が異なりますのでご注意ください． Sakarovitch先生は現代のオートマトン理論を牽引する世界的研究者であり，この連続講演会は計算機科学に携わる多くの方に興味を持っていただけると思います．参加申し込みなどは不要ですので，どうぞふるってご参加ください．なお，2月28日(水)のLectureでは，古典的なKleeneの定理(正規表現とオートマトンの表現力の等価性)の精密化・一般化に関する講義をしてもらいます．本講義では現代的なオートマトン理論の基礎を説明してもらう予定ですので，学生の皆様もどうぞふるってご参加ください．また，3月1日(木)のSeminarでは，Sakarovitch先生自身のこれまでの研究成果を中心に講演してもらう予定です．下記のSeminar概要にて述べられている主結果については，拙著サーベイ論文「オートマトン理論再考」 https://www.jstage.jst.go.jp/article/jssst/34/3/34_3_3/_article/-char/ja/ <https://www.jstage.jst.go.jp/article/jssst/34/3/34_3_3/_article/-char/ja/> の4.4節でほんの少しだけ解説されていますので，興味のある方はどうぞこちらもご参照ください． ========== Lecture ========== Time: 15:20 ~ 16:20, February 28, 2018 (Wed.) Venue: Room W935, West Bldg. 9, Tokyo Institute of Technology (Ookayama Campus) 　東京工業大学大岡山キャンパス西9号館 W935講義室 (西9号館東側(芝生スロープ側)入口を入って階段を1階上がって左側) Title: Automata and expressions Jacques Sakarovitch CNRS / Paris Diderot University and Telecom ParisTech Abstract: Not many results in Computer Science are recognised to be as basic and fundamental as Kleene Theorem. It states the equality of two sets of objects that we now call languages. In this lecture, I propose a slight change of focus on this result and show how it is mainly the combination of two families of algorithms: algorithms that transform an automaton into an expression on one hand and algorithms that build an automaton from an expression on the other. The first purpose is to compare the results of these algorithms, in order to understand they are indeed not so different. And also to devise means to keep these results as small as possible. The second benefit of isolating this part of Kleene Theorem is to allow its extension much beyond languages: to subsets of arbitrary monoids first, and then, with some precaution, to subsets with multiplicity, that is, to formal power series. =========================== ========== Seminar ========== Time: 15:20 ~ 16:20, March 1, 2018 (Thu.) Venue: Multi-Purpose Digital Hall, West Bldg. 9, Tokyo Institute of Technology (Ookayama Campus) 　東京工業大学大岡山キャンパス西9号館ディジタル多目的ホール (西9号館東側(芝生スロープ側)入口を入ってすぐ) Title: Conjugacy and equivalence of weighted automata Jacques Sakarovitch CNRS / Paris Diderot University and Telecom ParisTech Abstract: As a main thread of this talk, I present the proof of the following result: If two regular languages $L$ and $K$ have the same generating functions, that is, for every integer $n$ they have the same number of words of length $n$, there exists a rational bijection realised by a letter-to-letter transducer that maps $L$ onto $K$. This statement is a consequence of a refinement of the decidability of the equivalence of two automata with multiplicity in $N$. It gives us the opportunity to review first the basic definitions and results on weighted finite automata, and second to revisit the `classical' theory of reduction of automata with two notions borrowed to symbolic dynamics: conjugacy and the Finite Equivalence Theorem. =========================== 大岡山キャンパスまでの行き方は以下をご覧ください： https://www.titech.ac.jp/maps/ <https://www.titech.ac.jp/maps/> 西9号館までの行き方は http://www.dst.titech.ac.jp/outline/facility/hall.html <http://www.dst.titech.ac.jp/outline/facility/hall.html> の中の地図をご覧ください。以上，どうぞよろしくお願いします．秋田大学数理科学コース新屋良磨 ryoma(a)math.akita-u.ac.jp <mailto:ryoma@math.akita-u.ac.jp> (共催：東京工業大学情報理工学院鹿島亮)

2 1

Deadline Extension: SetVR 2018 Workshop @ Diagrams 2018
by Yuri Sato 06 Feb '18

06 Feb '18

Logic MLの皆様、国際ワークショップSetVR 2018について、論文締切が延長されましたので、再度ご案内させて頂きます。 Due to many requests, the deadline has been extended. **************************************************************************** Call for Submissions: SetVR 2018 Workshop @ Diagrams 2018 SetVR 2018 International Workshop on Set Visualization and Reasoning 2018 https://sites.google.com/site/setvr2kn/current-workshop Conference dates: 18th--22nd June, 2018 Location: Edinburgh, UK Extended Submission Deadline: 19th February, 2018 **************************************************************************** SetVR 2018 will be the 6th meeting, with the first one held in 2004, previously called the Euler Diagrams Workshop. It aims to promote theoretical, empirical, applied research on visualization and diagrammatic reasoning, especially, about sets (set-theoretical and grouped data). SetVR 2018 welcomes submissions of types: full papers (16 pages) and short papers (8 pages; at least 5 pages). Accepted papers are expected to be published on-line by CEUR Workshop Proceedings (CEUR-WS.org). SetVR 2018 will run as part of Diagrams 2018 conference, which will be held from June 18th to 22nd in 2018, and is expected to occupy one day during this period. http://www.diagrams-conference.org/2018/ Topics include (but not limited to): -Information Visualization: diagram/graph drawing and layout, data visualization, ontology visualization, human-computer interaction -Diagrammatic Logic: formalization, inference system, expressiveness, decidability, computational complexity, automated reasoning, history of notation -Cognitive Science: efficacy evaluation, cognitive process, cognitive model, educational outcome -Application of Diagrams: visual modeling, real world reasoning, ontology engineering, data exploration Organizers Yuri Sato (University of Brighton, UK) Zohreh Shams (University of Cambridge, UK) Program Committee Bilal Alsallakh (Bosch Research and Technology Center, USA) Jim Burton (University of Brighton, UK) Peter Chapman (Edinburgh Napier University, UK) Renata De Freitas (Universidade Federal Fluminense, Brasil) Mateja Jamnik (University of Cambridge, UK) Sven Linker (University of Liverpool, UK) Luana Micallef (Helsinki Institute for Information Technology HIIT, Finland) Peter Rodgers (University of Kent, UK) Gem Stapleton (University of Brighton, UK)

1 0

【参加募集(再)】第20回プログラミングおよびプログラミング言語ワークショップ（PPL2018）
by 安部達也 04 Feb '18

04 Feb '18

皆様千葉工業大学の安部です． 3月5日(月)～7日(水)に鳥取県米子市で開催される，第20回プログラミングおよびプログラミング言語ワークショップ (PPL2018) のカテゴリ1,2,4の発表リストが確定いたしましたので，再度参加のご案内をさせていただきます．参加登録の締切は2月16日(金)です．どうぞお早めのご登録をお願い致します．また，カテゴリ3(ポスター・デモ発表)の発表申込締切も2月5日(月)17:00(JST) に迫っておりますので，合わせてご案内させていただきます． -------------------------------------------------------------------------- 第20回プログラミングおよびプログラミング言語ワークショップ（PPL2018） https://jssst-ppl.org/workshop/2018/ 参加登録のご案内主催: 日本ソフトウェア科学会プログラミング論研究会日程: 2018年3月5日(月)～3月7日(水) 会場: 鳥取県米子市皆生温泉「皆生グランドホテル天水」 PPL2018は，プログラミングとプログラミング言語に関連する幅広い分野の研究者・技術者・学生が一堂に会し，最新の研究成果の発表や，新たな研究課題の提案・討論・アイディア交換を行うことを目的とした，合宿形式の研究集会です．参加登録ならびに宿泊予約を日本旅行のウェブサービスにて受け付けております．参加費および参加登録方法については次のウェブページをご参照ください． https://jssst-ppl.org/workshop/2018/registration.html 参加登録締切：2018年2月16日(金) 問い合わせ先： ppl2018-oc(a)googlegroups.xn--com()-m53d8hra6b34cycyguk0hje6i3045cmp3h ppl2018-pc-chair(a)jssst-ppl.xn--org(/)-043e5ita1c46ctozdpfoc1401qpyjc ================================================================ ・プログラム委員会西崎真也 (東京工業大)[プログラム共同委員長] 松崎公紀 (高知工科大)[プログラム共同委員長] 上野雄大 (東北大) 鵜川始陽 (高知工科大) 海野広志 (筑波大学) 江本健斗 (九州工業大) 勝股審也 (NII) 河内谷清久仁 (日本IBM) 倉光君郎 (横浜国立大) 光来健一 (九州工業大) 櫻井孝平 (金沢大) 笹田耕一 (クックパッド) 新屋良磨 (秋田大学) 澄川靖信 (東京理科大) 田辺良則 (鶴見大) 対馬かなえ (NII) 土屋達弘 (大阪大) 鍋島英知 (山梨大) 浜名誠 (群馬大) 星野直彦 (京都大) 堀江倫大 (日本IBM) 前田敦司 (筑波大) 増原英彦 (東京工業大) 松田一孝 (東北大) 南出靖彦 (東京工業大) 森畑明昌 (東京大学) 結縁祥治 (名古屋大) ・組織委員会平石拓 (京都大)[組織委員長] 江本健斗 (九州工業大) 森口草介 (関西学院大) 佐藤重幸 (高知工科大) 安部達也 (千葉工業大) 西崎真也 (東京工業大)[プログラム共同委員長] 松崎公紀 (高知工科大)[プログラム共同委員長] ================================================================

1 0

「ラムダ計算と論理の早春セミナー」開催のお知らせ(3/22~3/25@TUFS田沢湖ロッジ)
by Ryoma Sin'ya 01 Feb '18

01 Feb '18

皆様，秋田大の新屋です． 3月22日(木)〜3月25日(日)の期間で田沢湖にて，恒例の「ラムダ計算と論理の早春セミナー」を行うこととなりました．過去のセミナーと同様に「ラムダ計算と論理およびその周辺分野」に関してなごやかな雰囲気で議論できる場としたいと思っております．本セミナーは成果発表の場というより成果を挙げる場となっており，講演件数を抑え，残りの時間は個人やグループで柔軟に研究計画をしてもらうようになっています．色々な方と交流を持つためにも丁度よいと思いますので，形式等はあまり気にせず，気軽に参加いただけますと幸いです．会場詳細や参加申し込みの方法は以下のWebページを御覧ください． http://www.math.akita-u.ac.jp/~ryoma/workshop/lls_spring_2018/ <http://www.math.akita-u.ac.jp/~ryoma/workshop/lls_spring_2018/> どうぞ，よろしくお願いします．秋田大学数理科学コース新屋良磨 (お問い合わせは lls_spring_2018(a)googlegroups.com <mailto:lls_spring_2018@googlegroups.com> まで)

1 0

Talk by Silvia Ghilezan (1st Feb., 11:00-)
by Kazushige TERUI 31 Jan '18

31 Jan '18

皆様、直前の連絡になってしまい大変申し訳ありません。明日木曜日に、京都大学でSilvia Ghilezanさんの講演があります。詳細は以下のとおりです。どうぞご参加ください。京都大学数理解析研究所照井一成 ==================== Time: 11:00-12:00, 1st Feb., 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: Silvia Ghilezan (University of Novi Sad, Mathematical Institute SASA, Serbia) Title: Types in logic, computation and concurrency - an overview Abstract: In this talk, we present an overview of results obtained for type systems of computational interpretations of intuitionistic and classical logic with applications to programming languages. We further present results obtained for type systems for concurrency and discuss the role of types in security, access control and privacy issues in these settings. ==================== ------------------------------------------ Kazushige TERUI Research Institute for Mathematical Sciences, Kyoto University. Kitashirakawa Oiwakecho, Sakyo-ku, Kyoto 606-8502, JAPAN. Phone: +81-75-753-7235 Fax: +81-75-753-7276 terui(a)kurims.kyoto-u.ac.jp http://www.kurims.kyoto-u.ac.jp/~terui/

1 0

【参加募集】第20回プログラミングおよびプログラミング言語ワークショップ（PPL2018）
by 安部達也 24 Jan '18

24 Jan '18

皆様千葉工業大学の安部です． 3月5日(月)～7日(水)に，鳥取県米子市で開催される，第20回プログラミングおよびプログラミング言語ワークショップ (PPL2018) の参加登録を開始いたしましたので，ご案内いたします．多くの方々のご参加をお待ちしております．参加登録の締切は2月16日(金)です．どうぞお早めのご登録をお願い致します．また，カテゴリ3(ポスター・デモ発表)の発表申込締切が2月5日(月)17:00(JST) となっております．こちらの投稿もあわせてご検討ください． -------------------------------------------------------------------------- 第20回プログラミングおよびプログラミング言語ワークショップ（PPL2018） https://jssst-ppl.org/workshop/2018/ 参加登録のご案内主催: 日本ソフトウェア科学会プログラミング論研究会日程: 2018年3月5日(月)～3月7日(水) 会場: 鳥取県米子市皆生温泉「皆生グランドホテル天水」 PPL2018は，プログラミングとプログラミング言語に関連する幅広い分野の研究者・技術者・学生が一堂に会し，最新の研究成果の発表や，新たな研究課題の提案・討論・アイディア交換を行うことを目的とした，合宿形式の研究集会です．参加登録ならびに宿泊予約を日本旅行のウェブサービスにて受け付けております．参加費および参加登録方法については次のウェブページをご参照ください． https://jssst-ppl.org/workshop/2018/registration.html 参加登録締切：2018年2月16日(金) 問い合わせ先： ppl2018-oc(a)googlegroups.xn--com()-m53d8hra6b34cycyguk0hje6i3045cmp3h ppl2018-pc-chair(a)jssst-ppl.xn--org(/)-043e5ita1c46ctozdpfoc1401qpyjc ================================================================ ・プログラム委員会西崎真也 (東京工業大)[プログラム共同委員長] 松崎公紀 (高知工科大)[プログラム共同委員長] 上野雄大 (東北大) 鵜川始陽 (高知工科大) 海野広志 (筑波大学) 江本健斗 (九州工業大) 勝股審也 (NII) 河内谷清久仁 (日本IBM) 倉光君郎 (横浜国立大) 光来健一 (九州工業大) 櫻井孝平 (金沢大) 笹田耕一 (クックパッド) 新屋良磨 (秋田大学) 澄川靖信 (東京理科大) 田辺良則 (鶴見大) 対馬かなえ (NII) 土屋達弘 (大阪大) 鍋島英知 (山梨大) 浜名誠 (群馬大) 星野直彦 (京都大) 堀江倫大 (日本IBM) 前田敦司 (筑波大) 増原英彦 (東京工業大) 松田一孝 (東北大) 南出靖彦 (東京工業大) 森畑明昌 (東京大学) 結縁祥治 (名古屋大) ・組織委員会平石拓 (京都大)[組織委員長] 江本健斗 (九州工業大) 森口草介 (関西学院大) 佐藤重幸 (高知工科大) 安部達也 (千葉工業大) 西崎真也 (東京工業大)[プログラム共同委員長] 松崎公紀 (高知工科大)[プログラム共同委員長] ================================================================

1 0

Talk by Bakh Khoussainov (25 Jan, 11.00-)
by Kazushige TERUI 21 Jan '18

21 Jan '18

みなさま来週木曜日に京都大学にてBakh Khoussainovさんによる講演があります。詳細は下記の通りです。よろしければご参加ください。京都大学数理解析研究所照井一成 ========== Time: 11:00-12:00, 25 Jan, 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: Bakh Khoussainov (University of Auckland) Title: Finitely presented expansions of semigroups, algebras, and groups. Abstract: Finitely presented algebraic systems, such as groups and semigroups, are of foundational interest in algebra and computation. Finitely presented algebraic systems necessarily have a computably enumerable (c.e. for short) word equality problem and these systems are finitely generated. Call finitely generated algebraic systems with a c.e. word equality problem computably enumerable. Computably enumerable finitely generated algebraic systems are not necessarily finitely presented. This paper is concerned with finding finitely presented expansions of finitely generated c.e. algebraic systems. The method of expansions of algebraic systems, such as turning groups into rings or distinguishing elements in the underlying algebraic systems, is an important method used in algebra, model theory, and in various areas of theoretical computer science. Bergstra and Tucker proved that all c.e. algebraic systems with decidable word problem possess finitely presented expansions. Then they, and, independently, Goncharov asked if every finitely generated c.e. algebraic system has a finitely presented expansion. We build examples of finitely generated c.e. semigroups, groups, and algebras that fail to possess finitely presented expansions, thus answering the question of Bergstra-Tucker and Goncharov for the classes of semigroups, groups and algebras. We also construct an example of a residually finite, infinite, and algorithmically finite group, thus answering the question of Miasnikov and Osin. Our constructions are based on the interplay between key concepts and known results from computability theory (such as simple and immune sets) and algebra (such as residual finiteness and the theorem of Golod-Shafaverevich). The work is joint with D. Hirschfeldt and A. Miasnikov. ------------------------------------------ Kazushige TERUI Research Institute for Mathematical Sciences, Kyoto University. Kitashirakawa Oiwakecho, Sakyo-ku, Kyoto 606-8502, JAPAN. Phone: +81-75-753-7235 Fax: +81-75-753-7276 terui(a)kurims.kyoto-u.ac.jp http://www.kurims.kyoto-u.ac.jp/~terui/

1 0

“Lambek Calculus and Linear Logic” Meeting　（１月２５日、慶応大三田キャンパス）のお知らせ
by Mitsu Okada 17 Jan '18

17 Jan '18

“Lambek Calculus and Linear Logic” Meeting　（１月２５日、慶応大三田キャンパス）国立情報学研究所教授金沢誠先生、ペンシルバニア大学数学科及び計算機科学科教授Andre Scedrov先生、リヨン大学哲学科教授Jean-Baptiste Joinet先生先生をお招きして、Lambek Calculus 及びLogic & Computationに関する次のようなミニ・シンポジウム形式集会を開催いたします。事前登録なし、参加自由です。 https://abelard.flet.keio.ac.jp/seminar/lambak_calculs.html なお１月１９日（金）―２０日（土）”Philosophy of Logic & Mathematics” Workshopの確定プログラムを https://abelard.flet.keio.ac.jp/seminar/frjp18jan.htmlに上げました。日時・会場日時:Jan. 25th, Thurs. 2018 / 2018年1月25日(木) 15:30 - 18:30 場所:8F, East Building, Mita Campus of Keio University / 慶應義塾大学三田キャンパス東館8階ホール Building #3 on this map. / キャンパスマップ3番の建物です。招待講演者/ Speakers •Jean-Baptiste Joinet教授(リヨン第3大学哲学科・パリ高等師範学校カバイエス研究センター) •Makoto Kanazawa/金沢誠教授(国立情報学研究所NII) •Andre Scedrov教授(ペンシルバニア大学数学科および計算機科学科）プログラム（アブストラクトは、 https://abelard.flet.keio.ac.jp/seminar/lambak_calculs.html を参照ください。） •15:20 Registration •15:30-16:30 Jean-Baptiste Joinet (リヨン第3大学哲学科・パリ高等師範学校カバイエス研究所)“Logic and Dialectical Time” •16:30-17:30 Andre Scedrov (ペンシルバニア大学数学科および計算機科学科）“Lambek Calculus Extended with Bracket and Subexponential Modalities” •17:30-18:30 Makoto Kanazawa (国立情報学研究所NII)“On the Recognizing Power of the Lambek Calculus with Brackets” 共催 •慶應義塾大学論理と感性のグローバル研究センター同大学•次世代研究推進プロジェクト •CNRS(フランス) 問い合わせ先：東京都港区三田２－１５－４５文学部岡田光弘研究室 logic(a)abelard.flet.keio.ac.jp --------------------------------------------------------------------

1 0

[最終CFP] Bx 2018: 7th International Workshop on Bidirectional Transformations (投稿締切：1月19日)
by Kazutaka Matsuda 05 Jan '18

05 Jan '18

皆様，東北大学の松田です．投稿〆切（1月19日）が近づいてまいりましたので， <Programming> 2018併設の双方向変換に関する国際ワークショップBx 2018の案内を再々度御送りいたします．どうぞ，投稿をご検討いただけますと幸いです． ----------------------------------------------------------------------------- FINAL CALL FOR PAPERS ===================== Bx 2018: 7th International Workshop on Bidirectional Transformations Nice, France (co-located with <Programming> 2018) https://2018.programming-conference.org/track/bx-2018-papers ---------------------------------------------------------------------- *NOTE: Deadline (Jan. 19) approaching!* Bidirectional transformations (bx) are a mechanism for maintaining the consistency of at least two related sources of information. Such sources can be relational databases, software models and code, or any other document following standard or ad-hoc formats. Bx are an emerging topic in a wide range of research areas, with prominent presence at top conferences in several different fields (namely databases, programming languages, software engineering, and graph transformation), but with results in one field often getting limited exposure in the others. Bx 2018 is a dedicated venue for bx in all relevant fields, and is part of a workshop series that was created in order to promote cross-disciplinary research and awareness in the area. As such, since its beginning in 2012, the workshop has rotated between venues in different fields. IMPORTANT DATES --------------- - Paper submission: Jan. 19, 2018 - Author notification: Feb. 17, 2018 - Workshop: Apr. 10, 2018 AIM & TOPICS ------------ The aim of the workshop is to bring together researchers and practitioners, established and new, interested in bx from different perspectives, including but not limited to: - bidirectional programming languages and frameworks - data and model synchronization - view updating - inter-model consistency analysis and repair - data/schema (or model/metamodel) co-evolution - coupled software/model transformations - inversion of transformations and data exchange mappings - domain-specific languages for bx - analysis and classification of requirements for bx - bridging the gap between formal concepts and application scenarios - analysis of efficiency of transformation algorithms and benchmarks - survey and comparison of bx technologies - case studies and tool support PAPER CATEGORIES ---------------- The BX 2018 program committee considers five categories of submissions: - Full Research Papers (up to 10 pages) * in-depth presentations of novel concepts and results * applications of bx to new domains * survey papers providing novel comparisons between existing bx technologies and approaches case studies - Tool Papers (up to 6 pages) * guideline papers presenting best practices for employing a specific bx approach (with a specific tool) * presentation of new tools or substantial improvements to existing ones * qualitative and/or quantitative comparisons of applying different bx approaches and tools - Experience Report (up to 4 pages) * sharing experiences and lessons learned with bx tools/frameworks/languages * how bx is used in (research/industrial/educational) projects - Extended Abstracts (up to 3 pages) * work in progress * small focused contributions * position papers and research perspectives * critical questions and challenges for bx - Talk Proposals (up to 2 pages) * proposed lectures about topics of interest for bx * existing work representing relevant contributions for bx * promising contributions that are not mature enough to be proposed as papers of the other categories All papers are expected to be self-contained and well-written. Tool papers are not expected to present novel scientific results, but to document artifacts of interest and share bx experience/best practices with the community. Experience papers are expected to report on lessons learnt from applying bx approaches, languages, tools and theories to practical application case studies. Extended abstracts should primarily provoke interesting discussion at the workshop and will not be held to the same standard of maturity as regular papers. Talk proposals are expected to present works of particular interest for the community and that are worth a talk slot at the workshop. We strongly encourage authors to ensure that any (variants of) examples are present in the bx example repository at the time of submission, and for tool papers, to allow for reproducibility with minimal effort, either via a virtual machine (e.g. via Share - http://share20.eu) or a dedicated website with relevant artifacts and tool access. All papers will be peer-reviewed by at least three members of the program committee. PROCEEDINGS ----------- The workshop proceedings, including all accepted papers (except talk proposals), will be published as International Conference Proceedings Series in the ACM Digital Library before the workshop. SUBMISSION GUIDELINE -------------------- Submission site: https://easychair.org/conferences/?conf=bx2018 Submissions should use the ACM Conference acmart Format with the ‘sigconf’ option (http://www.acm.org/publications/proceedings-template) with a font size of 10 point and the font family Times New Roman. All submissions should be in PDF format. If you use LaTeX or Word, please use the provided ACM acmart templates. Otherwise, please follow the ACM author instructions. If you are formatting your paper using LaTeX, you will need to set the 10pt option in the \documentclass command. If you are formatting your paper using Word, you may wish to use the provided Word template that supports this font size. Please include page numbers in your submission for review using the LaTeX command \settopmatter{printfolios=true} (see examples in template). Please also ensure that your submission is legible when printed on a black and white printer. In particular, please check that colors remain distinct and font sizes are legible. Submissions not complying with the above guidelines may be excluded from the reviewing process without further notice. If a paper is accepted, at least one author of the paper is expected to participate in the workshop to present it. Authors of accepted tool papers are also expected to be available to demonstrate their tool at the event. PROGRAM COMMITTEE MEMBERS ------------------------- Jens Weber (University of Victoria, co-chair) Kazutaka Matsuda (Tohoku Universiy, co-chair) Anthony Anjorin (University of Paderborn) James Cheney (University of Edinburgh) Anthony Cleve (University of Namur) Alcino Cunha (University of Minho and INESC TEC) Zinovy Diskin (McMaster University) Romina Eramo (University of L’Aquila) Jeremy Gibbons (University of Oxford) Holger Giese (Potsdam University) Boris Glavic (Illinois Institute of Technology) Martin Gogolla (University of Bremen) Soichiro Hidaka (Hosei University) Zhenjiang Hu (National Institute of Informatics) Michael Johnson (Macquarie University) Ekkart Kindler (Technical University of Denmark) Erhan Leblebici (TU Darmstadt) Fernando Orejas (Universitat Politècnica de Catalunya) Hugo Pacheco (University of Minho) Richard Paige (University of York) Arend Rensink (University of Twente) Andy Schürr (TU Darmstadt) Perdita Stevens (University of Edinburgh) James Terwilliger Janis Voigtländer (University of Duisburg-Essen) Meng Wang (University of Bristol) Bernhard Westfechtel (University of Bayreuth)

1 0

組合せ論・モデル理論セミナー(2018.1.15)
by Hirotaka Kikyo 28 Dec '17

28 Dec '17

組合せ論・モデル理論セミナーを下記のように開催いたしますので、ご案内さしあげます。よろしくお願い致します。 -- ・日時: 2018年1月15日(月) 14:30～・場所: 神戸大学六甲台第2 <https://maps.google.com/?q=%E5%85%AD%E7%94%B2%E5%8F%B0%E7%AC%AC2&entry=gmai…>キャンパス自然科学総合研究棟3号館 421室 (予定) ・講演者・プログラム: 14:30-16:00 坪井明人氏 (筑波大学,モデル理論) "A proof of Hales-Jewett theorem using a nonstandard method" 16:15-17:45 Qing Xiang 氏 (University of Delaware,組合せ論) "Applications of Linear Algebraic Methods in Combinatorics and Finite Geometry" ・HP: https://sites.google.com/site/kcmseminar/ ・世話人岡部峻典 (神戸大学) 桔梗宏孝 (神戸大学) 佐竹翔平 (神戸大学) 澤正憲 (神戸大学) --

1 0

WIAS Top Runners’ Lecture Collection “Proof Theory and Computation"(2018年3月16, 17日)のご案内
by Makoto Fujiwara 27 Dec '17

27 Dec '17

皆様早稲田大学の藤原誠です．以下の通り，3月16日-17日(日本数学会2018年度年会@東京大学の直前)に早稲田大学早稲田キャンパスにてLMU MunchenのHelmut Schwichtenberg先生にチュートリアル講演をしていただく予定です．日程：2018年3月16日(金)16:00-18:00, 3月17日(土)16:00-18:00 場所：早稲田大学早稲田キャンパス(教室未定) 講演者：Helmut Schwichtenberg (LMU Munchen, Emeritus Professor) 講演題目：Proof Theory and Computation 詳細につきましては日程が近づきましたら再度ご案内をさせていただきます．どうぞよろしくお願いいたします． ============================================ 藤原誠 (Makoto Fujiwara) 早稲田大学高等研究所 (Waseda Institute for Advanced Study, Waseda University) E-mail: makoto_fujiwara(a)aoni.waseda.jp ============================================

1 0

1月19日20日:日仏“論理と数学の哲学：証明と計算の哲学と歴史”ワークショップ(慶応大)
by Mitsu Okada 26 Dec '17

26 Dec '17

２０１８年１月１９日・２０日に開催される次のワークショップを案内させていただきます。慶応大文学部哲学専攻　岡田光弘 -------- 日仏“論理と数学の哲学：証明と計算の哲学・歴史”ワークショップ(1/19-20, Keio U) Workshop on Philosophy and History of Proofs and Computation, Jan.19-20,2018 (https://abelard.flet.keio.ac.jp/seminar/frjp18jan.html for updated information) 論理と数学の哲学及び歴史研究に関する日仏ワークショップを開催します。毎年このワークショップシリーズでは、論証・証明について、論理学・哲学・計算論的観点から議論し、本分野の日仏連携・協力を進めています。フランスから４人、国内から３人の招待講演者を迎えて本年度の会を開催します。(今年度は特にユークリッド原論の歴史・言語分析・証明の研究者３人をお呼びしています。) 日時:Jan 19th Friday-20th Saturday, 2018 / 2018年1月19日(金)-20日(土) 10:00 - 18:00場所:Distance Learning Room (B4F), South Building, Mita Campus of Keio University / 慶應義塾大学三田キャンパス南館地下4階ディスタンスラーニングルーム https://www.keio.ac.jp/en/maps/ Building #12 on this map. / キャンパスマップ12番の建物です。プログラムは「ユークリッド原論の歴史・言語分析・哲学」「現代論理学史とオントロー」「論理と証明の哲学」「計算と証明」などのセッションから構成されます。プログラム詳細については近日中に次のページに掲載します。 https://abelard.flet.keio.ac.jp/seminar/frjp18jan.html 招待講演者と講演テーマ/ Guest Speakers and Titles Andrew Arana (Univ. Paris-1 and IHPST)Logical Purity and Normalization .Jean-Baptiste Joinet (Univ. Lyon-3 and Inst. Jean Cavaillès (ENS-Paris)) Logic and ontology .Marco Panza (Univ. Paris-1 and IHPST)What Universality Could Have Been for Euclid .斎藤憲Ken Saito　(Osaka Prefecture Univ.)Syntax Analysis of the Whole Text of Euclid’s Elements .Nathan Camillo Sidoli (Waseda Univ.)Euclid’s Postulates and Problems .Pierre Wagner (Univ. Paris-1 and IHPST)Logical Commitment 伊藤遼Ryo Ito (Univ. of Kyoto)The Unity of the Proposition and Russell's Theories of Truth Japanese group speakers 秋吉亮太Ryota Akiyoshi (Waseda Univ.)Proof-Theoretic Studies of Parameter-Free Subsystems of Girard's System F (tentative) Daniel Said Monteiro (Univ. Paris 7 and Keio Univ.)Explaining the movements of qi: Nishikawa Joken (1648-1724) and the understanding of extraordinary phenomena in early modern Japan 岡田光弘Mitsuhiro Okada (Keio Univ.)　Norm, Commitment and Normalization of Proof (tentative) .小関健太郎Kentaro Ozeki (Keio Univ.)Meinongian Incomplete Objects and Negation .西牟田祐樹Yuki Nishimuta (Keio Univ.)Non-decomposability Preservation of Generalized Connectives and Cut Elimination (preliminary report) そのほかAnd others to be announced. ---------------------------------------------------------------------------------------------------------- なおこの集会とは別に、１月２５日に、Andre Scedrov、金沢誠/Makoto Kanazawa、Jean-Baptiste Joinetの３氏をお招きして、Lambek CalculusとLinear Logicに関する集会を開催する予定です。追ってお知らせします。 ------------------------------------------------------- ----------------------------------------------- 共催慶應義塾大学論理と感性のグローバル研究センター及び•次世代研究推進プロジェクト CNRS(フランス) 連絡先慶應義塾大学文学部岡田光弘研究室東京都港区三田２−１５−４５ Email: logic [AT] abelard.flet.keio.ac.jp https://abelard.flet.keio.ac.jp/seminar/frjp18jan.html

1 0

CFP: SetVR 2018 @ Diagrams 2018
by Yuri Sato 16 Dec '17

16 Dec '17

Logic MLの皆様、国際ワークショップSetVR 2018の論文募集についてご案内致します。 **************************************************************************** Call for Papers SetVR 2018: International Workshop on Set Visualization and Reasoning 2018 https://sites.google.com/site/setvr2kn/current-workshop Conference dates: 18th-22nd June, 2018 Location: Edinburgh, UK Deadline for submission: 5th February, 2018 **************************************************************************** SetVR 2018 will be the 6th meeting, with the first one held in 2004, previously called the Euler Diagrams Workshop. It aims to promote theoretical, empirical, applied research on visualization and diagrammatic reasoning, especially, about sets (set-theoretical and grouped data). SetVR 2018 welcomes submissions of types: full papers (16 pages) and short papers (8 pages; at least 5 pages). Accepted papers are expected to be published on-line by CEUR Workshop Proceedings (CEUR-WS.org). SetVR 2018 will run as part of Diagrams 2018 conference, which will be held from June 18th to 22nd in 2018, and is expected to occupy one day during this period. http://www.diagrams-conference.org/2018/ Topics include (but not limited to): • Information Visualization: diagram/graph drawing and layout, data visualization, ontology visualization, human-computer interaction • Diagrammatic Logic: formalization, inference system, expressiveness, decidability, computational complexity, automated reasoning, history of notation • Cognitive Science: efficacy evaluation, cognitive process, cognitive model, educational outcome • Application of Diagrams: visual modeling, real world reasoning, ontology engineering, data exploration Organizers Yuri Sato (University of Brighton, UK) Zohreh Shams (University of Cambridge, UK) Program Committee Bilal Alsallakh (Bosch Research and Technology Center, USA) Jim Burton (University of Brighton, UK) Peter Chapman (Edinburgh Napier University, UK) Renata De Freitas (Universidade Federal Fluminense, Brasil) Mateja Jamnik (University of Cambridge, UK) Sven Linker (University of Liverpool, UK) Luana Micallef (Helsinki Institute for Information Technology HIIT, Finland) Peter Rodgers (University of Kent, UK) Gem Stapleton (University of Brighton, UK)

1 0

[2nd CFP] Bx 2018: 7th International Workshop on Bidirectional Transformations
by Kazutaka Matsuda 16 Dec '17

16 Dec '17

皆様，東北大学の松田です．来たる2018年4月10日に，<Programming> 2018に併設して開催されるワークショップ， Bx 2018 の論文募集の案内を再度お送りいたします．前回お送りした投稿〆切日時が誤っておりましたことをお詫びいたします．誤 Feb. 18, 2018 正 Feb. 19, 2018 Bx 2018では，”Experience Report"という投稿カテゴリを新設いたしました．もしlens等の双方向変換システムを研究/教育/開発プロジェクト等に使用されたことがある方がいらっしゃいましたら，ぜひともその経験の投稿をご検討くださいませ．その他のカテゴリについても，ご投稿を検討いただければ幸いです． ---------------------------------------------------------------------- SECOND CALL FOR PAPERS ======================= Bx 2018: 7th International Workshop on Bidirectional Transformations Nice, France (co-located with <Programming> 2018) https://2018.programming-conference.org/track/bx-2018-papers ---------------------------------------------------------------------- Bidirectional transformations (bx) are a mechanism for maintaining the consistency of at least two related sources of information. Such sources can be relational databases, software models and code, or any other document following standard or ad-hoc formats. Bx are an emerging topic in a wide range of research areas, with prominent presence at top conferences in several different fields (namely databases, programming languages, software engineering, and graph transformation), but with results in one field often getting limited exposure in the others. Bx 2018 is a dedicated venue for bx in all relevant fields, and is part of a workshop series that was created in order to promote cross-disciplinary research and awareness in the area. As such, since its beginning in 2012, the workshop has rotated between venues in different fields. IMPORTANT DATES --------------- - Paper submission: Jan. 19, 2018 - Author notification: Feb. 17, 2018 - Workshop: Apr. 10, 2018 AIM & TOPICS ------------ The aim of the workshop is to bring together researchers and practitioners, established and new, interested in bx from different perspectives, including but not limited to: - bidirectional programming languages and frameworks - data and model synchronization - view updating - inter-model consistency analysis and repair - data/schema (or model/metamodel) co-evolution - coupled software/model transformations - inversion of transformations and data exchange mappings - domain-specific languages for bx - analysis and classification of requirements for bx - bridging the gap between formal concepts and application scenarios - analysis of efficiency of transformation algorithms and benchmarks - survey and comparison of bx technologies - case studies and tool support PAPER CATEGORIES ---------------- The BX 2018 program committee considers five categories of submissions: - Full Research Papers (up to 10 pages) * in-depth presentations of novel concepts and results * applications of bx to new domains * survey papers providing novel comparisons between existing bx technologies and approaches case studies - Tool Papers (up to 6 pages) * guideline papers presenting best practices for employing a specific bx approach (with a specific tool) * presentation of new tools or substantial improvements to existing ones * qualitative and/or quantitative comparisons of applying different bx approaches and tools - Experience Report (up to 4 pages) * sharing experiences and lessons learned with bx tools/frameworks/languages * how bx is used in (research/industrial/educational) projects - Extended Abstracts (up to 3 pages) * work in progress * small focused contributions * position papers and research perspectives * critical questions and challenges for bx - Talk Proposals (up to 2 pages) * proposed lectures about topics of interest for bx * existing work representing relevant contributions for bx * promising contributions that are not mature enough to be proposed as papers of the other categories All papers are expected to be self-contained and well-written. Tool papers are not expected to present novel scientific results, but to document artifacts of interest and share bx experience/best practices with the community. Experience papers are expected to report on lessons learnt from applying bx approaches, languages, tools and theories to practical application case studies. Extended abstracts should primarily provoke interesting discussion at the workshop and will not be held to the same standard of maturity as regular papers. Talk proposals are expected to present works of particular interest for the community and that are worth a talk slot at the workshop. We strongly encourage authors to ensure that any (variants of) examples are present in the bx example repository at the time of submission, and for tool papers, to allow for reproducibility with minimal effort, either via a virtual machine (e.g. via Share - http://share20.eu) or a dedicated website with relevant artifacts and tool access. All papers will be peer-reviewed by at least three members of the program committee. PROCEEDINGS ----------- The workshop proceedings, including all accepted papers (except talk proposals), will be published as International Conference Proceedings Series in the ACM Digital Library before the workshop. SUBMISSION GUIDELINE -------------------- Submission site: https://easychair.org/conferences/?conf=bx2018 Submissions should use the ACM Conference acmart Format with the ‘sigconf’ option (http://www.acm.org/publications/proceedings-template) with a font size of 10 point and the font family Times New Roman. All submissions should be in PDF format. If you use LaTeX or Word, please use the provided ACM acmart templates. Otherwise, please follow the ACM author instructions. If you are formatting your paper using LaTeX, you will need to set the 10pt option in the \documentclass command. If you are formatting your paper using Word, you may wish to use the provided Word template that supports this font size. Please include page numbers in your submission for review using the LaTeX command \settopmatter{printfolios=true} (see examples in template). Please also ensure that your submission is legible when printed on a black and white printer. In particular, please check that colors remain distinct and font sizes are legible. Submissions not complying with the above guidelines may be excluded from the reviewing process without further notice. If a paper is accepted, at least one author of the paper is expected to participate in the workshop to present it. Authors of accepted tool papers are also expected to be available to demonstrate their tool at the event. PROGRAM COMMITTEE MEMBERS ------------------------- Jens Weber (University of Victoria, co-chair) Kazutaka Matsuda (Tohoku Universiy, co-chair) Anthony Anjorin (University of Paderborn) James Cheney (University of Edinburgh) Anthony Cleve (University of Namur) Alcino Cunha (University of Minho and INESC TEC) Zinovy Diskin (McMaster University) Romina Eramo (University of L’Aquila) Jeremy Gibbons (University of Oxford) Holger Giese (Potsdam University) Boris Glavic (Illinois Institute of Technology) Martin Gogolla (University of Bremen) Soichiro Hidaka (Hosei University) Zhenjiang Hu (National Institute of Informatics) Michael Johnson (Macquarie University) Ekkart Kindler (Technical University of Denmark) Erhan Leblebici (TU Darmstadt) Fernando Orejas (Universitat Politècnica de Catalunya) Hugo Pacheco (University of Minho) Richard Paige (University of York) Arend Rensink (University of Twente) Andy Schürr (TU Darmstadt) Perdita Stevens (University of Edinburgh) James Terwilliger Janis Voigtländer (University of Duisburg-Essen) Meng Wang (University of Bristol) Bernhard Westfechtel (University of Bayreuth)

1 0

「論理学の哲学」ワークショップ：意味，証明，推論　のご案内です。
by 秋吉亮太 09 Dec '17

09 Dec '17

みなさま，早稲田大学高等研究所の秋吉と申します．以下の要領で論理学の哲学に関するワークショップを開催いたします．参加自由ですので，皆さまのご参加をお待ちしております．早稲田大学高等研究所主催「論理学の哲学」ワークショップ：意味，証明，推論 WIAS Event “Philosophy of Logic” Workshop: Meaning, Proof, and Inference 日時：2017年12月12日（火）15:00 - 18:15 Date: December 12, 2017 (Tue.) Time: 15:00 - 18:15 場所：早稲田大学早稲田キャンパス　11号館4階第一会議室 Venue: Meeting Room #1, 4th floor, Bldg. 11, Waseda Campus, Waseda University URL: https://www.waseda.jp/inst/wias/news/2017/11/14/4733/ <https://www.waseda.jp/inst/wias/news/2017/11/14/4733/> プログラム/Program： 15:00 - 16:00 西牟田祐樹（慶應義塾大学）/ Yuki Nishimuta (Keio University) 乗法的論理結合子の導入規則とスイッチングの関係 Relationship between the Introduction Rules of the Multiplicative Connectives and the Switching 16:00 - 16:30 ディスカッション/ Discussion 16:30 - 16:45 休憩/ Break 16:45 - 17:45 大西琢朗（京都大学）/ Takuro Onishi (Kyoto University) 　　　　　　　　　関係意味論を推論主義的に理解する Understanding Relational Semantics from the Viewpoint of Inferentialism 17:45 - 18:15 ディスカッション/ Discussion 使用言語/ Language：日本語（必要に応じて英語）/ Japanese (and English, if necessary) 司会/ Moderator：秋吉亮太（早稲田大学高等研究所）/ Ryota Akiyoshi (WIAS, Waseda University) 問い合わせ先/ Contact E-mail：秋吉亮太（早稲田大学高等研究所 ) georg.logic(a)gmail.com <mailto:georg.logic@gmail.com> 早稲田大学高等研究所/ Waseda Institute for Advanced Study, Waseda University

1 0

超準解析と数学基礎論のシンポジウム
by YOKOYAMA Keita 08 Dec '17

08 Dec '17

みなさま、北陸先端科学技術大学院大学の横山です。超準解析と数学基礎論のシンポジウムについて、プログラムができましたので再度ご案内いたします。詳しくは下記ホームページをご覧ください。 http://www.jaist.ac.jp/~y-keita/2017NSA/index.html 今回の会議では、江田勝哉先生にチュートリアル、木更津高専の倉橋太志先生に招待講演をお願いしております。（前回のメールで倉橋先生のお名前が間違っておりました。お詫びして訂正いたします。）超準解析を勉強したことのない学生の方等の参加も歓迎です。ご参加をご検討いただければ幸いです。 ********************** 超準解析と数学基礎論のシンポジウム http://www.jaist.ac.jp/~y-keita/2017NSA/index.html 日時：12月15,16日(金,土) 場所：早稲田大学早稲田キャンパス懇親会：12月15日 (5000円程度の予定です) 世話人：横山啓太(JAIST), 藤原誠(早稲田大学高等研究所) ※この会議は超準解析シンポジウム http://www.jaist.ac.jp/~y-keita/2014SLACS-NSA/ の後継になりますが、今回は超準解析分野を始め、超準構造や超準手法及び関連する数学基礎論の話題を広く募集致します。参加は登録無しでも可能ですが、できましたら以下のフォームに記入の上、 y-keita[at]jaist.ac.jp までメールにて事前にご連絡をいただけると幸いです。 (懇親会に参加希望の方はできるだけ早くご連絡ください。) ===以下フォーム=== １．お名前２．所属・身分３．メールアドレス４．懇親会に参加希望/希望しない (あまり直前ですと参加希望に添えないかもしれません) ５．その他 ===以上フォーム=== ********************** どうぞよろしくお願い致します。横山啓太 -- Keita Yokoyama y-keita(a)jaist.ac.jp

1 0

Talk by Amar Hadzihasanovic (07 Dec 11.00-)
by Kazushige TERUI 06 Dec '17

06 Dec '17

皆様直前のご案内で申し訳ありません。明日京都大学にて、新しくポスドクとして来られた Amar Hadzihasanovicさんによる講演があります。どうぞお気軽にお越しください。 ========== Time: 11:00-12:00, 07 Dec, 2017 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: Amar Hadzihasanovic (RIMS, Kyoto University) Title: Units without degeneracies, from higher categories to sequent calculi In a polycategory or multicategory, the existence of poly-cells or multi-cells satisfying certain universal properties induces coherent algebraic structures on the category of single-input, single-output cells (Cockett-Seely 1997, Hermida 2000). This was used by Hermida to produce an abstract proof of the strictification theorem for monoidal categories, and more generally bicategories. While the basic strategy seems generalisable, by a result by C. Simpson in 1998, no full strictification is possible for higher-dimensional categories. This seems to be due to problems with the combinatorics of cells with degenerate boundaries, that is, “0-ary” inputs or outputs, which were previously used to obtain units. We show that it is possible to obtain coherent units without degenerate boundaries, by deriving them from “equivalence” cells which satisfy lower-dimensional universal properties. This leads to a weaker semi-strictification theorem, which, however, we hope to generalise to arbitrary dimensions. Since the work of Cockett and Seely on linearly distributive categories, it is known that there is a deep connection between universal properties of cells in polycategories, and the rules of sequent calculi; in this context, units are also notorious for increasing the complexity of proof equivalence. In the last part of this talk, we pose some questions on the logical and computational aspects of our notion of unit, and the non-degeneracy constraint. ------------------------------------------ Kazushige TERUI Research Institute for Mathematical Sciences, Kyoto University. Kitashirakawa Oiwakecho, Sakyo-ku, Kyoto 606-8502, JAPAN. Phone: +81-75-753-7235 Fax: +81-75-753-7276 terui(a)kurims.kyoto-u.ac.jp http://www.kurims.kyoto-u.ac.jp/~terui/

1 0

Second Workshop on Mathematical Logic and its Applications
by YOKOYAMA Keita 05 Dec '17

05 Dec '17

みなさま、 3月に金沢にて開催予定の Second Workshop on Mathematical Logic and its Applications につきまして、講演募集の締め切りが近づきましたので再度ご案内させて頂きます。ご講演・ご参加の検討をいただければ幸いです。横山啓太 ******************************************* Second Call for Abstracts Second Workshop on Mathematical Logic and its Applications Kanazawa, Japan 5 - 9 March 2018 http://www.jaist.ac.jp/is/labs/ishihara-lab/mla2018/ Description ----------- The workshop brings together researchers of mathematical logic and its related areas, and would provide a forum for interplay between these areas. This workshop will be held as a part of the JSPS Core-to-Core Program "Mathematical Logic and its Applications", which is led by Japan Advanced Institute of Science and Technology (JAIST) in cooperation with several institutes both in Japan and abroad. We welcome submissions from anyone, not restricted to the members of the project, within the scope described below. Scope ------ Includes (but not limited to) the following topics and their application: * Intuitionistic logic * Type theory * Proof theory * Constructive analysis/topology * Program extraction * Reverse mathematics * Computable analysis/topology * Recursion theory (Computability theory) * Non-classical logic * Computational complexity Invited speakers ----------------- * Andrew Arana (Université Paris 1) * Douglas Bridges (University of Canterbury) * Laura Crosilla (University of Birmingham) * Akitoshi Kawamura (Kyushu University) * Hidenori Kurokawa (Kanazawa University) * Maria Emilia Maietti (University of Padova) * Norbert Preining (Accelia Inc.) * Helmut Schwichtenberg (LMU Muenchen) * Kazushige Terui (Kyoto University) * Wim Veldman (Radboud University Nijmegen) * Andreas Weiermann (Ghent University, to be confirmed) Guide for authors ----------------- The authors are asked to prepare short abstracts (1 page PDF) following the guideline on the workshop web-site: http://www.jaist.ac.jp/is/labs/ishihara-lab/mla2018/contributed_talks.html Submissions are accepted through EasyChair https://easychair.org/conferences/?conf=mla2018 Deadline of submission ----------------------- 15 December 2017 Notification of acceptance will be informed by December 31. Programme Committee -------------------- * Ryota Akiyoshi (Waseda, Japan) * Josef Berger (LMU Muenchen, Germany) * Makoto Fujiwara (Waseda, Japan) * Tatsuji Kawai (Padova, Italy) * Katsuhiko Sano (Hokkaido, Japan) * Keita Yokoyama (JAIST, Japan) * Martin Ziegler (KAIST, Korea) Organizers ----------------- * Ryota Akiyoshi (Waseda, Japan) * Makoto Fujiwara (Waseda, Japan) * Tatsuji Kawai (Padova, Italy) * Takako Nemoto (JAIST, Japan) * Keita Yokoyama (JAIST, Japan) Contact address: organizers-jsps2nd(a)jaist.ac.jp -- Keita Yokoyama y-keita(a)jaist.ac.jp

1 0

Kobe Colloquium: Dec. 7, 2017, Martin Ziegler
by Hirotaka Kikyo 02 Dec '17

02 Dec '17

Kobe Colloquium on Logic, Statistics and Informatics 以下の要領でコロキウムを開催します。日時: 2017/12/7 (木) 16.00 - 17:30 場所: 神戸大学六甲台第2キャンパス自然科学総合研究棟3号館421室講演者：Martin Ziegler（Freiburg大学）題目： A new Axiomatisation of the free N-pseudospace. 交通：阪急六甲駅またはJR六甲道駅から神戸市バス36系統「鶴甲団地」行きに乗車，「神大本部工学部前」停留所下車，徒歩すぐ． http://www.kobe-u.ac.jp/guid/access/rokko/rokkodai-dai2.html 連絡先：桔梗宏孝 kikyo(a)kobe-u.ac.jp <mkikuchi(a)kobe-u.ac.jp>

1 0

CFP: PPL2018 第20回プログラミングおよびプログラミング言語ワークショップ論文募集
by Shin-ya Nishizaki 01 Dec '17

01 Dec '17

logic-mlの皆様 PPL2018のCFPについては既に案内させていただきましたが、投稿方法や招待講演などの情報が更新されましたので、再度、連絡させて頂きます。是非、投稿・参加をご検討ください。東京工業大学学術国際情報センター西崎真也 ===================================================== 第20回プログラミングおよびプログラミング言語ワークショップ (PPL2018) http://jssst-ppl.org/workshop/2018/ 主催: 日本ソフトウェア科学会プログラミング論研究会日程: 2018年3月5日(月)〜3月7日(水) 会場: 鳥取県米子市皆生温泉「皆生グランドホテル天水」 PPL2018は，プログラミングとプログラミング言語に関連する幅広い分野の研究者・技術者・学生が一堂に会し，最新の研究成果の発表や，新たな研究課題の提案・討論・アイディア交換を行うことを目的とした，合宿形式の研究集会です．プログラミング方法論，プログラミング言語の理論・設計・実装などに関する研究発表を，カテゴリ別に幅広く募集します．カテゴリ1: 国内外で未発表の論文の発表カテゴリ2: 国際会議・学術雑誌等で既発表であるが，国内では未発表の研究の紹介カテゴリ3: ポスター・デモ発表(既発表・未発表の別を問いません) カテゴリ4: サーベイ・チュートリアル発表(既発表・未発表の別を問いません) カテゴリ1の採択論文の中から，特に独創的なアイディアや顕著な成果を含むものに対して論文賞を授与する予定です．また全論文発表と全ポスター・デモのなかから，聴衆の投票によりそれぞれ，最も優秀な論文プレゼンテーションには発表賞(一般の部，学生の部，既受賞者は除く)，最も優秀なポスター・デモにはポスター賞を授与する予定です．カテゴリ1 (国内外未発表論文) ---------------------------- 完成した理論やシステムの研究発表のみならず，萌芽的なアイディアや問題点の提示等も歓迎します．発展途上の研究内容も積極的に採録する方針です．また，カテゴリ1で発表された研究については，会場での討議や査読コメントをもとにその完成度を高め，将来の学術雑誌・国際会議等での業績に結び付けることを奨励しています．そのため，予稿集の配布は参加者のみへの限定的なものとします．発表申込を行った上で論文提出を行ってください．カテゴリ1で発表された研究のうち，PPL2018プログラム委員会により優れていると認められたものは， PPL2018終了後(2018年4月下旬予定)，「コンピュータソフトウェア」誌のPPL2018推薦論文としての投稿が可能です．推薦論文は， PPLプログラム委員が引き続き査読を行うことによる，迅速な査読プロセスを特長としています．カテゴリ2 (国外既発表論文) -------------------------- 査読付の国際会議または学術雑誌等で既発表であるが国内では未発表である研究を紹介する場です．採録決定済みの研究も含みます．PPLへの関連をもとに採否を判定いたしますが，申し込み多数の場合はプログラム委員会で選考致します．カテゴリ3 (ポスター・デモ発表) ------------------------------ 2時間程度のセッション内でのポスター発表またはデモ発表です．既発表・未発表の別を問いません．PPLへの関連をもとに採否を判定いたしますが，申し込み多数の場合はプログラム委員会で選考致します．カテゴリ4 (サーベイ・チュートリアル発表) ---------------------------------------- 研究動向の紹介(発表者の研究も含む) や分野間の相互理解と参加者の知識の底上げとなる発表を募集します．既発表・未発表の別を問いません．PPLへの関連，著者の研究発表実績，トピックや切り口の興味深さをもとに，プログラム委員会で選考致します．招待講演 -------- 丸山宏（Preferred Networks）久野靖（電気通信大学教授）以上お二方の招待講演を予定しております． ===================================================== ================= 投稿・発表申込要領すべてのカテゴリの投稿・発表について，次のURLから申し込んでください． https://easychair.org/conferences/?conf=ppl2018 申込にあたってはEasyChairのアカウントが必要です．4つのカテゴリそれぞれに対する申込要領の詳細は以下の通りです．申し込み時にEasychairで入力する氏名，所属の情報はプログラム作成に用いますので，参加者の便宜を考慮し，日本語が良いと考えられる場合には日本語での入力をお願い致します．最新の情報は上記ウェブページでご確認ください．カテゴリ1 (国内外未発表論文) --------------------------- 投稿手続きは2段階です．発表申込を行った上で論文提出を行ってください．発表申込締切: 2017年12月21日(木) 17:00 (JST) 著者名，所属，論文タイトル，論文概要(日本語300〜400字程度もしくは英語200 words 程度)，キーワード(3つ以上)を提出してください．論文提出締切: 2018年1月9日(火) 17:00 (JST) 10ページ程度(最大15ページ，参考文献を含む)の論文(日本語もしくは英語，PDF形式．PPL2018ウェブページにて指定のスタイルファイルを利用のこと)を提出してください．最大ページ数を超える付録は投稿版に入れて構いませんが，最終原稿においては削除してもらいます．著者のweb page等においてソースコードや実験データなどを載せて引用しても構いません．最大ページ数を超える付録やweb page等の情報については査読において考慮されない場合もあります．採否通知：2018年2月2日(金) 最終原稿締切: 2018年2月15日(木) 採録された論文の最終原稿の提出方法は，採否通知にてお知らせいたします． (注) 採録された論文等著作物は，日本ソフトウェア科学会著作権規定にもとづいて利用されますので，予めご確認ください．また，採録された論文等著作物に対して著作権の譲渡を求めません． (注) 投稿論文と類似の論文を，他の会議(予稿集を出版するもの)・論文誌などに同時投稿する場合は，査読の有無に関わらず，その旨を発表申込および論文提出の際に明記してください．PPLでは同時投稿の事実のみをもって論文を不採録とすることはありませんが，採否の決定に利用する場合があります(他の会議との重複を避けるため，発表内容についての条件付採録とすることもあります)．カテゴリ2 (国外既発表論文) ------------------------- 発表申込時に採録が決定している国際会議および国際学術雑誌等の発表論文が対象です．理論系だけではなく実装系の論文の投稿も歓迎いたします．発表申込締切: 2018年1月22日(月) 17:00 (JST) 原論文(ページ数不問，PDF形式)と論文概要(テキスト形式)を，著者名，所属，論文タイトル，キーワード(3つ以上)と併せて提出してください．論文概要にて，原論文の出典(発表会議名，掲載済／予定の別等を含む)についても明記してください．採否通知：2018年2月2日(金) カテゴリ3 (ポスター・デモ発表) ----------------------------- ポスター発表またはデモ発表(あるいは両方)を募集いたします．発表申込締切: 発表申込締切: 2018年2月5日(月) 17:00 (JST) 希望する発表形態を明記して著者名，所属，発表タイトル，発表概要 (200〜300字程度)，キーワード(3つ以上)を提出してください．発表形態については発表タイトル(Title欄)の最後の部分に括弧（）に入れて，「ポスター」「デモ」「ポスター・デモ」のいずれかを記載してください．採否通知：2018年2月13日(火) カテゴリ4 (サーベイ・チュートリアル発表) --------------------------------------- 発表申込締切: 発表申込締切: 2018年1月22日(月) 17:00 (JST) 著者名，所属，発表タイトル，キーワード(3つ以上)，発表概要(3ページ以内，PDF形式．目的，カバーする話題，想定する聴衆，必要な知識の記述を含むもの)を提出してください．採否通知：採否通知：2018年2月2日(金) ===================================================== 問い合わせ先 ppl2018-oc(a)googlegroups.xn--com()-m53d8hra6b34cycyguk0hje6i3045cmp3h ppl2018-pc-chair(a)jssst-ppl.xn--org(/)-043e5ita1c46ctozdpfoc1401qpyjc ===================================================== プログラム委員会上野雄大 (東北大) 鵜川始陽 (高知工科大) 海野広志 (筑波大学) 江本健斗 (九州工業大) 勝股審也 (NII) 河内谷清久仁 (日本IBM) 倉光君郎 (横浜国立大) 光来健一 (九州工業大) 櫻井孝平 (金沢大) 笹田耕一 (クックパッド) 新屋良磨 (秋田大学) 澄川靖信 (東京理科大) 田辺良則 (鶴見大) 対馬かなえ (NII) 土屋達弘 (大阪大) 鍋島英知 (山梨大) 浜名誠 (群馬大) 星野直彦 (京都大) 堀江倫大 (日本IBM) 前田敦司 (筑波大) 増原英彦 (東京工業大) 松田一孝 (東北大) 南出靖彦 (東京工業大) 森畑明昌 (東京大学) 結縁祥治 (名古屋大) 組織委員会平石拓 (京都大)[組織委員長] 江本健斗 (九州工業大) 森口草介 (関西学院大) 佐藤重幸 (高知工科大) 安部達也 (千葉工業大) 西崎真也 (東京工業大)[プログラム共同委員長] 松崎公紀 (高知工科大)[プログラム共同委員長]

1 0

Call for Papers: CLAR 2018 @ Zhejiang University in Hangzhou, China, 16-17 June 2018.
by Katsuhiko Sano 29 Nov '17

29 Nov '17

**Apologies for cross-postings** The interplay between logic and argumentation has a long history, from ancient Aristotle’s logic to very recent formal argumentation in AI. This is an interdisciplinary research field, involving researchers from, e.g., logic, philosophy, artificial intelligence, and law. The goal of the CLAR 2018 conference is to highlight recent advances in the two fields of logic and argumentation, respectively, and to promote communication between researchers in logic and argumentation within and outside China. CLAR 2018 takes place at Zhejiang University in Hangzhou, China, 16-17 June 2018. Proceedings will be published in Logic in Asia (Springer, Studia Logica Library). We invite submissions of full papers or extended abstracts (see below), from either the field of logic or the field of argumentation. We are particularly interested in works crossing the boundaries between the two (but this is not a requirement). Examples of research questions of interest are (not exclusively!): - What are the roles of logic and/or argumentation in social networks? - How to model legal reasoning, medical reasoning, etc. in logic and/or argumentation? - How can we formalize reasoning in game-theoretic situations? - What are the logical principles, models and patterns of daily life argumentation? - What are the logical theories, methods and techniques that can be of interest to researchers in formal argumentation? - How can existing logics be represented within existing argumentation frameworks? -What are the trade-offs between expressive power and computational complexity in logic and argumentation? - How can we model the strength of arguments? - How can we further develop and apply formal argumentation in AI? - How to identify and formalize argumentation in natural language texts? We invite two types of submissions: full papers (max 12 pages in LNCS format) describing original and unpublished work and extended abstracts (max 5 pages in LNCS format) of preliminary original work or already published work. Accepted full papers will be published in a volume of Springer’s Logic in Asia series (Studia Logica Library). Accepted submissions of both types will be invited for presentation at the conference. Authors of accepted submissions will also be invited to submit extended versions to a special issue of Journal of Applied Logic, after the conference. More information at the website: http://www.xixilogic.org/events/clar2018 Submissions: https://easychair.org/conferences/?conf=clar2018 Important Dates Submission: 15 January 2018 Notification: 5 March 2018 Final version: 12 March 2018 Conference: 16-17 June 2018 Invited Speakers (Confirmed): Natasha Alechina (University of Nottingham, UK) Anthony Hunter (University College London, UK) Organizers: Thomas Ågotnes (University of Bergen & Zhejiang University) Huimin Dong (Zhejiang University) Beishui Liao (Zhejiang University) Fanghong Shi (Zhejiang University) Yì N. Wáng (Zhejiang University) Teng Ying (Zhejiang University City College) If you have any question, please contact Huimin Dong (huimin.dong(a)xixilogic.org) or Teng Ying (skysky_998(a)hotmail.com).

1 0

Project colloquium talk by Jérémy Dubut and Akihisa Yamada on 30 November
by urabenatsuki＠is.s.u-tokyo.ac.jp 28 Nov '17

28 Nov '17

[Apologies for multiple copies] Dear all, Let me advertise our next ERATO MMSD project colloquium talk by Jérémy Dubut and Akihisa Yamada on 30th November, 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 ----- Thu 30 November 2017, 16:30–18:45 ERATO MMSD Takebashi Site Common Room 3 http://group-mmm.org/eratommsd/access.html 16:30-17:30 Jérémy Dubut (NII), Some thoughts on bisimilarity using open morphisms In this talk, I will present some work I have done on open morphisms during my PhD. I will start by giving an introduction on this categorical formalism from Joyal, et al.’s work on bisimilarity defined as the existence of a span of morphisms having some lifting properties with respect to “execution shapes”. I will show you examples, relational and logical characterisations for this bisimilarity. Next, I would like to present two quite different aspects of this theory that I used during my PhD. First, a general framework, called the accessible categorical models, where the open morphisms formalism is particularly nice. This is a case where it is possible to define a nice notion of trees. In this framework, we show that bisimilarity can be precisely captured by the existence of some bisimulation relation on executions, but also that there is a fine notion of unfolding, which acts very similarly as a universal covering. Secondly, a particular case of the theory of Joyal et al.: the bisimilarity of diagrams, namely functors from a small category to a specified category of values. I will show you that this case is equivalent to the existence of a nice notion of bisimulations, which allows us to translate the problem of bisimilarity, to a problem of isomorphisms in the category A, which is useful for (un)decidability. I will finally show you how to translate the general setting of Joyal et al. where the category of paths is small into diagrams, and I will describe the relation between the different bisimilarities involved. 17:45-18:45 Akihisa Yamada (NII), Mathematics for Complexity Analysis IsaFoR is a library of Isabelle-formalized theorems for validating program analyzers, originally on term rewriting. My previous work was to extend the library for more practical programing languages and also to enrich the library with deep results from mathematics. In this talk, I will explain how complexity analysis leads us to formalizing algebraic numbers, the Berlekamp factorization, Jordan normal forms, and the Perron-Frobenius theorem.

1 0

超準解析と数学基礎論のシンポジウム
by YOKOYAMA Keita 24 Nov '17

24 Nov '17

みなさま、北陸先端科学技術大学院大学の横山です。「超準解析と数学基礎論のシンポジウム」のご案内を再送させていただきます。講演枠にまだ少し余裕がありますので、講演の募集を１１月３０日まで延長致します。超準解析だけでなく、数学基礎論一般の講演も歓迎です。ご検討頂ければ幸いです。また、今回の会議では、江田勝哉先生にチュートリアル、木更津高専の倉橋大志先生に招待講演をお願いしております。超準解析を勉強したことのない学生の方等の参加も歓迎です。詳しくは下記ホームページをご覧ください。 http://www.jaist.ac.jp/~y-keita/2017NSA/index.html ********************** 超準解析と数学基礎論のシンポジウム http://www.jaist.ac.jp/~y-keita/2017NSA/index.html 日時：12月15,16日(金,土) 場所：早稲田大学早稲田キャンパス 11号館4階(12/15第四会議室，12/16第三会議室) 講演募集締め切り：11月30日懇親会：12月15日(予定) 世話人：横山啓太(JAIST), 藤原誠(早稲田大学高等研究所) ※この会議は超準解析シンポジウム http://www.jaist.ac.jp/~y-keita/2014SLACS-NSA/ の後継になりますが、今回は超準解析分野を始め、超準構造や超準手法及び関連する数学基礎論の話題を広く募集致します。講演・参加のお申し込みは以下のフォームをご記入の上、11月30日までに y-keita(a)jaist.ac.jp までお送りください。 -------------------- １．お名前２．所属・身分３．メールアドレス４．講演タイトル（未定でも可）/参加のみの予定５．その他（講演希望日など） -------------------- 参加は申し込み無しでも可能ですが、会議室・懇親会の調整や大まかな人数把握等のため、参加をご検討中の方も一度11月30日までに上のフォームでご連絡をいただけますと幸いです。（懇親会等の案内を致します。） ********************** 横山啓太 -- Keita Yokoyama y-keita(a)jaist.ac.jp

1 0

数学の哲学ウィンタースクール
by Makoto Kikuchi 24 Nov '17

24 Nov '17

皆様，以下の要領で「数学の哲学ウィンタースクール」を開催します．日時：2018年1月7日（日）から8日（月，祝）　（両日とも 10:00-12:00, 13:00-15:00, 15:30-17:30 の3コマの予定）場所：京都産業大学サギタリウス館（http://www.kyoto-su.ac.jp/facilities/cam_map.html）講師：金子洋之，岡田光弘，岡本賢吾プログラム：詳細未定（各講師「講義90分+質疑応答30分」x 2コマ）世話人：三好博之，菊池誠内容（変更の可能性があります）：金子洋之：直観主義と不完全性定理（ブラウワ，ゲーデル，ダメットなど）岡田光弘：形式主義と数学の無矛盾性証明（ゲンツェンから竹内外史へ）岡本賢吾：カントと数学基礎論（フレーゲ＆ウィトゲンシュタイン，ヒルベルト＆ゲーデル）昼食：ウィンタースクール開催中はキャンパス内の食堂は営業していません．両日ともお弁当（1000円／食）の手配をします．必要のある方は，参加申込と同時にお申し込みください．懇親会：7日夜に四条河原町周辺で懇親会を開催の予定です．会費は3千円から4千円程度を考えています．参加申込：会場の手配，弁当の手配，懇親会の準備のため，以下の情報を《12月20日》までに菊池（mkikuchi(a)kobe-u.ac.xn--jp)-ub4boe e-mail でご連絡ください． --ここから-- 氏名：所属：身分：（教員・ポスドク等・学生・その他）連絡先 e-mail：弁当：7日（要・不要），8日（要・不要）懇親会：（参加・不参加） --ここまで-- 備考：このウィンタースクールは科研費基盤B「数学の哲学の新たな展開」（代表：菊池誠）の活動の一環として開催されます．来年度以降も開催の予定です．連絡先：菊池誠（mkikuchi(a)kobe-u.ac.jp)

1 0

第52回 MLG数理論理学研究集会のご案内
by Suzuki, Nobu-Yuki 24 Nov '17

24 Nov '17

皆様静岡大学の鈴木信行です。 12月1日--3日の第52回 MLG数理論理学研究集会のご案内です。重複して受け取られた皆様、ご寛恕を賜りますようお願い申し上げます。・期間: 2017年12月1日(金)午後 -- 12月3日(日)午前・場所: 静岡大学　静岡キャンパス　〒422-8529　静岡県静岡市駿河区大谷836 　 (JR静岡駅よりバスで約30分) 申し込み無しでもご参加いただけます。今回のMLGは、静岡大学理学部の教室を使用します。宿泊の手配のお世話はいたしませんので、各自でご手配ください。 (JR静岡駅周辺に宿泊されることをお勧めします。) 会場へのアクセスなど、詳しくは下記のサイトをご覧下さい。 https://wwp.shizuoka.ac.jp/logic-suzuki-mlg/ よろしくお願い致します。

1 0

CFP: 48th TRS Meeting
by Takahito Aoto 23 Nov '17

23 Nov '17

皆様，第48回TRSミーティングの参加募集を案内させて頂きます． --- 青戸等人(新潟大学) ================================================================================== Call For Participation 48th TRS meeting February 25 - 27, 2018 Sendai, Miyagi http://www.nue.ie.niigata-u.ac.jp/events/trs-meeting-48/ * About TRS meeting Term Rewriting Meeting (TRS Meeting) is a biannual informal workshop that aims at promoting the research on rewriting and related areas. Participants are requested to give a talk(s) of approximately 15 - 60 minutes in English on their research activities. The subject of the talk may not be one's original result; for example, explaining an interesting paper is perfectly OK. (See Rewriting Researchers Forum for further information: http://www.jaist.ac.jp/~hirokawa/trs-meeting/) * Information Date: February 25 (Sun) - 27 (Tue), 2018 Venue: Oshu Akiu Onsen Rantei http://www.akiu-rantei.com/lg_en/ 7-1, Aza Kidoho, Yumoto, Akiu-machi, Taihaku-ku, Sendai City, Miyagi 982-0241 * Schedule Opening: 14:00 on Feb 25 (Sun) Closing: 12:00 on Feb 27 (Tue) * Fee Registration: 4,000 JPY Accommodation (two nights): 21,900 JPY Registration fee includes meeting room fee, coffee and snacks at breaks. Accommodation fee includes breakfasts and dinners (lunches are not included). * Registration Please send the registration form below to Takahito Aoto (mail: aoto at ie.niigata-u.ac.jp) no later than Jan 19, 2018. Registration after the deadline is subject to room availability. ---------------------------------------------------------------------- Registration Form of the 48th TRS meeting name: affiliation: [male / female] (leave one) special room request: [single room / twin room / none] (leave one) ---------------------------------------------------------------------- Japanese style shared rooms are default, but several single and twin rooms are also available. If you prefer a single or twin room, let me know at your earliest convenience. In the latter case, let me also know your roommate. * Contact Takahito Aoto (mail: aoto at ie.niigata-u.ac.jp) ==================================================================================

1 0

『第5回山陰基礎論・解析学研究集会』の御案内
by Horihata Yoshihiro 22 Nov '17

22 Nov '17

Logic-ml 各位米子高専の堀畑です。 2018年1月7日（日）終日，8日（月祝）午前に，米子で件名の研究会を開催いたします．基礎論と解析学の気軽な研究交流の場を目指しています．参加者，講演者を募集いたします．詳細は下記ＨＰ参照（ホームから過去開催のプログラムも見られます） https://sites.google.com/site/yonagonctmath/slas2018 【締め切り日】　12/13（水）　← 参加・ご講演頂ける方は，下記連絡票を堀畑（horihata(a)yonago-k.ac.xn--jp)-u63bmd1e2gs5ayc3h4683a. 　12/31（日）　← アブストラクト提出（発表者のみ，添付の「abstract.tex」で作成し，「texファイル」とコンパイルした「pdf」をメール添付にて堀畑まで）【懇親会】　1/6（土）　18時頃～米子駅前の店にて　1/7（日）　18時頃～皆生の店にて（研究会の会場付近） ▼▼連絡票▼▼ （１）講演を行う？　（○ ×）（２）参加する日？　（両日 or 7日のみ or 8日のみ）（３）6日懇親会参加？　（○ ×）（４）7日懇親会参加？　（○ ×）（５）講演タイトル（発表者のみ）要望等： ▲▲▲▲▲▲▲ 周りで興味ありそうな方にもお声掛け頂き，たくさんの方に参加して頂ければ幸いです．堀畑佳宏 -- 米子工業高等専門学校教養教育科・数学〒683-8502 鳥取県米子市彦名町4448 Tel: 0859-24-5075 E-mail: horihata(a)yonago-k.ac.jp

1 0

Kobe Colloquium: Nov. 17, 2017, Satoru Kuroda
by Makoto Kikuchi 18 Nov '17

18 Nov '17

Kobe Colloquium on Logic, Statistics and Informatics 以下の要領でコロキウムを開催します。日時: 2017/11/17 (金) 16.00 - 17:30 場所: 神戸大学六甲台第2キャンパス自然科学総合研究棟3号館421室講演者：黒田覚（群馬県立女子大）題目：竹内－安本強制法について交通：阪急六甲駅またはJR六甲道駅から神戸市バス36系統「鶴甲団地」行きに乗車，「神大本部工学部前」停留所下車，徒歩すぐ． http://www.kobe-u.ac.jp/guid/access/rokko/rokkodai-dai2.html 連絡先：菊池誠　mkikuchi(a)kobe-u.ac.jp

1 1

LFMTP'18 Call for Papers
by Makoto Hamana 17 Nov '17

17 Nov '17

皆様、来年の FLoC (FSCD,IJCAR,ITP,LICS等の合同国際会議)併設の LFMTP 2018 ワークショップのご案内です。〆切はまだ先ですがぜひ投稿をご検討ください。 -- 浜名誠群馬大学理工学府電子情報部門 [Apologies if you receive multiple copies of this announcement] ======================================================================= 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/ ======================================================================= SUBMISSION DEADLINE: 16 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 TBA Important Dates Abstract submission deadline: Monday April 9th Submission deadline: Monday April 16th Notification to authors: Monday May 14th Final version due: Monday June 4th 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

セミナーの案内
by Makoto Kikuchi 15 Nov '17

15 Nov '17

神戸大の菊池です．代理投稿です． -- 国立情報学研究所　新井紀子です。「ロボットは東大に入れるか」プロジェクトでは、以下の講演会を開催します。本セミナーは、言語処理の現状を数理的な方向から解きほぐすことを目的に開催いたします。ご関心のある方はぜひお出かけください。「ロボットは東大に入れるか」セミナー講師：松崎拓也氏（名古屋大学大学院工学研究科） https://researchmap.jp/mtzk 日時：2017年11月24日　15時30分～17時（講演1時間、質疑応答30分）場所：学術総合センタービル　国立情報学研究所12階　1208・1210 講演内容：タイトル：「自然言語処理における統計的機械学習－数理的枠組みと応用の場からの振り返り」概要：自然言語処理の分野では1990年代末から機械学習が主要な道具となり，ここ数年は他分野と同様にニューラルネットの応用が大ブームとなっている．この講演では，統計的機械学習の最も基本的な数理的枠組みを押さえたのち，いくつかの具体的な研究例を示しながら，この15年ほどの自然言語処理分野で実際に何が起きているのかを，私見を交えつつ，数理的観点から振り返る． ※本講演会へは事前申し込みが必要ですので、申し込みフォームから事前にお申し込みください。150名に達しましたら、申し込みを終了いたします。申し込みフォーム： https://arai-lab.netcommons.org/page_20171113013248 ※入館に際しては身分証明証が必要です。入り口で身分証明証をご提示の上、セミナー参加票（ウェブ上で登録の際、参加票が発行されます）をご持参の上、警備員にお伝えください。

1 0

RIMS共同研究（公開型）「証明論と証明活動」のご案内
by Katsumi Sasaki 13 Nov '17

13 Nov '17

みなさま　標記の研究集会　　　研究題目：証明論と証明活動　　　日程：2017年12月25日(月)〜27日(水) 　　　場所：京都大学数理解析研究所420号室の講演募集などの案内を http://www.st.nanzan-u.ac.jp/info/sasaki/2017rims/rims2017.html に載せましたので，ご連絡させていただきます．講演等の申込締切が，早目で，　　11月3日にさせていただいておりますのでご注意ください．　詳細は，上記のURLにありますが，関連する話題をお持ちでしたら，是非とも講演をご検討くださいますようお願いいたします．南山大学　佐々木克巳

1 4

FLOPS 2018 CFP
by Makoto Tatsuta 12 Nov '17

12 Nov '17

皆様、関数型、論理型プログラミング言語の国際会議 FLOPS 2018のご案内です。ふるって投稿をご検討ください。龍田真国立情報学研究所 -------------------------------------------------- FINAL Call For Papers ========================= NOTE: DEADLINE EXTENSION ========================= FLOPS 2018: 14th International Symposium on Functional and Logic Programming In-Cooperation with ACM SIGPLAN =============================== 9-11 May, 2018, Nagoya, Japan http://www.sqlab.jp/FLOPS2018/ Writing down detailed computational steps is not the only way of programming. The alternative, being used increasingly in practice, is to start by writing down the desired properties of the result. The computational steps are then (semi-)automatically derived from these higher-level specifications. Examples of this declarative style include functional and logic programming, program transformation and re-writing, and extracting programs from proofs of their correctness. 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. Scope FLOPS solicits original papers in all areas of the declarative programming: * functional, logic, functional-logic programming, re-writing systems, formal methods and model checking, program transformations and program refinements, developing programs with the help of theorem provers or SAT/SMT solvers; * foundations, language design, implementation issues (compilation techniques, memory management, run-time systems), applications and case studies. FLOPS promotes cross-fertilization among different styles of declarative programming. Therefore, submissions must be written to be understandable by the wide audience of declarative programmers and researchers. Submission of system descriptions and declarative pearls are especially encouraged. Submissions should fall into one of the following categories: * Regular research papers: they should describe new results and will be judged on originality, correctness, and significance. * System descriptions: they should contain a link to a working system and will be judged on originality, usefulness, and design. * Declarative pearls: new and excellent declarative programs or theories with illustrative applications. System descriptions and declarative pearls must be explicitly marked as such in the title. Submissions must be unpublished and not submitted for publication elsewhere. Work that already appeared in unpublished or informally published workshops proceedings may be submitted. See also ACM SIGPLAN Republication Policy. Proceedings The proceedings will be published by Springer International Publishing in the Lecture Notes in Computer Science (LNCS) series (www.springer.com/lncs), as a printed volume as well as online in the digital library SpringerLink. Post-proceedings: The authors of 4-7 best papers will be invited to submit the extended version of their FLOPS paper to a special issue of the journal Science of Computer Programming (SCP). Important dates 29 November 2017 (any time zone): Abstract Submission (extended) 4 December 2017 (any time zone): Submission deadline (extended) 29 January 2018: Author notification 9-11 May 2018: FLOPS Symposium Invited Speakers William E. Byrd, University of Utah, USA Zhenjiang Hu, National Institute of Informatics, SOKENDAI, Japan + 3rd speaker to be announced Submission Submissions must be written in English and can be up to 15 pages long including references, though pearls are typically shorter. The formatting has to conform to Springer's guidelines. Regular research papers should be supported by proofs and/or experimental results. In case of lack of space, this supporting information should be made accessible otherwise (e.g., a link to a Web page, or an appendix). Papers should be submitted electronically at https://easychair.org/conferences/?conf=flops2018 Springer Guidelines https://www.springer.com/gp/computer-science/lncs/conference-proceedings-gu… 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 Jurriaan Rot and Kenta Cho on 9 November
by urabenatsuki＠is.s.u-tokyo.ac.jp 06 Nov '17

06 Nov '17

[Apologies for multiple copies] Dear all, Let me advertise our next ERATO MMSD project colloquium talk by Jurriaan Rot and Kenta Cho on 9th November, 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 ---- Thu 9 November 2017, 16:30–18:45 ERATO MMSD Takebashi Site Common Room 3 http://group-mmm.org/eratommsd/access.html 16:30-17:30 Jurriaan Rot <http://jurriaan.me/> (Radboud University), Traces and Triangles In the theory of coalgebras, trace semantics can be defined in various distinct ways, including through algebraic logics, the Kleisli category of a monad or its Eilenberg-Moore category. I will talk about recent joint work with Bart Jacobs, which elaborates two new unifying ideas in the theory of coalgebraic trace semantics: 1) previous approaches can be placed and connected in so-called state-and-effect triangles, that arise in the semantics of programs; 2) coalgebraic trace semantics is naturally presented in terms of corecursive algebras. This perspective puts the different approaches under a common roof, and allows us to derive conditions under which they coincide. 17:45-18:45 Kenta Cho <https://www.cs.ru.nl/K.Cho/> (Radboud University), String diagrams in probability theory String diagrams are a graphical language for monoidal categories, which has become very popular in categorical quantum mechanics initiated by Abramsky and Coecke. In this talk I will explain that string diagrams are also useful for (classical) probability theory. The Kleisli categories of the distribution and the Giry monad give concrete interpretation of string diagrams, respectively, for discrete probability and general measure-theoretic probability. Topics include disintegration, Bayesian inversion, and conditional independence. The talk is based on joint work with Bart Jacobs; see preprint https://arxiv.org/abs/1709.00322.

1 0

Second Workshop on Mathematical Logic and its Applications
by YOKOYAMA Keita 06 Nov '17

06 Nov '17

みなさま、 3月に金沢にて開催予定の Second Workshop on Mathematical Logic and its Applications の講演募集のご案内です。ご講演・ご参加の検討をいただければ幸いです。横山啓太 ************************************** Call for Abstracts Second Workshop on Mathematical Logic and its Applications Kanazawa, Japan 5 - 9 March 2018 http://www.jaist.ac.jp/is/labs/ishihara-lab/mla2018/ Description ----------- The workshop brings together researchers of mathematical logic and its related areas, and would provide a forum for interplay between these areas. This workshop will be held as a part of the JSPS Core-to-Core Program "Mathematical Logic and its Applications", which is led by Japan Advanced Institute of Science and Technology (JAIST) in cooperation with several institutes both in Japan and abroad. We welcome submissions from anyone, not restricted to the members of the project, within the scope described below. Scope ------ Includes (but not limited to) the following topics and their application: * Intuitionistic logic * Type theory * Proof theory * Constructive analysis/topology * Program extraction * Reverse mathematics * Computable analysis/topology * Recursion theory (Computability theory) * Non-classical logic * Computational complexity Invited speakers ----------------- * Andrew Arana (Université Paris 1) * Douglas Bridges (University of Canterbury) * Laura Crosilla (University of Birmingham, to be confirmed) * Akitoshi Kawamura (Kyushu University) * Hidenori Kurokawa (Kanazawa University) * Maria Emilia Maietti (University of Padova) * Norbert Preining (Accelia Inc.) * Helmut Schwichtenberg (LMU Muenchen) * Kazushige Terui (Kyoto University) * Wim Veldman (Radboud University Nijmegen) * Andreas Weiermann (Ghent University, to be confirmed) Guide for authors ----------------- The authors are asked to prepare short abstracts (1 page PDF) following the guideline on the workshop web-site: http://www.jaist.ac.jp/is/labs/ishihara-lab/mla2018/contributed_talks.html Submissions are accepted through EasyChair https://easychair.org/conferences/?conf=mla2018 Deadline of submission ----------------------- 15 December 2017 Notification of acceptance will be informed by December 31. Programme Committee -------------------- * Ryota Akiyoshi (Waseda, Japan) * Josef Berger (LMU Muenchen, Germany) * Makoto Fujiwara (Waseda, Japan) * Tatsuji Kawai (Padova, Italy) * Katsuhiko Sano (Hokkaido, Japan) * Keita Yokoyama (JAIST, Japan) * Martin Ziegler (KAIST, Korea) Organizers ----------------- * Ryota Akiyoshi (Waseda, Japan) * Makoto Fujiwara (Waseda, Japan) * Tatsuji Kawai (Padova, Italy) * Takako Nemoto (JAIST, Japan) * Keita Yokoyama (JAIST, Japan) Contact address: organizers-jsps2nd(a)jaist.ac.jp -- Keita Yokoyama y-keita(a)jaist.ac.jp

1 0

CFP: TPP 2017 (Dec. 6-7 in Kyoto Univ.)
by Atsushi Igarashi 31 Oct '17

31 Oct '17

京都大学の五十嵐です．第１３回 TPP (Theorem Proving and Provers) ミーティングを１２月６日（水）の午後から１２月７日（木）までの予定で、京都大学吉田キャンパスにて開催します．このミーティングは， 2005 年から年に１回開催され，定理証明系を作っている人から使う側の人まで幅広い人たちが集まり，様々な側面からの話をしてアイディアの交換をしてきたものです．ミーティング期間中の討論を大切にしたいと考えていますので，出来上がった仕事の講演だけでなく，進行中の仕事、未完成の仕事についての講演も歓迎します．参加者には可能な限りご講演いただきたいと希望しています．参加者と講演の概数を把握したいので，参加される(かもしれない)方は、 https://docs.google.com/forms/d/e/1FAIpQLSeNY78Nptel4SY_U5MAGMX6qEzyipeFBSn… 経由で 11月22日(水)までに参加申し込みをしてください．また12月6日(水) の夜に懇親会を予定しております．こちらの参加(するかもしれない)表明をお願いいたします．恒例のTPP問題を含む，詳しい情報は https://aigarashi.github.io/TPP2017/ にあります．多数のご参加をお待ちしております．どうぞよろしくお願いします．五十嵐淳

1 0

[1st CFP] Bx 2018: 7th International Workshop on Bidirectional Transformations
by Kazutaka Matsuda 25 Oct '17

25 Oct '17

皆様，東北大学の松田です． <Programming> 2018に併設して開催されるワークショップ Bx 2018 の論文募集の案内をお送りいたします．もしよろしければ，ご投稿を検討いただけますと幸いです． --------------------------------------------------------- FIRST CALL FOR PAPERS ===================== Bx 2018: 7th International Workshop on Bidirectional Transformations Nice, France (co-located with <Programming> 2018) https://2018.programming-conference.org/track/bx-2018-papers ---------------------------------------------------------------------- Bidirectional transformations (bx) are a mechanism for maintaining the consistency of at least two related sources of information. Such sources can be relational databases, software models and code, or any other document following standard or ad-hoc formats. Bx are an emerging topic in a wide range of research areas, with prominent presence at top conferences in several different fields (namely databases, programming languages, software engineering, and graph transformation), but with results in one field often getting limited exposure in the others. Bx 2018 is a dedicated venue for bx in all relevant fields, and is part of a workshop series that was created in order to promote cross-disciplinary research and awareness in the area. As such, since its beginning in 2012, the workshop has rotated between venues in different fields. IMPORTANT DATES --------------- - Paper submission: Jan. 18, 2018 - Author notification: Feb. 17, 2018 - Workshop: To be announced (Apr. 9 or Apr. 10, 2018) AIM & TOPICS ------------ The aim of the workshop is to bring together researchers and practitioners, established and new, interested in bx from different perspectives, including but not limited to: - bidirectional programming languages and frameworks - data and model synchronization - view updating - inter-model consistency analysis and repair - data/schema (or model/metamodel) co-evolution - coupled software/model transformations - inversion of transformations and data exchange mappings - domain-specific languages for bx - analysis and classification of requirements for bx - bridging the gap between formal concepts and application scenarios - analysis of efficiency of transformation algorithms and benchmarks - survey and comparison of bx technologies - case studies and tool support PAPER CATEGORIES ---------------- The BX 2018 program committee considers five categories of submissions: - Full Research Papers (up to 10 pages) * in-depth presentations of novel concepts and results * applications of bx to new domains * survey papers providing novel comparisons between existing bx technologies and approaches case studies - Tool Papers (up to 6 pages) * guideline papers presenting best practices for employing a specific bx approach (with a specific tool) * presentation of new tools or substantial improvements to existing ones * qualitative and/or quantitative comparisons of applying different bx approaches and tools - Experience Report (up to 4 pages) * sharing experiences and lessons learned with bx tools/frameworks/languages * how bx is used in (research/industrial/educational) projects - Extended Abstracts (up to 3 pages) * work in progress * small focused contributions * position papers and research perspectives * critical questions and challenges for bx - Talk Proposals (up to 2 pages) * proposed lectures about topics of interest for bx * existing work representing relevant contributions for bx * promising contributions that are not mature enough to be proposed as papers of the other categories All papers are expected to be self-contained and well-written. Tool papers are not expected to present novel scientific results, but to document artifacts of interest and share bx experience/best practices with the community. Experience papers are expected to report on lessons learnt from applying bx approaches, languages, tools and theories to practical application case studies. Extended abstracts should primarily provoke interesting discussion at the workshop and will not be held to the same standard of maturity as regular papers. Talk proposals are expected to present works of particular interest for the community and that are worth a talk slot at the workshop. We strongly encourage authors to ensure that any (variants of) examples are present in the bx example repository at the time of submission, and for tool papers, to allow for reproducibility with minimal effort, either via a virtual machine (e.g. via Share - http://share20.eu) or a dedicated website with relevant artifacts and tool access. All papers will be peer-reviewed by at least three members of the program committee. PROCEEDINGS ----------- The workshop proceedings, including all accepted papers (except talk proposals), will be published as International Conference Proceedings Series in the ACM Digital Library before the workshop. SUBMISSION GUIDELINE -------------------- Submission site is to be announced. Submissions should use the ACM Conference acmart Format with the ‘sigconf’ option (http://www.acm.org/publications/proceedings-template) with a font size of 10 point and the font family Times New Roman. All submissions should be in PDF format. If you use LaTeX or Word, please use the provided ACM acmart templates. Otherwise, please follow the ACM author instructions. If you are formatting your paper using LaTeX, you will need to set the 10pt option in the \documentclass command. If you are formatting your paper using Word, you may wish to use the provided Word template that supports this font size. Please include page numbers in your submission for review using the LaTeX command \settopmatter{printfolios=true} (see examples in template). Please also ensure that your submission is legible when printed on a black and white printer. In particular, please check that colors remain distinct and font sizes are legible. Submissions not complying with the above guidelines may be excluded from the reviewing process without further notice. If a paper is accepted, at least one author of the paper is expected to participate in the workshop to present it. Authors of accepted tool papers are also expected to be available to demonstrate their tool at the event. PROGRAM CO-CHAIRS ----------------- - Jens Weber (University of Victoria) - Kazutaka Matsuda (Tohoku University) PROGRAM COMMITTEE MEMBERS ------------------------- To be announced.

1 0

MLG 数理論理学研究集会
by Suzuki, Nobu-Yuki 25 Oct '17

25 Oct '17

皆様静岡大学の鈴木信行です。第52回 MLG数理論理学研究集会のご案内です。重複して受け取られた皆さま、ご寛恕を賜りますようお願い申し上げます。ご参加・ご講演のお申込み、〆切が近づきました。 11月1日(水)までに、以下の申し込みフォームをお送りください。送り先: mlg52.shizuoka(a)gmail.com 件名: MLG52申込申し込みフォーム： -------------------- １．お名前２．所属・身分３．メールアドレス４．講演する・しない５．講演する場合タイトル（未定でも可）６．懇親会(12月1日)に参加する・しない７．備考 (講演の希望日などがありましたらこちらにご記入ください) -------------------- 申し込み無しでもご参加いただけますが、懇親会（大学内で行う予定です）の参加を希望される場合は必ずお申し込みください。今回のMLGは、静岡大学理学部の教室を使用します。宿泊の手配のお世話はいたしませんので、各自でご手配ください。 (JR静岡駅周辺に宿泊されることをお勧めします。) 会場へのアクセスなど、詳しくは下記のサイトをご覧下さい。 https://wwp.shizuoka.ac.jp/logic-suzuki-mlg/ よろしくお願い致します。

1 0

CALL FOR PARTICIPATION: Logic and Engineering of Natural Language Semantics 14 (LENLS 14)
by Katsuhiko Sano 20 Oct '17

20 Oct '17

（重複して受け取られた場合はご容赦ください）皆様、北海道大学の佐野勝彦と申します。今年の11月に東京で開催される LENLS 14 国際ワークショップのご案内をお送り致します。皆様のご参加をお待ちしております。 [Apologies for multiple copies] ================================================================= CALL FOR PARTICIPATION Logic and Engineering of Natural Language Semantics 14 (LENLS 14) Workshop Site : Bunkyo School Building in University of Tsukuba, Tokyo Campus Bunkyo-ku, Tokyo, Japan http://www.tsukuba.ac.jp/en/access/tokyocampus-access Dates : November 13-15, 2017 Contact Person: Katsuhiko Sano (Hokkaido University) Contact Email : lenls14[[at]]easychair.org Website : http://www.is.ocha.ac.jp/~bekki/lenls/ ================================================================= Chair: Katsuhiko Sano (Hokkaido University) Co-chair: Daisuke Bekki (Ochanomizu University/JST CREST) Eric McCready (Aoyama Gakuin University) Koji Mineshima (Ochanomizu University/JST CREST) Invited Speakers: - Craige Roberts (The Ohio State University) - Ivano Ciardelli (Munich Center for Mathematical Philosophy, LMU Munchen) - Shoichi Takahashi (Aoyama Gakuin University) LENLS is an annual international workshop on formal syntax, semantics and pragmatics. It will be held as one of the workshops of the JSAI International Symposia on AI (isAI2017) (https://www.ai-gakkai.or.jp/isai/) sponsored by the Japan Society for Artificial Intelligence (JSAI). Aims and Topics: ================ We invite submissions to this year's workshop on topics in formal syntax, semantics and pragmatics, and related fields, including but in no way limited to the following: - Formal syntax, semantics and pragmatics of natural language - Model-theoretic and/or proof-theoretic semantics of natural language - Computational Semantics - Game-theoretic/Bayesian approaches to pragmatics - Nonclassical Logic and its relation to natural language (especially Substructural/Fuzzy/Categorical/Topological logics) - Formal Philosophy of language - Scientific methodology and/or experimental design for linguistics Important dates: ================ Deadline for camera-ready copy: October 16, 2017 Deadline for onsite registration: November 1, 2017 LENLS14: November 13-15, 2017 Registration: ============= The proceedings of the workshop will be available at the conference site for registered persons. Please follow the link below and register yourself until End of October, 2017. https://www.ai-gakkai.or.jp/isai/registration2017 Program: ======== 1st Day: November 13 (Mon) ------------------------- 9:00-10:00:Registration 10:00-11:30:Session * Lukas Rieser "Quality as a speech-act CI and presuppositions" * Hitomi Hirayama "Towards a Unified Analysis of Contrastive wa as Contrastive Topic" * Michael Yoshitaka Erlewine and Hadas Kotek "Intervention tracks scope-rigidity in Japanese" 11:30-12:50:Lunch 12:50-14:20:Session * Yulia Zinova "Explaining prefix contributions in Russian using Frame Semantics and RSA" * Liping Tang "A Signaling Model for Pictorial and Alphabet Writings" * Ilaria Frana and Keir Moulton "Derived Nominals and Concealed Propositions" 14:20-14:35:Coffee Break 14:35-16:05:Session * Dan Zeman "Perspectival Plurality, Relativism, and Multiple Indexing" * Fabrizio Cariani and Simon Goldstein "Conditional heresies" * Andres Soria Ruiz "It's Getting Better All The Time: An Expressivist Semantics For Comparative Value Judgments" 16:05-16:20:Coffee Break 16:20-17:20:Invited Talk * Ivano Ciardelli "Two Switches in the Theory of Counterfactuals" 2nd Day: November 14 (Tue) ------------------------- 10:00-11:30:Session * Yu Izumi and Shintaro Hayashi "Expressive Small Clauses in Japanese" * Osamu Sawada and Jun Sawada "The dependent property of the Japanese inferential use of no koto-da: An evidence indicator for an inferential modal statement" * Gregoire Winterstein, Regine Lai and Zoe Luk "Denials and negative emotions: a unified analysis of the Cantonese expressive 'gwai2'" 11:30-12:50:Lunch 12:50-14:20:Session * Kristina Liefke "Relating Intensional Models of Formal Semantics: established methods and surprising results" * Oleg Kiselyov "Transformational Semantics on a Tree Bank" * Simon Charlow "A modular theory of pronouns and binding" 14:20-14:35:Coffee Break 14:35-16:05:Session * Robert Henderson and Eric McCready "How Dogwhistles Work" * Emily Lake "Ideological legibility as a primary pragmatic process in the interpretation of implicit content" * Eric McCready and Christopher Davis "An Invocational Theory of Slurs" 16:05-16:20:Coffee Break 16:20-17:20:Invited Talk * Craige Roberts "Character assassination: Indexicals in a new perspective" 19:30-:Banquet 3rd Day: November 15 (Wed) ------------------------- 10:00-11:30:Session * Katsuhiko Yabushita "On the suspendability of the prejacent of an only sentence" * Hiroaki Nakamura "Discontinuity in Potential Sentences in Japanese" * Roussanka Loukanova "Semantic Argument Slots in the Type-Theory of Acyclic Recursion and Syntax-Semantics Interfaces in CBLG" 11:30-12:50:Lunch 12:50-14:20:Session * Tatiana Bladier, Kilian Evang and Yulia Zinova "Aspecto-Temporal Representation of Slavic Aktionsarten in DRT with Boxer" * Mathieu Lafourcade, Bruno Mery, Mehdi Mirzapour, Richard Moot and Christian Retore. "Collecting Crowd-Sourced Lexical Coercions for Compositional Semantic Analysis" * Alastair Butler and Stephen Wright Horn "Annotating syntax and lexical semantics with(out) indexing" 14:20-14:35:Coffee Break 14:35-16:05:Session * Patrick Elliott "An algebraic theory of attitude reports" * Chungmin Lee "Languages with non-factive knowledge verbs" * Yurie Hara, Naho Orita and Hiromu Sakai "Evidentials in Causal Premise Semantics: A Rating Study" 16:05-16:20:Coffee Break 16:20-17:20:Invited Talk * Shoichi Takahashi "Lethal Restrictors: Remedies and Ramifications" Sponsor: ======== LENLS is being organized by an alliance of "Establishment of Knowledge-Intensive Structural Natural Language Processing and Construction of Knowledge Infrastructure" (http://nlp.ist.i.kyoto-u.ac.jp/CREST/?en) project, funded by JST CREST Programs "Advanced Core Technologies for Big Data Integration" (http://www.jst.go.jp/kisoken/crest/en/research_area/ongoing/areah25-6.html). Workshop Organizers/Program Committee: ====================================== - Katsuhiko Sano (Hokkaido University) - Daisuke Bekki (Ochanomizu University/JST CREST) - Eric McCready (Aoyama Gakuin University) - Koji Mineshima (Ochanomizu University/JST CREST) - Alastair Butler (National Institute for Japanese Language and Linguistics) - Richard Dietz (Yamanashi Gakuin University) - Naoya Fujikawa (Tokyo Metropolitan University) - Yoshiki Mori (University of Tokyo) - Yasuo Nakayama (Osaka University) - David Y. Oshima (Nagoya University) - Osamu Sawada (Mie University) - Wataru Uegaki (Leiden University) - Katsuhiko Yabushita (Naruto University of Education) - Tomoyuki Yamada (Hokkaido University) - Shunsuke Yatabe (Kyoto University) - Kei Yoshimoto (Tohoku University)

1 0

CFP: PPL2018 第20回プログラミングおよびプログラミング言語ワークショップ論文募集
by Shin-ya Nishizaki 12 Oct '17

12 Oct '17

logic-mlの皆様下記の通り、PPL2018のCFPを連絡させて頂きます。是非、投稿・参加をご検討ください。東京工業大学学術国際情報センター西崎真也 ================================================================ 第20回プログラミングおよびプログラミング言語ワークショップ (PPL2018) http://jssst-ppl.org/workshop/2018/ 主催: 日本ソフトウェア科学会プログラミング論研究会日程: 2018年3月5日(月)～3月7日(水) 会場: 鳥取県米子市皆生温泉「皆生グランドホテル天水」 PPL2018は，プログラミングとプログラミング言語に関連する幅広い分野の研究者・技術者・学生が一堂に会し，最新の研究成果の発表や，新たな研究課題の提案・討論・アイディア交換を行うことを目的とした，合宿形式の研究集会です．プログラミング方法論，プログラミング言語の理論・設計・実装などに関する研究発表を，カテゴリ別に幅広く募集します．カテゴリ1 (国内外未発表論文) ---------------------------- 完成した理論やシステムの研究発表のみならず，萌芽的なアイディアや問題点の提示等も歓迎します．発展途上の研究内容も積極的に採録する方針です．また，カテゴリ1で発表された研究については，会場での討議や査読コメントをもとにその完成度を高め，将来の学術雑誌・国際会議等での業績に結び付けることを奨励しています．そのため，予稿集の配布は参加者のみへの限定的なものとします．発表申込を行った上で論文提出を行ってください．発表申込締切: 2017年12月21日(木) 17:00 (JST) 論文提出締切: 2018年1月9日(火) 17:00 (JST) 採否通知：2018年2月2日(金) カテゴリ2 (国外既発表論文) -------------------------- 査読付の国際会議または学術雑誌等で既発表であるが国内では未発表である研究を紹介する場です．採録決定済みの研究も含みます．PPLへの関連をもとに採否を判定いたしますが，申し込み多数の場合はプログラム委員会で選考致します．発表申込締切: 2018年1月22日(月) 17:00 (JST) 採否通知：2018年2月2日(金) カテゴリ3 (ポスター・デモ発表) ------------------------------ 2時間程度のセッション内でのポスター発表またはデモ発表です．既発表・未発表の別を問いません．PPLへの関連をもとに採否を判定いたしますが，申し込み多数の場合はプログラム委員会で選考致します．発表申込締切: 2018年2月5日(月) 17:00 (JST) 採否通知：2018年2月13日(火) カテゴリ4 (サーベイ・チュートリアル発表) ---------------------------------------- 研究動向の紹介(発表者の研究も含む) や分野間の相互理解と参加者の知識の底上げとなる発表を募集します．既発表・未発表の別を問いません．PPLへの関連，著者の研究発表実績，トピックや切り口の興味深さをもとに，プログラム委員会で選考致します．発表申込締切: 2018年1月22日(月) 17:00 (JST) 採否通知：2018年2月2日(金) 申込方法や詳細につきましては，上記ウェブページにて確定次第お知らせ致します． ================================================================ 問い合わせ先 ppl2018-oc(a)googlegroups.xn--com()-m53d8hra6b34cycyguk0hje6i3045cmp3h ppl2018-pc-chair(a)jssst-ppl.xn--org()-m53d8hra6b05cqqod3b1719ofh4b ================================================================ プログラム委員会上野雄大(東北大) 鵜川始陽(高知工科大) 海野広志(筑波大学) 江本健斗(九州工業大) 勝股審也(NII) 河内谷清久仁(日本IBM) 倉光君郎(横浜国立大) 光来健一(九州工業大) 櫻井孝平(金沢大) 笹田耕一(クックパッド) 新屋良磨(東京大) 澄川靖信(東京理科大) 田辺良則(鶴見大) 対馬かなえ(NII) 土屋達弘(大阪大) 鍋島英知 (山梨大) 浜名誠(群馬大) 星野直彦(京都大) 堀江倫大(日本IBM) 前田敦司(筑波大) 増原英彦(東京工業大) 松田一孝(東北大) 南出靖彦(東京工業大) 森畑明昌(東京大学) 結縁祥治(名古屋大) 組織委員会平石拓 (京都大)[組織委員長] 江本健斗 (九州工業大) 森口草介 (関西学院大) 佐藤重幸 (高知工科大) 安部達也 (千葉工業大) 西崎真也 (東京工業大)[プログラム共同委員長] 松崎公紀 (高知工科大)[プログラム共同委員長]

1 0

数学基礎論若手の会２０１７のご案内（再送）
by Toshimichi Usuba 12 Oct '17

12 Oct '17

MLの皆様、早稲田大学の薄葉です。締め切りが近づいてまいりましたので再度数学基礎論若手の会についてご案内させていただきます。講演、宿泊ともにまだ余裕がありますのでふるってご参加ください。数学基礎論若手の会は，数学基礎論を専攻する学生および若手研究者の研究交流を目的とする合宿形式の研究集会です．講演はオリジナルの成果発表に限らず，研究の途中報告や研究内容の紹介など幅広く募集しています．また，これから数学基礎論を勉強したいと思っている方のご参加も歓迎します．多くの方のご参加・ご講演をお待ちしています．日時２０１７年１０月２７日（金）午後～２９日（日）午前場所財団法人大学セミナーハウス https://iush.jp/ 住所〒192-0372東京都八王子市下柚木1987-1 世話人　薄葉季路（早稲田大学基幹理工学部）連絡先　usuba(a)waseda.jp ウェブページ　https://sites.google.com/view/kisoronwakatenokai2017/%E3%83%9B%E3%83%BC%E3%… 参加費用：１４０００円程度（宿泊費、食事、懇親会費ふくむ。部分参加や食事をとられない場合はその分割引になります）参加を希望される方は、以下の情報を薄葉(usuba(a)waseda.xn--jp)-ub4boe 件名：数学基礎論若手の会参加申込にてお送りください。参加申し込み締め切り：９月１５日＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝・所属大学，学部，立場（修士1年，博士2年，社会人、ポスドク，助教など）・氏名，性別・講演希望するorしない（講演希望の場合、後日題目と概要をお送りください）・２７日の宿泊を希望するorしない・２８日の宿泊を希望するorしない・２７日の夕食を希望するorしない・２８日の朝食を希望するorしない・２８日の昼食を希望するorしない・２８日の夜の懇親会に参加するorしない・２９日の朝食を希望するorしない・その他（質問、講演希望日など）＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝ -- Toshimichi USUBA School of Fundamental Science and Engineering, Waseda University

1 1

第37回量子情報技術研究会(QIT37)申込締切延長
by NISHIMURA Harumichi 11 Oct '17

11 Oct '17

logic-mlの皆様第３７回量子情報技術研究会（QIT37）の発表申込締切が延長されたとのことですので，延長後の日程に変更した会告をご案内させていただきます（招待講演者の情報も増えています）．ご興味をお持ちの方は講演申込もご検討のほどよろしくお願いいたします．名古屋大学大学院情報学研究科西村治道＜申込締め切りを延長しました＞ ---------------------------------------------------------- QIT37 第37回量子情報技術研究会研究会の内容情報科学と量子力学を融合させた新しい分野，量子情報科学に関する研究会です．情報を担う物理系の量子力学的側面を積極的に活かした新しい情報処理原理の研究とそこから開かれる新しい学問体系の構築および新しい情報技術パラダイムの創生を目指して，情報科学，物理学，光エレクトロニクスを含む理学，工学，数理科学に携わる研究者間に自由な討論の場を提供し，この研究分野の発展を図ることを目的としています．　第３７回研究会を下記のように開催いたします．現在この分野で活躍する研究者は勿論，自分の研究資産が何らかの形で使えそうだと予感している研究者・技術者など，広く関連する分野の研究者・技術者からの発表，聴講を募集致します．奮ってご参加ください．日時：平成２９年１１月１６日（木），１７日（金）会場：埼玉大学総合研究棟１階シアター教室　　　（〒338-8570 さいたま市桜区下大久保255）発表募集分野：（申し込み状況によっては査読可能性あり）：量子情報，　　　　　　　　　量子計算，量子暗号など広く量子情報技術に関わる理論的　　　　　　　　　研究，実験的研究，計算機科学的研究，数学的研究，及び　　　　　　　　　その他関連分野定員：１４０名程度参加費：事前振込み　一般4,000円，学生3,000円　　　　（当日会場支払いは一般5,000円，学生4,000円）　　　　（懇親会は別途）研究会参加申込要領：講演(口頭，ポスター)希望者，聴講希望者は下記Webにて受付を行います．http://staff.aist.go.jp/s-kawabata/qit/ 招待講演：　小坂英男（横浜国立大学）「ダイヤモンドへの量子テレポーテーション転写と万能ホロノミック　量子操作～量子系の機械学習による最適量子操作の試みと量子情報　通信への応用～」　添田彬仁（東京大学）「高階量子情報処理の最近の展開」　古澤明（東京大学）「Hybrid quantum information processing: A way for large-scale 　optical quantum information processing」　森前智行（群馬大学）「セキュアクラウド量子計算」申込締め切り（延長しました）【講演申込締め切り】　　　平成２９年１０月１６日（月）口頭　　　　　　　　　　　　　平成２９年１０月２０日（金）ポスター【PDF原稿提出締め切り】　平成２９年１０月２０日（金）【参加申込締め切り】　　　平成２９年１０月２７日（金） [問合先] 小柴健史 (早稲田大学) 小川朋宏 (電気通信大学) 大久保潤 (埼玉大学) E-mail　qit37(a)list.waseda.jp 主催：電子情報通信学会　量子情報技術特別研究専門委員会（委員長　竹内繁樹（京都大学））共催：応用物理学会量子エレクトロニクス研究会 ----------------------------------------------------------

1 0

FSCD 2018 Call for Papers
by Takahito Aoto 11 Oct '17

11 Oct '17

皆様，国際会議 FSCD 2018 の論文募集をご案内致します．来年7月に，FLoC 2018 の一環として Oxford での開催です．投稿〆切は，1月22日です．ぜひ投稿をご検討いただければ幸いです． --- 青戸等人(新潟大学) --------------------------------------------------------------------------------------------------- Third International Conference on Formal Structures for Computation and Deduction (FSCD 2018) Oxford, UK, July 9 - 12th, 2018 Part of The Federated Logic Conference, FLoC 2018, July 6 - 19th, 2018. TOPICS: FSCD http://fscd-conference.org/ <http://fscd-conference.org/> covers all aspects of formal structures for computation and deduction from theoretical foundations to applications. Building on two communities, RTA (Rewriting Techniques and Applications) and TLCA (Typed Lambda Calculi and Applications), FSCD embraces their core topics and broadens their scope to closely related areas in logics, proof theory, new emerging models of computation (e.g. homotopy type theory or quantum computing), semantics and verification in new challenging areas (e.g. blockchain protocols or deep learning algorithms). PUBLICATION : The proceedings will be published as an electronic volume in the Leibniz International Proceedings in Informatics (LIPIcs) of Schloss Dagstuhl http://www.dagstuhl.de/publikationen/lipics/ <http://www.dagstuhl.de/publikationen/lipics/> All LIPIcs proceedings are open access. SUBMISSION GUIDELINES : Submissions can be made in two categories. - Regular research papers are limited to 15 pages and must present original research which is unpublished and not submitted elsewhere. - System descriptions are limited to 6 pages (excluding references) and must present new software tools in which FSCD topics play an important role, or significantly new versions of such tools. Submissions must be formatted using the LIPIcs style files and submitted via EasyChair. Complete instructions on submitting a paper can be found on the conference web site http://www.cs.le.ac.uk/events/fscd2018/ <http://www.cs.le.ac.uk/events/fscd2018/> IMPORTANT DATES: All deadlines are midnight anywhere-on-earth (AoE); late submissions will not be considered. Titles and Short Abstracts: January 15th, 2018 Full Papers: January 22nd, 2018 Rebuttal period: March 22 - 25th, 2018 Authors Notification: April 2nd, 2018 Final version for proceedings: May 2nd, 2018 BEST PAPER AWARD BY JUNIOR RESEARCHERS: The program committee will consider declaring this award to a paper in which at least one author is a junior researcher, i.e. either a student or whose PhD award date is less than three years from the first day of the meeting. Other authors should declare to the PC Chair that at least 50% of contribution is made by the junior researcher(s). SPECIAL ISSUE: Authors of selected papers will be invited to submit an extended version for a special issue of Logical Methods in Computer Science. PROGRAM COMMITTEE CHAIR Hélène Kirchner, Inria PROGRAM COMMITTEE S. Akshay, IIT Bombay T. Aoto, Niigata U. P. Arrighi, Marseille U. L. Birkedal, Aarhus U. E. Bonelli, Quilmes U. A. Bouhoula, Carthage U. C. Castro, F. Santa Maria Tech. U. U. Dal Lago, Bologna U. S. Escobar, U.P. Valencia M. Fernández, King's College London V. Ganesh, Waterloo U. H. Geuvers, Nijmegen U. M. Hasegawa, Kyoto U. H. Kirchner, Inria P.B. Levy, U. of Birmingham C. Loeding, Aachen U. A. Miquel, UdelaR, Montevideo G. Moser, Innsbruck U. C. Nalon, Brasilia U. V. Nigam, Paraiba U. & fortiss P. C. Ölveczky, Oslo U. G. Rosu, Illinois U. P. Severi, Leicester U. V. Sofronie-Stokkermans, Koblenz-Landau U. N. Tabareau, Inria R. Thiemann, Innsbruck U. A. Tiu, NTU Singapore F. van Raamsdonk, VU Amsterdam L. Zhi, CAS Beijing CONFERENCE & WORKSHOP CHAIR: Paula Severi, Leicester U. PUBLICITY CHAIR: Sandra Alves, Porto U. FSCD STEERING COMMITTEE T. Altenkirch (Nottingham U.), S. Alves (Porto U.), M. Fern\'andez (King's College London), C. Fuhs (Birkbeck, London U.), D. Kesner (Paris U.), N. Kobayashi (Tokyo U.), D. Miller (Inria), L. Ong (Chair, Oxford U.), B. Pientka (McGill U.), S. Staton (Oxford U.), R. Thiemann (Innsbruck U.). ---------------------------------------------------------------------------------------------------

1 0

25th WoLLIC 2018 (Bogotá, Colombia) - Call for Papers
by 小野寛晰 10 Oct '17

10 Oct '17

[Apologies for multiple copies.] WoLLIC 2018 25th Workshop on Logic, Language, Information and Computation July 24th to 27th, 2018 Bogotá, Colombia SCIENTIFIC SPONSORSHIP Interest Group in Pure and Applied Logics (IGPL) The Association for Logic, Language and Information (FoLLI) Association for Symbolic Logic (ASL) European Association for Theoretical Computer Science (EATCS) European Association for Computer Science Logic (EACSL) ACM Special Interest Group on Logic and Computation (ACM-SIGLOG) (TBC) Sociedade Brasileira de Computação (SBC) Sociedade Brasileira de Lógica (SBL) ORGANISATION Departamento de Matemáticas, Universidad de los Andes, Colombia Centro de Informática, Universidade Federal de Pernambuco, Brazil HOSTED BY Departamento de Matemáticas, Universidad de los Andes, Colombia CALL FOR PAPERS WoLLIC is an annual international forum on inter-disciplinary research involving formal logic, computing and programming theory, and natural language and reasoning. Each meeting includes invited talks and tutorials as well as contributed papers. The twenty-fifth WoLLIC will be held at the Departamento de Matemáticas of the Universidad de los Andes, Bogotá, Colombia, from July 24th to 27th, 2018. It is sponsored by the Association for Symbolic Logic (ASL), the Interest Group in Pure and Applied Logics (IGPL), the The Association for Logic, Language and Information (FoLLI), the European Association for Theoretical Computer Science (EATCS), the European Association for Computer Science Logic (EACSL), ACM Special Interest Group on Logic and Computation (ACM-SIGLOG) (TBC), the Sociedade Brasileira de Computação (SBC), and the Sociedade Brasileira de Lógica (SBL). PAPER SUBMISSION Contributions are invited on all pertinent subjects, with particular interest in cross-disciplinary topics. Typical but not exclusive areas of interest are: foundations of computing and programming; novel computation models and paradigms; broad notions of proof and belief; proof mining, type theory, effective learnability; formal methods in software and hardware development; logical approach to natural language and reasoning; logics of programs, actions and resources; foundational aspects of information organization, search, flow, sharing, and protection; foundations of mathematics; philosophy of mathematics; philosophical logic; philosophy of language. Proposed contributions should be in English, and consist of a scholarly exposition accessible to the non-specialist, including motivation, background, and comparison with related works. Articles should be written in the LaTeX format of LNCS by Springer (see authors instructions at http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0 <http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0>). They must not exceed 12 pages, with up to 5 additional pages for references and technical appendices. The paper's main results must not be published or submitted for publication in refereed venues, including journals and other scientific meetings. It is expected that each accepted paper be presented at the meeting by one of its authors. (At least one author is required to pay the registration fee before granting that the paper will be published in the proceedings.) Papers must be submitted electronically at the WoLLIC 2018 EasyChair website. (Please go to http://wollic.org/wollic2018/instructions.html <http://wollic.org/wollic2018/instructions.html> for instructions.) A title and single-paragraph abstract should be submitted by Mar 11, 2018, and the full paper by Mar 18, 2018 (firm date). Notifications are expected by Apr 15, 2018, and final papers for the proceedings will be due by Apr 22, 2018 (firm date). PROCEEDINGS The proceedings of WoLLIC 2018, including both invited and contributed papers, will be published in advance of the meeting as a volume in Springer's LNCS series. In addition, abstracts will be published in the Conference Report section of the Logic Journal of the IGPL, and selected contributions will be published (after a new round of reviewing) as a special post-conference WoLLIC 2018 issue of a scientific journal (to be confirmed). INVITED SPEAKERS (TBA) STUDENT GRANTS ASL sponsorship of WoLLIC 2018 will permit ASL student members to apply for a modest travel grant (deadline: May 1st, 2018). See http://www.aslonline.org/studenttravelawards.html <http://www.aslonline.org/studenttravelawards.html> for details. IMPORTANT DATES Mar 11, 2018: Paper title and abstract deadline Mar 18, 2018: Full paper deadline Apr 15, 2018: Author notification Apr 22, 2018: Final version deadline (firm) PROGRAMME COMMITTEE Siddharth Bhaskar (Haverford College, USA) Torben Braüner (Roskilde University, Denmark) Hazel Brickhill (University of Bristol, UK) Michael Detlefsen (University of Notre Dame, USA) Juliette Kennedy (University of Helsinki, Finland) Sophia Knight (Uppsala University, Sweden) Alex Kruckman (Indiana University, USA) Maricarmen Martinez Baldares (Universidad de los Andes, Colombia) Frederike Moltmann (CNRS, France) Lawrence Moss (Indiana University, USA) (CHAIR) Cláudia Nalon (University of Brasília, Brazil) Valeria de Paiva (Nuance Comms, USA, and University of Birmingham, UK) Sophie Pinchinat (IRISA Rennes, France) David Pym (University College London, UK) Ruy de Queiroz (Univ Federal de Pernambuco, Brazil) Revantha Ramanayake (Vienna University of Technology, Austria) Giselle Reis (Carnegie Mellon University, Qatar) Jeremy Seligman (The University of Auckland, New Zealand) Yanjing Wang (Peking University, China) Fan Yang (Delft University of Technology, The Netherlands) STEERING COMMITTEE Samson Abramsky, Johan van Benthem, Anuj Dawar, Joe Halpern, Wilfrid Hodges, Juliette Kennedy, Ulrich Kohlenbach, Daniel Leivant, Leonid Libkin, Angus Macintyre, Luke Ong, Hiroakira Ono, Valeria de Paiva, Ruy de Queiroz, Jouko Väänänen. (Former Member: Grigori Mints (deceased).) ORGANISING COMMITTEE Jaime A. Bohórquez (Escuela Colombiana de Ingeniería, Bogotá, Colombia) Xavier Caicedo (Universidad de los Andes, Colombia) (Local co-chair) Nicolás Cardozo (Universidad de los Andes, Bogotá, Colombia) Maricarmen Martínez (Universidad de los Andes, Colombia) (Local co-chair) Anjolina G. de Oliveira (Univ Federal de Pernambuco, Brasil) Ruy de Queiroz (Univ Federal de Pernambuco, Brasil) (co-chair) Camilo Rocha (Universidad Javeriana, Cali, Colombia) FURTHER INFORMATION Contact one of the Co-Chairs of the Organising Committee. WEB PAGE http://wollic.org/wollic2018/ <http://wollic.org/wollic2018/>

1 0

超準解析と数学基礎論のシンポジウム
by YOKOYAMA Keita 05 Oct '17

05 Oct '17

みなさま、北陸先端科学技術大学院大学の横山です。以下の通り12月に早稲田大学にて「超準解析と数学基礎論のシンポジウム」の開催を予定しております。講演を募集致しますのでご検討いただければ幸いです。 ********************** 超準解析と数学基礎論のシンポジウム日時：12月15,16日(金,土) 場所：早稲田大学早稲田キャンパス講演募集締め切り：11月24日世話人：横山啓太(JAIST), 藤原誠(早稲田大学高等研究所) ※この会議は超準解析シンポジウム http://www.jaist.ac.jp/~y-keita/2014SLACS-NSA/ の後継になりますが、今回は超準解析分野を始め、超準構造や超準手法及び関連する数学基礎論の話題を広く募集致します。講演・参加のお申し込みは以下のフォームをご記入の上、11月24日までに y-keita(a)jaist.ac.jp までお送りください。 -------------------- １．お名前２．所属・身分３．メールアドレス４．講演タイトル（未定でも可）/参加のみの予定５．その他（講演希望日など） -------------------- 参加は申し込み無しでも可能ですが、会議室・懇親会の調整や大まかな人数把握等のため、参加をご検討中の方も一度11月24日までに上のフォームでご連絡をいただけますと幸いです。（懇親会等の案内を致します。） ********************** 横山啓太 -- Keita Yokoyama y-keita(a)jaist.ac.jp

1 0

名古屋ロジックセミナー(10/6)
by Takayuki Kihara 04 Oct '17

04 Oct '17

皆様名古屋大学の木原貴行です．以下の要領で名古屋ロジックセミナーを開催します．多数のご参加をお待ちしております．名古屋ロジックセミナー http://www.math.mi.i.nagoya-u.ac.jp/~kihara/logic-seminar.html 日時：10月6日 (金) 15:30〜場所：名古屋大学大学院情報学研究科棟 314室講演者：宮元忠敏 (南山大学)　題目： On iterated forcing with side conditions アブストラクト： Aspero-Mota introduced an iterated forcing that used symmetric systems of elementary substructures with the markers. We reproduce it. Our construction features the following: 1. We stick to a single transitive set universe to form various clubs. 2. We use a pre-forced stationary set to manage amalgamations. 3. We use what we call signed coordinates rather than the markers. We consider these features by iteratively forcing the following examples. 1. Posets that force what we call fast functions. 2. Posets that kill weak club guessings. -------- 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

PEPM 2018: Final CfP
by Kohei SUENAGA 29 Sep '17

29 Sep '17

皆様，（複数お受け取りの場合はご容赦ください．）京都大学の末永と申します． PEPM 2018 の final call for paper をお送りします．投稿をお待ちしております．末永幸平 PEPM 2018 FINAL CALL FOR PAPERS =============================== The submission site is now open: https://pepm18.hotcrp.com Only one week until the paper submission deadline (6th October AoE)! Highlights ---------- PEPM 2018 welcomes submissions on * semantics based and machine-learning based program synthesis and program optimisation, and * modelling, analysis, and transformation techniques for distributed and concurrent protocols and programs, such as session types, linear types, and contract specifications, in addition to traditional PEPM topics. Do submit a short paper if you want to get feedback for your work in progress! If requested, short papers can be left out of the proceedings so that the results can be published elsewhere. New in this call ---------------- Invited talks by Alex Aiken, Conal Elliott, and Jan Midtgaard. Short papers should include the words “short paper” somewhere in their title, and will be evaluated primarily on the basis of their ideas rather than finished execution. -- CALL FOR PAPERS -- ACM SIGPLAN Workshop on PARTIAL EVALUATION AND PROGRAM MANIPULATION (PEPM) 2018 =============================================================================== * Website : http://popl18.sigplan.org/track/PEPM-2018 * Time : 8th – 9th January 2018 * Place : Los Angeles, CA, US (co-located with POPL 2018) The ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM), which has a history going back to 1991 and has co-located with POPL every year since 2006, originates in the discoveries of practically useful automated techniques for evaluating programs with only partial input. Over the years, the scope of PEPM has expanded to include a variety of research areas centred around the theme of semantics-based program manipulation — the systematic exploitation of treating programs not only as subject to black-box execution, but also as data structures that can be generated, analysed, and transformed while establishing or maintaining important semantic properties. Scope ----- In addition to the traditional PEPM topics (see below), PEPM 2018 welcomes submissions in new domains, in particular: * Semantics based and machine-learning based program synthesis and program optimisation. * Modelling, analysis, and transformation techniques for distributed and concurrent protocols and programs, such as session types, linear types, and contract specifications. More generally, topics of interest for PEPM 2018 include, but are not limited to: * Program and model manipulation techniques such as: supercompilation, partial evaluation, fusion, on-the-fly program adaptation, active libraries, program inversion, slicing, symbolic execution, refactoring, decompilation, and obfuscation. * Techniques that treat programs/models as data objects including metaprogramming, generative programming, embedded domain-specific languages, program synthesis by sketching and inductive programming, staged computation, and model-driven program generation and transformation. * Program analysis techniques that are used to drive program/model manipulation such as: abstract interpretation, termination checking, binding-time analysis, constraint solving, type systems, automated testing and test case generation. * Application of the above techniques including case studies of program manipulation in real-world (industrial, open-source) projects and software development processes, descriptions of robust tools capable of effectively handling realistic applications, benchmarking. Examples of application domains include legacy program understanding and transformation, DSL implementations, visual languages and end-user programming, scientific computing, middleware frameworks and infrastructure needed for distributed and web-based applications, embedded and resource-limited computation, and security. This list of categories is not exhaustive, and we encourage submissions describing new theories and applications related to semantics-based program manipulation in general. If you have a question as to whether a potential submission is within the scope of the workshop, please contact the programme co-chairs, Fritz Henglein (http://www.diku.dk/~henglein/) and Josh Ko (https://josh-hs-ko.github.io). Submission categories and guidelines ------------------------------------ Two kinds of submissions will be accepted: Regular Research Papers and Short Papers. * Regular Research Papers should describe new results, and will be judged on originality, correctness, significance, and clarity. Regular research papers must not exceed 12 pages (excluding bibliography). * Short Papers may include tool demonstrations and presentations of exciting if not fully polished research, and of interesting academic, industrial, and open-source applications that are new or unfamiliar; they will be evaluated primarily on the basis of their ideas rather than finished execution. Short papers must not exceed 6 pages (excluding bibliography), and should include the words “short paper” somewhere in their title. Both kinds of submissions should be typeset using the two-column ‘sigplan’ sub-format of the new ‘acmart’ format available at: http://sigplan.org/Resources/Author/ and submitted electronically via HotCRP: https://pepm18.hotcrp.com/ PEPM 2018 will employ lightweight double-blind reviewing according to the rules of POPL 2018. Quoting from POPL 2018’s call for papers: “submitted papers must adhere to two rules: 1. author names and institutions must be omitted, and 2. references to authors’ own related work should be in the third person (e.g., not “We build on our previous work ...” but rather “We build on the work of ...”). The purpose of this process is to help the PC and external reviewers come to an initial judgment about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult. In particular, important background references should not be omitted or anonymized. In addition, authors should feel free to disseminate their ideas or draft versions of their paper as they normally would. For instance, authors may post drafts of their papers on the web or give talks on their research ideas.” See POPL 2018’s Submission and Reviewing FAQ page for more information: http://popl18.sigplan.org/track/POPL-2018-papers#Submission-and-Reviewing-F… Submissions are welcome from PC members (except the two co-chairs) provided that there are non-PC co-authors. Accepted papers will appear in formal proceedings published by ACM, and be included in the ACM Digital Library. Authors of short papers, however, can ask for their papers to be left out of the formal proceedings. At least one author of each accepted contribution must attend the workshop and present the work. In the case of tool demonstration papers, a live demonstration of the described tool is expected. Student participants with accepted papers can apply for a SIGPLAN PAC grant to help cover travel expenses and other support. PAC also offers other support, such as for child-care expenses during the meeting or for travel costs for companions of SIGPLAN members with physical disabilities, as well as for travel from locations outside of North America and Europe. For details on the PAC programme, see its web page. Important dates --------------- * Paper submission deadline : Friday 6th October 2017 (AoE) (firm) * Author notification : Saturday 4th November 2017 * Workshop : Monday 8th – Tuesday 9th January 2018 The proceedings will be published 2 weeks pre-conference. AUTHORS TAKE NOTE: The official publication date is the date the proceedings are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of your conference. The official publication date affects the deadline for any patent filings related to published work. (For those rare conferences whose proceedings are published in the ACM Digital Library after the conference is over, the official publication date remains the first day of the conference.) Best paper award ---------------- PEPM 2018 continues the tradition of a Best Paper award. The winner will be announced at the workshop. Invited speakers ---------------- Alex Aiken (Stanford University) Conal Elliott (Target) Jan Midtgaard (University of Southern Denmark) Programme committee ------------------- Nada Amin (EPFL) Shigeru Chiba (University of Tokyo) Ezgi Çiçek (Max Planck Institute for Software Systems) Olivier Danvy (Yale-NUS College) Ronald Garcia (University of British Columbia) Simon Gay (University of Glasgow) Andy Gill (X, the Moonshot Factory) Fritz Henglein (co-chair) (University of Copenhagen) Anastasia Izmaylova (IMC Financial Markets) Johan Jeuring (Utrecht University) Gabriele Keller (University of New South Wales) Oleg Kiselyov (Tohoku University) Hsiang-Shang Ko (co-chair) (National Institute of Informatics) Ralf Lämmel (University of Koblenz-Landau) Julia Lawall (Inria) Simon Peyton Jones (Microsoft Research Cambridge) Frank Pfenning (Carnegie Mellon University) Sriram Rajamani (Microsoft Research India) Norman Ramsey (Tufts University) Thomas Reps (University of Wisconsin-Madison) Sergei Romanenko (Keldysh Institute of Applied Mathematics) Tiark Rompf (Purdue University) Wolfram Schulte (Facebook) Peter Sestoft (IT University of Copenhagen) Harald Søndergaard (University of Melbourne) Kohei Suenaga (Kyoto University) Martin Vechev (ETH Zurich) Marcos Viera (University of the Republic) Nobuko Yoshida (Imperial College London) -- 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 0

Kyoto Workshop on Logic and Metaphysicsのご案内
by Hitoshi Omori 28 Sep '17

28 Sep '17

Kyoto Workshop on Logic and Metaphysicsのご案内 (重複してお受け取りの際はご容赦ください。) 京都大学の大森仁です。直前の案内になってしまいましたが、以下の通りワークショップを開催いたします。 ------------------------------------- Kyoto Workshop on Logic and Metaphysics 【日時】2017年10月2日【場所】京都大学吉田泉殿【ウェブサイト】https://sites.google.com/site/hitoshiomori/home/workshops/kwlm 【プログラム】 09:30-10:30 Filippo Casati "Inside *Aussersein*" 10:30-11:30 Ryo Ito "Rules and Trivialities in Proofs" 11:30-12:45 Lunch 12:45-13:45 Colin Caret "The Mutability of Entailment" 13:45-14:45 Ole Hjortland "Theories of truth and the maxim of minimal mutilation" 14:45-15:00 Break 15:00-16:00 Zach Weber "On paradox explanation, the inclosure schema, and being exceptionally ordinary" ------------------------------------- どうぞよろしくお願いいたします。大森仁

1 0

Kyoto Nonclassical Logic Workshop IIIのご案内
by Hitoshi Omori 22 Sep '17

22 Sep '17

Kyoto Nonclassical Logic Workshop IIIのご案内 (重複してお受け取りの際はご容赦ください。) 京都大学の大森仁です。直前の案内になってしまいましたが、以下の通りワークショップを開催いたします。 ------------------------------------- Kyoto Nonclassical Logic Workshop III 【日時】2017年9月25日【場所】京都大学吉田泉殿【ウェブサイト】https://sites.google.com/site/hitoshiomori/home/workshops/kncl3 【プログラム】 September 25: 11:00--12:00 Zach Weber "On Substructural Logic and Metatheory" 12:00--13:00 Takuro Onishi "Unifying two plans in relevant logic" 13:00--14:30 Lunch 14:30--15:30 Igor Sedlár "Abstract completeness of some lattice-valued modal logics" 15:30--16:30 Kazushige Terui "The noble art () of diagrammatic reasoning in algebraic logic" 16:30--16:45 Coffee break 16:45--17:45 Adam Přenosil "Reconstructing involutive residuated lattices from their negative cones" 17:45--18:45 Petr Cintula "Lindenbaum-style proof of completeness for infinitary logics" 19:00-- Dinner ------------------------------------- どうぞよろしくお願いいたします。大森仁

1 0

続報: MLG 数理論理学研究集会
by Suzuki, Nobu-Yuki 21 Sep '17

21 Sep '17

皆様静岡大学の鈴木信行です。第52回MLG 数理論理学研究集会の続報です。ご参加・ご講演のお申込みを開始いたします。参加の申し込みは以下のフォームにご記入の上、 11月1日(水)までにお送りください。送り先: mlg52.shizuoka(a)gmail.com -------------------- １．お名前２．所属・身分３．メールアドレス４．講演する・しない５．講演する場合タイトル（未定でも可）６．懇親会(12月1日)に参加する・しない７．備考 (講演の希望日などがありましたらこちらにご記入ください) -------------------- 申し込み無しでもご参加いただけますが、懇親会（大学内で行う予定です）の参加を希望される場合は必ずお申し込みください。詳しくは、下記のサイトをご覧下さい。 https://wwp.shizuoka.ac.jp/logic-suzuki-mlg/

1 0

第37回量子情報技術研究会(QIT37)のご案内
by NISHIMURA Harumichi 15 Sep '17

15 Sep '17

logic-mlの皆様 QIT37の世話人に代わりまして第３７回量子情報技術研究会（QIT37）の会告をご案内させていただきます．よろしくお願いいたします．名古屋大学大学院情報学研究科西村治道 -------- QIT37 第37回量子情報技術研究会研究会の内容情報科学と量子力学を融合させた新しい分野，量子情報科学に関する研究会です．情報を担う物理系の量子力学的側面を積極的に活かした新しい情報処理原理の研究とそこから開かれる新しい学問体系の構築および新しい情報技術パラダイムの創生を目指して，情報科学，物理学，光エレクトロニクスを含む理学，工学，数理科学に携わる研究者間に自由な討論の場を提供し，この研究分野の発展を図ることを目的としています．　第３７回研究会を下記のように開催いたします．現在この分野で活躍する研究者は勿論，自分の研究資産が何らかの形で使えそうだと予感している研究者・技術者など，広く関連する分野の研究者・技術者からの発表，聴講を募集致します．奮ってご参加ください．日時：平成２９年１１月１６日（木），１７日（金）会場：埼玉大学総合研究棟１階シアター教室　　　（〒338-8570 さいたま市桜区下大久保255）発表募集分野：（申し込み状況によっては査読可能性あり）：量子情報，　　　　　　　　　量子計算，量子暗号など広く量子情報技術に関わる理論的　　　　　　　　　研究，実験的研究，計算機科学的研究，数学的研究，及び　　　　　　　　　その他関連分野定員：１４０名程度参加費：事前振込み　一般4,000円，学生3,000円　　　　（当日会場支払いは一般5,000円，学生4,000円）　　　　（懇親会は別途）研究会参加申込要領：講演(口頭，ポスター)希望者，聴講希望者は下記Webにて受付を行います．http://staff.aist.go.jp/s-kawabata/qit/ <http://staff.aist.go.jp/s-kawabata/qit/> <http://staff.aist.go.jp/s-kawabata/qit/> 申込締め切り【講演申込締め切り】　　　平成２９年１０月６日（金）口頭　　　　　　　　　　　　　平成２９年１０月１３日（金）ポスター【PDF原稿提出締め切り】　平成２９年１０月２０日（金）【参加申込締め切り】　　　平成２９年１０月２７日（金） [問合先] 小柴健史 (早稲田大学) 小川朋宏 (電気通信大学) 大久保潤 (埼玉大学) E-mail　qit37(a)list.waseda.jp <mailto:qit37@list.waseda.jp> <qit37(a)list.waseda.jp> 主催：電子情報通信学会　量子情報技術特別研究専門委員会（委員長　竹内繁樹（京都大学））共催：応用物理学会量子エレクトロニクス研究会 ----------------------------------------------------------

1 0

Fwd: [hscc] 2018 Hybrid Systems: Computation and Control (HSCC) -- Call for Papers
by Ichiro Hasuo 05 Sep '17

05 Sep '17

*HSCC 2018 CALL FOR PAPERS* 21st ACM International Conference on Hybrid Systems: Computation and Control (HSCC) April 11-13, 2018, Porto, Portugal *URL:* www.hscc2018.deib.polimi.it <https://urldefense.proofpoint.com/v2/url?u=http-3A__www.hscc2018.deib.polim…> *Important dates:* Paper submission deadline: October 6, 2017 (11:59pm UTC-12) *FIRM* Notification: December 2017 Camera-ready: February 2018 Conference dates: April 11-13, 2018 * Please refer to the conference website for up-to-date information. * *Paper submission information:* Regular papers (maximum 10 pages, 10pt font, two-column ACM format) Tool and Case Study Papers (maximum 6 pages, 10pt font, two-column ACM format) Demos (maximum 2 pages, 10pt font, two-column ACM format, title should begin with “Demo”) Posters (maximum 2 pages, 10pt font, two-column ACM format, title should begin with “Poster”) *Awards:* - Best Repeatability Evaluation Award; Papers would be eligible upon passing the repeatability evaluation process will receive the “artifact evaluated” badge. - Best Demo/Poster Award - Best Paper Award **New** - Test-of-Time Award* *New** *Conference scope:* HSCC 2018 is the 21st in a series of conferences focusing on original research on concepts, tools, and techniques from computer science, control theory, and applied mathematics for the analysis and control of hybrid systems, with an emphasis on computational aspects. By drawing on strategies from computation and control, hybrid systems theory finds application in both man-made cyber-physical systems (ranging from small robots to global infrastructure networks) and natural systems (ranging from biochemical networks to physiological models). Papers are expected to cover a wide spectrum of topics from theoretical results to practical considerations, from academic research to industrial adoption, including but not limited to: - Mathematical foundations, computability and complexity - Analysis, verification, validation, and testing - Modeling paradigms and techniques - Design, synthesis, planning, and control - Programming and specification languages - Network science and network-based control - Security, privacy, and resiliency in cyber-physical systems with a focus on computation and control - Artificial intelligence and machine learning in control algorithms - Software tools - Applications and industrial case studies in: automotive, transportation, autonomous systems, avionics, energy and power, robotics, medical devices, manufacturing, systems and synthetic biology, models for the life sciences, and other related areas *Program Committee Chairs:* Maria Prandini, Politecnico di Milano Jyotirmoy V.Deshmukh, University of Southern California *Repeatability Evaluation Chair:* Sergiy Bogomolov, Australian National University *Publicity Chair:* Kostas Margellos, University of Oxford *Demo and Poster Session Chair:* Jens Oehlerking, Robert Bosch GmbH *Awards Chair* Akshay Rajhans, The MathWorks *Program Committee:* See www.hscc2018.deib.polimi.it <https://urldefense.proofpoint.com/v2/url?u=http-3A__www.hscc2018.deib.polim…> *Steering Committee:* Rajeev Alur, University of Pennsylvania Werner Damm, OFFIS John Lygeros, ETH Zurich Oded Maler, Verimag Paulo Tabuada, University of California at Los Angeles Claire Tomlin, University of California at Berkeley *Submission website: * See www.hscc2018.deib.polimi.it <https://urldefense.proofpoint.com/v2/url?u=http-3A__www.hscc2018.deib.polim…> — Kostas Margellos Department of Engineering Science University of Oxford Parks Road, Ox1 3PJ, Oxford United Kingdom kostas.margellos(a)eng.ox.ac.uk

1 0

Kyoto Philosophical Logic Workshop IIIのご案内
by Hitoshi Omori 02 Sep '17

02 Sep '17

Kyoto Philosophical Logic Workshop IIIのご案内 (重複してお受け取りの際はご容赦ください。) 京都大学の大森仁です。直前の案内になってしまいましたが、以下の通りワークショップを開催いたします。概要などの詳細はウェブサイトをご覧下さい。 ------------------------------------- Kyoto Philosophical Logic Workshop III 【日時】2017年9月7日, 8日, 9日【場所】京都大学吉田泉殿(7日、9日)、芝蘭会館別館(8日) 【ウェブサイト】https://sites.google.com/site/hitoshiomori/home/workshops/kplw-3 【プログラム】 September 7: The third workshop on connexive logic, co-organized by Heinrich Wansing and Hitoshi Omori 11:00--12:00 Norihiro Kamide "Bi-classical connexive logic and its modal extension: Cut-elimination, completeness and duality" 12:00--13:00 Tomasz Jarmużek "Connexive logics defined by relating semantics and tableau approach" 13:00--14:30 Lunch 14:30--15:00 Sara Ipakchi "A justification for Aristotle Thesis AT on the basis of LNC" 15:00--16:00 Wolfgang Lenzen "Is connexive logic based on a gross misunderstanding? A Leibnitian approach" 16:00--16:15 Coffee break 16:15--17:15 Heinrich Wansing "Connexive Logic and Chellas-Segerberg Semantics" 17:15--18:15 Andreas Kapsner "What is Connexivity? Lessons from Constructive and Conditional Logics" 19:00-- Dinner September 8: 09:15--10:15 Yasuo Deguchi "Analytic Nishida: Metaphysics of Self and Non-classial Logic" 10:15--11:15 Rafał Urbaniak "Paradoxes of informal provability and many-valued indeterministic provability logic" 11:15--12:15 Toshiharu Waragai "Lesniewski's Ontology from a Syllogistic Point of View" 12:15--13:30 Lunch Special session on Leibniz's logic 13:30--14:30 Ryosuke Igarashi "A Comparison of the Logical Systems of Leibniz and Kant" 14:30--15:30 Hiroyuki Inaoka "Mathematics as make-believe: Infinite diagram in Leibniz's mathematical study" 15:30--15:45 Coffee break 15:45--16:45 Shinji Ikeda "Extension and Space in Leibniz’s Theory of Abstraction" 16:45--17:45 Wolfgang Lenzen "The evolution of the system of Leibniz’s logic" 18:30-- Dinner September 9: 10:00--11:00 Vít Punčochář "Between material and strict implication" 11:00--12:00 Igor Sedlár "Term negation in first-order logic" 12:00--13:30 Lunch 13:30--14:30 Yasuo Nakayama "Philosophical Basis for Dynamic Belief-Desire-Obligation Logic" 14:30--15:30 Shunsuke Yatabe "TBA" 15:30--15:45 Coffee break 15:45--16:45 Makoto Kanazawa "Lambek Calculus and Context-Free Grammars: Some Unresolved Issues" 16:45--17:45 Heinrich Wansing "Disentangling FDE-based Paraconsistent Modal Logics" 18:30-- Dinner ------------------------------------- どうぞよろしくお願いいたします。大森仁

1 0

FINAL CALL FOR PAPERS: Logic and Engineering of Natural Language Semantics 14 (LENLS 14), Deadline Extended
by Katsuhiko Sano 31 Aug '17

31 Aug '17

[Apologies for multiple copies] ================================================================= FINAL CALL FOR PAPERS **Deadline extended to September 7, 2017** Logic and Engineering of Natural Language Semantics 14 (LENLS 14) Workshop Site : Bunkyo School Building in University of Tsukuba, Tokyo Campus Bunkyo-ku, Tokyo, Japan http://www.tsukuba.ac.jp/en/access/tokyocampus-access Dates : November 13-15, 2017 Contact Person: Katsuhiko Sano (Hokkaido University) Contact Email : lenls14[[at]]easychair.org Website : http://www.is.ocha.ac.jp/~bekki/lenls/ ================================================================= Chair: Katsuhiko Sano (Hokkaido University) Co-chair: Eric McCready (Aoyama Gakuin University) Daisuke Bekki (Ochanomizu University/JST CREST) Koji Mineshima (Ochanomizu University/JST CREST) Invited Speakers: - Craige Roberts (The Ohio State University) - Ivano Ciardelli (University of Amsterdam) - Shoichi Takahashi (Aoyama Gakuin University) LENLS is an annual international workshop on formal syntax, semantics and pragmatics. It will be held as one of the workshops of the JSAI International Symposia on AI (isAI2017) (https://www.ai-gakkai.or.jp/isai/) sponsored by the Japan Society for Artificial Intelligence (JSAI). Aims and Topics: ================ We invite submissions to this year's workshop on topics in formal syntax, semantics and pragmatics, and related fields, including but in no way limited to the following: - Formal syntax, semantics and pragmatics of natural language - Model-theoretic and/or proof-theoretic semantics of natural language - Computational Semantics - Game-theoretic/Bayesian approaches to pragmatics - Nonclassical Logic and its relation to natural language (especially Substructural/Fuzzy/Categorical/Topological logics) - Formal Philosophy of language - Scientific methodology and/or experimental design for linguistics Submissions: ============ Abstracts (anonymous, up to 4 pages, including figures and references, A4 size, with 12 point font) must be submitted electronically in PDF format at: https://easychair.org/conferences/?conf=lenls14 When the abstract is accepted, the author is expected to submit a full paper (10-14 pages) before the workshop. The online proceedings of the workshop will be available at the conference site. Important dates: ================ Abstract submission deadline: September 7, 2017 (extended) Notification of acceptance: September 30, 2017 Deadline for camera-ready copy: mid-October, 2017 LENLS14: November 13-15, 2017 Sponsor: ======== LENLS is being organized by an alliance of "Establishment of Knowledge-Intensive Structural Natural Language Processing and Construction of Knowledge Infrastructure" (http://nlp.ist.i.kyoto-u.ac.jp/CREST/?en) project, funded by JST CREST Programs "Advanced Core Technologies for Big Data Integration" (http://www.jst.go.jp/kisoken/crest/en/research_area/ongoing/areah25-6.html). Workshop Organizers/Program Committee: ====================================== - Katsuhiko Sano (Hokkaido University) - Eric McCready (Aoyama Gakuin University) - Daisuke Bekki (Ochanomizu University/JST CREST) - Koji Mineshima (Ochanomizu University/JST CREST) - Alastair Butler (National Institute for Japanese Language and Linguistics) - Richard Dietz (iCLA, Yamanashi Gakuin University) - Naoya Fujikawa (Tokyo Metropolitan University) - Yoshiki Mori (University of Tokyo) - Yasuo Nakayama (Osaka University) - David Y. Oshima (Nagoya University) - Osamu Sawada (Mie University) - Wataru Uegaki (Leiden University) - Katsuhiko Yabushita (Naruto University of Education) - Tomoyuki Yamada (Hokkaido University) - Shunsuke Yatabe (Kyoto University) - Kei Yoshimoto (Tohoku University)

1 0

JAIST Logic Seminar Series
by Hajime Ishihara 30 Aug '17

30 Aug '17

皆様スワンジー大学のArnold Beckmann先生の講演のお知らせです。どうぞふるってご参加ください。問合せ先：石原　哉北陸先端科学技術大学院大学情報科学系 e-mail: ishihara(a)jaist.ac.jp ----------------------------------------------- * JAIST Logic Seminar Series * * The seminar below is held as a part of JSPS Core-to-Core Program, A. Advanced Research Networks, EU FP7 Marie Curie Actions IRSES project CORCON. (http://www.jaist.ac.jp/logic/ja/core2core, https://corcon.net/), and EU Horizon 2020 Marie Skłodowska-Curie actions RISE project CID. Date: Friday 15, September, 2017, 15:20-17:00 Place: JAIST, Collaboration room 7 (I-56) (Access: http://www.jaist.ac.jp/english/location/access.html) Speaker: Professor Arnold Beckmann (University of Swansea, Head of Department of Computer Science) http://www.cs.swan.ac.uk/~csarnold/ Title: Provably Total NP Search Problems of Bounded Arithmetic and beyond Abstract: Bounded Arithmetic forms a collection of weak theories of Arithmetic related to complexity classes of functions like the Polynomial Time Hierarchy. Many connections between Bounded Arithmetic and important questions about complexity classes have already been established. Recent research considers total NP search problems in the context of Bounded Arithmetic. Total NP search problems have been studied by Papadimitriou et al as a means to characterise the complexity of natural search problems which cannot be analysed as decision problems. In my talk I will review the research programme of characterising the provably total NP search problems in Bounded Arithmetic, and explain why it is important for current research questions in the area. I will describe recent results about the provably total NP search problems of a Bounded Arithmetic theories related to PSPACE and EXPTIME reasoning. I will also describe this program for theories beyond Bounded Arithmetic like Peano arithmetic, and what impact this might have on Complexity Theory.

1 0

3rd CALL FOR PAPERS: Logic and Engineering of Natural Language Semantics 14 (LENLS 14)
by Katsuhiko Sano 26 Aug '17

26 Aug '17

[Apologies for multiple copies] ================================================================= 3rd CALL FOR PAPERS Logic and Engineering of Natural Language Semantics 14 (LENLS 14) Workshop Site : Bunkyo School Building in University of Tsukuba, Tokyo Campus Bunkyo-ku, Tokyo, Japan http://www.tsukuba.ac.jp/en/access/tokyocampus-access Dates : November 13-15, 2017 Contact Person: Katsuhiko Sano (Hokkaido University) Contact Email : lenls14[[at]]easychair.org Website : http://www.is.ocha.ac.jp/~bekki/lenls/ ================================================================= Chair: Katsuhiko Sano (Hokkaido University) Co-chair: Eric McCready (Aoyama Gakuin University) Daisuke Bekki (Ochanomizu University/JST CREST) Koji Mineshima (Ochanomizu University/JST CREST) Invited Speakers: - Craige Roberts (The Ohio State University) - Ivano Ciardelli (University of Amsterdam) - Shoichi Takahashi (Aoyama Gakuin University) LENLS is an annual international workshop on formal syntax, semantics and pragmatics. It will be held as one of the workshops of the JSAI International Symposia on AI (isAI2017) (https://www.ai-gakkai.or.jp/isai/) sponsored by the Japan Society for Artificial Intelligence (JSAI). Aims and Topics: ================ We invite submissions to this year's workshop on topics in formal syntax, semantics and pragmatics, and related fields, including but in no way limited to the following: - Formal syntax, semantics and pragmatics of natural language - Model-theoretic and/or proof-theoretic semantics of natural language - Computational Semantics - Game-theoretic/Bayesian approaches to pragmatics - Nonclassical Logic and its relation to natural language (especially Substructural/Fuzzy/Categorical/Topological logics) - Formal Philosophy of language - Scientific methodology and/or experimental design for linguistics Submissions: ============ Abstracts (anonymous, up to 4 pages, including figures and references, A4 size, with 12 point font) must be submitted electronically in PDF format at: https://easychair.org/conferences/?conf=lenls14 When the abstract is accepted, the author is expected to submit a full paper (10-14 pages) before the workshop. The online proceedings of the workshop will be available at the conference site. Important dates: ================ Abstract submission deadline: August 31, 2017 Notification of acceptance: September 30, 2017 Deadline for camera-ready copy: mid-October, 2017 LENLS14: November 13-15, 2017 Sponsor: ======== LENLS is being organized by an alliance of "Establishment of Knowledge-Intensive Structural Natural Language Processing and Construction of Knowledge Infrastructure" (http://nlp.ist.i.kyoto-u.ac.jp/CREST/?en) project, funded by JST CREST Programs "Advanced Core Technologies for Big Data Integration" (http://www.jst.go.jp/kisoken/crest/en/research_area/ongoing/areah25-6.html). Workshop Organizers/Program Committee: ====================================== - Katsuhiko Sano (Hokkaido University) - Eric McCready (Aoyama Gakuin University) - Daisuke Bekki (Ochanomizu University/JST CREST) - Koji Mineshima (Ochanomizu University/JST CREST) - Alastair Butler (National Institute for Japanese Language and Linguistics) - Richard Dietz (iCLA, Yamanashi Gakuin University) - Naoya Fujikawa (Tokyo Metropolitan University) - Yoshiki Mori (University of Tokyo) - Yasuo Nakayama (Osaka University) - David Y. Oshima (Nagoya University) - Osamu Sawada (Mie University) - Wataru Uegaki (Leiden University) - Katsuhiko Yabushita (Naruto University of Education) - Tomoyuki Yamada (Hokkaido University) - Shunsuke Yatabe (Kyoto University) - Kei Yoshimoto (Tohoku University)

1 0

[Deadline Extension] JURISIN2017: call for Papers
by Ken Satoh (web mail) 22 Aug '17

22 Aug '17

CFP: Eleventh International Workshop on Juris-informatics (JURISIN 2017) homepage: http://research.nii.ac.jp/~ksatoh/jurisin2017 **************************************************** The submission deadline is extended to 6 September. **************************************************** ** Workshop dates November 14 - 15, 2017 ** Venue Tokyo Campus, University of Tsukuba, Tokyo, Japan http://www.tsukuba.ac.jp/en/access/tokyocampus-access ** Important Dates Submission Deadline: September 6, 2017 Notification: October 6, 2017 Camera-ready due: October 13, 2017 ** Aims and Scope 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 Any theories and technologies which is not directly related with juris-informatics but has a potential to contribute to this domain ** Invited Speakers Kevin D. Ashley (University of Pittsburgh) Katsumi Nitta (Tokyo Institute of Technology) ** Submissions 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 2017 (The 28th International Conference on Legal Knowledge and Information Systems). The double submission policy with JURIX 2017 is as follows: Papers being submitted both to JURISIN2017 and JURIX2017 must note this on the title page. A paper to be presented at JURISIN2017 must be withdrawn from JURIX2017 and vice versa according to the choice by the authors. If the authors do not follow this double submission policy, the paper by the authors will not be included in the proceedings of JURISIN 2017. Papers should be written in English, formatted according to the Springer Verlag LNCS style in a pdf form, which can be obtained from http://www.springeronline.com and not exceed 14 pages including figures, references, etc. If you use a word file, please follow the instruction of the format, and then convert it into a pdf form and submit it at the paper submission page. If a paper is accepted, at least one author of the paper must register the workshop and present it. We strongly encourage an online registration. You can submit your paper at "https://easychair.org/conferences/?conf=jurisin2017". If you cannot submit a paper by EasyChair System by some trouble, please send email to "ksatoh[at]nii.ac.jp" ** Post Proceedings Selected papers will be published as a post-proceedings via Springer Verlag LNAI series after the second round of review after the workshop. ** Workshop Chair Ken Satoh, National Institute of Informatics and Sokendai, Japan ** Steering Committee Members Takehiko Kasahara, Toin Yokohama University Makoto Nakamura, Nagoya University, 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, JAIST, Japan Katsuhiko Toyama, Nagoya University, Japan ** Advisory Committee Members Trevor Bench-Capon, The University of Liverpool, UK Tomas Gordon, Fraunfoher FOKUS, Germany Henry Prakken, University of Utrecht & Groningen, The Netherlands John Zeleznikow, Victoria University, Australia Robert Kowalski, Imperial College London, UK Kevin Ashley, University of Pittsburgh, USA ** Program Committee Members Thomas Agotnes, University of Bergen, Norway Ryuta Arisaka, National Institute of Informatics, Japan Kristijonas Cyras Imperial College London Marina De Vos, University of Bath, UK Phan Minh Dung, AIT, Thailand Randy Goebel, University of Alberta, Canada Guido Governatori, Data61, Australia Tatsuhiko Inatani, Kyoto University, Japan Tokuyasu Kakuta, Nagoya University, Japan Yoshinobu Kano, Shizuoka University, Japan Mi-Young Kim, University of Alberta, Canada Nguyen Le Minh, JAIST, Japan Beishui Liao, Zhejiang University, Chaina Hatsuru Morita, Tohoku University, Japan Makoto Nakamura, Nagoya University, 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 Ginevra Peruginelli, ITTIG-CNR, Italy Katsuhiko Sano, Hokkaido University, Japan Giovanni Sartor, EUI/CIRSFID, Italy Seiichiro Sakurai, Meiji Gakuin University, Japan Ken Satoh, National Institute of Informatics and Sokendai Akira Shimazu, JAIST, Japan Fumio Shimpo, Keio 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 Katsumasa Yoshikawa, IBM Research Tokyo, Japan Masaharu Yoshioka, Hokkaido University, Japan Harumichi Yuasa, Institute of Information Security, Japan Yueh-Hsuan Weng, Tohoku University, Japan Adam Wyner, University of Aberdeen, UK For any inquiry concerning the workshop, please send it to "ksatoh[at]nii.ac.jp"

1 0

名古屋ロジックセミナー (Linda Brown Westrick氏の講演 8/24)
by Takayuki Kihara 16 Aug '17

16 Aug '17

皆様，名古屋大学の木原貴行です．この度，コネチカット大学の Linda Brown Westrick 氏の名古屋訪問の折に，下記の要領で名古屋ロジックセミナーを開催することとなりました．多数のご参加をお待ちしております．名古屋ロジックセミナー http://www.math.mi.i.nagoya-u.ac.jp/~kihara/logic-seminar.html 日時：8月24日 (木) 15:30〜場所：名古屋大学大学院情報学研究科棟 314室講演者：Linda Brown Westrick (コネチカット大学) 題目 Uncountable free abelian groups via admissible computability 概要 One way to study structures of uncountable cardinality κ is to generalize the notion of computation. Saying that a subset of κ is κ-c.e. if it is Σ^0_1 definable (with parameters, in the language of set theory) over L_κ provides the notion of κ-computability. We may also quantify over subsets of L_κ, providing a notion of a κ-analytic set (here we assume V=L). In this setting, we consider the difficulty of recognizing free groups and the complexity of their bases. For example, if κ is a successor cardinal, the set of free abelian groups of size κ is Σ^1_1-complete. The resolution of questions of this type is more complex for other κ, and a few questions remain open. This is joint work with Greenberg and Turetsky. -------- 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

第二十八回 ALGI（代数，論理，幾何と情報科学研究集会）の暫定プログラムと懇親会参加について
by 西澤弘毅 11 Aug '17

11 Aug '17

logic-mlメーリングリストの皆様，神奈川大学の西澤弘毅と申します。第二十八回 ALGI（代数，論理，幾何と情報科学研究集会）の暫定プログラムのアナウンスをさせていただきます。 < 重複してお受け取りの節はご容赦願います。> ご参加をお待ちしております。 --------------------------------------------------------------------- **************************************************************** * 第二十八回 ALGI（代数，論理，幾何と情報科学研究集会） * * * * 2017年8月28日（月）午後～8月29日（火） * * 鹿児島大学郡元キャンパス理学部 1号館 101講義室 * * * * 暫定プログラムのお知らせと講演募集 * **************************************************************** ALGI (Algebra, Logic, Geometry and Informatics) は、代数学や論理学、幾何学の情報科学への応用について、および情報科学の代数学や論理学、幾何学への応用についての研究集会で、年一回の頻度で開催されています。今年からウェブサイトがこちらに移動しました。 https://sites.google.com/site/algimeeting/home 第二十八回 ALGI の開催場所や暫定プログラムはこちらで確認できます。会場の手配は鹿児島大学の古澤仁先生にお願いしています。 https://sites.google.com/site/algimeeting/home/28 講演枠が５つ空いております。講演を希望される方は、・題目・講演者名・e-mail address ・所属・梗概・希望時間・講演に必要な道具などの情報を西澤（nishizawa AT kanagawa-u.ac.jp）までお寄せください。また、一日目の夕方に鹿児島大学周辺で懇親会を予定しておりますので、懇親会への参加を希望される方は、8/23（水）までに上記アドレスにメールでお知らせください。 ALGI 自体は申し込み不要で自由にご参加いただけます。できるだけ多くの皆さんのご講演・ご参加をお待ちしております。なお、以前お知らせしたメーリングリストの移行については、混乱を避けるため第二十八回 ALGI の開催後に行います。その際はご協力よろしくお願いいたします。西澤弘毅（神奈川大学）津曲紀宏（崇城大学） -- 西澤弘毅神奈川大学工学部情報システム創成学科〒221-8686 神奈川県横浜市神奈川区六角橋3-27-1 nishizawa(a)kanagawa-u.ac.jp TEL（代表）045-481-5661 （内線：3378）

1 0

【論文募集】「コンピュータソフトウェア」サーベイ論文特集【〆切 9/30】
by Kazutaka Matsuda 10 Aug '17

10 Aug '17

（複数のメーリングリストに投稿しております．重複して受けとられましたらご容赦ください）皆様，東北大学の松田です．日本ソフトウェア科学会誌「コンピュータソフトウェア」では，サーベイ論文特集を企画しており，下記の要領で論文を募集（9/30 〆切）しております．どうぞ，投稿をご検討いただければ幸いです． ============================================================== 日本ソフトウェア科学会誌「コンピュータソフトウェア」「サーベイ論文」特集論文募集 http://www.jssst.or.jp/edit_news/detail/id=280 日本ソフトウェア科学会の学会誌「コンピュータソフトウェア」の使命の一つは，ソフトウェア科学・技術のすぐれた解説を通じた知識の普及および学術の発展への貢献です．本誌では折に触れ解説論文を掲載していますが，より多様なテーマに関する独特な視点からの興味深い分析を広く共有すべく，独自の切り口での網羅的な文献調査に基づく解説を「サーベイ論文」として募集します．サーベイ論文といえば，大きなテーマに対して，深い知識だけでなく，広く網羅的な知識が要求され，各分野で名の通った専門家が執筆するものというイメージがあるかもしれません．本学会誌のサーベイ論文では，このようなイメージとは一線を画した，掘り下げ方や解説の切り口などに新しい視点を与える，特定のテーマに関する網羅的なサーベイを期待しています．例えば，一つの研究を完成させる過程でその新規性および有用性を裏付けるために挙げるべき関連研究に対し，独自の観点や関連付けを与えて整理することができるでしょう．「サーベイ論文特集」は，このサーベイ論文の方向性を示し，一般投稿論文として定着させることを目的にしています．2012年2月号の第1回特集以来，年に一度のペースで特集を企画しており，今回は第7回目となります．今回も引き続き，各研究の周辺にテーマを適切に設定し，その範囲の文献を深い理解とともに網羅的に解説するというサーベイ論文の趣旨を広く周知し，さらに採択数を増やしていきたいと考えています．多くのご投稿をお待ちしております．博士論文等を執筆する過程で調査した文献の解説も広く歓迎します． [対象分野] コンピュータソフトウェアがカバーするすべての分野，例えば以下の技術や分野に関わるもの：アルゴリズム，プログラミング言語と処理系，数値的・記号的計算，システムソフトウェア，高信頼ソフトウェア，データベース，データマイニング，人工知能，ロボティクス，人間－計算機インタラクション，コンピュータネットワークをはじめとするソフトウェア科学・工学の分野において，新しい視点を与える文献の解説．オリジナルの結果を含むかどうかは問いません． [執筆要領] 日本ソフトウェア科学会誌「コンピュータソフトウェア」の関連諸規定をご参照の上，投稿論文のPDFファイルと「投稿メモ」を jssst-survey2018_at_se.cs.titech.ac.jp （_at_を@で置き換えて下さい）宛てにお送りください．学会誌関連諸規定は以下でご参照いただけます． http://www.jssst.or.jp/edit/kitei/ [スケジュール] 論文投稿締切り：2017年9月30日 17:00 特集号刊行予定：2018年8月号（査読プロセスの進行状況により掲載予定号に間に合わない場合があります．その場合でも特集論文として扱われます．） [特集号編集委員] 川端英之（広島市立大学），林晋平（東京工業大学），松田一孝（東北大学），松野裕（日本大学），櫻田英樹（NTT） [問合せ先] jssst-survey2018_at_se.cs.titech.ac.jp （_at_を@で置き換えて下さい）

1 0

PPLサマースクール2017: 参加募集
by Takahito Aoto 07 Aug '17

07 Aug '17

PPLサマースクール2017のご案内です． (重複して受信された場合はご容赦願います．) PPLサマースクールは，日本ソフトウェア科学会・プログラミング論研究会主催のイベントです．今回も，例年と同様に日本ソフトウェア科学会大会の併設企画として開催いたします．今回のテーマは「Isabelle/HOL による証明とプログラミング」で，講師はインスブルック大学の山田晃久様にお願いしております．参加申し込み方法などを含む詳細につきましては， http://ppl.jssst.or.jp/?ss2017 をご覧ください．是非ご参加をご検討いただければ幸いです． --- 青戸等人(新潟大学) ------------------------------------------------------------------------ PPLサマースクール2017 Isabelle/HOL による証明とプログラミング日本ソフトウェア科学会 (JSSST) プログラミング論研究会 (PPL) 主催日本ソフトウェア科学会第34回大会併設企画 Webページ: http://ppl.jssst.or.jp/?ss2017 講師：山田晃久(インスブルック大学) 2017年 9月 18日 (月) 10:00 - 17:00 慶應義塾大学日吉キャンパス == 概要 == Isabelle/HOL は，1986年に Lawrence Paulson によって創始され，現在はミュンヘン工科大学 Tobias Nipkow のチームを中心にメンテナンスされている証明支援ツールです． Isabelle/HOL の特徴は，スマートな証明環境 (jEdit)，強力な自動証明のサポート (Sledgehammer)，Haskell 等への自然なコード輸出 (code export)，多彩でオープンなライブラリ (Archive of Formal Proofs; AFP) などが挙げられます．本セミナーでは，Isabelle/HOL を用いた定理証明と，正しさの保証されたプログラム開発方法を，実践を通して紹介します．また AFP より，代数的数計算ライブラリなど，そのごく一部を紹介します． Isabelle には歴史的経緯からさまざまなクセがあり，学習を困難にしている要因となっていると考えられますが，本セミナーでは証明言語 Isar による，クセを排した“行儀のよい”証明の書き方に徹します．実習形式で行いますので，受講に際してはノートパソコンをご持参ください．なお，Isabelle/HOL をストレスなく利用するために，ある程度高性能なノートパソコンを推奨します．受講にあたっては，簡単な証明を書ける程度の基本的な論理学の知識を習得していること，また関数型言語の利用経験があることが推奨されます． == 講師紹介 == 山田晃久 (やまだあきひさ) http://cl-informatik.uibk.ac.at/users/ayamada/ インスブルック大学ポスドク．項書き換え系の停止性証明法に関する研究で， 2014年名古屋大学情報科学研究科博士課程を修了．同年，産業技術総合研究所にて組み合わせテストツール Calot の開発に従事．2015年より，インスブルック大学にて項書換え系，プログラム解析技法などの形式証明ライブラリ IsaFoR の開発プロジェクトに参加．情報処理学会正会員． == 参加費・参加申し込み == PPLサマースクールの参加費は以下の通りです．学生会員1000円, 学生非会員2000円, 一般会員2000円, 一般非会員3000円参加ご希望の方は，日本ソフトウェア科学会第34回大会共通の参加登録ページ https://jssst2017.wordpress.com/%e5%8f%82%e5%8a%a0%e7%94%b3%e3%81%97%e8%be%… から，お申し込みください．事前登録をお願いしております． == 問い合わせ先 == PPLサマースクール2017 幹事青戸等人 (新潟大学) E-mail: aoto(a)ie.niigata-u.ac.jp ------------------------------------------------------------------------

1 0

SLACS2017プログラム確定のお知らせと懇親会追加募集
by 安部達也 04 Aug '17

04 Aug '17

皆様（複数のメイリングリストに送信しています。重複して受信の際はご容赦ください。） SLACS2017幹事、千葉工大の安部です。講演・懇親会参加へお申し込みいただいた方々、ありがとうございました。今回は、以下のご案内をさせていただきます。 1. プログラムが確定しましたのでお知らせします。 2. 懇親会の参加について追加募集（若干名）を行います。 SLACS2017（記号論理と情報科学） http://super.para.media.kyoto-u.ac.jp/~abet/slacs2017/ 日時 2017年8月8日（火）から2017年8月9日（水）（前日まで数学基礎論サマースクールが明治大学で行われています。）場所千葉県習志野市津田沼2-17-1 千葉工業大学津田沼キャンパス 6号館3階633室参加費無料。ただし、懇親会費（3000から5000円程度）は別途徴収します。 1. プログラム（敬称略）は以下のとおり決定しました。 8月8日（火）オープニング 13:25–13:30 セッション1：座長未定 13:30–14:05 山形頼之（産総研） Validity of bilateral classical logic and its application 14:05–14:40 武原直紀（東工大）論理式完備ハイティング代数による直観主義二階命題論理のカット除去定理についてセッション2：座長未定 15:00–15:35 伴睦久（東京大） Self-identification on Social Software 15:35–16:10 福田陽介（京都大）準複数結論自然演繹による爆発則の再定式化セッション3：座長未定 16:30–17:05 内藏理史（東京大）再帰的な確率的プログラムの実行時間の二次のモーメントのための述語変換子 17:05–17:40 西脇友一（東京大） Contextual Modality through Iterated Enrichment 懇親会 18:00–20:00 福盛園（JR津田沼駅近く）SLACS2017のウェブページに地図を載せています 8月9日（水）セッション4：座長未定 10:00–10:35 酒井千尋（奈良女子大） TBA 10:35–11:10 上村太一（京都大） TBA セッション5：座長未定 11:30–12:05 木村大輔（東邦大） TBA 12:05–12:40 中澤巧爾（名古屋大） TBA クロージング 12:40–12:45 2. 懇親会会場を決定しました。当日飛び入りは不可能とのことですが、事前に連絡しておけば（会場の広さの都合上）若干名であれば対応可能とのことですので、追加募集いたします。参加を希望される方は幹事までご連絡ください。先着順に受け付けますのでご希望にそえないこともありますがご了承ください。

1 0

2017年度数学基礎論サマースクール案内第３報（直前のご案内）
by Toshio Suzuki 04 Aug '17

04 Aug '17

2017年度数学基礎論サマースクール案内第３報（直前のご案内）首都大学東京の鈴木登志雄です。 2017年度数学基礎論サマースクールは，いよいよ８月５日（土）から明治大学駿河台キャンパスで開催されます。今年度のテーマは「計算理論」です。参加費は無料です。申し込み・参加登録は不要です（会場収容人数１４０名。先着順。ただし過去の例から類推して，席は十分あると思われます）。時間割，最寄駅の情報などは下記のウェブサイトでご覧になれます。多くの方のご来場をお待ちしております。 http://toshio-suzuki-logic.jp/meeting/summer2017.html （NEW）すべての講義について，講義資料を事前に掲載しました。日時：８月５日（土）から７日（月）初日 13:00-16:30、２日目以降 9:00-16:30 会場：明治大学駿河台キャンパス　リバティタワー1073 （この部屋は７階です。ご注意ください。） http://www.meiji.ac.jp/koho/campus_guide/suruga/access.html 世話人：鈴木登志雄（首都大学東京），隈部正博（放送大学），河村彰星（8/1から九州大学），宮部賢志（明治大学）講師・テーマ：河村彰星「はじめての計算可能性」，宮部賢志「チューリング次数」，隈部正博「ジェネリック次数」，鈴木登志雄「ＨＦ上のデルタ１関係」この集会はJSPS科研費16K05255 「ブール値探索コストの条件付き極値問題：資本対リスク比による手法の展開」（研究代表者鈴木登志雄）から部分的に援助を受けています。 -- 近い日程の集会：サマースクールの翌日から，SLACS 2017（記号論理と情報科学）が開催されます（千葉工業大学）。 http://super.para.media.kyoto-u.ac.jp/~abet/slacs2017/index.html -- 鈴木登志雄首都大学東京理工学研究科　数理情報科学専攻 toshio-suzuki(a)tmu.ac.jp

1 0

Call for papers: PEPM 2018
by Kohei SUENAGA 02 Aug '17

02 Aug '17

皆様，（複数お受け取りの場合はご容赦下さい．）京都大学の末永と申します．来年1月にロサンゼルスで開催される PEPM 2018 の CFP をお送りします． POPL 2018 との同時開催です． "Partial evaluation" と会議名に入っていますが，プログラミングに関することならば部分計算に関係なくとも広く募集しております．大事な日程は * Paper submission deadline : Friday 6th October 2017 (AoE) (firm) * Author notification : Saturday 4th November 2017 * Workshop : Monday 8th – Tuesday 9th January 2018 です．どうぞ投稿をご検討下さい．よろしくお願いいたします．末永幸平 -- CALL FOR PAPERS -- ACM SIGPLAN Workshop on PARTIAL EVALUATION AND PROGRAM MANIPULATION (PEPM) 2018 =============================================================================== * Website : http://popl18.sigplan.org/track/PEPM-2018 * Time : 8th – 9th January 2018 * Place : Los Angeles, CA, US (co-located with POPL 2018) The ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM), which has a history going back to 1991 and has co-located with POPL every year since 2006, originates in the discoveries of practically useful automated techniques for evaluating programs with only partial input. Over the years, the scope of PEPM has expanded to include a variety of research areas centred around the theme of semantics-based program manipulation — the systematic exploitation of treating programs not only as subject to black-box execution, but also as data structures that can be generated, analysed, and transformed while establishing or maintaining important semantic properties. Scope ----- In addition to the traditional PEPM topics (see below), PEPM 2018 welcomes submissions in new domains, in particular: * Semantics based and machine-learning based program synthesis and program optimisation. * Modelling, analysis, and transformation techniques for distributed and concurrent protocols and programs, such as session types, linear types, and contract specifications. More generally, topics of interest for PEPM 2018 include, but are not limited to: * Program and model manipulation techniques such as: supercompilation, partial evaluation, fusion, on-the-fly program adaptation, active libraries, program inversion, slicing, symbolic execution, refactoring, decompilation, and obfuscation. * Techniques that treat programs/models as data objects including metaprogramming, generative programming, embedded domain-specific languages, program synthesis by sketching and inductive programming, staged computation, and model-driven program generation and transformation. * Program analysis techniques that are used to drive program/model manipulation such as: abstract interpretation, termination checking, binding-time analysis, constraint solving, type systems, automated testing and test case generation. * Application of the above techniques including case studies of program manipulation in real-world (industrial, open-source) projects and software development processes, descriptions of robust tools capable of effectively handling realistic applications, benchmarking. Examples of application domains include legacy program understanding and transformation, DSL implementations, visual languages and end-user programming, scientific computing, middleware frameworks and infrastructure needed for distributed and web-based applications, embedded and resource-limited computation, and security. This list of categories is not exhaustive, and we encourage submissions describing new theories and applications related to semantics-based program manipulation in general. If you have a question as to whether a potential submission is within the scope of the workshop, please contact the programme co-chairs, Fritz Henglein (http://www.diku.dk/~henglein/) and Josh Ko (https://josh-hs-ko.github.io). Submission categories and guidelines ------------------------------------ Two kinds of submissions will be accepted: Regular Research Papers and Short Papers. * Regular Research Papers should describe new results, and will be judged on originality, correctness, significance, and clarity. Regular research papers must not exceed 12 pages (excluding bibliography). * Short Papers may include tool demonstrations and presentations of exciting if not fully polished research, and of interesting academic, industrial, and open-source applications that are new or unfamiliar. Short papers must not exceed 6 pages (excluding bibliography). Both kinds of submissions should be typeset using the two-column ‘sigplan’ sub-format of the new ‘acmart’ format available at: http://sigplan.org/Resources/Author/ and submitted electronically via HotCRP: https://pepm18.hotcrp.com/ PEPM 2018 will employ lightweight double-blind reviewing according to the rules of POPL 2018. Quoting from POPL 2018’s call for papers: “submitted papers must adhere to two rules: 1. author names and institutions must be omitted, and 2. references to authors’ own related work should be in the third person (e.g., not “We build on our previous work ...” but rather “We build on the work of ...”). The purpose of this process is to help the PC and external reviewers come to an initial judgment about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult. In particular, important background references should not be omitted or anonymized. In addition, authors should feel free to disseminate their ideas or draft versions of their paper as they normally would. For instance, authors may post drafts of their papers on the web or give talks on their research ideas.” See POPL 2018’s Submission and Reviewing FAQ page for more information: http://popl18.sigplan.org/track/POPL-2018-papers#Submission-and-Reviewing-F… Submissions are welcome from PC members (except the two co-chairs) provided that there are non-PC co-authors. Accepted papers will appear in formal proceedings published by ACM, and be included in the ACM Digital Library. Authors of short papers, however, can ask for their papers to be left out of the formal proceedings. At least one author of each accepted contribution must attend the workshop and present the work. In the case of tool demonstration papers, a live demonstration of the described tool is expected. Suggested topics, evaluation criteria, and writing guidelines for both research tool demonstration papers will be made available on the PEPM 2018 web site. Student participants with accepted papers can apply for a SIGPLAN PAC grant to help cover travel expenses and other support. PAC also offers other support, such as for child-care expenses during the meeting or for travel costs for companions of SIGPLAN members with physical disabilities, as well as for travel from locations outside of North America and Europe. For details on the PAC programme, see its web page. Important dates --------------- * Paper submission deadline : Friday 6th October 2017 (AoE) (firm) * Author notification : Saturday 4th November 2017 * Workshop : Monday 8th – Tuesday 9th January 2018 The proceedings will be published 2 weeks pre-conference. AUTHORS TAKE NOTE: The official publication date is the date the proceedings are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of your conference. The official publication date affects the deadline for any patent filings related to published work. (For those rare conferences whose proceedings are published in the ACM Digital Library after the conference is over, the official publication date remains the first day of the conference.) Best paper award ---------------- PEPM 2018 continues the tradition of a Best Paper award. The winner will be announced at the workshop. Programme committee ------------------- Nada Amin (EPFL) Shigeru Chiba (University of Tokyo) Ezgi Çiçek (Max Planck Institute for Software Systems) Olivier Danvy (Yale-NUS College) Ronald Garcia (University of British Columbia) Simon Gay (University of Glasgow) Andy Gill (X, the Moonshot Factory) Fritz Henglein (co-chair) (University of Copenhagen) Anastasia Izmaylova (IMC Financial Markets) Johan Jeuring (Utrecht University) Gabriele Keller (University of New South Wales) Oleg Kiselyov (Tohoku University) Hsiang-Shang Ko (co-chair) (National Institute of Informatics) Ralf Lämmel (University of Koblenz-Landau) Julia Lawall (Inria) Simon Peyton Jones (Microsoft Research Cambridge) Frank Pfenning (Carnegie Mellon University) Sriram Rajamani (Microsoft Research India) Norman Ramsey (Tufts University) Thomas Reps (University of Wisconsin-Madison) Sergei Romanenko (Keldysh Institute of Applied Mathematics) Tiark Rompf (Purdue University) Wolfram Schulte (Facebook) Peter Sestoft (IT University of Copenhagen) Harald Søndergaard (University of Melbourne) Kohei Suenaga (Kyoto University) Martin Vechev (ETH Zurich) Marcos Viera (University of the Republic) Nobuko Yoshida (Imperial College London) -- 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 0

AQIS17のご案内
by NISHIMURA Harumichi 27 Jul '17

27 Jul '17

logic-mlの皆様シンガポールで９月４日から８日に開催される 17th Asian Quantum Information Science Conference: AQIS2017 の案内をするように依頼がありましたので、メーリングリストをお借りして、ご案内いたします。以下の通り、早期登録の期限は７月３０日となっております。ご参加をご検討いただければ幸いです。＃複数お受け取りの場合はご容赦ください。名古屋大学大学院情報学研究科西村治道 ----------------------------------------------------------------------------------------------------------------------------------------- Announcement: AQIS 2017: preliminary conference program available online Dear all, The conference preliminary program is now made available: http://aqis-conf.org/2017/program together with a preliminary conference program. The registration system is also open at: http://aqis-conf.org/2017/registration early-bird deadline is on 30 July 2017. Accommodation options can also be found: http://aqis-conf.org/2017/accommodation Your help to share or forward this information to other students, researchers and research groups who might be interested would be very much appreciated. We look forward to seeing you at AQIS 2017. Sincerely yours, AQIS 2017 Organising Committee Conference secretariat contact: aqis17(a)quantumlah.org -----------------------------------------------------------------------------------------------------------------------------------------

1 0

モデル理論夏の学校のお知らせ
by kota takeuchi 24 Jul '17

24 Jul '17

皆様筑波大学の竹内耕太です。今年のモデル理論夏の学校のお知らせです。モデル理論夏の学校は毎年夏に開催されているワークショップです。モデル理論に興味のある研究者や学生を歓迎いたします。詳しくはwebページ（ https://sites.google.com/site/modeltheolysummerschool2017/ ）をご覧ください。日時：9月19－21日（火～木）場所：大学セミナーハウス（東京都八王子）宿泊：セミナーハウスに20名分の部屋を予約してあります。数に限りがありますのでお早めに相談ください。またご自身で近隣のホテルを探していただくことも可能です。世話人：坪井明人（筑波大学）、竹内耕太（筑波大学）参加を希望される方はwebページをご確認のうえ必要な情報をkota(a)math.tsukuba.ac.xn--jp-g73axaz0b2e8b0moe6233j. 竹内耕太

1 0

[リマインダ] SLACS2017講演募集のお知らせ
by 安部達也 24 Jul '17

24 Jul '17

皆様（複数のメイリングリストに送信しています。重複して受信の際はご容赦ください。）講演募集締切一週間前になりましたのでリマインダです。 # 既に講演/懇親会に申し込まれた皆様、ありがとうございます。7/31以降に # プログラム案をお送りします。しばらくお待ちください。また、講演/懇親 # 会に申し込んだのに幹事から返事をもらっていないという方がいらっしゃい # ましたらご連絡ください。 SLACS 2017（記号論理と情報科学）幹事の千葉工業大学の安部達也です。今年度の講演募集を以下のとおり行います。ご検討よろしくお願いいたします。 SLACS 2017（記号論理と情報科学） http://super.para.media.kyoto-u.ac.jp/~abet/slacs2017/ 日時 2017年8月8日（火）から2017年8月9日（水）（前日まで数学基礎論サマースクールが明治大学で行われています。）場所千葉県習志野市津田沼2-17-1 千葉工業大学津田沼キャンパス6号館3階633室参加費無料。ただし、懇親会（初日夕方に開催予定）費は別途徴収します。幹事千葉工業大学人工知能・ソフトウェア技術研究センター安部達也連絡先 abet(a)stair.center SLACSとは以下はSLACSのページの冒頭からの抜粋です。 http://www.math.s.chiba-u.ac.jp/SLACS/ 「SLACS（スラックス）は，記号論理学と情報科学の境界領域に関する研究発表・研究討論の場を提供することを目的にして開催されている研究集会です． 1985年1月に第１回が開催されて以来，毎年１回のペースで開催されています． SLACS は，堅苦しい研究会ではなく，その年の幹事を中心とした参加者自らの手作りによるフレンドリーな雰囲気を持った集会です．気軽に発表できる場ですから，研究が進行中の話題を持ってきて議論したり，学生さんが発表する場としても適当です．もちろん，発展を続けるこの分野の最先端の研究テーマに関する発表も数多く聞くことができます．参加者の資格は問いませんので，原則として，どなたでも講演発表・聴講いただけます．発表はごく少数の例外を除いて日本語です．」より詳しい情報はSLACSのページや最近の開催情報をご確認ください。 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 を「SLACS2017講演申込」にしておいていただけるとありがたいです。講演申込期限は2017年7月31日としますが、講演する意思があるという方は早目にご連絡いただけると幸いです。 ----- 8< ----- 8< ----- 8< ----- 8< ----- 8< ----- 8< ----- 8< ----- 1. 氏名：（例）安部達也 2. 所属：（例）千葉工業大学人工知能・ソフトウェア技術研究センター 3. 区分：一般/学生 ← プログラム作成・懇親会費設定に利用する場合があります 4. 演題：（例）TBA 5. 懇親会：参加する/追って連絡する/参加できない 6. 要望等：（例）初日しか参加できませんので初日の枠に入れてください ----- 8< ----- 8< ----- 8< ----- 8< ----- 8< ----- 8< ----- 8< ----- 講演を伴わない聴講のみを希望される場合、事前連絡は不要です。当日、会場に直接お越しください。懇親会に参加を希望される方は、幹事に連絡をお願いいたします。その際、講演申込と同様のフォーマット（演題不要）での回答をお願いいたします。 Subject を「SLACS2017懇親会参加申込」にしておいていただけるとありがたいです。申込期限は2017年7月31日としますが、参加する意思があるという方は早目にご連絡いただけると幸いです。

1 0

講演会 (上村太一氏)
by Ryoma Shinya 21 Jul '17

21 Jul '17

(重複で受け取られた方はご容赦ください) 皆様，東京大学の新屋です．以下の要領で京都大学の上村太一氏の講演会を実施いたしますので，ふるってご参加ください．新屋良磨東京大学大学院情報理工学系研究科コンピュータ科学専攻 email: ryoma(a)kb.is.s.u-tokyo.ac.jp <mailto:ryoma@kb.is.s.u-tokyo.ac.jp> ========== 日時：8/4(金) 午後2時から場所：東京大学理学部化学東館2階化東236教室題目：Homotopy Type Theory 入門 / Fibred Fibration Categories 話者：上村太一 (京都大学数理解析研究所) 第一部 (チュートリアル): Homotopy Type Theory 入門概要: *Homotopy Type Theory* (HoTT) は Martin-Löf 依存型理論の拡張で、ホモトピー論に特化した型理論である。代数トポロジーと計算機科学の橋渡しとなる分野であり、ホモトピー論、高次圏論、数理論理学、定理証明器、依存型プログラミングなどと関わりが深い。特に定理証明器を用いた代数トポロジーおよび数学全般の形式化に使われており、 HoTT による数学の基礎付けと定理証明器上での実装は *Univalent Foundations program* と呼ばれる。本チュートリアルでは、Martin-Löf 依存型理論の基本的な概念と、 HoTT の重要な概念である *univalence axiom* と *higher inductive type* についてインフォーマルに解説する。また、HoTT の圏論的意味論として弱分解系、モデル圏や Shulman の type-theoretic fibration category についても触れる。第二部: Fibred Fibration Categories 概要: We introduce fibred type-theoretic fibration categories which are fibred categories between categorical models of Martin-L\"{o}f type theory. Fibred type-theoretic fibration categories give a categorical description of logical predicates for identity types. As an application, we show a relational parametricity result for homotopy type theory. As a corollary, it follows that every closed term of type of polymorphic endofunctions on a loop space is homotopic to some iterated concatenation of a loop.

1 0

数学基礎論若手の会２０１７のご案内
by Toshimichi Usuba 21 Jul '17

21 Jul '17

（重複して受け取られた場合はご容赦ください） logic-mlの皆様、早稲田大学の薄葉と申します。２０１７年度の数学基礎論若手の会のご案内をさせていただきます。数学基礎論若手の会は，数学基礎論を専攻する学生および若手研究者の研究交流を目的とする合宿形式の研究集会です．講演はオリジナルの成果発表に限らず，研究の途中報告や研究内容の紹介など幅広く募集しています．また，これから数学基礎論を勉強したいと思っている方のご参加も歓迎します．多くの方のご参加・ご講演をお待ちしています．日時２０１７年１０月２７日（金）午後～２９日（日）午前場所財団法人大学セミナーハウス https://iush.jp/ 住所〒192-0372東京都八王子市下柚木1987-1 世話人　薄葉季路（早稲田大学基幹理工学部）連絡先　usuba(a)waseda.jp ウェブページ　https://sites.google.com/view/kisoronwakatenokai2017/%E3%83%9B%E3%83%BC%E3%… 参加費用：１４０００円程度（宿泊費、食事、懇親会費ふくむ。部分参加や食事をとられない場合はその分割引になります）参加を希望される方は、以下の情報を薄葉(usuba(a)waseda.xn--jp)-ub4boe 件名：数学基礎論若手の会参加申込にてお送りください。参加申し込み締め切り：９月１５日＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝・所属大学，学部，立場（修士1年，博士2年，社会人、ポスドク，助教など）・氏名，性別・講演希望するorしない（講演希望の場合、後日題目と概要をお送りください）・２７日の宿泊を希望するorしない・２８日の宿泊を希望するorしない・２７日の夕食を希望するorしない・２８日の朝食を希望するorしない・２８日の昼食を希望するorしない・２８日の夜の懇親会に参加するorしない・２９日の朝食を希望するorしない・その他（質問、講演希望日など）＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝ -- Toshimichi USUBA School of Fundamental Science and Engineering, Waseda University

1 0

2nd CALL FOR PAPERS: Logic and Engineering of Natural Language Semantics 14 (LENLS 14)
by Katsuhiko Sano 21 Jul '17

21 Jul '17

皆様、北海道大学の佐野勝彦と申します。今年の１１月に東京で開催される LENLS14 国際ワークショップの 2nd CFPをお送り致します。皆様のご投稿・ご参加をお待ちしております。佐野勝彦 [Apologies for multiple copies] ================================================================= 2nd CALL FOR PAPERS Logic and Engineering of Natural Language Semantics 14 (LENLS 14) Workshop Site : Bunkyo School Building in University of Tsukuba, Tokyo Campus Bunkyo-ku, Tokyo, Japan http://www.tsukuba.ac.jp/en/access/tokyocampus-access Dates : November 13-15, 2017 Contact Person: Katsuhiko Sano (Hokkaido University) Contact Email : lenls14[[at]]easychair.org Website : http://www.is.ocha.ac.jp/~bekki/lenls/ ================================================================= Chair: Katsuhiko Sano (Hokkaido University) Co-chair: Eric McCready (Aoyama Gakuin University) Daisuke Bekki (Ochanomizu University/JST CREST) Koji Mineshima (Ochanomizu University/JST CREST) Invited Speakers: - Craige Roberts (The Ohio State University) - Ivano Ciardelli (University of Amsterdam) - Shoichi Takahashi (Aoyama Gakuin University) LENLS is an annual international workshop on formal syntax, semantics and pragmatics. It will be held as one of the workshops of the JSAI International Symposia on AI (isAI2017) (https://www.ai-gakkai.or.jp/isai/) sponsored by the Japan Society for Artificial Intelligence (JSAI). Aims and Topics: ================ We invite submissions to this year's workshop on topics in formal syntax, semantics and pragmatics, and related fields, including but in no way limited to the following: - Formal syntax, semantics and pragmatics of natural language - Model-theoretic and/or proof-theoretic semantics of natural language - Computational Semantics - Game-theoretic/Bayesian approaches to pragmatics - Nonclassical Logic and its relation to natural language (especially Substructural/Fuzzy/Categorical/Topological logics) - Formal Philosophy of language - Scientific methodology and/or experimental design for linguistics Submissions: ============ Abstracts (anonymous, up to 4 pages, including figures and references, A4 size, with 12 point font) must be submitted electronically in PDF format at: https://easychair.org/conferences/?conf=lenls14 When the abstract is accepted, the author is expected to submit a full paper (10-14 pages) before the workshop. The online proceedings of the workshop will be available at the conference site. Important dates: ================ Abstract submission deadline: August 31, 2017 Notification of acceptance: September 30, 2017 Deadline for camera-ready copy: mid-October, 2017 LENLS14: November 13-15, 2017 Sponsor: ======== LENLS is being organized by an alliance of "Establishment of Knowledge-Intensive Structural Natural Language Processing and Construction of Knowledge Infrastructure" (http://nlp.ist.i.kyoto-u.ac.jp/CREST/?en) project, funded by JST CREST Programs "Advanced Core Technologies for Big Data Integration" (http://www.jst.go.jp/kisoken/crest/en/research_area/ongoing/areah25-6.html). Workshop Organizers/Program Committee: ====================================== - Katsuhiko Sano (Hokkaido University) - Eric McCready (Aoyama Gakuin University) - Daisuke Bekki (Ochanomizu University/JST CREST) - Koji Mineshima (Ochanomizu University/JST CREST) - Alastair Butler (National Institute for Japanese Language and Linguistics) - Richard Dietz (iCLA, Yamanashi Gakuin University) - Naoya Fujikawa (Tokyo Metropolitan University) - Yoshiki Mori (University of Tokyo) - Yasuo Nakayama (Osaka University) - David Y. Oshima (Nagoya University) - Osamu Sawada (Mie University) - Wataru Uegaki (Leiden University) - Katsuhiko Yabushita (Naruto University of Education) - Tomoyuki Yamada (Hokkaido University) - Shunsuke Yatabe (Kyoto University) - Kei Yoshimoto (Tohoku University)

1 0

CTFM2017のご案内
by YOKOYAMA Keita 19 Jul '17

19 Jul '17

先ほどのメール、おかしなタイトルで送信してしまいましたので、改めて送信させて頂きます。失礼致しました。横山啓太皆様、北陸先端大の横山です。 9月にシンガポールで開催されます、CTFM2017のご案内をさせて頂きます。どうぞよろしくお願い致します。横山啓太 CALL FOR PRESENTATION: ============================================================ Workshop on Computability Theory and Foundations of Mathematics (National University of Singapore, 8 - 12 September 2017) http://ims.nus.edu.sg/events/2017/wcom/index.php Abstracts of talks should be submitted via email to imsbox1(a)nus.edu.sg with subject line: CTFM2017 submission. The length of abstract is limited to 2 pages including references. The authors are recommended to prepare their abstracts in the following IMS format: Tex file: http://ims.nus.edu.sg/files/IMSAbstractTemplate.tex PDF example: http://ims.nus.edu.sg/files/IMSAbstractTemplate.pdf IMPORTANT DATE. Submission deadline: September 1, 2017. ============================================================ This workshop is the seventh in the Computability Theory and Foundations of Mathematics (CTFM) series. CTFM aims to provide a forum for computability theory and logical foundations of mathematics. The topics include, but are not limited to, Computability / Recursion Theory, Reverse Mathematics, Nonstandard Analysis, Proof Theory, Set Theory, Philosophy of Mathematics, Constructive Mathematics, Algorithmic Randomness and Computational Complexity. CTFM began as a "Workshop on Proof Theory and Computability Theory" and held its first meeting in Japan. Previous venues were Matsushima (2008, 2009), Inawashiro (2010), Sendai (2011), Tokyo (2012). The series assumed the name "Computability and Foundations of Mathematics" at the 2013 meeting which was hosted in Tokyo. CTFM 2017 will be the first time a meeting in the series is held outside Japan. The previous meetings attracted not only researchers in Japan but also many from around the world. In particular, since 2013, logicians from Singapore have had frequent scientific exchanges with their Japanese counterpart through the platform of the CTFM meetings. The first day and the last day of the 2017 workshop will focus on classical recursion theory, and computable structures as well as reverse mathematics. The activities are held jointly with the program Aspect of Computation. The other two days will focus on topics in set theory and the foundations of mathematics. -------------------------------------------- Invited Speakers Joerg Brendle (Kobe University, Japan) Satoru Kuroda (Gunma Prefectural Women's University, Japan) Ludovic Patey (The University of California, Berkeley, USA) Toshimichi Usuba (Waseda University, Japan) Thomas Zeugmann (Hokkaido University, Japan) Hao Zhaokuan (Fudan University, China) -------------------------------------------- Program Committee: Dilip Raghavan (National University of Singapore) Stephen Simpson (Pennsylvania State University) Frank Stephan (National University of Singapore) Kazuyuki Tanaka (Tohoku University) (Chair) Yue Yang (National University of Singapore) Keita Yokoyama (Japan Advanced Institute of Science and Technology) -------------------------------------------- Organizing Committee: Chi Tat Chong (National University of Singapore) Kazuyuki Tanaka (Tohoku University) Guohua Wu (Nanyang Technological University) Yue Yang (National University of Singapore) Keita Yokoyama (Japan Advanced Institute of Science and Technology) -------------------------------------------- -- Keita Yokoyama y-keita(a)jaist.ac.jp

1 0

Fwd: CTFM2107: the change of speakers
by YOKOYAMA Keita 19 Jul '17

19 Jul '17

皆様、北陸先端大の横山です。 9月にシンガポールで開催されます、CTFM2017のご案内をさせて頂きます。どうぞよろしくお願い致します。横山啓太 CALL FOR PRESENTATION: ============================================================ Workshop on Computability Theory and Foundations of Mathematics (National University of Singapore, 8 - 12 September 2017) http://ims.nus.edu.sg/events/2017/wcom/index.php Abstracts of talks should be submitted via email to imsbox1(a)nus.edu.sg with subject line: CTFM2017 submission. The length of abstract is limited to 2 pages including references. The authors are recommended to prepare their abstracts in the following IMS format: Tex file: http://ims.nus.edu.sg/files/IMSAbstractTemplate.tex PDF example: http://ims.nus.edu.sg/files/IMSAbstractTemplate.pdf IMPORTANT DATE. Submission deadline: September 1, 2017. ============================================================ This workshop is the seventh in the Computability Theory and Foundations of Mathematics (CTFM) series. CTFM aims to provide a forum for computability theory and logical foundations of mathematics. The topics include, but are not limited to, Computability / Recursion Theory, Reverse Mathematics, Nonstandard Analysis, Proof Theory, Set Theory, Philosophy of Mathematics, Constructive Mathematics, Algorithmic Randomness and Computational Complexity. CTFM began as a "Workshop on Proof Theory and Computability Theory" and held its first meeting in Japan. Previous venues were Matsushima (2008, 2009), Inawashiro (2010), Sendai (2011), Tokyo (2012). The series assumed the name "Computability and Foundations of Mathematics" at the 2013 meeting which was hosted in Tokyo. CTFM 2017 will be the first time a meeting in the series is held outside Japan. The previous meetings attracted not only researchers in Japan but also many from around the world. In particular, since 2013, logicians from Singapore have had frequent scientific exchanges with their Japanese counterpart through the platform of the CTFM meetings. The first day and the last day of the 2017 workshop will focus on classical recursion theory, and computable structures as well as reverse mathematics. The activities are held jointly with the program Aspect of Computation. The other two days will focus on topics in set theory and the foundations of mathematics. -------------------------------------------- Invited Speakers Joerg Brendle (Kobe University, Japan) Satoru Kuroda (Gunma Prefectural Women's University, Japan) Ludovic Patey (The University of California, Berkeley, USA) Toshimichi Usuba (Waseda University, Japan) Thomas Zeugmann (Hokkaido University, Japan) Hao Zhaokuan (Fudan University, China) -------------------------------------------- Program Committee: Dilip Raghavan (National University of Singapore) Stephen Simpson (Pennsylvania State University) Frank Stephan (National University of Singapore) Kazuyuki Tanaka (Tohoku University) (Chair) Yue Yang (National University of Singapore) Keita Yokoyama (Japan Advanced Institute of Science and Technology) -------------------------------------------- Organizing Committee: Chi Tat Chong (National University of Singapore) Kazuyuki Tanaka (Tohoku University) Guohua Wu (Nanyang Technological University) Yue Yang (National University of Singapore) Keita Yokoyama (Japan Advanced Institute of Science and Technology) -------------------------------------------- -- Keita Yokoyama y-keita(a)jaist.ac.jp

1 0

Call for papers: Non-classical Modal and Predicate Logics
by Katsuhiko Sano 15 Jul '17

15 Jul '17

皆様、北海道大学の佐野勝彦と申します。2017年12月に広州で開催される国際会議についてご案内申し上げます。どうぞ宜しくお願い致します。佐野勝彦 ------------------------------------------------------------------------------------------------- (* Apologies for any cross-postings. *) Call for papers *** Non-classical Modal and Predicate Logics *** Guangzhou (Canton), China, 4-8 December 2017 http://logic.sysu.edu.cn/wolc2017/ Modalities and predicates have since ancient times been central notions of logic. In the 20th century, various systems of non-classical logics emerged, with applications mainly in Computer Science, but also in many other disciplines such as Linguistics, Mathematics, and Philosophy. Both the theoretical studies and the needs of applications gave rise to the questions of non-classical treatment of quantification and modalities and their accommodation in these non-classical logics. In response, various modal and predicate variants of non-classical logics have been introduced and studied in the past decades. Although there are many good conferences on (mainly propositional) non-classical logics, this conference is one solely dedicated to modal and predicate non-classical logics. The aim of the conference is to bring together researchers in both pure and applied aspects of various branches of non-classical logics, not only to present recent advances in their particular fields, but mainly foster the exchange of ideas between researchers focusing on (1) separate branches of non-classical logic and (2) foundational and applied issues. We invite submissions on both (a) theoretical topics from all branches of mathematical logic (e.g., proof-theory, model theory, game theory, computational complexity, etc.), as well as (b) their applications in various areas (including computer science, linguistics, mathematics, philosophy, etc.). Topics of interest include (but are not limited to): * The study of first- or higher-order variants of non-classical logics, including, but not limited to: - Predicate intuitionistic and superintuitionistic logics - Predicate modal logics (e.g. epistemic, tense, action) - Predicate substructural logics - Predicate many-valued and partial logics - Predicate paraconsistent logics - Predicate conditional logic - Predicate non-monotonic logics * Non-classical theories of quantification over classical logic, such as: - Free logics - Branching quantifiers and IF-logic - Generalized quantifiers * Extensions by modalities of (propositional or predicate) non-classical logics, including: - Modal extensions of (super)intuitionistic, substructural, many-valued, paraconsistent, non-monotonic, etc., logics - Co-algebraic treatment of modalities * Applications of non-classical modal and predicate logics in various areas, including: - Computer science - Linguistics and logical analysis of natural language - Philosophy - Methodology of science - Foundations of mathematics (non-classical mathematics) - Mathematical social sciences (e.g. social choice theory, game theory, decision theory) Strong papers on propositional logics can also be accepted, provided they relate to the themes in the main scope of the conference (e.g., the study of completions in algebraic semantics, propositional quantification, etc.). Full versions of selected papers will be published in a special issue of an international peer-reviewed journal (to be specified). == Invited speakers == Gilles Dowek Xavier Caicedo Thomas Ehrhard Melvin Fitting Rosalie Iemhoff Edwin Mares (more to be announced) == Program committee == Shier Ju (chair) Petr Cintula (chair) Arnon Avron Libor Behounek Rob Goldblatt Minghui Ma Chris Mortensen Hiroakira Ono Alessandra Palmigiano Valentin Shehtman Yde Venema Xuefeng Wen (more to be announced) == Organizing committee == Zhe Lin (chair) == Contacts == Web: http://logic.sysu.edu.cn/wolc2017/ Email: linzhe8(a)mail.sysu.edu.cn == Submissions == Extended abstracts of 1-2 pages (including references) should be submitted via the EasyChair web interface: https://easychair.org/conferences/?conf=ncmpl2017 The typesetting style of the document is free for the moment, but a file written according to LNCS style will be requested upon acceptance == Important dates == Deadline for abstracts: 1 September 2017 Notification of acceptance: 20 September 2017 Conference: 4-8 December 2017 Shier Ju and Petr Cintula Conference chairs

1 0

名古屋ロジックセミナー (Arno Pauly氏の講演 7/21)
by Takayuki Kihara 14 Jul '17

14 Jul '17

皆様，名古屋大学の木原貴行です．この度，ブリュッセル自由大学のArno Pauly氏の日本訪問の折に，下記の要領で名古屋ロジックセミナーを開催することとなりました．多数のご参加をお待ちしております．名古屋ロジックセミナー http://www.math.mi.i.nagoya-u.ac.jp/~kihara/logic-seminar.html 日時：7月21日 (金) 15:30〜場所：名古屋大学大学院情報学研究科棟 314室講演者：Arno Pauly (ブリュッセル自由大学) 題目：Computability: From ω^ω to κ^κ アブストラクト： Recently Galeotti and Nobrega [1,2] have suggested to generalize computable analysis and the theory of Weihrauch degrees to higher cardinalities. The central role taken by Baire space ω^ω in the classic theories is then filled by κ^κ for a cardinal κ with κ^{<κ}, the reals are replaced by initial segments of the surreal numbers and Turing machines are generalized to ordinal time Turing machines. Initial investigations have reveiled that some results carry over directly, whereas other core questions can become inpendent of ZFC. I will outline both the classic theory and its the generalization to higher cardinalities. In particular, I will highlight some open questions and challenges. [1] Lorenzo Galeotti: A candidate for the generalised real line, CiE 2016. [2] Lorenzo Galeotti and Hugo Nobrega: Towards computable analysis on the generalised real line, CiE 2017. -------- 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

2017年度数学基礎論サマースクール案内第２報
by Toshio Suzuki 12 Jul '17

12 Jul '17

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

1 0

早稲田大学高等研究所 / 慶應義塾大学論理と感性のグローバル研究センター共催「Workshop in Logic and Philosophy of Mathematics」(7月14-15日)のご案内
by Makoto Fujiwara 10 Jul '17

10 Jul '17

早稲田大学の藤原誠です。先日ご案内させていただいた早稲田大学高等研究所 / 慶應義塾大学論理と感性のグローバル研究センター共催「Workshop in Logic and Philosophy of Mathematics」について最新の情報を流させていただきます。 14日15日ともに参加自由です。どうぞふるってご参加ください。 ------------------------------------------------------------------- We apologize if you receive this message more than once. --------------------------------------------------------------------- We announce the following “Workshop in Logic and Philosophy of Mathematics”. The first day is at Mita campus of Keio University and the second day is at Waseda campus of Waseda University. 7月14日は慶應義塾大学三田キャンパス、7月15日は早稲田大学早稲田キャンパスでの開催になりますのでご注意下さい。 ---- Workshop in Logic and Philosophy of Mathematics Date: July 14 (Fri) and 15 (Sat), 2017 日時: 2017年7月14日(金), 7月15日(土) Place: G-Lab, 6th floor, East Building, Mita campus of Keio University (14th); Meeting Room #1, 5th Floor, Bldg. 9, Waseda campus of Waseda University (15th). 場所: 慶應義塾大学三田キャンパス東館6階G-Lab (14日); 早稲田大学早稲田キャンパス9号館5階第一会議室 (15日). For more details, please see the following page: 詳細は以下をご覧ください。 https://www.waseda.jp/inst/wias/news/2017/07/04/4467/ ---- Program: 1. July 14 (Friday, G-Lab, 6th floor, East Building, Mita campus of Keio University): Time: 13:00-18:00 Speakers: Andrew Arana (Université Paris 1 Panthéon-Sorbonne, IHPST), Kengo Okamoto (Tokyo Metropolitan University), Ryota Akiyoshi (Waseda University), Makoto Fujiwara (Waseda University) The details will be announced soon at the following page: https://abelard.flet.keio.ac.jp/jindex.php <https://abelard.flet.keio.ac.jp/jindex.php> 2. July 15 (Saturday, Meeting Room #1, 5th Floor, Bldg. 9, Waseda Campus of Waseda University) Talk 1: 13:00-14:00 Ryoma Shinya (The University of Tokyo) Title: Almost every simply typed λ-term has a long β-reduction sequence Abstract: It is well known that the length of a β-reduction sequence of a simply typed λ-term of order k can be huge; it is as large as k-fold exponential in the size of the λ-term in the worst case. We consider the following relevant question about quantitative properties, instead of the worst case: how many simply typed λ-terms have very long reduction sequences? We provide a partial answer to this question, by showing that asymptotically almost every simply typed λ-term of order k has a reduction sequence as long as (k − 2)-fold exponential in the term size, under the assumption that the arity of functions and the number of variables that may occur in every subterm are bounded above by a constant. The work has been motivated by quantitative analysis of the complexity of higher-order model checking. Talk 2: 14:00-15:00 Taishi Kurahashi (National Institute of Technology, Kisarazu College) Title: On partial disjunction properties of theories containing PA Abstract: It is well-known that intuitionistic predicate logic and Heyting Arithmetic have the disjunction property (DP). For intuitionistic logic, DP seems to reflect its constructivity. In classical logic, DP plays a different role. If a theory T in classical logic has DP, then T is complete because the law of excluded middle is valid. Thus in classical logic, every \Sigma_1-definable consistent extension of Peano Arithmetic PA does not have DP by the Gödel–Rosser first incompleteness theorem. On the other hand, PA enjoys a partial disjunction property. Let \Gamma be a class of formula. We say that a theory T has the \Gamma-disjunction property (\Gamma-DP) iff for any \Gamma sentences \varphi and \psi, at least one of \varphi or \psi is provable in T whenever \varphi \lor \psi is provable in T. It is known that PA has \Sigma_1-DP but does not have \Pi_1-DP. In this talk, we present several results concerning partial disjunction properties and other related properties of theories containing PA which is not necessarily \Sigma_1-definable. Talk 3: 15:20-16:20 Naosuke Matsuda (Kanagawa University) Title: Some extensions of de Jongh's theorem Abstract: It is obvious that if a propositional formula A is provable in intuitionistic propositional calculus, then each arithmetical instance is provable in Heyting Arithmetic. The converse of this statement is known as de Jongh's theorem. In this talk, I give an introduction to de Jongh's theorem and introduce some extensional works. Talk 4: 16:20-17:20 Masahiko Sato (Kyoto University) Title: A common notation system for lambda calculus and combinatory logic Abstract: We present a notation system which can be used to faithfully represent both the terms of lambda calculus and combinatory logic. We show the faithfullness of the representations by observing that the representations respect the beta and eta reduction rules. We also argue that Curry's Last Problem (J.R.Hindley, Curry's Last Problem: Imitating lambda-beta-reduction in Combinatory Logic) in its original form is an ill-posed problem, and can be solved naturally by expressing the problem in our notation system. --------------------------------------------------------------------- Organizers: Ryota Akiyoshi (Waseda Institute for Advanced Study, Waseda University) Makoto Fujiwara (Waseda Institute for Advanced Study, Waseda University) Mitsuhiro Okada (Global Research Center for Logic and Sensibility, Keio University) Co-host: Waseda Institute for Advanced Study (Waseda University), Global Research Center for Logic and Sensibility (Keio University) Contact: Ryota Akiyoshi georg.logic(a)gmail.com <mailto:georg.logic@gmail.com> ============================================ 藤原誠 (Makoto Fujiwara) 早稲田大学高等研究所 (Waseda Institute for Advanced Study, Waseda University) E-mail: makoto_fujiwara(a)aoni.waseda.jp ============================================

2 1

47th TRS meeting (参加者募集)
by Munehiro Iwami 07 Jul '17

07 Jul '17

皆様島根大学の岩見と申します。 9月25～27日に開催される「第47回 TRS Meeting」の参加者募集をご案内致します。今回は水の都とよばれる松江の宍道湖岸のホテルで開催します。皆様、ぜひ参加をご検討下さい。講演題目と講演時間は後程連絡して頂く形で構いません。和室シングルルームは宍道湖眺望ありです。通常のシングルルームは宍道湖眺望なしです。 7月14日（金）までに岩見へメールにて連絡してください。 -- 岩見宗弘島根大学総合理工学研究科情報システム学領域 E-mail: munehiro(a)cis.shimane-u.ac.jp ----------------------------------------- 47th TRS Meeting September 25 - 27, 2017 Matsue, Japan http://www.cis.shimane-u.ac.jp/~munehiro/trs-meeting47/ About TRS Meeting Term Rewriting Meeting (TRS Meeting) is a biannual informal workshop that aims at promoting the research on rewriting and related areas. Participants are requested to give a talk(s) of approximately 15 - 60 minutes in English on their research activities. The subject of the talk may not be one's original result; for example, explaining an interesting paper is perfectly OK. (See Rewriting Researchers Forum for further information: http://www.jaist.ac.jp/~hirokawa/trs-meeting/). Basic Information Date September 25 (Mon) - 27 (Wed), 2017 Venue Matsue New Urban Hotel (webpage in Japanese) 40-1, Nishicha-machi, Mstsue-shi, Shimane, 690-0845, Japan Fee Registration: 6,000 JPY (includes coffee breaks and meeting room) Accomodation: 8,400 JPY (Sep. 25) (includes breakfast and dinner) and 12,560 JPY (Sep. 26) (includes breakfast and bunquet) Tentative Schedule Room Koto (we will have a screen and a whiteboard) Opening 13:30, September 25 Closing 12:00, September 27 Timetable Tentative Registration Deadline July 14th (Fri), 2017 Please fill in the following registration form and send it to Munehiro Iwami (munehiro [at] cis.shimane-u.ac.jp) by e-mail. Items marked with * can be sent later. -------------------------------------------------------------------------------------------- Registration Form of the 47th TRS Meeting name: affiliation: * title of talk: * approximate duration of talk (15 - 60 minutes): preference on your room: [standard single room / Japanese style single room] (choose one) (In case of partial participation, please contact us) --------------------------------------------------------------------------------------------

1 0

FLOPS 2018: Call for Papers
by koba＠kb.is.s.u-tokyo.ac.jp 04 Jul '17

04 Jul '17

皆様、東京大学の小林です。 FLOPS 2018 の論文募集案内をお送りいたします。小林直樹東京大学大学院情報理工学系研究科コンピュータ科学専攻〒113-0033 東京都文京区本郷7-3-1 Phone: 03-5841-4124 Fax: 03-5841-4124 email: koba(a)is.s.u-tokyo.ac.jp ----------------- FIRST Call For Papers FLOPS 2018: 14th International Symposium on Functional and Logic Programming 9-11 May, 2018, Nagoya, Japan http://www.sqlab.jp/FLOPS2018/ Writing down detailed computational steps is not the only way of programming. The alternative, being used increasingly in practice, is to start by writing down the desired properties of the result. The computational steps are then (semi-)automatically derived from these higher-level specifications. Examples of this declarative style include functional and logic programming, program transformation and re-writing, and extracting programs from proofs of their correctness. 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. Scope FLOPS solicits original papers in all areas of the declarative programming: * functional, logic, functional-logic programming, re-writing systems, formal methods and model checking, program transformations and program refinements, developing programs with the help of theorem provers or SAT/SMT solvers; * foundations, language design, implementation issues (compilation techniques, memory management, run-time systems), applications and case studies. FLOPS promotes cross-fertilization among different styles of declarative programming. Therefore, submissions must be written to be understandable by the wide audience of declarative programmers and researchers. Submission of system descriptions and declarative pearls are especially encouraged. Submissions should fall into one of the following categories: * Regular research papers: they should describe new results and will be judged on originality, correctness, and significance. * System descriptions: they should contain a link to a working system and will be judged on originality, usefulness, and design. * Declarative pearls: new and excellent declarative programs or theories with illustrative applications. System descriptions and declarative pearls must be explicitly marked as such in the title. Submissions must be unpublished and not submitted for publication elsewhere. Work that already appeared in unpublished or informally published workshops proceedings may be submitted. See also ACM SIGPLAN Republication Policy. Proceedings The proceedings will be published by Springer International Publishing in the Lecture Notes in Computer Science (LNCS) series, as a printed volume as well as online in the digital library SpringerLink. Post-proceedings: The authors of 4-7 best papers will be invited to submit the extended version of their FLOPS paper to a special issue of the journal Science of Computer Programming (SCP). Important dates 13 November 2017 (any time zone): Abstract Submission 20 November 2017 (any time zone): Submission deadline 15 January 2018: Author notification 9-11 May 2018: FLOPS Symposium Invited Talks To be announced Submission Submissions must be written in English and can be up to 15 pages long including references, though pearls are typically shorter. The formatting has to conform to Springer's guidelines. Regular research papers should be supported by proofs and/or experimental results. In case of lack of space, this supporting information should be made accessible otherwise (e.g., a link to a Web page, or an appendix). Papers should be submitted electronically at https://easychair.org/conferences/?conf=flops2018 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 Sondergaard The University of Melbourne, Australia Jacques Garrigue Nagoya University, Japan Jan Midtgaard Technical University of Denmark, Denmark Joachim Breitner University of Pennsylvania, USA John Gallagher Roskilde University, Denmark and IMDEA Software Institute, Spain (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 (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 (co-chair) John Gallagher Roskilde University and IMDEA Software Institute (co-chair) Makoto Tatsuta National Institute of Informatics, Japan (General Chair) Koji Nakazawa Nagoya University, Japan (Local Chair)

1 0

ARANA博士パリ第1大哲学科准教授Geometrical knowledge and　geometrical　legitimacy7月４、１１、１９日慶応大三田
by Mitsuhiro Okada 04 Jul '17

04 Jul '17

次の3回の連続セミナートークを予定しています。アナウンスが第1回目の開催日に間に合わないかもしれませんが、次の内容をこのメールリストに流させて頂きけるとありがたいです。よろしくお願いいたします。岡田光弘　慶應義塾大学文学部哲学専攻 ─────────────────────────────── ＜Andrew ARANA パリ第1大学哲学科准教授　数学の哲学連続トークと討論 7月4日、11日、19日、Geometrical knowledge and　geometrical　 legitimacy ＞　July 4th, 11th,19th, Mita Campus, Keio University 次のようなPhilosophy of mathematics 連続セミナートークを Andrew ARANA 博士にお願いしています。連続セミナートーク・テーマ　Theme Geometrical knowledge and geometrical legitimacy I, II, III 初回Iはoverview的講演をお願いしてます。この告知メールは初回のトークのあとに届く可能性が高いですが、 2回目、3回目の内容は初回と独立にお聴きいただくこともできますので2回目以降からのご参加も歓迎いたします。スピーカー Speaker Andrew Arana, パリ第1大学哲学科准教授、Dept of Philosophy, University of Paris-1 場所：慶應大三田キャンパス大学院棟３１３番教室 Room 313, Graduate School Building, Mita Campus, Keio university (構内図 Campus Mapの8番です。　#8 of this map.) https://www.keio.ac.jp/ja/maps/mita.html One hour talk and 30 minutes discussion 第1回7月4日 (火) July 4th (Tues) 18;00-19:30 第2回　7月11日(火)　July 11th (Tues) 18:00-19:30 第3回 7月１９日（火）July 19th (Tues) 18:00-19:30 ---------------------------------------------------------------- この会合とは別に、早稲田大学高等研究所―慶應義塾大学論理と感性のグローバル研究センター共催の「論理と数学の哲学」会合(7月14日三田キャンパス、１５日早稲田キャンパス)でもArana先生が14日に話されます。) Ａｎｄｒｅｗ　Arana, Proofs and Meaning in Arithmetic 14日、15日とも13:00に開始を予定しています。こちらの案内はプログラムが決まり次第追ってお知らせします。14日は慶應大三田キャンパス東館６階G-Lab　Ａｌｓｏ　the Waseda-U=Keio U Joint Workshop on “Logic and Philosophy of Mathematics” Is acheduled. Prof. Arana is going to give another talk there on 14th at G-Lab, 6th floor, East Building, Mita Campus, Keio University. We will announce the program soon. ------------------------------------------- 論理と感性のグローバル研究センター(論理班)、三田ロジックセミナー共催お問い合わせ Contact: logic(a)abelard.flet.keio.ac.jp (セミナー事務局専用アドレス)　慶応義塾大学文学部哲学専攻岡田光弘研究室内 ----------------------------------------

1 0

3rd CFP +++ extended deadline +++ IWC 2017 (with FSCD in Oxford)
by Fujita Kenetsu 02 Jul '17

02 Jul '17

皆様，群馬大学の藤田と申します． 9月の IWC 2017(Oxford)の締切が7/5まで延長されましたのでご案内をさせていただきます．どうぞ宜しくお願い致します． ----- (* Apologies for any cross-postings. *) ===================================================================== Call for Papers IWC 2017 6th International Workshop on Confluence September 8th, 2017, Oxford, United Kingdom Collocated with FSCD 2017 http://cl-informatik.uibk.ac.at/events/iwc-2017/ ===================================================================== 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 2017 is collocated with FSCD 2017. Previous editions of the workshop were held in Nagoya (2012), Eindhoven (2013), Vienna (2014), Berlin (2015), and Obergurgl (2016). During the workshop, the 6th Confluence Competition (CoCo 2017) takes place. IMPORTANT DATES: * submission Wednesday, July 5th, 2017 (extended) * notification Saturday, July 22nd, 2017 * final version Saturday, August 5th, 2017 * workshop Friday, September 8th, 2017 (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: * Stefan Kahrs (University of Kent) * Patrick Bahr (IT University of Copenhagen) PROGRAM COMMITTEE: * Beniamino Accattoli (INRIA) * Jörg Endrullis (Vrije Universiteit Amsterdam) * Bertram Felgenhauer (University of Innsbruck) * Ken-Etsu Fujita (Gumma University) * Philippe Malbos (Université Claude Bernard Lyon 1) * 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=iwc2017 EasyChair style: http://easychair.org/publications/for_authors -----

1 0

第52回MLG数理論理学研究集会のご案内
by Suzuki, Nobu-Yuki 30 Jun '17

30 Jun '17

皆さま静岡大学の鈴木信行と申します。今年度の　MLG 数理論理学研究集会　の世話人（代表）をいたします。今年度、第52回MLG 数理論理学研究集会は、以下の要領で開催する予定です。・期間: 2017年12月1日(金)午後 -- 12月3日(日)午前・場所: 静岡大学　静岡キャンパス　〒422-8529　静岡県静岡市駿河区大谷836 　 (JR静岡駅よりバスで約30分) ご予定にお加えいただけますよう、お願いいたします。ご案内も随時送信しますが、次のHPでも最新のご案内を申し上げまので、ご覧ください。（現時点では、まだあまり情報はありません） https://wwp.shizuoka.ac.jp/logic-suzuki-mlg/ よろしくお願い致します。

1 0

First CFP: Eleventh International Workshop on Juris-informatics (JURISIN 2017)
by Ken Satoh 28 Jun '17

28 Jun '17

First CFP: Eleventh International Workshop on Juris-informatics (JURISIN 2017) (associated with JSAI International Symposia on AI 2017 (IsAI-2017)) homepage: http://research.nii.ac.jp/~ksatoh/jurisin2017 ** Workshop dates November 13 - 15, 2017 ** Venue Tokyo Campus, University of Tsukuba, Tokyo, Japan http://www.tsukuba.ac.jp/en/access/tokyocampus-access ** Important Dates Submission Deadline: August 28, 2017 Notification: October 1, 2017 Camera-ready due: October 13, 2017 ** Aims and Scope 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 Any theories and technologies which is not directly related with juris-informatics but has a potential to contribute to this domain ** Invited Speakers Kevin D. Ashley (University of Pittsburgh) Katsumi Nitta (Tokyo Institute of Technology) ** Submissions We welcome and encourage the submission of high quality, original papers, which are not simultaneously submitted for publication elsewhere Papers should be written in English, formatted according to the Springer Verlag LNCS style in a pdf form, which can be obtained from http://www.springeronline.com and not exceed 14 pages including figures, references, etc. If you use a word file, please follow the instruction of the format, and then convert it into a pdf form and submit it at the paper submission page. If a paper is accepted, at least one author of the paper must register the workshop and present it. We strongly encourage an online registration. You can submit your paper at "https://easychair.org/conferences/?conf=jurisin2017". If you cannot submit a paper by EasyChair System by some trouble, please send email to "ksatoh[at]nii.ac.jp" ** Post Proceedings Selected papers will be published as a post-proceedings via Springer Verlag LNAI series after the second round of review after the workshop. ** Workshop Chair Ken Satoh, National Institute of Informatics and Sokendai, Japan ** Steering Committee Members Takehiko Kasahara, Toin Yokohama University Makoto Nakamura, Nagoya University, 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 Trevor Bench-Capon, The University of Liverpool, UK Tomas Gordon, Fraunfoher FOKUS, Germany Henry Prakken, University of Utrecht & Groningen, The Netherlands John Zeleznikow, Victoria University, Australia Robert Kowalski, Imperial College London, UK Kevin Ashley, University of Pittsburgh, USA ** Program Committee Members Thomas Agotnes, University of Bergen, Norway Ryuta Arisaka, National Institute of Informatics, Japan Kristijonas Cyras Imperial College London Marina De Vos, University of Bath, UK Tatsuhiko Inatani, Kyoto University, Japan Phan Minh Dung, AIT, Thailand Guido Governatori, Data61, Australia Tokuyasu Kakuta, Nagoya University, Japan Yoshinobu Kano, Shizuoka University, Japan Nguyen Le Minh, JAIST, Japan Beishui Liao, Zhejiang University, China Hatsuru Morita, Tohoku University, Japan Makoto Nakamura, Nagoya University, 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 Ginevra Peruginelli, ITTIG-CNR, Italy Katsuhiko Sano, Hokkaido University, Japan Giovanni Sartor, EUI/CIRSFID, Italy Seiichiro Sakurai, Meiji Gakuin University, Japan Ken Satoh, National Institute of Informatics and Sokendai, Japan Akira Shimazu, JAIST, Japan Fumio Shinpo, Keio 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 Harumichi Yuasa, Institute of Information Security, Japan Yueh-Hsuan Weng, Tohoku University, Japan For any inquiry concerning the workshop, please send it to "ksatoh[at]nii.ac.jp"

1 0

Workshop in Logic and Philosophy of Mathematics
by Makoto Fujiwara 28 Jun '17

28 Jun '17

皆様早稲田大学の藤原誠です。標記ワークショップのご案内をさせていただきます。 ------------------------------------------------------------------- We apologize if you receive this message more than once. --------------------------------------------------------------------- We announce the following “Workshop in Logic and Philosophy of Mathematics” 次のようなワークショップ「Workshop in Logic and Philosophy of Mathematics」を予定しております。参加自由です。 The exact list of speakers and places will be announced later. The first day is at Mita campus of Keio University and the second day is at Waseda campus of Waseda University. スピーカーや開催場所の詳細につきましては後ほど改めてご連絡させていただきます。（7月14日は慶應義塾大学三田キャンパス，7月15日は早稲田大学早稲田キャンパスでの開催になります） ---- Workshop in Logic and Philosophy of Mathematics Date: July 14 (Fri) and 15 (Sat), 2017 日時: 2017年7月14日(金), 7月15日(土) Place: Mita campus of Keio University (14th) and Waseda campus of Waseda University (15th). 場所: 慶應義塾大学三田キャンパス（14日），早稲田大学早稲田キャンパス（15日） ---- Program: 1. July 14 (Friday, Mita campus of Keio University): Time: 13:00-18:00 Speakers: Andy Arana (Université Paris 1 Panthéon-Sorbonne, IHPST), Kengo Okamoto (Tokyo Metropolitan University), Ryota Akiyoshi (Waseda University), Makoto Fujiwara (Waseda University) 2. July 15 (Saturday, Waseda campus of Waseda University ) Time: 13:00-18:00 Speakers: Ryoma Shinya (The University of Tokyo), Taishi Kurahashi (National Institute of Technology, Kisarazu College), Naosuke Matsuda (Kanagawa University), Masahiko Sato (Kyoto University) --------------------------------------------------------------------- Organizers: Ryota Akiyoshi (Waseda Institute for Advanced Study, Waseda University) Makoto Fujiwara (Waseda Institute for Advanced Study, Waseda University) Mitsuhiro Okada (Global Research Center for Logic and Sensibility, Keio University) Co-host: Waseda Institute for Advanced Study (Waseda University), Global Research Center for Logic and Sensibility (Keio University) Contact: Ryota Akiyoshi georg.logic(a)gmail.com

1 0

CALL FOR PAPERS: Logic and Engineering of Natural Language Semantics 14 (LENLS 14)
by Katsuhiko Sano 27 Jun '17

27 Jun '17

[Apologies for multiple copies] ================================================================= CALL FOR PAPERS Logic and Engineering of Natural Language Semantics 14 (LENLS 14) Workshop Site : Bunkyo School Building in University of Tsukuba, Tokyo Campus Bunkyo-ku, Tokyo, Japan http://www.tsukuba.ac.jp/en/access/tokyocampus-access Dates : November 13-15, 2017 Contact Person: Katsuhiko Sano (Hokkaido University) Contact Email : lenls14[[at]]easychair.org Website : http://www.is.ocha.ac.jp/~bekki/lenls/ ================================================================= Chair: Katsuhiko Sano (Hokkaido University) Co-chair: Eric McCready (Aoyama Gakuin University) Daisuke Bekki (Ochanomizu University/JST CREST) Koji Mineshima (Ochanomizu University/JST CREST) Invited Speakers: - Craige Roberts (The Ohio State University) - Ivano Ciardelli (University of Amsterdam) - Shoichi Takahashi (Aoyama Gakuin University) LENLS is an annual international workshop on formal syntax, semantics and pragmatics. It will be held as one of the workshops of the JSAI International Symposia on AI (isAI2017) (https://www.ai-gakkai.or.jp/isai/) sponsored by the Japan Society for Artificial Intelligence (JSAI). Aims and Topics: ================ We invite submissions to this year's workshop on topics in formal syntax, semantics and pragmatics, and related fields, including but in no way limited to the following: - Formal syntax, semantics and pragmatics of natural language - Model-theoretic and/or proof-theoretic semantics of natural language - Computational Semantics - Game-theoretic/Bayesian approaches to pragmatics - Nonclassical Logic and its relation to natural language (especially Substructural/Fuzzy/Categorical/Topological logics) - Formal Philosophy of language - Scientific methodology and/or experimental design for linguistics Submissions: ============ Abstracts (anonymous, up to 4 pages, including figures and references, A4 size, with 12 point font) must be submitted electronically in PDF format at: https://easychair.org/conferences/?conf=lenls14 When the abstract is accepted, the author is expected to submit a full paper (10-14 pages) before the workshop. The online proceedings of the workshop will be available at the conference site. Important dates: ================ Abstract submission deadline: August 31, 2017 Notification of acceptance: September 30, 2017 Deadline for camera-ready copy: mid-October, 2017 LENLS14: November 13-15, 2017 Sponsor: ======== LENLS is being organized by an alliance of "Establishment of Knowledge-Intensive Structural Natural Language Processing and Construction of Knowledge Infrastructure" (http://nlp.ist.i.kyoto-u.ac.jp/CREST/?en) project, funded by JST CREST Programs "Advanced Core Technologies for Big Data Integration" (http://www.jst.go.jp/kisoken/crest/en/research_area/ongoing/areah25-6.html). Workshop Organizers/Program Committee: ====================================== - Katsuhiko Sano (Hokkaido University) - Eric McCready (Aoyama Gakuin University) - Daisuke Bekki (Ochanomizu University/JST CREST) - Koji Mineshima (Ochanomizu University/JST CREST) - Alastair Butler (National Institute for Japanese Language and Linguistics) - Richard Dietz (iCLA, Yamanashi Gakuin University) - Naoya Fujikawa (Tokyo Metropolitan University) - Yoshiki Mori (University of Tokyo) - Yasuo Nakayama (Osaka University) - David Y. Oshima (Nagoya University) - Osamu Sawada (Mie University) - Wataru Uegaki (Leiden University) - Katsuhiko Yabushita (Naruto University of Education) - Tomoyuki Yamada (Hokkaido University) - Shunsuke Yatabe (Kyoto University) - Kei Yoshimoto (Tohoku University)

1 0

Talk by Georgios Fainekos on June 30
by urabenatsuki＠is.s.u-tokyo.ac.jp 26 Jun '17

26 Jun '17

Dear all (apologies for multiple copies), Let me advertise a talk by Georgios Fainekos on 30th June, 15: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 ---------- https://docs.google.com/document/d/1Qrg4c8XDkbO3tmns6tQwxn5l GHOrBON5LtHXXTpXDeA/edit?usp=sharing Fri 30 June 2017, 15:00–17:00 NII meeting room 2010 https://www.nii.ac.jp/en/about/access/ Georgios Fainekos <http://www.public.asu.edu/%7Egfaineko/> (Arizona State University), Beyond Requirements Falsification : Semi-formal methods and tools for the analysis of Cyber-Physical Systems Correct-by-design synthesis methods for Cyber-Physical Systems (CPS) are still in their infancy for CPS with complex physical dynamics. For that reason, a combination of design theories for simpler systems and/or ad-hoc design approaches are utilized. Hence, numerous design and implementation errors are discovered while CPS are operational in the field. Such errors can have catastrophic effects to human life and to the economy. Over the last few years, requirements guided falsification methods have proven to be a practical approach to the verification problem of industrial size CPS. However, requirements falsification is just one component of the necessary tools for the development of safe and reliable CPS. In this talk, we provide an overview of our research in providing support for all the stages of the development for CPS, from formal requirements elicitation and mining to system conformance to on-line monitoring. Most of our methods have been implemented in a Matlab (TM) toolbox called S-TaLiRo (System's TemporAl LogIc Robustness). Finally, in this talk, we demonstrate that S-TaLiRo can provide answers to challenge problems from the automotive industry. 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/UCRC 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 and an M.Sc. degree in Computer and Information Science from the University of Pennsylvania. Before joining ASU, he held a Postdoctoral Researcher position at NEC Laboratories America in the System Analysis & Verification Group. He is currently working on Cyber-Physical Systems (CPS) and robotics. In particular, his expertise is on formal methods, logic, control theory, artificial intelligence, and optimization. His research has applications to automotive systems, medical devices, autonomous (ground and aerial) robots and human-robot interaction (HRI). In 2013, Dr. Fainekos received the NSF CAREER award. He was also recipient of the SCIDSE Best Researcher Junior Faculty award for 2013 and of the 2008 Frank Anger Memorial ACM SIGBED/SIGSOFT Student Award. Two of his conference papers have been nominated for student best paper awards. In 2016, Dr. Fainekos was the program co-Chair for the ACM International Conference on Hybrid Systems: Computation and Control.

1 0

国際会議 : 2nd CFP IWC 2017 (with FSCD in Oxford )
by Fujita Kenetsu 20 Jun '17

20 Jun '17

皆様，群馬大学の藤田と申します． 9月の IWC 2017 のご案内をさせていただきます．どうぞよろしくお願いいたします． ----- (* Apologies for any cross-postings. *) ===================================================================== Call for Papers IWC 2017 6th International Workshop on Confluence September 8th, 2017, Oxford, United Kingdom Collocated with FSCD 2017 http://cl-informatik.uibk.ac.at/events/iwc-2017/ ===================================================================== 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 2017 is collocated with FSCD 2017. Previous editions of the workshop were held in Nagoya (2012), Eindhoven (2013), Vienna (2014), Berlin (2015), and Obergurgl (2016). During the workshop, the 6th Confluence Competition (CoCo 2017) takes place. IMPORTANT DATES: * submission Saturday, July 1st, 2017 * notification Saturday, July 22nd, 2017 * final version Saturday, August 5th, 2017 * workshop Friday, September 8th, 2017 (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: * Stefan Kahrs (University of Kent) * tba PROGRAM COMMITTEE: * Beniamino Accattoli (INRIA) * Jörg Endrullis (Vrije Universiteit Amsterdam) * Bertram Felgenhauer (University of Innsbruck) * Ken-Etsu Fujita (Gumma University) * Philippe Malbos (Université Claude Bernard Lyon 1) * 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=iwc2017 EasyChair style: http://easychair.org/publications/for_authors -----

1 0

[LORI-VI] 1st Call for Participation
by Katsuhiko Sano 20 Jun '17

20 Jun '17

[Please circulate. Apologies for multiple copies] The Sixth International Conference on Logic, Rationality and Interaction September 11-14, 2017, Hokkaido University, Sapporo, Japan http://golori.org/lori2017/ [About LORI] The International Conference on Logic, Rationality and Interaction (LORI) conference series aims at bringing together researchers working on a wide variety of logic-related topics that concern the understanding of rationality and interaction. The series aims at fostering a view of Logic as an interdisciplinary endeavour, and supports the creation of an East-Asian community of interdisciplinary researchers. [Invited Speakers] Mike Dunn: Indiana University, U.S.A. Alan Hajek: Australian National University, Australia Nina Gierasimczuk: Technical University of Denmark, Denmark Natasha Alechina: University of Nottingham, UK Sara Negri: University of Helsinki, Finland Hiroakira Ono: JAIST, Japan [PC Chairs] Alexandru Baltag: University of Amsterdam, The Netherlands Jeremy Seligman: University of Auckland, New Zealand [Conference Organiser] Tomoyuki Yamada: Hokkaido University, Japan [News] ****** ASL Sponsorship ****** Student ASL members may apply for (limited) ASL travel funds that ASL is making available for sponsored meetings. For more on this, see http://www.aslonline.org/studenttravelawards.html . The deadline for student travel grant applications and recommendations for LORI VI is kindly extended to June 30th, 2017. [Website] For detailed conference information and registration, please visit http://golori.org/lori2017/ . [Sponsors] LORI Tsinghua University - University of Amsterdam Joint Research Centre for Logic Graduate School of Letters, Hokkaido University Association for Symbolic Logic [Contacts] Programme: The PC Chairs <lori6(a)easychair.org> Conference: Tomoyuki Yamada <tomoyuki.s.yamada(a)gmail.com>

1 0

教員公募（東北大学電気通信研究所教授）
by Atsushi Ohori 17 Jun '17

17 Jun '17

sonoteno皆様，PPLの皆様，logic-mlの皆様，メーリングリストをお借りして、教員公募の案内をお送りいたします．教授１名（理論計算機科学等を含む基礎研究分野），応募締切 6月30日です．(重複して受信された場合はご容赦ください) 東北大学大堀淳 ------------------------------------------------------------------------- 教員公募情報東北大学大電気通信研究所では、教授職の教員を下記により公募いたします。募集人員：教授１名所　　属：　システム・ソフトウェア研究部門コンピューティング情報理論研究分野専門分野：　　本分野では、情報の意味や計算の構造に関する基礎研究の飛躍的発展とその応用的展開を通じて、複雑で多様な情報のより高速、より安全、より効率的な処理の実現を目指します。　この実現のため、計算理論分野の基礎研究を対象とし、プログラム検証や自動証明、高度コミュニケーションシステム、人工知能などへの応用に資する計算理論への展開なども視野にいれた研究と教育を行います。着任時期：平成30年4月以降のなるべく早い時期応募資格：博士の学位を持つ者応募期限：平成29年6月30日（消印有効）なお、提出書類や書類送付先などの詳細につきましては以下をご覧ください。 http://www.riec.tohoku.ac.jp/ja/information/proposals/2017/04/post-14412/ -------------------------------------------------------------------------

1 1

24th WoLLIC 2017 - Call for Participation
by 小野寛晰 14 Jun '17

14 Jun '17

[Please circulate. Apologies for multiple copies] Call for Participation WoLLIC 2017 24th Workshop on Logic, Language, Information and Computation July 18-21, 2017 University College London (UCL), London, UK SPECIAL SESSION: Screening of Navajo Math Circles <http://www.zalafilms.com/navajo/about.html> (Directed by George Paul Csicsery, 2016, 58min) SCIENTIFIC SPONSORSHIP Interest Group in Pure and Applied Logics (IGPL) The Association for Logic, Language and Information (FoLLI) Association for Symbolic Logic (ASL) European Association for Theoretical Computer Science (EATCS) European Association for Computer Science Logic (EACSL) Sociedade Brasileira de Computação (SBC) Sociedade Brasileira de Lógica (SBL) IN COOPERATION WITH ACM Special Interest Group on Logic and Computation (ACM-SIGLOG) ORGANISATION Department of Computer Science, University College London, London, UK School of Electronic Engineering and Computer Science, Queen Mary College, London, UK Centro de Informática, Universidade Federal de Pernambuco, Brazil HOSTED BY Department of Computer Science, University College London, London, UK INVITED SPEAKERS Hazel Brickhill (Bristol) (University of Bristol) Michael Detlefsen (University of Notre Dame) Alexander Kurz (University of Leicester) Frederike Moltmann (New York University) David Pym (University College London) Nicole Schweikardt (Humboldt Universität) Fan Yang (Delft University) Boris Zilber (University of Oxford) STUDENT GRANTS ASL sponsorship of WoLLIC 2017 will permit ASL student members to apply for a modest travel grant (deadline: May 1st, 2017). See http://www.aslonline.org/studenttravelawards.html <http://www.aslonline.org/studenttravelawards.html> for details. PROGRAMME COMMITTEE Matthias Baaz <http://www.logic.tuwien.ac.at/staff/baaz/home.html> (University of Technology, Vienna, Austria) John Baldwin <http://homepages.math.uic.edu/~jbaldwin/> (University of Illinois at Chicago, USA) Dana Bartozová <http://www.math.toronto.edu/bartosov/> (Universidade de São Paulo, Brazil) Agata Ciabattoni <https://www.logic.at/staff/agata/> (University of Technology, Vienna, Austria) Walter Dean <http://www2.warwick.ac.uk/fac/soc/philosophy/people/dean/> (University of Warwick, UK) Erich Grädel <https://logic.rwth-aachen.de/~graedel/> (RWTH Aachen, Germany) Volker Halbach <http://users.ox.ac.uk/~sfop0114/> (University of Oxford, UK) Juliette Kennedy <http://www.math.helsinki.fi/logic/people/juliette.kennedy/> (Helsinki University, Finland) (Chair) Dexter Kozen <http://www.cs.cornell.edu/~kozen/> (Cornell University, USA) Janos Makowsky <http://www.cs.technion.ac.il/~janos/> (Technion - Israel Institute of Technology, Israel) Larry Moss <http://www.indiana.edu/~iulg/moss/> (indiana University, USA) Alessandra Palmigiano <http://www.appliedlogictudelft.nl/alessandra-palmigiano/> (Delft University, The Netherlands) Mehrnoosh Sadrzadeh <http://www.eecs.qmul.ac.uk/people/view/33472/dr-mehrnoosh-sadrzadeh> (Queen Mary, UK) Sonja Smets <http://sonja.tiddlyspot.com/#HOME> (Amsterdam University, The Netherlands) Asger Törnquist <http://www.math.ku.dk/~asgert/> (Københavns Universitet, Denmark) Rineke Verbrugge <http://www.rinekeverbrugge.nl/> (University of Groningen, The Netherlands) Andrés Villaveces <https://avillavecesn.net/> (Universidad Nacional, Colombia) Philip Welch <http://www.maths.bris.ac.uk/~mapdw/> (University of Bristol, UK) STEERING COMMITTEE Samson Abramsky, Johan van Benthem, Anuj Dawar, Joe Halpern, Wilfrid Hodges, Ulrich Kohlenbach, Daniel Leivant, Leonid Libkin, Angus Macintyre, Luke Ong, Hiroakira Ono, Valeria de Paiva, Ruy de Queiroz, Jouko Väänänen. ORGANISING COMMITTEE Alexandra Silva <http://www.alexandrasilva.org/#/main.html> (Univ College London, UK) (Local co-chair) Mehrnoosh Sadrzadeh <http://www.eecs.qmul.ac.uk/people/view/33472/dr-mehrnoosh-sadrzadeh> (Queen Mary, UK) (Local co-chair) Paulo Oliva <http://www.eecs.qmul.ac.uk/~pbo/> (Queen Mary, UK) James Brotherston <http://www0.cs.ucl.ac.uk/staff/J.Brotherston/> (Univ College London, UK) Anjolina G. de Oliveira <http://www.cin.ufpe.br/~ago> (U Fed Pernambuco) Ruy de Queiroz <http://www.cin.ufpe.br/~ruy> (U Fed Pernambuco) (co-chair) FURTHER INFORMATION Contact one of the Co-Chairs of the Organising Committee. WEB PAGE http://wollic.org/wollic2017/ <http://wollic.org/wollic2017/> ACCEPTED PAPERS Fausto Barbero, Lauri Hella and Raine Rönnholm. Independence-Friendly logic without Henkin quantification. Fedor Pakhomov. Solovay completeness without fixed points. Paola Bruscoli and Lutz Strassburger. On the length of Medial-Switch-Mix derivations. Almudena Colacito and George Metcalfe. Proof Theory and Ordered Groups. Rohit Parikh. An Epistemic Generalization of Rationalizability. Lev Beklemishev. On the reflection calculus with partial conservativity operators. Arnold Beckmann and Jean Jose Razafindrakoto. Total Search Problems in Bounded Arithmetic and Improved Witnessing. Flavio Ferrarotti, Senén González and Jose Turull-Torres. On Fragments of Higher Order Logics that on Finite Structures Collapse to Second Order. Michał Tomasz Godziszewski and Joel David Hamkins. Computable quotient presentations of models of arithmetic and set theory. Nathanael L. Ackerman and Cameron E. Freer. On the Computability of Graph Turing Machines. Ian Mackie. A Geometry of Interaction Machine for Gödel's System T. Zhaohui Luo and Serguei Soloviev. Dependent Event Types. Igor Sedlar. Substructural logics with a reflexive transitive closure modality. Stepan Kuznetsov. The Lambek calculus with iteration: two variants. Willem Conradie, Andrew Craig, Alessandra Palmigiano and Zhiguang Zhao. Constructive canonicity for lattice-based fixed point logics. Karin Cvetko Vah, Mehrnoosh Sadrzadeh, Dimitri Kartsaklis and Benjamin Blundell. Non-commutative logic for compositional distributional semantics. Daniyar Shamkanov. Global Neighbourhood Completeness of the Gödel-Löb Provability Logic. Vít Punčochář. Knowledge is a Diamond. Gijs Wijnholds. Coherent Diagrammatic Reasoning in Compositional Distributional Semantics. Zhiguang Zhao. Algorithmic Sahlqvist Preservation for Modal Compact Hausdorff Spaces. Marcin Mostowski and Marek Czarnecki. Concrete mathematics. Finitistic approach to foundations. Denis I. Saveliev and Nikolai L. Poliakov. On two concepts of ultrafilter extensions of first-order models and their generalizations. Yury Savateev and Daniyar Shamkanov. Cut-elimination for the modal Grzegorczyk logic via non-well-founded proofs. Sérgio Marcelino and Carlos Caleiro. Disjoint fibring of non-deterministic matrices. Fei Liang, Giuseppe Greco, Andrew Moshier and Alessandra Palmigiano. Multi-type display caculus for Semi De Morgan Logic. Dan Marsden, Fabrizio Genovese, Bob Coecke and Martha Lewis. Applications of Generalized Relations in Linguistics and Cognition. Bjørn Kjos-Hanssen. Shift registers fool finite automata. Giuseppe Greco and Alessandra Palmigiano. Lattice logic properly displayed.

1 0

Kyoto Philosophical Logic Workshop IIのご案内
by Hitoshi Omori 13 Jun '17

13 Jun '17

Kyoto Philosophical Logic Workshop IIのご案内 (重複してお受け取りの際はご容赦ください。) 京都大学の大森仁です。直前の案内になってしまいましたが、以下の通りワークショップを開催いたします。概要などの詳細はウェブサイトをご覧下さい。 ------------------------------------- Kyoto Philosophical Logic Workshop II 【日時】2017年6月19日、20日【場所】京都大学文学部校舎地下大会議室【ウェブサイト】https://sites.google.com/site/hitoshiomori/home/workshops/kplw2017-2 【プログラム】 19日: 11:00--12:30 Eduardo Barrio "What is a Paraconsistent Logic?" 12:30--14:00 Lunch 14:00--15:00 Damian Szmuc "On all Weak Kleene generalizations of Classical Logic" 15:00--16:00 Takuro Onishi "Routley’s American plan revisited" 16:00--16:15 Coffee break 16:15--17:15 Yosuke Fukuda "On a computational interpretation of Rumfitt's bilateral natural deduction" 17:15--18:45 Shunsuke Yatabe "Deflationism, logical notion of truth and proof theoretic semantics" 19:00-- Dinner 20日: 11:00--12:30 Wen-fang Wang "Three-Valued Semantic Pluralism: A Defense of A Three-Valued Solution to the Sorites Paradox" 12:30--14:00 Lunch 14:00--15:00 Ryosuke Igarashi "Kant's Transcendental Logic and Antinomies of Pure Reason" 15:00--16:00 Ryo Ito "Classes, Fusions and Russell's original theory of types" 16:00--16:15 Coffee break 16:15--17:15 Timo Weiss "Logic, Probability, Belief" 17:15--18:45 Graham Priest "Logical Theory-Choice: the Case of Vacuous Counterfactuals" 19:00-- Dinner ------------------------------------- どうぞよろしくお願いいたします。大森仁

1 0

ERATO MMSD キックオフワークショップのご案内
by Shin-ya KATSUMATA 01 Jun '17

01 Jun '17

国立情報学研究所の勝股です。 ERATO蓮尾メタ数理システムデザインプロジェクトでは、プロジェクトの紹介と研究交流のためのキックオフワークショップを以下の要領で行います。お気軽にお越しください。名称 ERATO MMSD キックオフワークショップ日時 6月15日(木) 14:30開始 17:15終了場所東京都千代田区一ツ橋2-1-2 国立情報学研究所12階 1208-1210 参加をご希望の方は文末のフォームにご記入の上、s.katsumata+kickoff(a)gmail.com に6月8日午前中までにご連絡下さいますようお願い申し上げます。また、ワークショップ後に研究交流会を行います。こちらもお気軽にお越しください。名称 ERATO MMSD 研究交流会日時 6月15日(木) 18:00開始場所東京都千代田区一ツ橋1-1-1 パレスサイドビルディング3階 ERATO蓮尾プロジェクト (http://group-mmm.org/eratommsd/accessj.html 東エレベータをご利用下さい) 参加費一般 3000円程度学生割引あり ========== ワークショッププログラム(発表は英語です) ========== 14:30-14:35 Introduction 14:35-14:55 Kengo Kido Nonstandard Static Analysis (Metatheoretical Transfer via Logic) 15:00-15:20 Natsuki Urabe Coalgebraic Unfolding in Forward and Backward Simulations (Metatheoretical Transfer via Category Theory) 15:25-15:45 Shin-ya Katsumata Simulations and Fibrational Liftings (Categorical Foundation for System Approximation) 15:45-16:00 Break 16:00-16:05 Interlude 16:05-16:25 Takamasa Okudono Generating Polynomial Interpolant with Semidefinite Programming (Numerical Optimization and Formal Methods) 16:30-16:50 Masaki Waga Efficient Timed Pattern Matching by Automata-Based Skipping (Automata Theory in Light-Weight Formal Methods) 16:55-17:15 Fuyuki Ishikawa Insights into Verification of Complex Systems from Software Testing Research (Formal Methods and Intelligence) ========== s.katsumata+kickoff(a)gmail.com 宛ワークショップ参加連絡フォーム ========== ERATO MMSD キックオフワークショップにご出席します。お名前: 研究交流会の参加：するしない (該当しないものを消去して下さい) 研究交流会の参加区分：一般学生 (該当しないものを消去して下さい) ========== ERATOプロジェクトホームページ ========== http://www.jst.go.jp/erato/research_area/ongoing/16816853.html 国立情報学研究所勝股審也

1 0

名古屋ロジックセミナー (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

ALGIについての重要なお知らせ３件と第二十八回ALGIの開催について
by 西澤弘毅 25 May '17

25 May '17

logic-mlメーリングリストの皆様，神奈川大学の西澤弘毅と申します。 ALGI（代数，論理，幾何と情報科学研究集会）について重要なお知らせ３件と、第二十八回 ALGIの開催に関する告知をさせていただきます。 < 重複してお受け取りの節はご容赦願います。> 【重要なお知らせ３件】 1. 現在の algi メーリングリストのアドレスは algi(a)sakura.imi.kyushu-u.ac.jp ですが、googleグループを利用したメーリングリストへの移行を計画しています。近いうちに、現在ご登録いただいているメールアドレスに招待メールが届く予定ですので、ぜひ承認作業をお願いいたします。 2. ALGIのウェブサイトが新しくなりました。新しいURLはこちらです。 https://sites.google.com/site/algimeeting/home 一部のコンテンツは旧サイトへのリンクになっていますが、順次移行いたしますので、ブックマークには新サイトをご登録ください。 3. 昨年度まで長きにわたり幹事を務めていただきました鹿児島大学の古澤仁さんに代わりまして、今年から崇城大学の津曲紀宏さんに幹事をお願いすることにいたしました。西澤も引き続き幹事を務めさせていただきます。よろしくお願いいたします。【第二十八回 ALGIの開催について】 **************************************************************** * 第二十八回 ALGI（代数，論理，幾何と情報科学研究集会） * * * * 2017年8月28日（月）午後～8月29日（火） * * 鹿児島大学郡元キャンパス理学部 1号館 101講義室 * * * * 開催のお知らせと講演の募集 * **************************************************************** ALGI (Algebra, Logic, Geometry and Informatics) は、代数学や論理学、幾何学の情報科学への応用について、および情報科学の代数学や論理学、幾何学への応用についての研究集会で、年一回の頻度で開催されています。このたび、第二十八回ALGIを開催することになりました。会場の手配などは、昨年度まで幹事を務めていただきました鹿児島大学の古澤仁先生にお願いしています。開催場所は下記のとおりです。鹿児島大学郡元キャンパス理学部 1号館 101講義室 http://www.kagoshima-u.ac.jp/about/campusmap.html 講演を希望される方は、・題目・講演者名・e-mail address ・所属・梗概・希望時間・講演に必要な道具などの情報を nishizawa(a)kanagawa-u.ac.jp までお寄せください。「講演したいと思っている」程度の不完全情報でも結構です。時間の空きがある限り、開催直前まで講演申込を受け付けるつもりですが、申込順に発表時間を割り当てていきますので、講演をお考えの方は、なるべくお早めにお知らせいただけますようにお願い致します。初日は午後から開催いたします。夕方には懇親会を計画しています。 ALGIは申し込み不要で自由にご参加いただけます。ただし懇親会については事前に詳細を告知し参加申し込みを受け付けます。できるだけ多くの皆さんのご講演・ご参加をお待ちしております。西澤弘毅（神奈川大学）津曲紀宏（崇城大学） ----------------------------------------------------------- -- 西澤弘毅神奈川大学工学部情報システム創成学科〒221-8686 神奈川県横浜市神奈川区六角橋3-27-1 nishizawa(a)kanagawa-u.ac.jp TEL（代表）045-481-5661 （内線：3378）

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 20 May '17

20 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

Talk by Prof. Sebastian Maneth
by Keisuke Nakano 18 May '17

18 May '17

皆様， (複数のメーリングリストに送信しています．重複して受信された場合はご容赦願います) 電気通信大学の中野と申します．来る5月26日(金)，ブレーメン大学のSebastian Maneth先生がご講演を行います．木トランスデューサ理論とその応用についてお話ししていただきますので，お時間のある方は是非ご参加ください．日時： 2017年5月26日(金) 15:00-17:00 場所：電気通信大学西9号館3階AVホール http://www.uec.ac.jp/about/profile/access/pdf/map.pdf 　　　 (こちらの地図の68番の建物です．地図にはありませんが68番の南側に　　　　門が設置されましたので，そちらをご利用されると便利です) 講演者：Prof. Sebastian Maneth (University of Bremen) タイトル：View-Query Determinacy for Tree Transducers 概要： This talk consists of two parts each with a duration of approximately 40 minutes. The first part focuses on the view-query determinacy problem. Given transformations v and q, the problem asks whether there exists a function f such that f(v(s))=q(s) for all possible inputs s. View-query determinacy is a strong static analysis with many important applications; for instance, it was used by Buneman, Davidson and Frey for data citation [CACM 59 (2016)]. For tree transducers, Hashimoto, Sawada, Ishihara, Seki, and Fujiwara showed in 2013 that determinacy is decidable for views realized by extended linear bottom-up tree transducers, and queries realized by single-valued bottom-up tree transducers. Their solution tests functionality of the inverse of the view composed with the query. We extend this result using known results about transducers and properties of uniformizers. A uniformizer of a relation R is a function that has the same domain as R. A query q is determined by a view v if and only if the composition v ; u ; q is equivalent to q, where u is a uniformizer of the inverse of v. Thus, our technique reduces the determinacy problem to the existence of uniformizers and to the decidability of equivalence. Henceforth, recent new results on decidability of equivalence immediately give rise to new results about determinacy. These results about transducer determinacy only work for views given by linear (extended) transducers. It is easy to see that even if a view transducer copies once, at the input root node, then determinacy becomes undecidable. This is unfortunate, because some very basic translations cannot be realized by linear transducers but require copying. Consider for instance a view that regroups a list of publications into sublists of books, articles, etc. A tree transducer realizing this view needs copying (i.e., it needs to process the original list multiple times). The issue that we cannot deal with non-linear views lead us to study transducers with origin (Part 2 of the talk). Under origin semantics, transducers that produce their output in "different ways" are considered different, even if they realize the same tree translation. Under this more rigid semantics, determinacy can be decided even for non-linear views. In particular, origin determinacy is decidable if the view and query are either both given by deterministic top-down tree transducers with look-ahead, or, if they are both given by deterministic MSO definable transducers. Intuitively, the world becomes safer with origin, but more restrictive (e.g., the query “is book X before article Y in the original list?” becomes determined under origin semantics). -- 中野圭介 <ksk(a)cs.uec.ac.jp> 電気通信大学大学院情報理工学研究科 http://millsmess.cs.uec.ac.jp/~ksk/

1 0

SLACS2017講演募集のお知らせ
by 安部達也 17 May '17

17 May '17

皆様（複数のメイリングリストに送信しています。重複して受信の際はご容赦ください。） SLACS 2017（記号論理と情報科学）幹事の千葉工業大学の安部達也です。今年度の講演募集を以下のとおり行います。ご検討よろしくお願いいたします。 SLACS 2017（記号論理と情報科学） http://super.para.media.kyoto-u.ac.jp/~abet/slacs2017/ 日時 2017年8月8日（火）から2017年8月9日（水）場所千葉県習志野市津田沼2-17-1 千葉工業大学津田沼キャンパス6号館3階633室参加費無料。ただし、懇親会（初日夕方に開催予定）費は別途徴収します。幹事千葉工業大学人工知能・ソフトウェア技術研究センター安部達也連絡先 abet(a)stair.center SLACSとは以下はSLACSのページの冒頭からの抜粋です。 http://www.math.s.chiba-u.ac.jp/SLACS/ 「SLACS（スラックス）は，記号論理学と情報科学の境界領域に関する研究発表・研究討論の場を提供することを目的にして開催されている研究集会です． 1985年1月に第１回が開催されて以来，毎年１回のペースで開催されています． SLACS は，堅苦しい研究会ではなく，その年の幹事を中心とした参加者自らの手作りによるフレンドリーな雰囲気を持った集会です．気軽に発表できる場ですから，研究が進行中の話題を持ってきて議論したり，学生さんが発表する場としても適当です．もちろん，発展を続けるこの分野の最先端の研究テーマに関する発表も数多く聞くことができます．参加者の資格は問いませんので，原則として，どなたでも講演発表・聴講いただけます．発表はごく少数の例外を除いて日本語です．」より詳しい情報はSLACSのページや最近の開催情報をご確認ください。 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 を「SLACS2017講演申込」にしておいていただけるとありがたいです。講演申込期限は2017年7月31日としますが、講演する意思があるという方は早目にご連絡いただけると幸いです。 ----- 8< ----- 8< ----- 8< ----- 8< ----- 8< ----- 8< ----- 8< ----- 1. 氏名：（例）安部達也 2. 所属：（例）千葉工業大学人工知能・ソフトウェア技術研究センター 3. 区分：一般/学生 ← プログラム作成・懇親会費設定に利用する場合があります 4. 演題：（例）TBA 5. 懇親会：参加する/追って連絡する/参加できない 6. 要望等：（例）初日しか参加できませんので初日の枠に入れてください ----- 8< ----- 8< ----- 8< ----- 8< ----- 8< ----- 8< ----- 8< ----- 講演を伴わない聴講のみを希望される場合、事前連絡は不要です。当日、会場に直接お越しください。懇親会に参加を希望される方は、幹事に連絡をお願いいたします。その際、講演申込と同様のフォーマット（演題不要）での回答をお願いいたします。 Subject を「SLACS2017懇親会参加申込」にしておいていただけるとありがたいです。申込期限は2017年7月31日としますが、参加する意思があるという方は早目にご連絡いただけると幸いです。

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

訃報：竹内外史先生
by Makoto Kikuchi 12 May '17

12 May '17

皆様，昨日，竹内外史先生がお亡くなりになられたそうです．菊池誠

2 1

ランダムネス集中講義
by Toshio Suzuki 28 Apr '17

28 Apr '17

ランダムネス集中講義のご案内（重複して受け取られた折はご容赦ください）お世話になっております。首都大学東京の鈴木登志雄です。さて５月・６月に首都大で，明治大学の宮部先生にランダムネスの集中講義をしていただきます。公式にオープンセミナーとうたっているわけではありませんが，当専攻ではこの種の集中講義に数名程度まで学外の院生等が聴きに来ても黙認する慣習のようです。お近くに関心のありそうな方がいらっしゃいましたら、お知らせいただければ幸いです。 %%%%%%% ここから＊＊担当者宮部賢志先生（明治大学理工学部講師）　＊＊授業科目名情報数理科学２ (博士前期課程、Ｒ０７９）、情報数理科学特論２(博士後期課程、Ｒ０８０）タイトルランダムネス入門場所　首都大学東京（南大沢キャンパス）８号館６階６１０時期５月１８日（木），５月２５日（木），６月　８日（木），６月１５日（木）の１４：４０−１７：５０（途中休憩あり）当専攻での連絡係鈴木登志雄 toshio-suzuki[atmark]tmu.ac.jp 概要アルゴリズム的ランダムネスの理論では，科学の基本概念であるランダムについて，計算論を使って厳密な定義を与え，その性質を調べる。本講義では，計算論の再帰定理やTuring次数などの概念の復習から始める。その後，MLランダムネスの定義といくつかの性質を見る。特に，ランダムな列の構成技術に焦点を当てて解説する。 %%%%%%% ここまで首都大学東京南大沢キャンパスへの交通 http://www.tmu.ac.jp/university/campus_guide/access.html 同・構内図 http://www.tmu.ac.jp/university/campus_guide/map.html -- 鈴木登志雄首都大学東京理工学研究科数理情報科学専攻 toshio-suzuki(a)tmu.ac.jp

1 0

早稲田大学高等研究所セミナー「Logic and Game Theory」 (5/16)のご案内
by Makoto Fujiwara 28 Apr '17

28 Apr '17

皆様 (English follows) 以下の通り、5/16(火)に金子守先生(早稲田大学政治経済学術院、特任教授)に非専門家向けのご講演(英語)をしていただきます。事前申込みは不要ですので、どうぞふるってご参加ください。詳細は下記ホームページをご覧ください。 https://www.waseda.jp/inst/wias/news/2017/04/25/4250/ <https://www.waseda.jp/inst/wias/news/2017/04/25/4250/> 問い合わせ先：藤原誠(早稲田大学高等研究所) makoto_fujiwara(a)aoni.waseda.jp <mailto:makoto_fujiwara@aoni.waseda.jp> Dear all, It is our pleasure to announce WIAS Seminar "Logic and Game Theory" (May 16, 2017). The talk by Professor Mamoru Kaneko and the following discussion would be held in English. It is free for charge and the prior registration for your attendance is not needed. You are welcome to join us. Best regards, Coordinators ================================================================== WIAS Seminar "Logic and Game Theory" Date & Time: Tuesday, 16 May 2017, 11:00 - 12:15 Venue: Meeting room. 1 on the 5th floor, Building #9, Waseda University Speaker: Mamoru KANEKO（Professor, Waseda University） Title: Logic and Game Theory Abstract: In this presentation, I make conceptual connections between logic and game theory. First, I give a small introduction to each filed. Then, a Japanese comic story called “Konnyaku Mondo” is introduced to describe a basic problem on one’s understanding about the other person’s thought. The Konnyaku Mondo phenomena are often observed in our real lives. It is indicative of the distinction between a symbolic expression and its intended meaning; this is a very basic distinction in the modern logic. The story leads also to a new field in game theory called “Inductive Game Theory” that I and several collaborators have developed. Indeed, we construct a game theory example having the feature of the Konnyaku Mondo that two players are playing a game with mutual misunderstanding of the situation, but they cannot correct their mutual misunderstanding even after they have played the game several times. Coordinators: Makoto FUJIWARA （Assistant Professor, Waseda University） Ryota AKIYOSHI （Associate Professor, Waseda University） Kazuto OHTSUKI （Assistant Professor, Waseda University） For more information, please see the following page: https://www.waseda.jp/inst/wias/news-en/2017/04/25/4251/ <https://www.waseda.jp/inst/wias/news-en/2017/04/25/4251/> Contact: Makoto FUJIWARA E-mail: makoto_fujiwara(a)aoni.waseda.jp <mailto:makoto_fujiwara@aoni.waseda.jp> ================================================================== ============================================ 藤原誠 (Makoto Fujiwara) 早稲田大学高等研究所 (Waseda Institute for Advanced Study, Waseda University) E-mail: makoto_fujiwara(a)aoni.waseda.jp ============================================

1 0

Project colloquium talk by Sean Sedwards on 28 April
by Akira Yoshimizu 27 Apr '17

27 Apr '17

Dear colleagues, (apology for multiple copies) Let us advertise the next ERATO MMSD project colloquium talk by Sean Sedwards. Please find the title and abstract of the talk below. You are all cordially invited. Remote attendance is also welcome (Polycom is available in the room). Please let us know beforehand if you would like to join remotely. Sincerely, Akira Yoshimizu Technical Assistant at ERATO MMSD project ---------- https://docs.google.com/document/d/1Qrg4c8XDkbO3tmns6tQwxn5lGHOrBON5LtHXXTp… <https://docs.google.com/document/d/1Qrg4c8XDkbO3tmns6tQwxn5lGHOrBON5LtHXXTp…> Fri 28 April 2017, 15:15–17:00 NII meeting room 2010 https://www.nii.ac.jp/en/about/access/ <https://www.nii.ac.jp/en/about/access/> Sean Sedwards (ERATO MMSD), Rare Event Simulation for Statistical Model Checking Statistical model checking (SMC) avoids the intractable number of states associated with numerical model checking by estimating the probability of a property from a number of execution traces (simulations). Rare events nevertheless pose an important challenge to SMC because interesting properties, such as bugs and optima, are often very rare and occur infrequently in simulations. A key objective for SMC is thus to reduce the number and length of simulations necessary to produce an estimate with a given level of statistical confidence. In this talk I will describe two variance reduction approaches that address this problem: importance sampling and importance splitting. Importance sampling weights the probabilities of a system to make a rare property occur more frequently in simulations, then compensates the results by the weights. Importance splitting decomposes a rare property into the product of sub-properties that are less rare and easier to simulate. I will outline the challenges of using these techniques in SMC and highlight some practical solutions, including the recent successful application of importance sampling to stochastic timed automata.

1 0

JAIST Logic Seminar Series
by Takako Nemoto 25 Apr '17

25 Apr '17

皆様インスブリア大学（イタリア）の Marco Benini 先生の講演のお知らせです。どうぞふるってご参加ください。問い合わせ先：根元　多佳子北陸先端科学技術大学院大学　情報科学系 email: t-nemoto(a)jaist.ac.jp --------------------------------------------- *JAIST Logic Seminar Series* Date: Friday, 12 May, 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: Explaining the Kruskal's Tree Theorem Abstract: The famous Kruskal's tree theorem states that the collection of finite trees labelled over a well quasi order and ordered by homeomorphic embedding, forms a well quasi order. Its intended mathematical meaning is that the collection of finite, connected and acyclic graphs labelled over a well quasi order is a well quasi order when it is ordered by the graph minor relation. Oppositely, the standard proof(s) shows the property to hold for trees in the Computer Science's sense together with an ad-hoc, inductive notion of embedding. The mathematical result follows as a consequence in a somewhat unsatisfactory way. In this talk, a variant of the standard proof will be illustrated explaining how the Computer Science and the graph-theoretical statements are strictly coupled, thus explaining why the double statement is justified and necessary.

1 0

国際会議 IWC 2017 (with FSCD at Oxford)
by Fujita Kenetsu 19 Apr '17

19 Apr '17

(* Apologies for any cross-postings. *) ===================================================================== Call for Papers IWC 2017 6th International Workshop on Confluence September 8th, 2017, Oxford, United Kingdom Collocated with FSCD 2017 http://cl-informatik.uibk.ac.at/events/iwc-2017/ ===================================================================== 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 2017 is collocated with FSCD 2017. Previous editions of the workshop were held in Nagoya (2012), Eindhoven (2013), Vienna (2014), Berlin (2015), and Obergurgl (2016). During the workshop, the 6th Confluence Competition (CoCo 2017) takes place. IMPORTANT DATES: * submission Saturday, July 1st, 2017 * notification Saturday, July 22nd, 2017 * final version Saturday, August 5th, 2017 * workshop Friday, September 8th, 2017 (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: tba PROGRAM COMMITTEE: * Beniamino Accattoli (INRIA) * Jörg Endrullis (Vrije Universiteit Amsterdam) * Bertram Felgenhauer (University of Innsbruck) * Ken-Etsu Fujita (Gumma University) * Philippe Malbos (Université Claude Bernard Lyon 1) * 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=iwc2017 EasyChair style: http://easychair.org/publications/for_authors -------

1 0

JAIST Logic Seminar Series
by Hajime Ishihara 17 Apr '17

17 Apr '17

皆様バーミンガム大学のSteve Vickers先生の講演のお知らせです。どうぞふるってご参加ください。問合せ先：石原　哉北陸先端科学技術大学院大学情報科学系 e-mail: ishihara(a)jaist.ac.jp ----------------------------------------------- * JAIST Logic Seminar Series * * The seminar below is held as a part of JSPS Core-to-Core Program, A. Advanced Research Networks, EU FP7 Marie Curie Actions IRSES project CORCON. (http://www.jaist.ac.jp/logic/ja/core2core, https://corcon.net/), and EU Horizon 2020 Marie Skłodowska-Curie actions RISE project CID. Date: Monday 17, April, 2017, 15:20-17:00 Place: JAIST, Collaboration room 6 (I-57g) (Access: http://www.jaist.ac.jp/english/location/access.html) Speaker: Steve Vickers (University of Birmingham) Title: Arithmetic universes as generalized point-free spaces Abstract: Point-free topology in all its guises (e.g. locales, formal topology) can be understood as presenting a space as a _logical theory_, for which the points are the models and the opens are the formulae. The logic in question is geometric logic, its connectives being finite conjunctions and arbitrary disjunctions, and then the Lindenbaum algebra (formulae modulo equivalence) for a theory T is a frame O[T], a complete lattice with binary meet distributing over all joins. Locales are frames but with the morphisms reversed. Grothendieck proposed Grothendieck toposes as the generalized point-free spaces got when one moves to the first-order form of geometric logic. Then the opens (giving truth values for each point) are not enough, and one must move to sheaves (giving sets for each point). The Lindenbaum algebra now becomes a Grothendieck topos Set[T], the classifying topos for T, constructed using presheaves with a pasting condition, and closed under finite limits and arbitrary colimits in accordance with Giraud's theorem. The topos Set[T] canonically represents the generalized space of models of T. Grothendieck used the category Set of classical sets, but we now know that it can be replaced by any elementary topos S. This base will determine the infinities available for "arbitrary" disjunctions, as well as governing the construction of the classifier S[T]. However, for theories in which all the disjunctions are countable (such as the formal space of reals) it doesn't matter which S is used, as long as it has a natural numbers object (nno). Thus the generalized space of models of T is not absolutely fixed as a mathematical object. In my talk I shall present the idea of using Joyal's _arithmetic universes_ (AUs), pretoposes with parameterized list objects, as a base-independent substitute for Grothendieck toposes in which countable disjunctions are intrinsic to the logic rather than being supplied extrinsically by a base S. In [1] I have defined a 2-category Con whose objects ("contexts") serve as geometric theories that are sufficiently countable in nature, and whose morphisms are the maps of models. In [2] I showed how to use Con to prove results for Grothendieck toposes, fibred over choice of base topos. Thus we start to see AUs providing a free-standing foundations for a significant fragment of geometric logic and Grothendieck toposes, independent of base S. My two papers - [1] "Sketches for arithmetic universes" (arXiv:1608.01559) [2] "Arithmetic universes and classifying toposes" (arXiv:1701.04611)

2 1

Continuity, Computability, Constructivity 2017; second call for submission; extended deadline
by Hajime Ishihara 12 Apr '17

12 Apr '17

*Continuity, Computability, Constructivity – From Logic to Algorithms* * (CCC 2017)* * Loria, 26-30 June 2017* *Call for papers* http://ccc2017.loria.fr/ CCC is a workshop series bringing together researchers from exact real number computation, computable analysis, effective descriptive set theory, constructive analysis, and related areas. 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 2009, Trier 2012, Gregynog 2013, Ljubljana 2014, and Kochel 2015. The conference series has always been linked with EU-funded international research projects, with COMPUTAL (Computable Analysis) in the years 2012-2015 and now with CID (Computing with Infinite Data), a research network between Europe, Chile, Japan, New Zealand, Russia, Singapore, South Africa, South Korea, and the USA. This conference is the first CID event, but is open to all researchers in the area. The workshop will take place in Nancy, France. *Scope: *The workshop specifically invites contributions in the areas of * Exact real number computation, * Correctness of algorithms on infinite data, * Computable analysis, * Complexity of real numbers, real-valued functions, etc. * Effective descriptive set theory * Scott's domain theory, * Constructive analysis, * Category-theoretic approaches to computation on infinite data, * Weihrauch degrees, * And related areas. *Invited Speakers:* * Matthew de Brecht (Kyoto, Japan) * Bernhard Reus (Brighton, UK) * Matthias Schröder (Darmstadt, Germany) * Alex Simpson (Ljubljana, Slovenia) * * *Submission:* * * Extended abstracts (1-2 pages) of original work are welcome. * * ** *Extended Deadline:* *10 May 2017* ** *Upload your submission via EasyChair:* https://easychair.org/conferences/?conf=ccc20170 *Programme Committee:* * Ulrich Berger (Swansea) * Pieter Collins (Maastricht) * Mathieu Hoyrup (Nancy) (co-chair) * Erik Palmgren (Stockholm) * Victor Selivanov (Novosibirsk) * Dieter Spreen (Siegen) (co-chair) * Martin Ziegler (Daejeon). *Organizing Committee:* * Anne-Lise Charbonnier (Nancy) * Mathieu Hoyrup (Nancy)

2 1

FW: 松山 TGSAセミナーのお知らせ（４月１９日）
by FUJITA Hiroshi 11 Apr '17

11 Apr '17

こんにちは。愛媛大学の藤田です。次回のTGSAセミナーの案内を転送します。藤田博司 <fujita.hiroshi.mh(a)ehime-u.ac.jp> ________________________________ 差出人: Dmitri SHAKHMATOV <dmitri.shakhmatov(a)dmitri.math.sci.ehime-u.ac.jp> 送信日時: 2017年4月11日 10:55 宛先: FUJITA Hiroshi CC: dmitri.shakhmatov(a)dmitri.math.sci.ehime-u.ac.jp 件名: 松山 TGSAセミナーのお知らせ（４月１９日）皆様、「Matsuyama Seminar on Topology, Geometry, Set Theory and their Applications」（松山TGSAセミナー）のお知らせです。 ***** 第30回のセミナー日時: 2017年4月19日（水） 16:30〜17:30 場所: 愛媛大学理学部2号館2階，大演習室 (201号室) 講演者: Alejandro Dorantes-Aldama (愛媛大学) 題目: Selective sequential pseudcompactness 概要： We say that a topological space $X$ is {\em selectively sequentially pseudcompact} if for every family $\{U_n:n\in\mathbb{N}\}$ of non-empty open subsets of $X$, one can choose a point $x_n\in U_n$ for each $n\in\mathbb{N}$ in such a way that the sequence $\{x_n:n\in \mathbb{N}\}$ has a convergent subsequence. We show that the class of selectively sequentially pseudcompact spaces is closed under arbitrary products and continuous images, contains the class of all dyadic spaces and forms a proper subclass of the class of strongly pseudocompact spaces introduced recently by Garc\'ia-Ferreira and Ortiz-Castillo. We prove, under the Singular Cardinal Hypothesis SCH, that if $G$ is an Abelian group admitting a pseudocompact group topology, then it can also be equipped with a selectively sequentially pseudcompact group topology. Since selectively sequentially pseudcompact spaces are strongly pseudocompact, this provides a strong positive answer to a question of Garc\'ia-Ferreira and Tomita. This is a joint work with Dmitri Shakhmatov. 講演終了後に交流会を予定しています。交流会にご参加いただける方はシャクマトフ<dmitri.shakhmatov(a)ehime-u.ac.jp>までご一報お願い致します。以上、よろしくお願い申し上げます。世話人（五十音順）井上友喜尾國新一シャクマトフディミトリ野倉嗣紀平出耕一平田浩一藤田博司山内貴光 --- ウェブページ： http://www.math.sci.ehime-u.ac.jp/MTGSA.ja.html

1 0

論文募集：「プログラミングおよびプログラミング言語」特集
by Isao Sasano 11 Apr '17

11 Apr '17

皆様芝浦工業大学の篠埜です。論文誌「コンピュータソフトウェア」の特集「プログラミングおよびプログラミング言語」の論文募集のご案内です。 PPL2017の論文に限らず募集いたします。是非論文のご投稿をお願いいたします。 ----------------------------------------------------------------------- 論文募集：「プログラミングおよびプログラミング言語」特集 (論文投稿締切: 2017年6月16日(金) 17:00) http://www.jssst.or.jp/edit_news/detail/id=274 日本ソフトウェア科学会プログラミング論研究会は，毎年「プログラミングおよびプログラミング言語ワークショップ (PPL)」を開催しており，2017年3 月には第19回シンポジウム PPL2017 を開催しました．本「プログラミングおよびプログラミング言語」特集号は，PPL2017 に連動した企画であり，プログラミングに関する最先端の研究成果を掲載することを目的にしています．PPL2017 の発表論文を発展させた論文，PPL2017 での発表論文の中から推薦された論文（PPL2017 推薦論文），あるいはそれに限らず下記の対象分野に関連した論文を広く募集します．なお，PPL2017 との連携を強化するために，PPL2017 のプログラム共同委員長・篠埜功 (芝浦工業大学) 氏，番原睦則 (神戸大学) 氏を中心として特集号編集委員を構成しています．PPL2017 での発表論文を発展させた論文，および， PPL2017 推薦論文の査読にあたっては，PPL2017 の論文およびその査読結果を参考とさせていただきますので，迅速で一貫した査読が期待できます． <対象分野> プログラミングおよびプログラミング言語に関する研究成果 <募集論文> プログラミングおよびプログラミング言語に関する研究論文・解説論文・ソフトウェア論文 <執筆要領> 日本ソフトウェア科学会誌「コンピュータソフトウェア」の関連諸規定をご参照の上，投稿論文の PDF ファイルと「投稿メモ」を ppl2017si[at]org.kobe-u.ac.jp 宛てにお送りください．([at]を@に置換下さい) * PPL2017 で発表した論文を改訂して投稿する場合はその旨をお知らせください．学会誌関連諸規定は以下でご参照いただけます． http://www.jssst.or.jp/edit/kitei/ * レター論文による投稿を歓迎します． * レター論文は，査読者 1名による査読を行い，「照会後判定」は行わず，一度の査読で採否を判定します．刷り上がりで 6ページ以下の速報性を重視した論文です．レター論文を発展させたものは通常論文として投稿可能です． * 特集号に投稿された論文の査読基準は，一般投稿論文の査読基準と同じです． * 二重投稿にならないよう，十分ご注意下さい．（国際会議であっても，査読期間が重複する場合は二重投稿に該当します．） * 特集号への投稿に限り，日本ソフトウェア科学会の非会員による投稿も受け付けております．詳しくは上記より論文投稿規定をご覧ください． <スケジュール> 論文投稿締切り： 2017年6月16日(金) 17:00 特集号刊行予定： 2018年11月号査読プロセスの進行状況により掲載予定号に間に合わない場合があります．その場合でも特集論文として扱われます． <特集号編集委員> 青谷知幸 (東京工業大学)，馬谷誠二 (京都大学)，篠埜功 (芝浦工業大学)，番原睦則 (代表者，神戸大学) <企画母体> 日本ソフトウェア科学会プログラミング論研究会 <問合せ先> 篠埜功，番原睦則 (ppl2017si[at]org.kobe-u.ac.jp) ([at]は@で置き換えて下さい) ----------------------------------------------------------------------- 篠埜　功 -- Isao Sasano <sasano(a)sic.shibaura-it.ac.jp>

1 0

Talk by Marc Bagnol (13 Apr 11:00-)
by Tetsuya Sato 08 Apr '17

08 Apr '17

京都大学数理解析研究所の佐藤です。 4月13日11:00から、東京大学のMarc Bagnol氏に以下の講演をしていただくことになりましたので、ご連絡いたします。どうぞお気軽にお越しください。 ========== Time: 11:00-12:00, 13 Apr, 2017 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) http://www.kyoto-u.ac.jp/ja/access/campus/map6r_y.htm (34番の建物) Speaker: Marc Bagnol (JSPS Postdoctoral Fellow, University of Tokyo) Title: A Free Trace Construction and the Embedding Problem Abstract: The notion of traced category allows to model feedback situations in the language of category theory. Traces are ubiquitous in mathematics and serve as the basis for the categorical formulation of Girard's Geometry of Interaction. The notion was extended to partially-defined traces by Scott and Haghverdi, and a representation theorem was later shown: any partially traced category can be embedded in a fully traced one. A related problem we are currently investigating with some RIMS members is understanding when a monoidal category can be embedded into a traced one, or equivalently when it can be equipped with a partial trace. This "embedding problem" has already seen a few tentative solutions, conditions that are necessary but turned out not to be sufficient which I will present and discuss. I will also present a construction of a free trace for monoidal categories that both can be used to prove the representation theorem mentioned above (this was its original purpose) and gives an angle to look at the embedding problem.

1 0

Autumn school "Proof and Computation"
by Hajime Ishihara 07 Apr '17

07 Apr '17

Autumn school "Proof and Computation" Herrsching, Germany, 23rd to 26th September 2017 http://www.mathematik.uni-muenchen.de/~schwicht/pc17.php An international autumn school "Proof and Computation" will be held from 23rd to 26th September 2017 at Haus der bayerischen Landwirtschaft Herrsching in Herrsching near Munich. Its aim is to bring together young researchers in the field of Foundations of Mathematics, Computer Science and Philosophy. SCORE -------------------- - Predicative Foundations - Constructive Mathematics and Type Theory - Computation in Higher Types - Extraction of Programs from Proofs - Algorithmic Aspects in Financial Mathematics COURSES -------------------- - Mark Bickford on Constructive Analysis in NuPrl - Laura Crosilla on Foundations of Predicative Mathematics - Hajime Ishihara on Constructive Reverse Mathematics - Ulrich Kohlenbach on Proof Mining - Davide Rinaldi on Constructivising Transfinite Algebra - Andrei Rodin on Foundations of Axiomatic Mathematics - Gregor Svindland on Algorithmic Aspects in Financial Mathematics WORKING GROUPS -------------------- There will be an opportunity to form ad-hoc groups working on specific projects, but also to discuss in more general terms the vision of constructing correct programs from proofs. APPLICATIONS -------------------- Graduate or PhD students and young postdoctoral researches are invited to apply. Applications must be accompanied by a letter of recommendation, preferably from the thesis adviser, and should be sent to Chuangjie Xu (xu(a)math.lmu.de). DEADLINE for applications: **30th May 2017**. Applicants will be notified by 30th June 2017. FINANCIAL SUPPORT -------------------- The workshop is supported by the Udo Keller Stiftung (Hamburg), the CID (Computing with Infinite Data) programme of the European Commission and a JSPS core-to-core project. Successful applicants will be offered full-board accommodation for the days of the autumn school. There are no funds, however, to reimburse travel or further expenses, which successful applicants will have to cover otherwise. Klaus Mainzer Peter Schuster Helmut Schwichtenberg

1 0

Third Call for Papers ***** extended deadline ***** [LORI-VI] The Sixth International Conference on Logic, Rationality and Interaction
by Katsuhiko Sano 26 Mar '17

26 Mar '17

Third Call for Papers ***** extended deadline ***** [LORI-VI] The Sixth International Conference on Logic, Rationality and Interaction September 11-14, 2017, Hokkaido University, Sapporo, Japan http://golori.org/lori2017/ [About LORI] The International Conference on Logic, Rationality and Interaction (LORI) conference series aims at bringing together researchers working on a wide variety of logic-related topics that concern the understanding of rationality and interaction. The series aims at fostering a view of Logic as an interdisciplinary endeavour, and supports the creation of an East-Asian community of interdisciplinary researchers. [News] ****** Submission Deadline extended to Friday April 14 ****** [Call for Papers] We invite submission of contributed papers on any of the broad themes of LORI series; specific topics of interest include, but are not limited to, formal approaches to · agency · argumentation and agreement · belief representation · cooperation · belief revision and belief merging · strategic reasoning · games · decision making and planning · knowledge and action · epistemology · dynamics of informational attitudes · speech acts · knowledge representation · interaction · norms and normative systems · natural language · rationality · philosophy and philosophical logic · preference and utility · social choice · probability and uncertainty · social interaction · intentions, plans, and goals Submitted papers should be at most 12 pages long, with one additional page for references, in PDF format following the Springer LNCS style. Please submit your paper by Friday April 14, 2017, via EasyChair : http://easychair.org/conferences/?conf=lori6 . [Publication] Accepted papers will be collected as a volume in the FoLLI Series on Logic, Language and Information, and authors may be later invited to submit extended versions of their papers in a special issue of a prestigious journal. [Best Student Paper] The best student paper will be selected from the contributed student papers accepted for presentation at LORI VI, and be awarded the prize of 60,000 Japanese Yen (approximately 500 Euro). For more details, see http://golori.org/lori2017/award.html . [Website] For detailed conference information and registration, please visit http://golori.org/lori2017/ . [Invited Speakers] Mike Dunn: Indiana University, U.S.A. Alan Hájek: Australian National University, Australia Nina Gierasimczuk: Technical University of Denmark, Denmark Willemien Kets: Northwestern University, U.S.A Sara Negri: University of Helsinki, Finland Hiroakira Ono: JAIST, Japan [PC Chairs] Alexandru Baltag: University of Amsterdam, The Netherlands Jeremy Seligman: University of Auckland, New Zealand [Conference Organiser] Tomoyuki Yamada: Hokkaido University, Japan [Sponsors] LORI Tsinghua University - University of Amsterdam Joint Research Centre for Logic Hokkaido University [Contacts] Programme: The PC Chairs <lori6(a)easychair.org> Conference: Tomoyuki Yamada <tomoyuki.s.yamada(a)gmail.com>

1 0

Computability and Complexity in Analysis (CCA 2017): Final Call for Papers
by Daniel Graça 23 Mar '17

23 Mar '17

______________________________________________________________ Final Call for Papers Fourteenth International Conference on Computability and Complexity in Analysis (CCA 2017) http://cca-net.de/cca2017/ July 24-27, 2017, Daejeon, Republic of Korea (South Korea) Submission deadline: April 3, 2017 ______________________________________________________________ Topics * Computable analysis * Complexity on real numbers * Constructive analysis * Domain theory and analysis * Effective descriptive set theory * Theory of representations * Computable numbers, subsets and functions * Randomness and computable measure theory * Models of computability on real numbers * Realizability theory and analysis * Reverse analysis * Real number algorithms * Implementation of exact real number arithmetic Invited Speakers * Hee-Kap Ahn (Pohang, Republic of Korea) * Verónica Becher (Buenos Aires, Argentina) * Anders Hansen (Cambridge, UK) * Takayuki Kihara (Berkeley, USA) * Amaury Pouly (Max Planck Institute, Germany) * Linda Brown Westrick (Connecticut, USA) Funding Funding opportunities for student members of the Association for Symbolic Logic (ASL) are available. Applications should be directed to the Association for Symbolic Logic three months prior to the meeting, following the instructions here: http://www.aslonline.org/studenttravelawards.html Scientific Programme Committee * Johanna Franklin (Hempstead, USA) * Daniel Graça, chair (Faro, Portugal) * Vassilios Gregoriades (Turin, Italy) * Peter Hertling (Munich, Germany) * Gyesik Lee (Anseong, Republic of Korea) * Alexander Melnikov (Auckland, New Zealand) * Takako Nemoto (Ishikawa, Japan) * Arno Pauly (Brussells, Belgium) * Cristóbal Rojas (Santiago, Chile) * Frank Stephan (Singapore) * Klaus Weihrauch (Hagen, Germany) Organising Committee * Sunyoung Kim (Yonsei University, Republic of Korea) * Sewon Park (KAIST, Republic of Korea) * Martin Ziegler, chair (KAIST, Republic of Korea) Submissions Authors are invited to submit 1-2 pages abstracts in PDF format, including references via the following web page: https://easychair.org/conferences/?conf=cca2017 If full versions of papers are already available as technical report or arXiv version, then corresponding links should be added to the reference list. Final versions of abstracts might be distributed to participants in hardcopy and/or in electronic form. Dates * Submission deadline: April 3, 2017 * Notification of authors: May 1, 2017 * Final version: May 29, 2017 Conference Web Page http://cca-net.de/cca2017/ A co-located "Workshop on Real Verification" will take place on Friday, July 28, jointly organized by: * Gyesik Lee (Hankyong National University, Republic of Korea) * Martin Ziegler (KAIST, Republic of Korea) https://complexity.kaist.edu/CCA2017/workshop.html

1 0

RIMS共同研究（公開型）「証明論と証明活動」のご案内
by Katsumi Sasaki 16 Mar '17

16 Mar '17

みなさま　標記の共同研究として，以下の研究集会を開催します．　　　研究題目：証明論と証明活動　　　日程：2017年12月25日(月)〜27日(水) 　　　場所：京都大学数理解析研究所420号室　証明論・計算論・証明活動に関連する話題の講演を広く募集します．お忙しい時期かと思いますが，是非とも、講演・参加をご計画ください．　講演される学生の方には，旅費の援助があります．　詳細は， http://www.st.nanzan-u.ac.jp/info/sasaki/2017rims/rims2017.html で案内していく予定です．世話人：南山大学　佐々木克巳佐々木克巳 -- sasaki <sasaki(a)nanzan-u.ac.jp>

1 0

ITP 2017 - Final Call for Papers
by Nao Hirokawa 14 Mar '17

14 Mar '17

皆様 ITP 2017 の論文募集案内（最終）をお送り致します。ぜひ論文投稿をご検討下さい。廣川 (JAIST) ---------------------------------------------------------------------- FINAL CALL FOR PAPERS ITP 2017 8th International Conference on Interactive Theorem Proving Brasilia, Brazil September 26-29, 2017 http://itp2017.cic.unb.br SUBMISSION DEADLINES * April 3, 2017 (abstracts) * April 10, 2017 (full papers) GENERAL INFORMATION The ITP conference series is concerned with all topics related to interactive theorem proving, ranging from theoretical foundations to implementation aspects and applications in program verification, security, and formalization of mathematics. ITP is the evolution of the TPHOLs conference series to the broad field of interactive theorem proving. TPHOLs meetings took place every year from 1988 until 2009. The eighth ITP conference, ITP 2017, will be held at Universidade de Brasilia, September 26-29, 2017. SCOPE OF CONFERENCE ITP welcomes submissions describing original research on all aspects of interactive theorem proving and its applications. Suggested topics include but are not limited to the following: * formal aspects of hardware and software * formalizations of mathematics * improvements in theorem prover technology * user interfaces for interactive theorem provers * formalizations of computational models * verification of security algorithms * use of theorem provers in education * industrial applications of interactive theorem provers * concise and elegant worked examples of formalizations (proof pearls) PUBLICATION DETAILS The proceedings of the symposium will be published in the Springer's LNCS series. ** After the conference the authors of selected papers will be invited to submit revised papers for a special issue of the Journal of Automated Reasoning. ** PAPER SUBMISSIONS All submissions must be original, unpublished, and not submitted concurrently for publication elsewhere. Furthermore, when appropriate, submissions are expected to be accompanied by verifiable evidence of a suitable implementation, such as the source files of a formalization for the proof assistant used. Submissions should be no more than 16 pages in length and are to be submitted in PDF via EasyChair at the following address: https://easychair.org/conferences/?conf=itp2017 Submissions must conform to the LNCS style in LaTeX. Authors of accepted papers are expected to present their paper at the conference and will be required to a sign copyright release form. In addition to regular papers, described above, there will be a rough diamond section. Rough diamond submissions are limited to 6 pages and may consist of an extended abstract. They will be refereed and be expected to present innovative and promising ideas, possibly in an early form and without supporting evidence. Accepted diamonds will be published in the main proceedings and will be presented as short talks. IMPORTANT DATES Abstract submission deadline: April 3, 2017 Full paper submission deadline: April 10, 2017 Author notification: June 2, 2017 Camera-ready papers: June 30, 2017 Workshops & Tutorials: September 23-25, 2017 Conference: September 26-29, 2017 INVITED SPEAKERS Moa Johansson, Chalmers University of Technology, Sweden Leonardo de Moura, Microsoft Research Cezary Kaliszyk, Universitaet Innsbruck, Austria (joint with TABLEAUX and FroCos) Katalin Bimbo, University of Alberta, Canada (joint with TABLEAUX and FroCos) Jasmin Blanchette, Inria and LORIA, Nancy, France (joint with TABLEAUX and FroCos) WORKSHOPS AND TUTORIALS There will be a three-day programme of four workshops and four tutorials from 23-25 September. Workshops: 12th Logical and Semantic Frameworks with Applications (LSFA 2017) Sandra Alves, Renata Wassermann, Flavio L. C. de Moura 23 and 24 September 2017 Proof eXchange for Theorem Proving (PxTP) Catherine Dubois, Bruno Woltzenlogel Paleo 23 and 24 September 2017 EPS - Encyclopedia of Proof Systems Giselle Reis, Bruno Woltzenlogel Paleo 24 and 25 September 2017 DaLi - Dynamic Logic: new trends and applications Mario Benevides, Alexandre Madeira 24 September 2017 Tutorials: General methods in proof theory for modal and substructural logics Bjoern Lellmann, Revantha Ramanayake 23 September 2017 From proof systems to complexity bounds Anupam Das 24 September 2017 Proof Compressions and the conjecture NP =3D PSPACE Lew Gordeev, Edward Hermann Haeusler 25 September 2017 PVS for Computer Scientists Cesar Munoz, Mauricio Ayala-Rincon, Mariano Moscato 25 September 2017 Details will be published in separate calls and on the conference website. PROGRAM COMMITTEE CHAIRS Mauricio Ayala-Rincon, U. Brasilia Cesar Munoz, NASA PROGRAM COMMITTEE Maria Alpuente, T.U. Valencia Vander Alves, U. Brasilia June Andronick, Data61, CSIRO, UNSW Jeremy Avigad, Carnegie Mellon U. Sylvie Boldo, INRIA LRI Ana Bove, Chalmers & Gothenburg U. Adam Chlipala, MIT Gilles Dowek, INRIA, ENS Cachan Aaron Dutle, NASA Amy Felty, U. Ottawa Marcelo Frias, I.T. Buenos Aires Ruben Gamboa, U. Wyoming Herman Geuvers, Radboud U. Elsa Gunter, U. Illinois U.C. John Harrison, Intel Corporation Nao Hirokawa, JAIST Matt Kaufmann, U. Texas Austin Mark Lawford, McMaster U. Andreas Lochbihler, ETH Zurich Assia Mahboubi, INRIA Panagiotis Manolios, Northeastern U. Gopalan Nadathur, U. Minnesota Keiko Nakata, SAP Potsdam Adam Naumowicz, U. Bialystok Tobias Nipkow, T.U. Munich Scott Owens, U. Kent Sam Owre, SRI Lawrence Paulson, U. Cambridge Leila Ribeiro, U.F. Rio Grande do Sul Claudio Sacerdoti Coen, U. Bologna Augusto Sampaio, U.F. Pernambuco Monika Seisenberger, Swansea U. Christian Sternagel, U. Innsbruck Sofiene Tahar, Concordia U. Christian Urban, King's College London Josef Urban, Czech T.U. Prague CONTACT INFORMATION itp2017(a)easychair.org http://itp2017.cic.unb.br

1 0

[FINAL CALL FOR PAPERS] TABLEAUX 2017, University of Brasilia, Brazil, September 25-28, 2017
by Katsuhiko Sano 13 Mar '17

13 Mar '17

************************************************************************ FINAL CALL FOR PAPERS TABLEAUX 2017 26th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods University of Brasilia, Brazil September 25-28, 2017 Deadlines: 18 Apr 2017 (abstract), 25 Apr 2017 (paper) http://tableaux2017.cic.unb.br/ GENERAL INFORMATION TABLEAUX is the main international conference at which research on all aspects, theoretical foundations, implementation techniques, systems development and applications, of the mechanization of tableau-based reasoning and related methods is presented. As the first TABLEAUX workshop was held in Lautenbach in 1992, this year's conference will include special events celebrating 25 years of TABLEAUX. The conference will be held in Brasilia from 25-28 September 2017. It will be co-located with both the 11th International Symposium on Frontiers of Combining Systems (FroCoS 2017) and the 8th International Conference on Interactive Theorem Proving (ITP 2017). TOPICS Tableau methods offer a convenient and flexible set of tools for automated reasoning in classical logic, extensions of classical logic, and a large number of non-classical logics. For large groups of logics, tableau methods can be generated automatically. Areas of application include verification of software and computer systems, deductive databases, knowledge representation and its required inference engines, teaching, and system diagnosis. Topics of interest include but are not limited to: * tableau methods for classical and non-classical logics (including first-order, higher-order, modal, temporal, description, hybrid, intuitionistic, substructural, relevance, non-monotonic logics) and their proof-theoretic foundations; * related methods (SMT, model elimination, model checking, connection methods, resolution, BDDs, translation approaches); * sequent calculi and natural deduction calculi for classical and non-classical logics, as tools for proof search and proof representation; * flexible, easily extendable, light weight methods for theorem proving; * novel types of calculi for theorem proving and verification in classical and non-classical logics; * systems, tools, implementations, empirical evaluations and applications (provers, logical frameworks, model checkers, ...); * implementation techniques (data structures, efficient algorithms, performance measurement, extensibility, ...); * extensions of tableau procedures with conflict-driven learning, generation of proofs; compact (or humanly readable) representation of proofs; * decision procedures, theoretically optimal procedures; * applications of automated deduction to mathematics, software development, verification, deductive and temporal databases, knowledge representation, ontologies, fault diagnosis or teaching. We also welcome papers describing applications of tableau procedures to real world examples. Such papers should be tailored to the tableau community and should focus on the role of reasoning, and logical aspects of the solution. CELEBRATING 25 YEARS To celebrate 25 years TABLEAUX the conference will include a special session of invited talks by: Reiner Haehnle Technische Universitaet Darmstadt, Germany Wolfgang Bibel Technische Universitaet Darmstadt, Germany INVITED SPEAKERS: Carlos Areces FaMAF - Universidad Nacional de Cordoba, Argentina Katalin Bimbo University of Alberta, Canada (with FroCoS and ITP) Jasmin Blanchette Inria and LORIA, Nancy, France (with FroCoS and ITP) Cezary Kaliszyk Universitaet Innsbruck, Austria (with FroCoS and ITP) WORKSHOPS AND TUTORIALS There will be a three-day programme of four workshops and four tutorials from 23-25 September. Workshops: 12th Logical and Semantic Frameworks with Applications (LSFA 2017) Sandra Alves, Renata Wassermann, Flavio L. C. de Moura 23 and 24 September 2017 Proof eXchange for Theorem Proving (PxTP) Catherine Dubois, Bruno Woltzenlogel Paleo 23 and 24 September 2017 EPS - Encyclopedia of Proof Systems Giselle Reis, Bruno Woltzenlogel Paleo 24 and 25 September 2017 DaLi - Dynamic Logic: new trends and applications Mario Benevides, Alexandre Madeira 24 September 2017 Tutorials: General methods in proof theory for modal and substructural logics Bjoern Lellmann, Revantha Ramanayake 23 September 2017 From proof systems to complexity bounds Anupam Das 24 September 2017 Proof Compressions and the conjecture NP = PSPACE Lew Gordeev, Edward Hermann Haeusler 25 September 2017 PVS for Computer Scientists Cesar Munoz, Mauricio Ayala-Rincon, Mariano Moscato 25 September 2017 Details will be published in separate calls and on the conference website. POSTER SESSION There will be a joint poster session for TABLEAUX 2017, FroCos 2017, and ITP 2017. The session is intended for descriptions of work in progress, student projects and relevant research being published elsewhere. The deadline for posters submission is June 15, 2017. More details can be found at http://tableaux2017.cic.unb.br/#postersession. PUBLICATION DETAILS The conference proceedings will published in the Springer LNAI/LNCS series, as in previous editions. SUBMISSIONS Submissions are invited in two categories: A Research papers, which describe original theoretical research, original algorithms, or applications, with length up to 15 pages. B System descriptions, with length up to 9 pages. Submissions will be reviewed by the PC, possibly with the help of external reviewers, taking into account readability, relevance and originality. For category A, theoretical results and algorithms must be original, and not submitted for publication elsewhere. Submissions will be reviewed taking into account correctness, theoretical elegance, and possible implementability. For category B submissions, a working implementation must be accessible via the internet, which includes sources. The aim of a system description is to make the system available in such a way that users can use it, understand it, and build on it. Accepted papers in both categories will be published in the conference proceedings. Papers must be edited in LaTeX using the llncs style and must be submitted electronically as PDF files via the EasyChair system: https://easychair.org/conferences/?conf=tableaux2017. For all accepted papers at least one author is required to attend the conference and present the paper. A paper title and a short abstract of about 100 words must be submitted before the paper submission deadline. Further information about paper submissions will be made available at the conference website. Be aware that neither plagiarism, nor self-plagiarism, nor duplicate publication is acceptable. Formatting instructions and the LNCS style files can be obtained via http://www.springer.com/br/computer-science/lncs/conference-proceedings-gui… BEST PAPER AWARD The TABLEAUX 2017 Best Paper Award will be presented to the best submission nominated and chosen by the Program Committee among the accepted papers. The eligibility criteria will place emphasis on the originality and significance of the contribution, but readability and the overall technical quality, including correctness and completeness of results, will also be considered. The TABLEAUX Best Paper Award was established in 2015 and is a permanent initiative of TABLEAUX. IMPORTANT DATES 18 Apr 2017 Abstract submission 25 Apr 2017 Paper submission 8 Jun 2017 Notification of paper decisions 3 Jul 2017 Camera-ready papers due 23-25 Sep 2017 Workshops & Tutorials 25-28 Sep 2017 TABLEAUX Conference PROGRAM COMMITTEE Peter Baumgartner National ICT Australia, Canberra Maria Paola Bonacina Universita degli Studi di Verona Laura Bozzelli Universidad Politecnica de Madrid Torben Brauener Roskilde University Serenella Cerrito Ibisc, Universite d'Evry Val d'Essonne Agata Ciabattoni Technische Universitaet Wien Clare Dixon University of Liverpool Pascal Fontaine LORIA, INRIA, Universite de Lorraine Didier Galmiche LORIA, Universite de Lorraine Martin Giese Universitetet i Oslo Laura Giordano DISIT, Universita del Piemonte Orientale Rajeev Gore The Australian National University Volker Haarslev Concordia University George Metcalfe Universitaet Bern Angelo Montanari Universita degli Studi di Udine Barbara Morawska Technische Universitaet Dresden Boris Motik University of Oxford Leonardo de Moura Microsoft Research Neil Murray SUNY at Albany Claudia Nalon Universidade de Brasilia Linh Anh Nguyen Uniwersytet Warszawski Hans de Nivelle Uniwersytet Wroclawski Nicola Olivetti LSIS, Aix-Marseille Universite Jens Otten Universitetet i Oslo Valeria de Paiva Nuance Communications Nicolas Peltier Centre National de la Recherche Scientifique, Laboratoire d'Informatique de Grenoble Elaine Pimentel Universidade Federal do Rio Grande do Norte Giselle Reis Carnegie Mellon University-Qatar Philipp Ruemmer Uppsala Universitet Katsuhiko Sano Hokkaido University Renate Schmidt The University of Manchester Cesare Tinelli The University of Iowa Alwen Tiu Nanyang Technological University David Toman University of Waterloo Josef Urban Ceske vysoke uceni technicke v Praze LOCAL CONFERENCE ORGANIZATION COMMITTEE Claudia Nalon, Universidade de Brasilia, Brazil Daniele Nantes Sobrinho, Universidade de Brasilia, Brazil Elaine Pimentel, Universidade Federal do Rio Grande do Norte, Brazil Joao Marcos, Universidade Federal do Rio Grande do Norte, Brazil CONFERENCE CHAIR Claudia Nalon, University of Brasilia, Brazil PC CHAIRS Claudia Nalon, University of Brasilia, Brazil Renate Schmidt, The University of Manchester, UK

1 0

[Second Call for Paper] LORI-VI: The Sixth International Conference on Logic, Rationality and Interaction, September 11-14, 2017, Hokkaido University, Sapporo, Japan
by Katsuhiko Sano 13 Mar '17

13 Mar '17

Second Call for Papers LORI-VI: The Sixth International Conference on Logic, Rationality and Interaction September 11-14, 2017, Hokkaido University, Sapporo, Japan http://golori.org/lori2017/ [About LORI] The International Conference on Logic, Rationality and Interaction (LORI) conference series aims at bringing together researchers working on a wide variety of logic-related topics that concern the understanding of rationality and interaction. The series aims at fostering a view of Logic as an interdisciplinary endeavour, and supports the creation of an East-Asian community of interdisciplinary researchers. [News] *** 60,000 yen (approx 500 Euro) prize for best student paper *** The best student paper will be selected from the contributed student papers accepted for presentation at LORI VI, and be awarded the prize of 60,000 Japanese Yen (approximately 500 Euro). For more details, see http://golori.org/lori2017/award.html . [Call for Papers] We invite submission of contributed papers on any of the broad themes of LORI series; specific topics of interest include, but are not limited to, formal approaches to ・ agency ・ argumentation and agreement ・ belief representation ・ cooperation ・ belief revision and belief merging ・ strategic reasoning ・ games ・ decision making and planning ・ knowledge and action ・ epistemology ・ dynamics of informational attitudes ・ speech acts ・ knowledge representation ・ interaction ・ norms and normative systems ・ natural language ・ rationality ・ philosophy and philosophical logic ・ preference and utility ・ social choice ・ probability and uncertainty ・ social interaction ・ intentions, plans, and goals Submitted papers should be at most 12 pages long, with one additional page for references, in PDF format following the Springer LNCS style. Please submit your paper by Friday March 31, 2017, via EasyChair : http://easychair.org/conferences/?conf=lori6 . [Publication] Accepted papers will be collected as a volume in the FoLLI Series on Logic, Language and Information, and authors may be later invited to submit extended versions of their papers in a special issue of a prestigious journal. [Website] For detailed conference information and registration, please visit http://golori.org/lori2017/ . [Invited Speakers] Mike Dunn: Indiana University, U.S.A. Alan Hajek: Australian National University, Australia Nina Gierasimczuk: Technical University of Denmark, Denmark Willemien Kets: Northwestern University, U.S.A Sara Negri: University of Helsinki, Finland Hiroakira Ono: JAIST, Japan [PC Chairs] Alexandru Baltag: University of Amsterdam, The Netherlands Jeremy Seligman: University of Auckland, New Zealand [Conference Organiser] Tomoyuki Yamada: Hokkaido University, Japan [Sponsors] LORI Tsinghua University - University of Amsterdam Joint Research Centre for Logic Hokkaido University [Contacts] Programme: The PC Chairs <lori6(a)easychair.org> Conference: Tomoyuki Yamada <tomoyuki.s.yamada(a)gmail.com>

1 0

JAIST Logic Seminar Series
by Takako Nemoto 10 Mar '17

10 Mar '17

皆様 Ludwig-Maximilians-Universität München の Josef Berger 博士の講演のお知らせです。どうぞふるってご参加ください。問い合わせ先：根元　多佳子北陸先端科学技術大学院大学　情報科学系 email: t-nemoto(a)jaist.ac.jp --------------------------------------------- *JAIST Logic Seminar Series* Date: Thursday 16 March, 2017, 15:20-17:00 Place: JAIST, Collaboration room 7 (I-56) (Access: http://www.jaist.ac.jp/english/location/access.html) Speaker: Josef Berger (udwig-Maximilians-Universität München, Germany) (joint work with Gregor Svindland) Brouwer's fan theorem and convexity In the framework of Bishop's constructive mathematics, we introduce a correspondence between sets B of finite binary sequences on the one hand and uniformly continuous functions f on the unit interval on the other hand. This correspondence is compatible with basic properties of the involved objects as follows: i) B is a bar if and only if the corresponding f is positive-valued ii) B is a uniform bar if and only if f has positive infimum iii) B is weakly convex if and only f is weakly convex. This simplifies and generalises a result in William H. Julian and Fred Reichmann, A uniformly continuous function on [0, 1] that is everywhere different from its infimum. Pacific Journal of Mathematics 111, No 2 (1984) 333–340

1 0

QIT36のご案内
by NISHIMURA Harumichi 08 Mar '17

08 Mar '17

logic-mlの皆様 QIT36世話人に代わりまして第36回量子情報技術研究会(QIT36)の会告を以下の通り投稿させていただきます．どうぞよろしくお願いいたします．名古屋大学大学院情報科学研究科西村治道 ---------------- 第36回量子情報技術研究会(QIT36) 研究会の内容：情報科学と量子力学を融合させた新しい分野，量子情報科学に関する研究会です．情報を担う物理系の量子力学的側面を積極的に活かした新しい情報処理原理の研究とそこから開かれる新しい学問体系の構築および新しい情報技術パラダイムの創生を目指して，情報科学，物理学，光エレクトロニクスを含む理学，工学，数理科学に携わる研究者間に自由な討論の場を提供し，この研究分野の発展を図ることを目的としています．第36回研究会を下記のように開催いたします．現在この分野で活躍する研究者は勿論，自分の研究資産が何らかの形で使えそうだと予感している研究者・技術者など，広く関連する分野の研究者・技術者からの発表を募集致します．聴講のみの参加も歓迎致しますので，奮ってお申し込みください．日時: 2017年5月29日(月)～30日(火) 会場: 立命館大学朱雀キャンパス５階大講義室（ホール） (〒604-8520 京都市中京区西ノ京朱雀町１）発表募集分野 (申し込み状況によっては査読の可能性あり)：量子情報，量子計算，量子暗号など広く量子情報技術に関わる理論的研究，実験的研究，計算機科学的研究，数学的研究，および，その他関連分野．定員: 200名参加費: 事前振込み一般2,000円，学生1,000円（当日会場払いは一般3,000円，学生2,000円．学生に限り予稿集なしで当日無料参加可能です．）懇親会費：事前振り込み一般4,000円，学生2,000円．（当日会場払いは一般5,000円，学生3,000円．）招待・チュートリアル講演：笹川崇男（東京工業大学）：CRESTプロジェクト「トポロジカル量子計算の基盤技術構築」の研究構想について田家慎太郎（京都大学）：光格子を用いた実験による、量子磁性や高温超伝導といった固体電子系の物理に対する量子シミュレーションに関した最近の成果と展望について谷誠一郎（NTT）：機能制限された量子計算モデルの能力について並木亮（学習院大学）：連続量量子チャンネルの最近の理論展開について研究会参加申込要領：参加申込は下記 Web にて受付けます： http://staff.aist.go.jp/s-kawabata/qit/ 講演 (口頭，ポスター) の申込，予稿集原稿 PDF の提出は，電子情報通信学会の Web システムを使用する予定．【口頭講演申込締切】2017年4月7日(金) 【ポスター講演申込締切】2017年4月21日(金) 【予稿原稿提出締切】2017年4月21日(金) 【参加申込締切】2017年4月28日(金) 【問合せ先】山下茂（立命館大学）中西正樹（山形大学) 添田彬仁（東京大学) Email: qit36(a)ngc.is.ritsumei.ac.jp 主催: 量子情報技術時限研究専門委員会 (委員長: 竹内繁樹 (京都大学)) 共催: 応用物理学会量子エレクトロニクス研究会立命館大学情報理工学部

1 0

First NII Programming and Logic Workshop
by Makoto Tatsuta 27 Feb '17

27 Feb '17

First NII Programming and Logic Workshop Date: March 2--3, 2017 Place: National Institute of Informatics, Room 2006 (20th floor) 場所: 国立情報学研究所 20階 2006室 (半蔵門線,都営地下鉄三田線・新宿線神保町駅または東西線竹橋駅より徒歩5分) (地図 http://www.nii.ac.jp/about/access/) Program: March 2 10:20--11:00 Wei-Ngan Chin (National University of Singapore) Title: Automated Verification and Analysis of Expressive Specifications 11:00--11:40 Zhenjiang Hu (National Institute of Informatics) Title: Towards Change-Oriented Programming 11:40--11:55 Break 11:55--12:35 Makoto Tatsuta (National Institute of Informatics) Title: Presburger and Mutual Inductive Definitions 12:35--14:00 Lunch Break 14:00--14:40 Quang Loc Le (Singapore University of Technology and Design / National University of Singapore) Title: A Decidable Fragment in Separation Logic with Inductive Predicates and Arithmetic 14:40--15:20 Hsiang-Shang Ko (National Institute of Informatics) Title: An Axiomatic Basis for Bidirectional Programming 15:20--15:35 Break 15:35--16:15 Daisuke Kimura (Toho University) Title: Decidability of Entailments in Separation Logic with Arrays 16:15--16:55 Mahmudul Faisal Al Ameen (National University of Singapore) Title: Separation-Logic-Based Analyzer for Detecting Memory Errors March 3 10:15--10:55 Koji Nakazawa (Nagoya University) Title: Cyclic-Proof-Based Decision Procedure for Symbolic Heaps and Inductive Definitions 10:55--11:35 Shin-Cheng Mu (Academia Sinica) Title: Towards Derivation of Monadic Programs: A Case Study of States and Nondeterminism 11:35--11:50 Break 11:50--12:30 Andreea Costea National University of Singapore) Title: Automated Reasoning for Race-Free Channels with Explicit Synchronization and Precise Disjunction Abstracts: ---------------------------------------------------------------------- Speaker: Wei-Ngan Chin (National University of Singapore) Title: Automated Verification and Analysis of Expressive Specifications Abstract: The last two decades have seen a proliferation of research activities in methodologies, techniques and systems for automated verification and analysis of software programs. One driving force in this direction has been the deployment of expressive logics that are able to capture specifications of programs in a concise and precise manner. One of these logics that my research group has been pre-occupied with in the last decade is separation logic itself, made popular by seminal works of John Reynolds and Peter O’Hearn. Separation logic is a sub-structural which treats memory locations as resources that can be transferred, borrowed or consumed. Such a resource logic allows must-aliasing and updates to be succinctly expressed. We have looked into various extensions to support expressive specification logics. We have also explored automated verification techniques that work with inductive predicates. We have proposed and evaluated decision procedures on satisfiability and entailment on some fragments of our logics. We have moreover extended our approach to support incremental specification inference with the help of second-order unknown predicates. These works have challenged us to go beyond properties that guarantee memory safety and correctness, to include also termination, immutability infinity, deeper sharing, communication and concurrency. We shall describe several aspects of our recent endeavours here. ---------------------------------------------------------------------- Speaker: Zhenjiang Hu (National Institute of Informatics) Title: Towards Change-Oriented Programming Abstract: Change is essential and expensive in software development. Although a significant amount of work has been done on software change, its status as a scientific discipline is still an open challenge. In this talk, I will show that it is possible to treat software change as a first-class citizen in software development. The success of this work could lead to change-oriented programming, a new programming paradigm that can effectively cope with software dynamics. ---------------------------------------------------------------------- Speaker: Makoto Tatsuta (National Institute of Informatics) Title: Presburger and Mutual Inductive Definitions Abstract: This talk proposes some restrictions for a system of Presburger arithmetic and mutual inductive definitions and proves the decidability of truth in the system. To prove it, this talk shows that every inductively defined predicate in the system represents a semilinear set. Since inductively defined predicates can be eliminated, the truth is decided in the arithmetic. This system is an extension of the system given in our APLAS 2016 paper but more expressive as it can handle mutual inductive definitions and more than one induction steps in inductive definitions. ---------------------------------------------------------------------- Speaker: Quang Loc Le (Singapore University of Technology and Design / National University of Singapore) Title: A Decidable Fragment in Separation Logic with Inductive Predicates and Arithmetic Abstract: We consider the satisfiability problem for a fragment of separation logic including inductive predicates with shape and arithmetic properties. We show that the fragment is decidable if the arithmetic properties can be represented as semilinear sets. Our decision procedure is based on a novel algorithm to infer a finite representation for each inductive predicate which precisely characterises its satisfiability. Our analysis shows that the proposed algorithm runs in exponential time in the worst case. To show the feasibility of our proposal, we have implemented our decision procedure, integrated it into an existing verification system and evaluated the solver on a set of satisfiability problems which is generated from the verification of heap-manipulated programs. ---------------------------------------------------------------------- Speaker: Hsiang-Shang Ko (National Institute of Informatics) Title: An Axiomatic Basis for Bidirectional Programming Abstract: Among the frameworks of bidirectional transformations proposed for addressing various synchronisation problems, Foster et al.’s lenses have influenced the design of a generation of bidirectional programming languages. Most of these languages are highly declarative, and only allow the programmer to specify a consistency relation with limited control over the behaviour of the automatically derived consistency restorer. However, synchronisation problems are diverse and require vastly different consistency restoration strategies, and the programmer must be empowered to fully control and reason about the consistency restoration behaviour of their bidirectional programs. The putback-based approach to bidirectional programming was proposed to address this issue once and for all, and this talk will present the latest result along this line of research: a Hoare-style logic for the putback-based language BiGUL. With this Hoare-style logic, the BiGUL programmer can precisely understand the bidirectional behaviour of their programs by reasoning solely in the putback direction. The theory underlying the Hoare-style logic has been formalised and checked in the dependently typed language Agda, but this talk will give a semi-formal presentation of the logic suitable for human reasoning. ---------------------------------------------------------------------- Speaker: Daisuke Kimura (Toho University) Title: Decidability of Entailments in Separation Logic with Arrays Abstract: We show decidability of validity of entailments in symbolic-heap fragment of separation logic with arrays, which is designed for verifying array-manipulating imperative programs. Our proof is given by translating entailments into formulas of Presburger Arithmetic, which is known to be decidable. Finally we provide an implementation of our decision procedure, in which Presburger-formulas are decided by an internally called SMT-solver. ---------------------------------------------------------------------- Speaker: Mahmudul Faisal Al Ameen (National University of Singapore) Title: Separation-Logic-Based Analyzer for Detecting Memory Errors Abstract: This talk discusses an implementation of a separation-logic-based analyzer for memory errors. This system is based on symbolic heap with presburger arithmetic. This implementation extracts errors by analyzing the strongest postcondition. The system abstracts all the existentially quantified pointers. A while loop is analyzed using fixed point analysis and it uses an arithmetic decision procedure. It is also intended to analyze array and inter-procedure analysis. ---------------------------------------------------------------------- Speaker: Koji Nakazawa (Nagoya University) Title: Cyclic-Proof-Based Decision Procedure for Symbolic Heaps and Inductive Definitions Abstract: We introduce a new cyclic-proof system CSLID_omega for separation logic with inductively defined predicates. CSLID_omega is complete and gives decision procedure for entailment checking based on the unfold-match approach. ---------------------------------------------------------------------- Speaker: Shin-Cheng Mu (Academia Sinica) Title: Towards Derivation of Monadic Programs: A Case Study of States and Nondeterminism Abstract: Equational reasoning is among the most important tools that functional programming provides us. Curiously, relatively little attention has been paid on reasoning about monadic programs. In this talk we propose some theorems and patterns useful for derivation of monadic programs, focusing on non-determinism and states. ---------------------------------------------------------------------- Speaker: Andreea Costea National University of Singapore) Title: Automated Reasoning for Race-Free Channels with Explicit Synchronization and Precise Disjunction Abstract: The usage of the message passing for inter-process communication leveraged the performance and scalability of computing platforms leading to a rise in the level of concurrency. Together with its benefits though, message passing also places a burden on the safety and correctness verification process of concurrent system, which was already a challenging task even in the absence of message passing. The current state of the art tackles this problem of safe message communication assuming the systems rely solely of message passing in order to obtain concurrency. However, this is generally not true, since existing software tend to use a combination of synchronization mechanisms. Our aim is to break the assumption of unique synchronization mechanisms, and step further into reasoning about hybrid communication system, where different concurrency instruments intermingle. We therefore present a multiparty session logic which vows to marry the message passing model with explicit synchronization mechanisms, such as CountDownLatch. In this context, we consider how to ensure well-formedness of the session logic, and how to build summaries that can help ensure race-freedom and type safety amongst shared channels. ---------------------------------------------------------------------- 問合せ先　龍田 (tatsuta(a)nii.ac.jp)

1 0

DICE-FOPARA 2017: deadline extension
by Nao Hirokawa 21 Feb '17

21 Feb '17

皆様 DICE-FOPARA 2017 の論文募集の案内をお送り致します。投稿締切が延長され、3月5日になっております。廣川 [Apologies for cross-postings.] ------------------------------------------------------------------------------------------- 8th Workshop on Developments in Implicit Computational complExity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis (DICE-FOPARA 2017) Affiliated with ETAPS 2017 April 22 - 23, 2017, Uppsala, Sweden http://cbr.uibk.ac.at/events/dice-fopara ------------------------------------------------------------------------------------------- OBJECTIVES The first joint international workshop on Developments in Implicit Computational complExity and FOundational and Practical Aspects of Resource Analysis (DICE-FOPARA) will be held in Uppsala, Sweden, from April 22-23, 2017 as part of ETAPS. DICE-FOPARA serves as a forum for presenting results relevant to the implicit computational complexity theory *and* to the analysis of resource consumption by computer programs (e.g. time, space, energy). The workshop brings together researchers that work on foundational issues with researchers that focus more on practical results. For further information, kindly see the workshop's website. INVITED SPEAKERS Elvira Albert (Complutense University of Madrid) Kerstin I. Eder (University of Bristol) Lars Kristiansen (University of Oslo) Jan Reinecke (Universität Saarland) SUBMISSIONS We ask for submission of *regular papers* describing original work (10-15 pages) or *extended abstracts* (2-6 pages) presenting already published work or work in progress. Regular papers must be prepared using the LaTeX EPTCS class (see http://eptcs.org/). Accepted regular papers will appear in an EPTCS volume. Papers should be submitted electronically via the submission page: https://easychair.org/conferences/?conf=dicefopara2017 IMPORTANT DATES Paper submission March 5, 2017 (extended) Notification March 19, 2017 Final versions due March 26, 2017 Workshop date April 22-23, 2017 CONFERENCE VENUE The workshop will be held as a satellite workshop of European Joint Conferences on Theory and Practice of Software 2017 (ETAPS 2017) which takes place in Uppsala, Sweden. PROGRAM COMMITTEE Beniamino Accattoli (Paris) Guillaume Bonfante (Nancy, co-chair) Marko van Eekelen (Nijmegen) Marco Gaboardi (Buffalo) Dan Ghica (Birmingham) Clemens Grelck (Amsterdam) Charles Grellois (Bologna) Nao Hirokawa (JAIST) Jan Hoffmann (CMU) Thomas Jensen (Rennes) Björn Lisper (Mälardalen) Hans-Wolfgang Loidl (Edinburgh) Georg Moser (Innsbruck, co-chair) Kazushige Terui (Kyoto) Simon Wegener (Saarbrücken) Florian Zuleger (Vienna)

1 0

JAIST Logic Seminar Series
by Takako Nemoto 14 Feb '17

14 Feb '17

皆様ベルン大学の Silvia Steila 博士の講演のお知らせです。どうぞふるってご参加ください。問い合わせ先：根元　多佳子北陸先端科学技術大学院大学　情報科学系 email: t-nemoto(a)jaist.ac.jp --------------------------------------------- *JAIST Logic Seminar Series* Date: Tuesday 28 February, 2017, 15:20-17:00 Place: JAIST, Collaboration room 7 (I-56) (Access: http://www.jaist.ac.jp/english/location/access.html) Speaker: Silvia Steila (University of Bern, Switzerland) Title: The strength of the SCT criterion (Joint work with Emanuele Frittaion and Keita Yokoyama). In 2001 Lee, Jones and Ben-Amram introduced the notion of size-change termination (SCT) for first order functional programs, a sufficient condition for termination. They proved that a program is size-change terminating if and only if it satisfies a certain property which can be statically verified from the recursive definition of the program. We call this equivalence SCT criterion. We undertake the study of size-change analysis in the context of Reverse Mathematics. In particular, we prove that the SCT criterion is equivalent to $\Sigma_2$-induction over RCA$_{0}$.

1 0

CCA 2017 (Computability and Complexity in Analysis): 2nd call for papers
by Daniel Graça 11 Feb '17

11 Feb '17

______________________________________________________________ Second Call for Papers Fourteenth International Conference on Computability and Complexity in Analysis (CCA 2017) http://cca-net.de/cca2017/ July 24-27, 2017, Daejeon, Republic of Korea (South Korea) Submission deadline: April 3, 2017 ______________________________________________________________ Topics * Computable analysis * Complexity on real numbers * Constructive analysis * Domain theory and analysis * Effective descriptive set theory * Theory of representations * Computable numbers, subsets and functions * Randomness and computable measure theory * Models of computability on real numbers * Realizability theory and analysis * Reverse analysis * Real number algorithms * Implementation of exact real number arithmetic Invited Speakers * Hee-Kap Ahn (Pohang, Republic of Korea) * Verónica Becher (Buenos Aires, Argentina) * Anders Hansen (Cambridge, UK) * Takayuki Kihara (Berkeley, USA) * Amaury Pouly (Max Planck Institute, Germany) * Linda Brown Westrick (Connecticut, USA) Scientific Programme Committee * Johanna Franklin (Hempstead, USA) * Daniel Graça, chair (Faro, Portugal) * Vassilios Gregoriades (Turin, Italy) * Peter Hertling (Munich, Germany) * Gyesik Lee (Anseong, Republic of Korea) * Alexander Melnikov (Auckland, New Zealand) * Takako Nemoto (Ishikawa, Japan) * Arno Pauly (Brussells, Belgium) * Cristóbal Rojas (Santiago, Chile) * Frank Stephan (Singapore) * Klaus Weihrauch (Hagen, Germany) Organising Committee * Sunyoung Kim (Yonsei University, Republic of Korea) * Sewon Park (KAIST, Republic of Korea) * Martin Ziegler, chair (KAIST, Republic of Korea) Submissions Authors are invited to submit 1-2 pages abstracts in PDF format, including references via the following web page: https://easychair.org/conferences/?conf=cca2017 If full versions of papers are already available as technical report or arXiv version, then corresponding links should be added to the reference list. Final versions of abstracts might be distributed to participants in hardcopy and/or in electronic form. Dates * Submission deadline: April 3, 2017 * Notification of authors: May 1, 2017 * Final version: May 29, 2017 Conference Web Page http://cca-net.de/cca2017/ A co-located "Workshop on Real Verification" will take place on Friday, July 28, jointly organized by: * Gyesik Lee (Hankyong National University, Republic of Korea) * Martin Ziegler (KAIST, Republic of Korea) https://complexity.kaist.edu/CCA2017/workshop.html

1 0

DICE-FOPARA 2017 - Second Call for Papers
by Nao Hirokawa 10 Feb '17

10 Feb '17

皆様 ETAPS に併設されます DICE-FOPARA 2017 の論文募集案内をお送り致します。投稿締切は2月19日です。ぜひご投稿をご検討下さい。廣川 (JAIST) ------------------------------------------------------------------------------------------- 8th Workshop on Developments in Implicit Computational complExity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis (DICE-FOPARA 2017) Affiliated with ETAPS 2017 April 22 - 23, 2017, Uppsala, Sweden http://cbr.uibk.ac.at/events/dice-fopara ------------------------------------------------------------------------------------------- OBJECTIVES The first joint international workshop on Developments in Implicit Computational complExity and FOundational and Practical Aspects of Resource Analysis (DICE-FOPARA) will be held in Uppsala, Sweden, from April 22-23, 2017 as part of ETAPS. DICE-FOPARA serves as a forum for presenting results relevant to the implicit computational complexity theory *and* to the analysis of resource consumption by computer programs (e.g. time, space, energy). The workshop aims to bring together the researchers that work on foundational issues with the researchers that focus more on practical results. INVITED SPEAKERS Elvira Albert (Complutense University of Madrid) Kerstin I. Eder (University of Bristol) Lars Kristiansen (University of Oslo) Jan Reinecke (Universität Saarland) SUBMISSIONS We ask for submission of *regular papers* describing original work (10-15 pages) or *extended abstracts* (2--6 pages) presenting already published work or work in progress. Regular papers must be prepared using the LaTeX EPTCS class (see http://eptcs.org/). Accepted regular papers will appear in an EPTCS volume. Papers should be submitted electronically via the submission page: https://easychair.org/conferences/?conf=dicefopara2017 IMPORTANT DATES Paper submission February 19, 2017 Notification March 19, 2017 Final versions due March 26, 2017 Workshop date April 22-23, 2017 CONFERENCE VENUE The workshop will be held as a satellite workshop of European Joint Conferences on Theory and Practice of Software 2017 (ETAPS 2017) which takes place in Uppsala, Sweden. PROGRAM COMMITTEE Beniamino Accattoli (Paris) Guillaume Bonfante (Nancy, co-chair) Marko van Eekelen (Nijmegen) Marco Gaboardi (Buffalo) Dan Ghica (Birmingham) Clemens Grelck (Amsterdam) Charles Grellois (Bologna) Nao Hirokawa (JAIST) Jan Hoffmann (CMU) Thomas Jensen (Rennes) Björn Lisper (Mälardalen) Hans-Wolfgang Loidl (Edinburgh) Georg Moser (Innsbruck, co-chair) Kazushige Terui (Kyoto) Simon Wegener (Saarbrücken) Florian Zuleger (Vienna)

1 0

Summer School in Dynamic Epistemic Logic, Sapporo (Japan), 14-25 Aug 2017
by Katsuhiko Sano 07 Feb '17

07 Feb '17

The Department of Philosophy at Hokkaido University (Sapporo, Japan) will hold a two-week summer school in dynamic epistemic logic and its applications, jointly with three guest lecturers from ILLC (University of Amsterdam) from August 14 to August 25 as part of Hokkaido Summer Institute (HSI) 2017. The following two intensive courses are scheduled to be offered during the summer school. Course 1 (August 14 to August 18): Introduction to Logic (For details, see http://hokkaidosummerinstitute.oia.hokudai.ac.jp/courses/CourseDetail=G070) Course 2 (August 21 to August 25): Dynamic Epistemic Logic and its Applications (For details, see http://hokkaidosummerinstitute.oia.hokudai.ac.jp/courses/CourseDetail=G074 ) The main lecturer of Course 1 is Katsuhiko Sano (Department of Philosophy, Hokkaido University). The main lectures of Course 2 are Alexandru Baltag and Sonja Smets (ILLC, University of Amsterdam). There will be a special live on-line lecture by Johan van Benthem (University of Amsterdam, Stanford University, and Tsinghua University) during Course 2. Tomoyuki Yamada and Yasushi Nomura (Hokkaido University) will also join the classes to help students follow the lectures, and communicate with the lecturers. The courses are intended for graduate students. Course 1 is meant for students without prior knowledge of logic and will prepare them for Course 2. Each course is designed to be independent from the other course. Those students who have some familiarity with basics of propositional logic, first order logic, and modal logic can skip Course 1, and those who wish to take only Course 1 can learn basics of logic. Application period for students from universities other than Hokkaido University is from February 1 to February 28 2017. For more details about applications, please check the HSI official website: https://hokkaidosummerinstitute.oia.hokudai.ac.jp/applications/ As the summer in Sapporo is beautiful and pleasant, it's a good idea to learn logic this summer in Sapporo. Tomoyuki Yamada Department of Philosophy Hokkaido University

1 0

早稲田大学江田勝哉先生最終講義
by Toshimichi Usuba 06 Feb '17

06 Feb '17

（このお知らせを重複して受け取られた方はご容赦ください）皆様、早稲田大学の薄葉です。本年3月をもちまして、早稲田大学基幹理工学部数学科江田勝哉先生がご退職されますことに伴い、 3月11日（土）に最終講義が行われることをお知らせいたします。日時：3月11日（土）13時〜14時30分題目：Speckerの定理（双対定理）をめぐって場所：早稲田大学西早稲田キャンパス52号館101教室最終講義に関する問い合わせは薄葉 <usuba(a)waseda.jp> までお願いいたします。皆様のご参加をお待ちしております。 -- Toshimichi USUBA School of Fundamental Science and Engineering, Waseda University

1 0

Fwd: categories: CALCO 2017: Second Call for Papers
by Ichiro Hasuo 05 Feb '17

05 Feb '17

========================================================= CALL FOR PAPERS: CALCO 2017 7th International Conference on Algebra and Coalgebra in Computer Science June 13 - 16, 2017 Ljubljana, Slovenia http://coalg.org/mfps-calco2017/ ========================================================== Abstract submission: April 3, 2017 Paper submission: April 7, 2017 Author notification: May 15, 2017 Final version due: May 31, 2017 ========================================================== -- SCOPE -- CALCO aims to bring together researchers and practitioners with interests in foundational aspects, and both traditional and emerging uses of algebra and coalgebra in computer science. It is a high-level, bi-annual conference formed by joining the forces and reputations of CMCS (the International Workshop on Coalgebraic Methods in Computer Science), and WADT (the Workshop on Algebraic Development Techniques). Previous CALCO editions took place in Swansea (Wales, 2005), Bergen (Norway, 2007), Udine (Italy, 2009), Winchester (UK, 2011), Warsaw (Poland, 2013) and Nijmegen (the Netherlands, 2015). The seventh edition will be held in Ljubljana, Slovenia, colocated with MFPS XXXIII. -- INVITED SPEAKERS -- Nicoletta Sabadini - University of Insubria, IT Alex Simpson - University of Ljubljana, SL *Joint Session with MFPS on Metrics, Privacy and Learning:* James Worrell - University of Oxford, UK (Tutorial) *Further Invited Speakers:* Catuscia Palamidessi - Ecole polytechnique, FR Vincent Danos - Ecole normale superieure, FR Marco Gaboardi - University at Buffalo, USA -- TOPICS OF INTEREST -- We invite submissions of technical papers that report results of theoretical work on the mathematics of algebras and coalgebras, the way these results can support methods and techniques for software development, as well as experience with the transfer of the resulting technologies into industrial practice. We encourage submissions in topics included or related to those listed below. * Abstract models and logics - Automata and languages - Categorical semantics - Modal logics - Relational systems - Graph transformation - Term rewriting * Specialised models and calculi - Hybrid, probabilistic, and timed systems - Calculi and models of concurrent, distributed, mobile, and context-aware computing - General systems theory and computational models (chemical, biological, etc.) * Algebraic and coalgebraic semantics - Abstract data types - Inductive and coinductive methods - Re-engineering techniques (program transformation) - Semantics of conceptual modelling methods and techniques - Semantics of programming languages * System specification and verification - Algebraic and coalgebraic specification - Formal testing and quality assurance - Validation and verification - Generative programming and model-driven development - Models, correctness and (re)configuration of hardware/middleware/architectures, - Process algebra * Corecursion in Programming Languages - Corecursion in logic / constraint / functional / answer set programming - Corecursive type inference - Coinductive methods for proving program properties - Implementing corecursion - Applications * Algebra and Coalgebra in quantum computing - Categorical semantics for quantum computing - Quantum calculi and programming languages - Foundational structures for quantum computing - Applications of quantum algebra * String Diagrams and Network Theory - Combinatorial approaches - Theory of PROPs and operads - Rewriting problems and higher-dimensional approaches - Automated reasoning with string diagrams - Applications of string diagrams - Connections with Control Theory, Engineering and Concurrency -- SUBMISSION GUIDELINES -- Prospective authors are invited to submit full papers in English presenting original research. Submitted papers must be unpublished and not submitted for publication elsewhere. Experience papers are welcome, but they must clearly present general lessons learned that would be of interest and benefit to a broad audience of both researchers and practitioners. Proceedings will be published in the Dagstuhl LIPIcs???Leibniz International Proceedings in Informatics series. Final papers should be no more than 15 pages long in the format specified by LIPIcs (http://www.dagstuhl.de/publikationen/lipics/anleitung-fuer-autoren/). It is recommended that submissions adhere to that format and length. Submissions that are clearly too long may be rejected immediately. Proofs omitted due to space limitations may be included in a clearly marked appendix. Both an abstract and the full paper must be submitted by their respective submission deadlines. A special issue of the open access journal Logical Methods in Computer Science (http://www.lmcs-online.org), containing extended versions of selected papers, is also being planned. Submissions will be handled via EasyChair https://www.easychair.org/conferences/?conf=calco2017 -- BEST PAPER AND BEST PRESENTATION AWARDS -- This edition of CALCO will feature two awards: a Best Paper Award whose recipients will be selected by the PC before the conference and a Best Presentation Award, elected by the participants. -- IMPORTANT DATES -- Abstract submission: April 3, 2017 Paper submission: April 7, 2017 Author notification: May 15, 2017 Final version due: May 31, 2017 -- PROGRAMME COMMITTEE -- Andrej Bauer (University of Ljubljana, Slovenia) Filippo Bonchi (ENS Lyon, France, co-chair) Marcello Bonsangue (University of Leiden, Netherlands) Corina Cirstea (University of Southampton, UK) Robin Cockett (University of Calgary, Canada) Andrea Corradini (University of Pisa, Italy) Sergey Goncharov (Universitaet Erlangen-Nuernberg, Germany) Helle Hvid Hansen (Delft University of Technology, Netherlands) Ichiro Hasuo (University of Tokyo, Japan) Tobias Heindel (University of Copenhagen, Denmark) Tom Hirschowitz (Savoie Mont Blanc University, France) Bart Jacobs (University of Nijmegen, Netherlands) Bartek Klin (Warsaw University, Poland) Barbara Koenig (University of Duisburg-Essen, Germany, co-chair) Alexander Kurz (University of Leicester, UK) Paul Levy (University of Birmingham, UK) Radu Mardare (Aalborg University, Denmark) Stefan Milius (Universitaet Erlangen-Nuernberg, Germany) Samuel Mimram (Ecole Polytechnique, France) Till Mossakowski (Universitaet Magdeburg, Germany) Larry Moss (Indiana University, US) Daniela Petrisan (Universite Paris-Diderot, France) John Power (University of Bath, UK) Grigore Rosu (University of Illinois, US) Jan Rutten (CWI, University of Nijmegen, Netherlands) Peter Selinger (Dalhousie University, Canada) Alexandra Silva (University College London, UK) Pawel Sobocinski (University of Southampton, UK) Ana Sokolova (University of Salzburg, Austria) -- ORGANISING COMMITTEE -- Andrej Bauer (University of Ljubljana, Slovenia) Matija Pretnar (University of Ljubljana, Slovenia) -- PUBLICITY CHAIR -- Fabio Zanasi (University College London, UK) -- SATELLITE WORKSHOPS: CALCO EARLY IDEAS AND CALCO TOOLS -- The CALCO Early Ideas Workshop is intended to enable presentation of work in progress and original research proposals. PhD students and young researchers are particularly encouraged to contribute. The CALCO Tools Workshop is dedicated to tools based on algebraic and/or coalgebraic principles. CALCO 2017 will run together with the CALCO Early Ideas Workshop, with dedicated sessions at the end of each conference day. CALCO Tools will take place on June 13. [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

第28回松山TGSAセミナーのお知らせ
by Hiroshi Fujita 03 Feb '17

03 Feb '17

皆さま、第28回松山TGSAセミナーにおいて、下記のとおり、池上大祐さん（東京電機大学）の講演を予定していますのでお知らせします。皆さまのご参加をお待ちしております。　　（記）【日時】2017年2月22日(水) 16:30〜17:30 【場所】愛媛大学理学部2号館2階・大演習室(201号室) 【講演題目】 omega_1 の超コンパクト性【講演概要】集合論は無限について研究する数学の一分野である。現代数学では通常選択公理を仮定して議論を進めるが、集合論で重要な数学的対象である巨大基数の研究を進めるうえで、 "ZF+決定性公理" を初めとする選択公理の否定を導く集合論の公理系について考察するのが重要であることがここ三十年ほどで明らかになってきた。この講演では、集合論や巨大基数について紹介した後、選択公理の否定を導く巨大基数の性質について考察する。特に、omega_1（可算でない最小の無限基数）が超コンパクト基数という巨大基数になっているとき、実数直線にどのような影響があるかについて議論する。この研究は Nam Trang 氏との共同研究である。　　（以上です） -- 追記：松山TGSAセミナーは、「一般トポロジー・幾何学・集合論およびその応用」を広く扱うセミナーで、原則として月に１回、愛媛大学において開催されています。これまでの講演の記録はWeb http://www.math.sci.ehime-u.ac.jp/MGTSA.ja.html でご覧になれます。 -- 愛媛大学理学部藤田博司 <fujita.hiroshi.mh(a)ehime-u.ac.jp>

1 0

Talk by Marc Bagnol (9 Feb 11:00-)
by Tetsuya Sato 30 Jan '17

30 Jan '17

京都大学数理解析研究所の佐藤です。 2月9日11:00から、東京大学のMarc Bagnol氏に以下の講演をしていただくことになりましたので、ご連絡いたします。どうぞお気軽にお越しください。 ========== Time: 11:00-12:00, 9 Feb, 2017 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) http://www.kyoto-u.ac.jp/ja/access/campus/map6r_y.htm (34番の建物) Speaker: Marc Bagnol (JSPS Postdoctoral Fellow, University of Tokyo) Title: Multiplicative-Additive Proof Equivalence is Logspace-complete Abstract: Given a logic presented in a sequent calculus, a natural question is that of equivalence of proofs: to determine whether two given proofs are equated by any denotational semantics, i.e. any categorical interpretation of the logic compatible with its cut-elimination procedure. This notion can usually be captured syntactically by a set of rule permutations. Very generally, proofnets can be defined as combinatorial objects which provide canonical representatives of equivalence classes of proofs. In particular, the existence of proof nets for a logic provides a solution to the equivalence problem of this logic. In certain fragments of linear logic, it is possible to give a notion of proofnet with good computational properties, making it a suitable representation of proofs for studying the cut-elimination procedure, among other things. It has recently been proved that there cannot be such a notion of proofnets for the multiplicative (with units) fragment of linear logic, due to the equivalence problem for this logic being Pspace-complete. We will investigate the multiplicative-additive (without unit) fragment of linear logic and see it is closely related to binary decision trees: we can build a representation of proofs based on binary decision trees, reducing proof equivalence to decision tree equivalence. We will see as a consequence that the proof equivalence problem multiplicative-additive linear logic is Logspace-complete.

1 0

Kusatsu_Seminar_2017
by Naosuke MATSUDA 29 Jan '17

29 Jan '17

みなさま神奈川大学の松田と申します．毎年草津セミナーハウスで開催されている，ラムダ計算と論理の早春セミナーを，今年も開催することになりましたので連絡させていただきます．日程：2017年3月16日-3月20日場所：国立大学草津セミナーハウス詳細等は， http://www.geocities.jp/naosuke_not_good/event/lls_spring_2017.html にあります．研究打ち合わせ・学生の発表練習の場など，様々な用途でお使いいただければと思います．質問等ございましたら，松田（神奈川大学）までお気軽にお問い合わせください． -- Naosuke Matsuda, Dept. of Information Sciences Kanagawa University 2946, Tsuchiya, Hiratsuka-shi, Kanagawa, 259-1293, JAPAN matsuda.naosuke(a)gmail.com -- ------------------------------ Naosuke Matsuda, Dept. of Information Sciences Kanagawa University Tsuchiya 2946, Hiratsuka-shi, Kanagawa 259-1293, Japan

1 0

TABLEAUX 2017, Brasilia (Brazil), 25-28 Sep 2017
by Katsuhiko Sano 24 Jan '17

24 Jan '17

Apologies for multiple postings. ------------------------------------------------------------------------------------------- SECOND CALL FOR PAPERS TABLEAUX 2017 26th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods University of Brasilia, Brazil September 25-28, 2017 Submission Deadline: 25 Apr 2017 http://tableaux2017.cic.unb.br/ GENERAL INFORMATION TABLEAUX is the main international conference at which research on all aspects, theoretical foundations, implementation techniques, systems development and applications, of the mechanization of tableau-based reasoning and related methods is presented. As the first TABLEAUX workshop was held in Lautenbach in 1992, this year's conference will include special events celebrating 25 years of TABLEAUX. The conference will be held in Brasilia from 25-28 September 2017. It will be co-located with both the 11th International Symposium on Frontiers of Combining Systems (FroCoS 2017) and the 8th International Conference on Interactive Theorem Proving (ITP 2017). TOPICS Tableau methods offer a convenient and flexible set of tools for automated reasoning in classical logic, extensions of classical logic, and a large number of non-classical logics. For large groups of logics, tableau methods can be generated automatically. Areas of application include verification of software and computer systems, deductive databases, knowledge representation and its required inference engines, teaching, and system diagnosis. Topics of interest include but are not limited to: * tableau methods for classical and non-classical logics (including first-order, higher-order, modal, temporal, description, hybrid, intuitionistic, substructural, relevance, non-monotonic logics) and their proof-theoretic foundations; * related methods (SMT, model elimination, model checking, connection methods, resolution, BDDs, translation approaches); * sequent calculi and natural deduction calculi for classical and non-classical logics, as tools for proof search and proof representation; * flexible, easily extendable, light weight methods for theorem proving; * novel types of calculi for theorem proving and verification in classical and non-classical logics; * systems, tools, implementations, empirical evaluations and applications (provers, logical frameworks, model checkers, ...); * implementation techniques (data structures, efficient algorithms, performance measurement, extensibility, ...); * extensions of tableau procedures with conflict-driven learning, generation of proofs; compact (or humanly readable) representation of proofs; * decision procedures, theoretically optimal procedures; * applications of automated deduction to mathematics, software development, verification, deductive and temporal databases, knowledge representation, ontologies, fault diagnosis or teaching. We also welcome papers describing applications of tableau procedures to real world examples. Such papers should be tailored to the tableau community and should focus on the role of reasoning, and logical aspects of the solution. CELEBRATING 25 YEARS To celebrate 25 years TABLEAUX the conference will include a special session of invited talks by: Reiner Haehnle Technische Universitaet Darmstadt, Germany Wolfgang Bibel Technische Universitaet Darmstadt, Germany INVITED SPEAKERS: Carlos Areces FaMAF - Universidad Nacional de Cordoba, Argentina Katalin Bimbo University of Alberta, Canada (joint with FroCoS and ITP) Jasmin Blanchette Inria and LORIA, Nancy, France (joint with FroCoS and ITP) Cesary Kaliszyk Universitaet Innsbruck, Austria (joint with FroCoS and ITP) WORKSHOPS AND TUTORIALS There will be a three-day programme of four workshops and four tutorials from 23-25 September. Workshops: 12th Logical and Semantic Frameworks with Applications (LSFA 2017) Sandra Alves, Renata Wassermann, Flavio L. C. de Moura 23 and 24 September 2017 Proof eXchange for Theorem Proving (PxTP) Catherine Dubois, Bruno Woltzenlogel Paleo 23 and 24 September 2017 EPS - Encyclopedia of Proof Systems Giselle Reis, Bruno Woltzenlogel Paleo 24 and 25 September 2017 DaLi - Dynamic Logic: new trends and applications Mario Benevides, Alexandre Madeira 24 September 2017 Tutorials: General methods in proof theory for modal and substructural logics Bjoern Lellmann, Revantha Ramanayake 23 September 2017 From proof systems to complexity bounds Anupam Das 24 September 2017 Proof Compressions and the conjecture NP =3D PSPACE Lew Gordeev, Edward Hermann Haeusler 25 September 2017 PVS for Computer Scientists Cesar Munoz, Mauricio Ayala-Rincon, Mariano Moscato 25 September 2017 Details will be published in separate calls and on the conference website. PUBLICATION DETAILS The conference proceedings will be published in the Springer LNAI/LNCS series, as in previous editions. SUBMISSIONS Submissions are invited in two categories: A Research papers, which describe original theoretical research, original algorithms, or applications, with length up to 15 pages. B System descriptions, with length up to 9 pages. Submissions will be reviewed by the PC, possibly with the help of external reviewers, taking into account readability, relevance and originality. For category A, theoretical results and algorithms must be original, and not submitted for publication elsewhere. Submissions will be reviewed taking into account correctness, theoretical elegance, and possible implementability. For category B submissions, a working implementation must be accessible via the internet, which includes sources. The aim of a system description is to make the system available in such a way that users can use it, understand it, and build on it. Accepted papers in both categories will be published in the conference proceedings. Papers must be edited in LaTeX using the llncs style and must be submitted electronically as PDF files via the EasyChair system: https://easychair.org/conferences/?conf=3Dtableaux2017. For all accepted papers at least one author is required to attend the conference and present the paper. A paper title and a short abstract of about 100 words must be submitted before the paper submission deadline. Further information about paper submissions will be made available at the conference website. Be aware that neither plagiarism, nor self-plagiarism, nor duplicate publication is acceptable. Formatting instructions and the LNCS style files can be obtained via http://www.springer.com/br/computer-science/lncs/conference-proceedings-gui= delines BEST PAPER AWARD The TABLEAUX 2017 Best Paper Award will be presented to the best submission nominated and chosen by the Program Committee among the accepted papers. The eligibility criteria will place emphasis on the originality and significance of the contribution, but readability and the overall technical quality, including correctness and completeness of results, will also be considered. The TABLEAUX Best Paper Award was established in 2015 and is a permanent initiative of TABLEAUX. IMPORTANT DATES 18 Apr 2017 Abstract submission 25 Apr 2017 Paper submission 8 Jun 2017 Notification of paper decisions 3 Jul 2017 Camera-ready papers due 23-25 Sep 2017 Workshops & Tutorials 25-28 Sep 2017 TABLEAUX Conference PROGRAM COMMITTEE Peter Baumgartner National ICT Australia, Canberra Maria Paola Bonacina Universita degli Studi di Verona Laura Bozzelli Universidad Politecnica de Madrid Torben Brauener Roskilde University Serenella Cerrito Ibisc, Universite d'Evry Val d'Essonne Agata Ciabattoni Technische Universitaet Wien Clare Dixon University of Liverpool Pascal Fontaine LORIA, INRIA, Universite de Lorraine Didier Galmiche LORIA, Universite de Lorraine Martin Giese Universitetet i Oslo Laura Giordano DISIT, Universita del Piemonte Orientale Rajeev Gore The Australian National University Volker Haarslev Concordia University George Metcalfe Universitaet Bern Angelo Montanari Universita degli Studi di Udine Barbara Morawska Technische Universitaet Dresden Boris Motik University of Oxford Leonardo de Moura Microsoft Research Neil Murray SUNY at Albany Claudia Nalon Universidade de Brasilia Linh Anh Nguyen Uniwersytet Warszawski Hans de Nivelle Uniwersytet Wroclawski Nicola Olivetti LSIS, Aix-Marseille Universite Jens Otten Universitetet i Oslo Valeria de Paiva Nuance Communications Nicolas Peltier Centre National de la Recherche Scientifique, Laboratoire d'Informatique de Grenoble Elaine Pimentel Universidade Federal do Rio Grande do Norte Giselle Reis Carnegie Mellon University-Qatar Philipp Ruemmer Uppsala Universitet Katsuhiko Sano Hokkaido University Renate Schmidt The University of Manchester Cesare Tinelli The University of Iowa Alwen Tiu Nanyang Technological University David Toman University of Waterloo Josef Urban Ceske vysoke uceni technicke v Praze LOCAL CONFERENCE ORGANIZATION COMMITTEE Claudia Nalon, Universidade de Brasilia, Brazil Daniele Nantes Sobrinho, Universidade de Brasilia, Brazil Elaine Pimentel, Universidade Federal do Rio Grande do Norte, Brazil Joao Marcos, Universidade Federal do Rio Grande do Norte, Brazil CONFERENCE CHAIR Claudia Nalon, University of Brasilia, Brazil PC CHAIRS Claudia Nalon, University of Brasilia, Brazil Renate Schmidt, The University of Manchester, UK

1 0

第19回プログラミングおよびプログラミング言語ワークショップ（PPL2017）参加募集
by Isao Sasano 24 Jan '17

24 Jan '17

皆様芝浦工業大学の篠埜です。第19回プログラミングおよびプログラミング言語ワークショップ（PPL2017）のご案内です。以下のweb pageで参加登録を開始いたしました。参加登録の締切は 2月21日（火）です。 https://ppl2017.ipl-e.ai.kyutech.ac.jp/registration/ カテゴリ2（国外既発表論文）およびカテゴリ4（サーベイ・チュートリアル発表）の発表申込締切も近づいております。カテゴリ2 発表申込締切: 2017年1月25日(水) 17:00 (JST) カテゴリ4 発表申込締切: 2017年1月25日(水) 17:00 (JST) 是非、発表申込、参加登録をお願いいたします。篠埜　功 -- Isao Sasano <sasano(a)sic.shibaura-it.ac.jp>

1 0

ITP 2017 - 2nd Call for Papers
by Nao Hirokawa 24 Jan '17

24 Jan '17

皆様９月にブラジリアで開催されます、対話的定理証明に関する国際会議 ITP 2017 の論文募集案内をお送り致します。ぜひ投稿をご検討下さい。廣川 (JAIST) -------------------------------------------------------------------- SECOND CALL FOR PAPERS ITP 2017 8th International Conference on Interactive Theorem Proving Brasilia, Brazil September 26-29, 2017 http://itp2017.cic.unb.br SUBMISSION DEADLINES * April 3, 2017 (abstracts) * April 10, 2017 (full papers) GENERAL INFORMATION The ITP conference series is concerned with all topics related to interactive theorem proving, ranging from theoretical foundations to implementation aspects and applications in program verification, security, and formalization of mathematics. ITP is the evolution of the TPHOLs conference series to the broad field of interactive theorem proving. TPHOLs meetings took place every year from 1988 until 2009. The eighth ITP conference, ITP 2017, will be held at Universidade de Brasilia, September 26-29, 2017. SCOPE OF CONFERENCE ITP welcomes submissions describing original research on all aspects of interactive theorem proving and its applications. Suggested topics include but are not limited to the following: * formal aspects of hardware and software * formalizations of mathematics * improvements in theorem prover technology * user interfaces for interactive theorem provers * formalizations of computational models * verification of security algorithms * use of theorem provers in education * industrial applications of interactive theorem provers * concise and elegant worked examples of formalizations (proof pearls) PUBLICATION DETAILS The proceedings of the symposium will be published in the Springer's LNCS series. PAPER SUBMISSIONS All submissions must be original, unpublished, and not submitted concurrently for publication elsewhere. Furthermore, when appropriate, submissions are expected to be accompanied by verifiable evidence of a suitable implementation, such as the source files of a formalization for the proof assistant used. Submissions should be no more than 16 pages in length and are to be submitted in PDF via EasyChair at the following address: https://easychair.org/conferences/?conf=itp2017 Submissions must conform to the LNCS style in LaTeX. Authors of accepted papers are expected to present their paper at the conference and will be required to a sign copyright release form. In addition to regular papers, described above, there will be a rough diamond section. Rough diamond submissions are limited to 6 pages and may consist of an extended abstract. They will be refereed and be expected to present innovative and promising ideas, possibly in an early form and without supporting evidence. Accepted diamonds will be published in the main proceedings and will be presented as short talks. After the conference the authors of selected papers will be invited to submit revised papers for a special issue of the Journal of Automated Reasoning. IMPORTANT DATES Abstract submission deadline: April 3, 2017 Full paper submission deadline: April 10, 2017 Author notification: June 2, 2017 Camera-ready papers: June 30, 2017 Workshops & Tutorials: September 23-25, 2017 Conference: September 26-29, 2017 INVITED SPEAKERS Moa Johansson, Chalmers University of Technology, Sweden Leonardo de Moura, Microsoft Research Katalin Bimbo, University of Alberta, Canada (joint with TABLEAUX and FroCos) Jasmin Blanchette Inria and LORIA, Nancy, France (joint with TABLEAUX and FroCos) Cesary Kaliszyk Universitaet Innsbruck, Austria (joint with TABLEAUX and FroCos) WORKSHOPS AND TUTORIALS There will be a three-day programme of four workshops and four tutorials from 23-25 September. Workshops: 12th Logical and Semantic Frameworks with Applications (LSFA 2017) Sandra Alves, Renata Wassermann, Flavio L. C. de Moura 23 and 24 September 2017 Proof eXchange for Theorem Proving (PxTP) Catherine Dubois, Bruno Woltzenlogel Paleo 23 and 24 September 2017 EPS - Encyclopedia of Proof Systems Giselle Reis, Bruno Woltzenlogel Paleo 24 and 25 September 2017 DaLi - Dynamic Logic: new trends and applications Mario Benevides, Alexandre Madeira 24 September 2017 Tutorials: General methods in proof theory for modal and substructural logics Bjoern Lellmann, Revantha Ramanayake 23 September 2017 From proof systems to complexity bounds Anupam Das 24 September 2017 Proof Compressions and the conjecture NP =3D PSPACE Lew Gordeev, Edward Hermann Haeusler 25 September 2017 PVS for Computer Scientists Cesar Munoz, Mauricio Ayala-Rincon, Mariano Moscato 25 September 2017 Details will be published in separate calls and on the conference website. PROGRAM COMMITTEE CHAIRS Mauricio Ayala-Rincon, U. Brasilia Cesar Munoz, NASA PROGRAM COMMITTEE CHAIRS Maria Alpuente, T.U. Valencia Vander Alves, U. Brasilia June Andronick, Data61, CSIRO, UNSW Jeremy Avigad, Carnegie Mellon U. Sylvie Boldo, INRIA LRI Ana Bove, Chalmers & Gothenburg U. Adam Chlipala, MIT Gilles Dowek, INRIA, ENS Cachan Aaron Dutle, NASA Amy Felty, U. Ottawa Marcelo Frias, I.T. Buenos Aires Ruben Gamboa, U. Wyoming Herman Geuvers, Radboud U. Elsa Gunter, U. Illinois U.C. John Harrison, Intel Corporation Nao Hirokawa, JAIST Matt Kaufmann, U. Texas Austin Mark Lawford, McMaster U. Andreas Lochbihler, ETH Zurich Assia Mahboubi, INRIA Panagiotis Manolios, Northeastern U. Gopalan Nadathur, U. Minnesota Keiko Nakata, SAP Potsdam Adam Naumowicz, U. Bialystok Tobias Nipkow, T.U. Munich Scott Owens, U. Kent Sam Owre, SRI Lawrence Paulson, U. Cambridge Leila Ribeiro, U.F. Rio Grande do Sul Claudio Sacerdoti Coen, U. Bologna Augusto Sampaio, U.F. Pernambuco Monika Seisenberger, Swansea U. Christian Sternagel, U. Innsbruck Sofiene Tahar, Concordia U. Christian Urban, King's College London Josef Urban, Czech T.U. Prague CONTACT INFORMATION Cesar Munoz Mauricio Ayala-Rincon itp2017(a)easychair.org http://itp2017.cic.unb.br

1 0

セミナー案内
by KASHIMA Ryo 22 Jan '17

22 Jan '17

数理論理学セミナーのお知らせ日時：1月20日(金) 17:00から場所：東京工業大学大岡山西８号館Ｗ棟10階 W1008 話者：竹内泉（産総研）題目：数学と変数概要：　これは数学の言語哲学の研究である。変数の使用は数学の言語に特有であるので変数の使用を分析することによって数学の本質に迫ることを目標とする。数学の変数の使用には幾つもの種類がある。本発表では、以下のような分類に沿って説明する。 (1)恒等式の文字 (2)方程式の未知数 (3)多項式論の変数と命題変数 (4)座標変数と確率変数 (5)独立変数と従属変数 ------ 本セミナーは定期的に東工大で開催しているものです。初めて参加を希望される方はご一報ください。 ----- 鹿島亮東京工業大学情報理工学院数理・計算科学系 kashima(a)is.titech.ac.jp

1 1

DICE-FOPARA 2017: Call for Papers
by Nao Hirokawa 18 Jan '17

18 Jan '17

皆様 ETAPS 2017 に併設されます、暗黙計算量 (ICC) とリソース解析に関する合同ワークショップ DICE-FOPARA 2017 の論文募集の案内をお送り致します。ぜひ投稿をご検討下さい。廣川 (JAIST) ------------------------------------------------------------------------------------------- 8th Workshop on Developments in Implicit Computational complExity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis (DICE-FOPARA 2017) Affiliated with ETAPS 2017 April 22 - 23, 2017, Uppsala, Sweden http://cbr.uibk.ac.at/events/dice-fopara ------------------------------------------------------------------------------------------- OBJECTIVES The first joint international workshop on Developments in Implicit Computational complExity (DICE) and FOundational and Practical Aspects of Resource Analysis (FOPARA) will be held in Uppsala, Sweden, from April 22-23, 2017 as part of ETAPS. The DICE workshop explores the area of Implicit Computational Complexity (ICC), which grew out from several proposals to use logic and formal methods to provide languages for complexity-bounded computation (e.g. Ptime, Logspace computation). It aims at studying the computational complexity of programs without referring to external measuring conditions or a particular machine model, but only by considering language restrictions or logical/computational principles entailing complexity properties. The FOPARA workshop serves as a forum for presenting original research results that are relevant to the analysis of resource (e.g. time, space, energy) consumption by computer programs. The workshop aims to bring together the researchers that work on foundational issues with the researchers that focus more on practical results. Therefore, both theoretical and practical contributions are encouraged. We also encourage papers that combine theory and practice. Given the complementarity and the synergy between these two communities, and following the successful experience of co-location of DICE-FOPARA 2015 in London at ETAPS 2015, we will hold the 8th Workshop on DICE and the 5th Workshop on FOPARA together at ETAPS 2017. TOPICS he joint international DICE-FOPARA workshop serves as a forum for presenting original and established research results that are relevant to the implicit computational complexity theory and to the analysis of resource (e.g. time, space, energy) consumption by computer programs. The workshop aims to bring together the researchers that work on foundational issues with the researchers that focus more on practical results. Therefore, both theoretical and practical contributions are encouraged, as well as papers that combine theory and practice. Areas of interest to the workshop include, but are not limited to, the following: * type systems for controlling/inferring/checking complexity * logical and machine-independent characterisations of complexity classes * logics closely related to complexity classes * linear logic * semantics of complexity-bounded computation * rewriting and termination orderings * interpretation-based methods for implicit complexity * programming languages for complexity-bounded computation * theoretical foundations of program complexity analysis * application of implicit complexity to security * resource static analysis for embedded or/and critical systems; * semantic methods to analyse resources, including quasi-interpretations; * practical applications of resource analysis; * resource analysis by term and graph rewriting. SUBMISSIONS We ask for submission of *regular papers* describing original work (10-15 pages) or *extended abstracts* (2-6 pages) presenting already published work or work in progress. With respect to regular papers, submissions will be in particular verified for originality and novelty and the manuscript must not have been published, nor is presently submitted, elsewhere. With respect of submissions of extended abstracts already published manuscripts are acceptable, but have to be within the scope of the workshop and potentially give rise to lively discussions during the meeting. After the workshop we plan to edit a special issue of DICE-FOPARA 2017 in a renown journal in conjunction with the 7th Workshop on Developments in Implicit Computational complExity (DICE 2016). Regular papers must be prepared using the LaTeX EPTCS class (see http://eptcs.org/). Accepted regular papers will appear in an EPTCS volume (application pending). Papers should be submitted electronically via the submission page: https://easychair.org/conferences/?conf=dicefopara2017 IMPORTANT DATES Paper submission February 19, 2017 Notification March 19, 2017 Final versions due March 26, 2017 Workshop date April 22-23, 2017 CONFERENCE VENUE The workshop will be held as a satellite workshop of European Joint Conferences on Theory and Practice of Software 2017 (ETAPS 2017) which takes place in Uppsala, Sweden. PROGRAM COMMITTEE Beniamino Accattoli (Paris) Guillaume Bonfante (Nancy, co-chair) Marko van Eekelen (Nijmegen) Marco Gaboardi (Buffalo) Dan Ghica (Birmingham) Clemens Grelck (Amsterdam) Charles Grellois (Bologna) Nao Hirokawa (JAIST) Jan Hoffmann (CMU) Thomas Jensen (Rennes) Björn Lisper (Mälardalen) Hans-Wolfgang Loidl (Edinburgh) Georg Moser (Innsbruck, co-chair) Kazushige Terui (Kyoto) Simon Wegener (Saarbrücken) Florian Zuleger (Vienna)

1 0

第19回プログラミングおよびプログラミング言語ワークショップ（PPL2017）論文募集/発表募集
by Isao Sasano 17 Jan '17

17 Jan '17

皆様芝浦工業大学の篠埜です。第19回プログラミングおよびプログラミング言語ワークショップ（PPL2017）のご案内です。カテゴリ2（国外既発表論文）およびカテゴリ4（サーベイ・チュートリアル発表）の発表申込締切が近づいてまいりました。カテゴリ2 発表申込締切: 2017年1月25日(水) 17:00 (JST) カテゴリ4 発表申込締切: 2017年1月25日(水) 17:00 (JST) 是非、発表申込をお願いいたします。 ====================================================================== 第19回プログラミングおよびプログラミング言語ワークショップ (PPL2017) https://ppl2017.ipl-e.ai.kyutech.ac.jp/ 論文募集/発表募集主催: 日本ソフトウェア科学会プログラミング論研究会日程: 2017年3月8日(水)～3月10日(金) 会場: 山梨県笛吹市石和温泉「華やぎの章慶山」 PPL2017は，プログラミングとプログラミング言語に関連する幅広い分野の研究者・技術者・学生が一堂に会し，最新の研究成果の発表や，新たな研究課題の提案・討論・アイディア交換を行うことを目的とした，合宿形式の研究集会です．プログラミング方法論，プログラミング言語の理論・設計・実装などに関する研究発表を，カテゴリ別に幅広く募集します．カテゴリ1: 国内外で未発表の論文の発表カテゴリ2: 国際会議・学術雑誌等で既発表であるが，国内では未発表の研究の紹介カテゴリ3: ポスター・デモ発表(既発表・未発表の別を問いません) カテゴリ4: サーベイ・チュートリアル発表(既発表・未発表の別を問いません) カテゴリ1の採択論文の中から，特に独創的なアイディアや顕著な成果を含むものに対して論文賞を授与する予定です．また全論文発表と全ポスター・デモのなかから，聴衆の投票によりそれぞれ，最も優秀な論文プレゼンテーションには発表賞(一般の部，学生の部，既受賞者は除く)，最も優秀なポスター・デモにはポスター賞を授与する予定です．カテゴリ1 (国内外未発表論文) ---------------------------- 完成した理論やシステムの研究発表のみならず，萌芽的なアイディアや問題点の提示等も歓迎します．発展途上の研究内容も積極的に採録する方針です(ただし，PPLでの発表として相応しくないと判断される場合は，この限りではありません)．また，カテゴリ1で発表された研究については，会場での討議や査読コメントをもとにその完成度を高め，将来の学術雑誌・国際会議等での業績に結び付けることを奨励しています．そのため，予稿集の配布は参加者のみへの限定的なものとします．カテゴリ1で発表された研究のうち，PPL2017プログラム委員会により優れていると認められたものは， PPL2017終了後(2017年4月下旬予定)，「コンピュータソフトウェア」誌のPPL2017推薦論文としての投稿が可能です．推薦論文は，PPLプログラム委員が引き続き査読を行うことによる，迅速な査読プロセスを特長としています．カテゴリ2 (国外既発表論文) -------------------------- 査読付の国際会議または学術雑誌等で既発表であるが国内では未発表である研究を紹介する場です．採録決定済みの研究も含みます．PPLへの関連をもとに採否を判定いたしますが，申し込み多数の場合はプログラム委員会で選考致します．カテゴリ3 (ポスター・デモ発表) ------------------------------ 2時間程度のセッション内でのポスター発表またはデモ発表です．既発表・未発表の別を問いません．PPLへの関連をもとに採否を判定いたしますが，申し込み多数の場合はプログラム委員会で選考致します．会場の状況により，ポスターの常設展示を可能とします．ショートプレゼンテーションは行いません．カテゴリ4 (サーベイ・チュートリアル発表) ---------------------------------------- 研究動向の紹介(発表者の研究も含む) や分野間の相互理解と参加者の知識の底上げとなる発表を募集します．既発表・未発表の別を問いません．発表後，発表スライドをPPL2017ウェブページ上にて公開して頂く予定です．PPLへの関連，著者の研究発表実績，トピックや切り口の興味深さをもとに，プログラム委員会で選考致します．招待講演 -------- 神谷年洋（島根大学教授）原田康徳（合同会社デジタルポケット代表）以上お二方の招待講演を予定しております．なお，PPL2017の終了は昼頃〜夕刻を予定しています． ====================================================================== 投稿・発表申込要領すべてのカテゴリの投稿・発表について，次のURLから申し込んでください． https://easychair.org/conferences/?conf=ppl2017 申込にあたってはEasyChairのアカウントが必要です．4つのカテゴリそれぞれに対する申込要領の詳細は以下の通りです．申し込み時にEasychairで入力する氏名，所属の情報はプログラム作成に用いますので，参加者の便宜を考慮し，日本語が良いと考えられる場合には日本語での入力をお願い致します．最新の情報は上記ウェブページでご確認ください．カテゴリ1 (国内外未発表論文) --------------------------- 投稿手続きは2段階です．発表申込を行った上で論文提出を行ってください．発表申込締切: 2016年12月21日(水) 17:00 (JST) 著者名，所属，論文タイトル，論文概要(日本語300〜400字程度もしくは英語200 words 程度)，キーワード(3つ以上)を提出してください．論文提出締切: 2017年1月11日(水) 17:00 (JST) 10ページ程度(最大15ページ，参考文献を含む)の論文(日本語もしくは英語，PDF形式．PPL2017ウェブページにて指定のスタイルファイルを利用のこと)を提出してください．最大ページ数を超える付録は投稿版に入れて構いませんが，最終原稿においては削除してもらいます．著者のweb page等においてソースコードや実験データなどを載せて引用しても構いません．最大ページ数を超える付録やweb page等の情報については査読において考慮されない場合もあります．採否通知：2017年2月3日(金) 最終原稿締切: 2017年2月16日(木) 採録された論文の最終原稿の提出方法は，採否通知にてお知らせいたします． (注) 採録された論文等著作物は，日本ソフトウェア科学会著作権規定にもとづいて利用されますので，予めご確認ください． (注) 投稿論文と類似の論文を，他の会議(予稿集を出版するもの)・論文誌などに同時投稿する場合は，査読の有無に関わらず，その旨を発表申込および論文提出の際に明記してください．PPLでは同時投稿の事実のみをもって論文を不採録とすることはありませんが，採否の決定に利用する場合があります(他の会議との重複を避けるため，発表内容についての条件付採録とすることもあります)．カテゴリ2 (国外既発表論文) ------------------------- 発表申込時に採録が決定している国際会議および国際学術雑誌等の発表論文が対象です．理論系だけではなく実装系の論文の投稿も歓迎いたします．発表申込締切: 2017年1月25日(水) 17:00 (JST) 原論文(ページ数不問，PDF形式)と論文概要(テキスト形式)を，著者名，所属，論文タイトル，キーワード(3つ以上)と併せて提出してください．論文概要にて，原論文の出典(発表会議名，掲載済／予定の別等を含む)についても明記してください．採否通知：2017年2月6日(月) カテゴリ3 (ポスター・デモ発表) ----------------------------- ポスター発表またはデモ発表(あるいは両方)を募集いたします．発表申込締切: 2017年2月8日(水) 17:00 (JST) 希望する発表形態を明記して著者名，所属，発表タイトル，発表概要 (200〜300字程度)，キーワード(3つ以上)を提出してください．発表形態については発表タイトル(Title欄)の最後の部分に括弧（）に入れて，「ポスター」「デモ」「ポスター・デモ」のいずれかを記載してください．採否通知：2017年2月15日(水) カテゴリ4 (サーベイ・チュートリアル発表) --------------------------------------- 発表申込締切: 2017年1月25日(水) 17:00 (JST) 著者名，所属，発表タイトル，キーワード(3つ以上)，発表概要(3ページ以内，PDF形式．目的，カバーする話題，想定する聴衆，必要な知識の記述を含むもの)を提出してください．採否通知：2017年2月6日(月) ====================================================================== 問い合わせ先 ppl2017-oc(a)ipl-e.ai.kyutech.ac.xn--jp()-753c9gpa1b92cqcsg7jrh5d1ix122cxi0h ppl2017-pc-chairs(a)ipl-e.ai.kyutech.ac.xn--jp(/)-m53d8hra6b05cmntd6e6b1719ok76b ====================================================================== プログラム委員会青谷知幸 (東京工業大学) 浅田和之 (東京大学) Reynald Affeldt (産業技術総合研究所) 稲葉一浩 (Google) 上野雄大 (東北大学) 菊池健太郎 (東北大学) 小宮常康 (電気通信大学) 篠埜功 (芝浦工業大学) 佐藤亮介 (東京大学) 首藤一幸 (東京工業大学) 末永幸平 (京都大学) 宋剛秀 (神戸大学) 千葉滋 (東京大学) 土屋達弘 (大阪大学) 中野圭介 (電気通信大学) 鍋島英知 (山梨大学) 番原睦則 (神戸大学) 前田敦司 (筑波大学) 松田一孝 (東北大学) 森畑明昌 (東京大学) 八杉昌宏 (九州工業大学) 組織委員会江本健斗 (九州工業大学) [組織委員長] 平石拓 (京都大学) 佐藤重幸 (高知工科大学) 海野広志 (筑波大学) 対馬かなえ (国立情報学研究所) 塚田武志 (東京大学) 篠埜功 (芝浦工業大学) [プログラム共同委員長] 番原睦則 (神戸大学) [プログラム共同委員長] ====================================================================== 篠埜　功 -- Isao Sasano <sasano(a)sic.shibaura-it.ac.jp>

1 0

FSCD 2017: CFP
by Takahito Aoto 10 Jan '17

10 Jan '17

皆様，国際会議FSCD 2017の論文募集をご案内致します． RTAとTLCAを融合・発展させた国際会議(2回目)です．ぜひ投稿をご検討いただければ幸いです． --- 青戸等人(新潟大学) ============================================================== CALL FOR PAPERS Second International Conference on Formal Structures for Computation and Deduction (FSCD'17) 3 -- 6 September 2017, Oxford, UK (co-located with ICFP 2017) http://www.cs.ox.ac.uk/conferences/fscd2017/ FSCD (http://fscdconference.org/) covers all aspects of formal structures for computation and deduction from theoretical foundations to applications. Building on two communities, RTA (Rewriting Techniques and Applications) and TLCA (Typed Lambda Calculi and Applications), FSCD embraces their core topics and broadens their scope to closely related areas in logics, proof theory and new emerging models of computation such as quantum computing or homotopy type theory. ========================================================================== IMPORTANT DATES All deadlines are midnight anywhere-on-earth (AoE) and are firm; late submissions will not be considered. Abstract Deadline: 7 April 2017 Submission Deadline: 14 April 2017 Rebuttal: 29--31 May 2017 Notification: 14 June 2017 Camera-Ready: 7 July 2017 ========================================================================== Suggested, but not exclusive, list of topics for submission are: 1. Calculi: Lambda calculus * Concurrent calculi * Logics * Rewriting systems * Proof theory * Type theory and logical frameworks 2. Methods in Computation and Deduction: Type systems * Induction and coinduction * Matching, unification, completion, and orderings * Strategies * Tree automata * Model checking * Proof search and theorem proving * Constraint solving and decision procedures 3. Semantics: Operational semantics * Abstract machines * Game Semantics * Domain theory and categorical models * Quantitative models 4. Algorithmic Analysis and Transformations of Formal Systems: Type Inference and type checking * Abstract Interpretation * Complexity analysis and implicit computational complexity * Checking termination, confluence, derivational complexity and related properties * Symbolic computation 5. Tools and Applications: Programming and proof environments * Verification tools * Libraries for proof assistants and interactive theorem provers * Case studies in proof assistants and interactive theorem provers * Certification PUBLICATION The proceedings will be published as an electronic volume in the Leibniz International Proceedings in Informatics (LIPIcs) of Schloss Dagstuhl. All LIPIcs proceedings are open access. SUBMISSION GUIDELINES Submissions can be made in two categories. Regular research papers are limited to 15 pages and must present original research which is unpublished and not submitted elsewhere. System descriptions are limited to 10 pages and must describe a working system which has not been published or submitted elsewhere. Submissions must be formatted using the LIPIcs style files and submitted via EasyChair. Complete instructions on submitting a paper can be found on the conference web site. SPECIAL ISSUES Full versions of several accepted papers, to be selected by the program committee, will be invited for submission to a special issue of Logical Methods in Computer Science. BEST PAPER AWARD BY JUNIOR RESEARCHERS The program committee will consider declaring this award to a paper in which all authors are junior researchers: a junior researcher is a person who is either a student or whose PhD award date is less than three years from the first day of the meeting. PROGRAM COMMITTEE CHAIR Dale Miller, Inria Saclay & LIX <fscd17(a)easychair.org> PROGRAM COMMITTEE Andreas Abel, Gothenburg Univ. Elvira Albert, Complutense Madrid Maria Alpuente, TU Valencia Takahito Aoto, Niigata Univ. Zena Ariola, Univ. Oregon Federico Aschieri, TU Wien Stefano Berardi, Univ. Turin Lars Birkedal, Aarhus Univ. Filippo Bonchi, CNRS, ENS Lyon Pierre Clairambault, CNRS, ENS Lyon Ugo Dal Lago, Univ. Bologna Herman Geuvers, Radboud Univ. Silvia Ghilezan, Univ. Novi Sad Juergen Giesl, RWTH Aachen Hugo Herbelin, Inria Paris Jan Hoffmann, Carnegie Mellon Deepak Kapur, Univ. New Mexico Paul Blain Levy, Univ. Birmingham Paulo Oliva, QMUL, London Vincent van Oostrom, Univ. Innsbruck Daniela Petrisan, LIAFA, Paris Femke van Raamsdonk, VU Univ. Amsterdam Grigore Rosu, Univ. Illinois Albert Rubio, UPC-BarcelonaTech Paula Severi, Univ. Leicester Bas Spitters, Aarhus Univ. Aaron Stump, Univ. Iowa Kazushige Terui, Kyoto Univ. Rene Thiemann, Univ. Innsbruck Sophie Tison, Lille Univ. CONFERENCE CHAIR Sam Staton, Univ. of Oxford WORKSHOP CHAIR Jamie Vicary, Univ. of Oxford PUBLICITY CHAIR Sandra Alves, Univ. of Porto FSCD STEERING COMMITTEE T. Altenkirch (Univ. Nottingham), S. Alves (Univ. Porto), G. Dowek, (Inria), S. Escobar (Univ. Politecnica de Valencia), M. Fernandez (King's College London), H. Herbelin (Inria), D. Kesner (Univ. Paris), N. Kobayashi (Univ. Tokyo), L. Ong (Chair, Univ. Oxford), B. Pientka (McGill Univ.), R. Thiemann (Univ. Innsbruck).

1 0

第４回山陰基礎論・解析学研究集会の御案内
by horihata 05 Jan '17

05 Jan '17

Logic-ml 各位米子高専の堀畑です。今週末、８日（日）と９日（月）に米子で件名の研究会を開催いたします。参加自由ですので、お気軽に御参加頂ければ幸いです。懇親会もありますので、研究会に参加頂ける方は堀畑までご連絡ください。詳細はホームページをご参照ください： https://sites.google.com/site/yonagonctmath/home/slas2017 参加者２６名。発表者は以下１２名（敬称略）。阿部敏一　（茨城大学）池上大祐　（東京電機大）石原哉　　（ＪＡＩＳＴ）薄葉季路　（早稲田大学）沖坂祥平　（東北大学）熊本真一郎（神戸大学）鈴木信行　（静岡大学）冨樫瑠美　（長岡高専）根元多佳子（ＪＡＩＳＴ）藤原誠　（早稲田大学）三浦毅　（新潟大学）横山啓太　（ＪＡＩＳＴ）以上です。よろしくお願いします。堀畑佳宏 -- 米子工業高等専門学校教養教育科・数学 E-mail: horihata(a)yonago-k.ac.jp

1 0

Announcement 「論理と数学の哲学―論証の哲学に向けて」Workshop “Philosophy of logic and Mathematics
by Mitsuhiro Okada 19 Dec '16

19 Dec '16

次の共同ワークショップを企画しておりますので、ご案内させて頂きます。　　　　　　　　　　　　　　　　　　　　　　　　　慶応義塾大学岡田光弘 ************************************************************************** 「論理と数学の哲学―論証の哲学に向けて」日仏ワークショップ Workshop “Philosophy of logic and Mathematics – Towards Philosophy of Proofs (本会合情報　https://abelard.flet.keio.ac.jp/seminar/frjp17jan.html) *************************************************************************** 日時：2017年1月12日(木)-13日(金)、参加自由、事前登録なし。 Date: Jan 12th Thursday-13th Friday, 2017 場所：慶應義塾大学三田キャンパス南館地下4階ディスタンスラーニングルーム Place: Distance Learning Room (B4F), South Building, Mita Campus of Keio University (キャンパスマップ https://www.keio.ac.jp/en/maps/mita.html 13番の建物です。/ Building #13 on this map.) 論理と数学の哲学についての日仏ワークショップを案内させて頂きます。特に、証明(論証)の哲学に向けたテーマを議論する予定です。フランス側招待講演者：ピエール・ワーグナー Pierre Wagner (パリ第１大学哲学科兼パリ科学史・科学哲学研究所) マルコ・パンツァ Marco Panza (パリ第１大学哲学科兼パリ科学史・科学哲学研究所) アンドリュー・アラナ Andrew Arana (パリ第１大学哲学科兼パリ科学史・科学哲学研究所) アルベルト・ナイボ Alberto Naibo (パリ第１大学哲学科兼パリ科学史・科学哲学研究所) 日本側招待講演者：岡本賢吾 Kengo Okamoto (首都大学東京哲学分野) 喜田浩平 Kohei Kida (慶應義塾大学文学部仏文学専攻) 峯島宏次 Koji Mineshima (お茶の水女子大学シミュレーション科学教育研究センター) 藤原誠 Makoto Fujiwara (早稲田大学高等研究所) 他の講演者：秋吉亮太 Ryota Akiyoshi (早稲田大学高等研究所) 高橋優太 Yuta Takahashi (名古屋大学・日本学術振興会) 西牟田祐樹 Yuki Nishimuta (慶應義塾大学後期博士課程) 岡田光弘 Mitsuhiro Okada (慶應義塾大学文学部哲学専攻) その他。　）暫定版プログラム： (プログラムの最新情報は https://abelard.flet.keio.ac.jp/seminar/frjp17jan.html をご覧ください。 1月12日(木) 9:45 受付開始 10:00 開会挨拶岡田光弘秋吉亮太 Mitsuhiro Okada and Ryota Akiyoshi 10:05 Introduction：ワークショップ趣旨説明岡田光弘ピエール・ワーグナー Mitsuhiro Okada and Pierre Wagner 10:20 ピエール・ワーグナー Pierre Wagner　“The normative character of logic” 11:20 峯島宏次 Koji Mineshima “Diagrams, proofs, and natural reasoning with “most"” 12:00 昼食休憩 13:30 喜田浩平 Kohei Kida “Une approche argumentative du sens (An argumentative approach to meaning)” 14:30 マルコ・パンツァ Marco Panza “The logicality of Frege’s definition of real numbers” 15:30 小休憩 15:50 岡本賢吾 Kengo Okamoto “Mathematical Necessity and Possibility from Kant to Frege and Wittgenstein” 16:50 アンドリュー・アラナ Andrew Arana “ “Purity and content” - the purity constraint, in the case of arithmetical proofs” 17:50 小休憩 18:10-18:40 ディスカッション (Discussion with French Speakers) 1月13日(金) 9:45 受付開始 10:00 アルベルト・ナイボ Alberto Naibo “Harmony, Stability and Identity: An intensional account in proof-theoretic semantics” 11:00 藤原誠 Makoto Fujiwara “Reverse mathematics and uniform provability” 11:40 昼食休憩 13:10 秋吉亮太 Ryota Akiyoshi “On Brouwer’s argument of bar induction” 13:40 高橋優太 Yuta Takahashi “Phase Semantic Framework for Proof-Terms as Proof-Theoretic Semantics” 14:10 小休憩 14:30 西牟田祐樹岡田光弘 Yuki Nishimuta and Mitsuhiro Okada On introduction rules of generalized connectives with proof-nets and substructural logics 岡田光弘 Mitsuhiro Okada “Normativity, normality and normalizability of proofs” 15:30 小休息 15:40-16:20 Discussion with Invited Speakers. 共同オーガナイザー：秋吉亮太 (早稲田大学高等研究所) 岡田光弘 (慶應義塾大学文学部哲学専攻) 高橋優太 (名古屋大学・日本学術振興会) , , 共催：慶應義塾論理と感性のグロル研究センター,次世代研究推進プロジェクト, CNRS-フランス国立科学研究センター連絡先：東京都港区三田２－１５－４５、慶應義塾大学文学部岡田光弘研究室メール：logic(a)abelard.flet.keio.ac.jp ----------------------------------------------

1 0

Fwd: 松山 TGSA セミナーのお知らせ（１２月２６日）
by Hiroshi Fujita 19 Dec '16

19 Dec '16

Logic-MLの皆さま、今月26日開催の松山TGSAセミナーのお知らせを転送いたします。藤田博司（愛媛大学大学院理工学研究科） -------- Forwarded Message -------- Subject: 松山 TGSA セミナーのお知らせ（１２月２６日） Date: Sat, 17 Dec 2016 18:29:24 +0000 From: Dmitri SHAKHMATOV <dmitri.shakhmatov(a)dmitri.math.sci.ehime-u.ac.jp> To: fujita.hiroshi.mh(a)ehime-u.ac.jp CC: dmitri.shakhmatov(a)dmitri.math.sci.ehime-u.ac.jp 皆様、「Matsuyama Seminar on Topology, Geometry, Set Theory and their Applications」（松山TGSAセミナー）のお知らせです。 ***** 第27回のセミナー日時: 2016年12月26日（月） 16:45〜17:45 場所: 愛媛大学理学部2号館2階，大演習室 (201号室) 講演者: Franklin D. Tall (University of Toronto, Canada) 題目: Definable versions of Menger's conjecture 概要： A topological space is Menger if, given a countable sequence of open covers, there is a finite selection from each of them, so that the union of the selections is a cover. The Menger property lies strictly between sigma-compactness and Lindelofness. In 1925 Hurewicz conjectured that Menger was equivalent to sigma-compact in metrizable spaces. This was refuted by Chaber and Pol in 2002. However, for spaces which are in some sense ``definable", the situation is less clear. Our principal result (joint with S. Todorcevic and S. Tokgoz) is that Hurewicz' Conjecture for projective sets of reals is equiconsistent with an inaccessible cardinal. In general topological spaces, the situation is more complicated, but we have a variety of similar results for co-analytic spaces, i.e. spaces having Cech-Stone remainders which are continuous images of the space of irrationals. 講演終了後に交流会を予定しています。交流会にご参加いただける方はシャクマトフ<dmitri.shakhmatov(a)ehime-u.ac.jp>までご一報お願い致します。以上、よろしくお願い申し上げます。世話人（五十音順）井上友喜尾國新一シャクマトフディミトリ野倉嗣紀平出耕一平田浩一藤田博司山内貴光 --- ウェブページ： http://www.math.sci.ehime-u.ac.jp/MTGSA.ja.html

1 0

第19回プログラミングおよびプログラミング言語ワークショップ（PPL2017）論文募集/発表募集
by Isao Sasano 18 Dec '16

18 Dec '16

皆様芝浦工業大学の篠埜です。第19回プログラミングおよびプログラミング言語ワークショップ（PPL2017）のご案内です。カテゴリー1の発表申込締切が近づいてまいりました。発表申込締切: 2016年12月21日(水) 17:00 (JST) 論文提出締切: 2017年1月11日(水) 17:00 (JST) 是非論文のご投稿をお願いいたします。 ====================================================================== 第19回プログラミングおよびプログラミング言語ワークショップ (PPL2017) https://ppl2017.ipl-e.ai.kyutech.ac.jp/ 論文募集/発表募集主催: 日本ソフトウェア科学会プログラミング論研究会日程: 2017年3月8日(水)～3月10日(金) 会場: 山梨県笛吹市石和温泉「華やぎの章慶山」 PPL2017は，プログラミングとプログラミング言語に関連する幅広い分野の研究者・技術者・学生が一堂に会し，最新の研究成果の発表や，新たな研究課題の提案・討論・アイディア交換を行うことを目的とした，合宿形式の研究集会です．プログラミング方法論，プログラミング言語の理論・設計・実装などに関する研究発表を，カテゴリ別に幅広く募集します．カテゴリ1: 国内外で未発表の論文の発表カテゴリ2: 国際会議・学術雑誌等で既発表であるが，国内では未発表の研究の紹介カテゴリ3: ポスター・デモ発表(既発表・未発表の別を問いません) カテゴリ4: サーベイ・チュートリアル発表(既発表・未発表の別を問いません) カテゴリ1の採択論文の中から，特に独創的なアイディアや顕著な成果を含むものに対して論文賞を授与する予定です．また全論文発表と全ポスター・デモのなかから，聴衆の投票によりそれぞれ，最も優秀な論文プレゼンテーションには発表賞(一般の部，学生の部，既受賞者は除く)，最も優秀なポスター・デモにはポスター賞を授与する予定です．カテゴリ1 (国内外未発表論文) ---------------------------- 完成した理論やシステムの研究発表のみならず，萌芽的なアイディアや問題点の提示等も歓迎します．発展途上の研究内容も積極的に採録する方針です(ただし，PPLでの発表として相応しくないと判断される場合は，この限りではありません)．また，カテゴリ1で発表された研究については，会場での討議や査読コメントをもとにその完成度を高め，将来の学術雑誌・国際会議等での業績に結び付けることを奨励しています．そのため，予稿集の配布は参加者のみへの限定的なものとします．カテゴリ1で発表された研究のうち，PPL2017プログラム委員会により優れていると認められたものは， PPL2017終了後(2017年4月下旬予定)，「コンピュータソフトウェア」誌のPPL2017推薦論文としての投稿が可能です．推薦論文は，PPLプログラム委員が引き続き査読を行うことによる，迅速な査読プロセスを特長としています．カテゴリ2 (国外既発表論文) -------------------------- 査読付の国際会議または学術雑誌等で既発表であるが国内では未発表である研究を紹介する場です．採録決定済みの研究も含みます．PPLへの関連をもとに採否を判定いたしますが，申し込み多数の場合はプログラム委員会で選考致します．カテゴリ3 (ポスター・デモ発表) ------------------------------ 2時間程度のセッション内でのポスター発表またはデモ発表です．既発表・未発表の別を問いません．PPLへの関連をもとに採否を判定いたしますが，申し込み多数の場合はプログラム委員会で選考致します．会場の状況により，ポスターの常設展示を可能とします．ショートプレゼンテーションは行いません．カテゴリ4 (サーベイ・チュートリアル発表) ---------------------------------------- 研究動向の紹介(発表者の研究も含む) や分野間の相互理解と参加者の知識の底上げとなる発表を募集します．既発表・未発表の別を問いません．発表後，発表スライドをPPL2017ウェブページ上にて公開して頂く予定です．PPLへの関連，著者の研究発表実績，トピックや切り口の興味深さをもとに，プログラム委員会で選考致します．招待講演 -------- 神谷年洋（島根大学教授）原田康徳（合同会社デジタルポケット代表）以上お二方の招待講演を予定しております．なお，PPL2017の終了は昼頃〜夕刻を予定しています． ====================================================================== 投稿・発表申込要領すべてのカテゴリの投稿・発表について，次のURLから申し込んでください． https://easychair.org/conferences/?conf=ppl2017 申込にあたってはEasyChairのアカウントが必要です．4つのカテゴリそれぞれに対する申込要領の詳細は以下の通りです．申し込み時にEasychairで入力する氏名，所属の情報はプログラム作成に用いますので，参加者の便宜を考慮し，日本語が良いと考えられる場合には日本語での入力をお願い致します．最新の情報は上記ウェブページでご確認ください．カテゴリ1 (国内外未発表論文) --------------------------- 投稿手続きは2段階です．発表申込を行った上で論文提出を行ってください．発表申込締切: 2016年12月21日(水) 17:00 (JST) 著者名，所属，論文タイトル，論文概要(日本語300〜400字程度もしくは英語200 words 程度)，キーワード(3つ以上)を提出してください．論文提出締切: 2017年1月11日(水) 17:00 (JST) 10ページ程度(最大15ページ，参考文献を含む)の論文(日本語もしくは英語，PDF形式．PPL2017ウェブページにて指定のスタイルファイルを利用のこと)を提出してください．最大ページ数を超える付録は投稿版に入れて構いませんが，最終原稿においては削除してもらいます．著者のweb page等においてソースコードや実験データなどを載せて引用しても構いません．最大ページ数を超える付録やweb page等の情報については査読において考慮されない場合もあります．採否通知：2017年2月3日(金) 最終原稿締切: 2017年2月16日(木) 採録された論文の最終原稿の提出方法は，採否通知にてお知らせいたします． (注) 採録された論文等著作物は，日本ソフトウェア科学会著作権規定にもとづいて利用されますので，予めご確認ください． (注) 投稿論文と類似の論文を，他の会議(予稿集を出版するもの)・論文誌などに同時投稿する場合は，査読の有無に関わらず，その旨を発表申込および論文提出の際に明記してください．PPLでは同時投稿の事実のみをもって論文を不採録とすることはありませんが，採否の決定に利用する場合があります(他の会議との重複を避けるため，発表内容についての条件付採録とすることもあります)．カテゴリ2 (国外既発表論文) ------------------------- 発表申込時に採録が決定している国際会議および国際学術雑誌等の発表論文が対象です．理論系だけではなく実装系の論文の投稿も歓迎いたします．発表申込締切: 2017年1月25日(水) 17:00 (JST) 原論文(ページ数不問，PDF形式)と論文概要(テキスト形式)を，著者名，所属，論文タイトル，キーワード(3つ以上)と併せて提出してください．論文概要にて，原論文の出典(発表会議名，掲載済／予定の別等を含む)についても明記してください．採否通知：2017年2月6日(月) カテゴリ3 (ポスター・デモ発表) ----------------------------- ポスター発表またはデモ発表(あるいは両方)を募集いたします．発表申込締切: 2017年2月8日(水) 17:00 (JST) 希望する発表形態を明記して著者名，所属，発表タイトル，発表概要 (200〜300字程度)，キーワード(3つ以上)を提出してください．発表形態については発表タイトル(Title欄)の最後の部分に括弧（）に入れて，「ポスター」「デモ」「ポスター・デモ」のいずれかを記載してください．採否通知：2017年2月15日(水) カテゴリ4 (サーベイ・チュートリアル発表) --------------------------------------- 発表申込締切: 2017年1月25日(水) 17:00 (JST) 著者名，所属，発表タイトル，キーワード(3つ以上)，発表概要(3ページ以内，PDF形式．目的，カバーする話題，想定する聴衆，必要な知識の記述を含むもの)を提出してください．採否通知：2017年2月6日(月) ====================================================================== 問い合わせ先 ppl2017-oc(a)ipl-e.ai.kyutech.ac.xn--jp()-753c9gpa1b92cqcsg7jrh5d1ix122cxi0h ppl2017-pc-chairs(a)ipl-e.ai.kyutech.ac.xn--jp(/)-m53d8hra6b05cmntd6e6b1719ok76b ====================================================================== プログラム委員会青谷知幸 (東京工業大学) 浅田和之 (東京大学) Reynald Affeldt (産業技術総合研究所) 稲葉一浩 (Google) 上野雄大 (東北大学) 菊池健太郎 (東北大学) 小宮常康 (電気通信大学) 篠埜功 (芝浦工業大学) 佐藤亮介 (東京大学) 首藤一幸 (東京工業大学) 末永幸平 (京都大学) 宋剛秀 (神戸大学) 千葉滋 (東京大学) 土屋達弘 (大阪大学) 中野圭介 (電気通信大学) 鍋島英知 (山梨大学) 番原睦則 (神戸大学) 前田敦司 (筑波大学) 松田一孝 (東北大学) 森畑明昌 (東京大学) 八杉昌宏 (九州工業大学) 組織委員会江本健斗 (九州工業大学) [組織委員長] 平石拓 (京都大学) 佐藤重幸 (高知工科大学) 海野広志 (筑波大学) 対馬かなえ (国立情報学研究所) 塚田武志 (東京大学) 篠埜功 (芝浦工業大学) [プログラム共同委員長] 番原睦則 (神戸大学) [プログラム共同委員長] ====================================================================== 篠埜　功 -- Isao Sasano <sasano(a)sic.shibaura-it.ac.jp>

1 0

PhDs in Logic IX, Bochum (Germany), 2-4 May 2017
by Hitoshi Omori 16 Dec '16

16 Dec '16

(Apologies for multiple copies) Call for submissions: PhDs in Logic IX, Bochum, 2nd - 4th May 2017 PhDs in Logic is an annual graduate conference organised by local graduate students. This interdisciplinary conference welcomes contributions to various topics in mathematical logic, philosophical logic, and logic in computer science. It involves tutorials by established researchers as well as short (20 minutes) presentations by PhD students, master students and first-year postdocs on their research. We are happy to announce that the ninth edition of PhDs in Logic will take place at the Ruhr University Bochum, Germany, during 2nd - 4th May 2017. Confirmed tutorial speakers are : Petr Cintula (Czech Academy of Sciences) María Manzano (University of Salamanca) João Marcos (University of Natal) Gabriella Pigozzi (Paris Dauphine University) Christian Straßer (Ruhr-University Bochum) Heinrich Wansing (Ruhr-University Bochum) Abstract submission: PhD students, master students and first-year postdocs in logic from disciplines, that include but are not limited to philosophy, mathematics and computer science are invited to submit an extended abstract on their research. Submitted abstracts should be between 2 and 3 pages, including the relevant references. Each abstract will be anonymously reviewed by the scientific committee. Accepted abstracts will be presented by their authors in a 20-minute presentation during the conference. The deadline for abstract submission is 2nd February 2017. Please submit your blinded abstract via: https://easychair.org/conferences/?conf=phdsinlogic9 For more information please see: http://www.ruhr-uni-bochum.de/phdsinlogicix Local organisers: Christopher Badura, AnneMarie Borg, Jesse Heyninck and Daniel Skurt

1 0

Talk by Nao Hirokawa (22 Dec 11:00-)
by Tetsuya Sato 15 Dec '16

15 Dec '16

京都大学数理解析研究所の佐藤です。 12月22日11:00から、北陸先端科学技術大学院大学‎の廣川直先生に以下の講演をしていただくことになりましたので、ご連絡いたします。どうぞお気軽にお越しください。 ========== Time: 11:00-12:00, 22 Dec, 2016 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) http://www.kyoto-u.ac.jp/ja/access/campus/map6r_y.htm (34番の建物) Speaker: Nao Hirokawa (Japan Advanced Institute of Science and Technology) Title: Basic Normalization Abstract: The Normalization Theorem (O'Donnell 1977) states that for every left-normal orthogonal rewrite system, the leftmost outermost strategy reduces any term to the normal form if it exists. Although the theorem ensures the normalization property of important systems such as Combinatory Logic, the left-normality condition rules out most of functional programs. We revisit the problem to seek a solution for normalization of the leftmost outermost strategy. This work is based on joint work with Aart Middeldorp and Georg Moser.

1 0

Nagoya Set Theory seminar
by 吉信康夫 15 Dec '16

15 Dec '16

みなさま：吉信＠名古屋大学情報科学です。重複して受け取られた方はご容赦ください。下記の要領で名古屋集合論セミナーを開催します。奮ってご参加下さい。日時：12月22日(木)15:30-17:00 場所：名古屋大学大学院情報科学研究科棟322号室講演者：Franklin D. Tall (トロント大学) 題目：Definable versions of Hurewicz’ conjecture アブストラクト： A topological space is Menger if, given a countable sequence of open covers, there is a finite selection from each of them, so that the union of the selections is a cover. The Menger property lies strictly between \sigma-compactness and Lindelofness. In 1925 Hurewicz conjectured that Menger was equivalent to \sigma-compact in metrizable spaces. This was refuted by Chaber and Pol in 2002. However, for spaces which are in some sense "definable", the situation is less clear. Our principal result (joint with S. Todorcevic and S. Tokgoz) is that Hurewicz' Conjecture for projective sets of reals is equiconsistent with an inaccessible cardinal. In general topological spaces, the situation is more complicated, but we have a variety of similar results for co-analytic spaces, i.e. spaces having Cech-Stone remainders which are continuous images of the space of irrationals.

1 0

GaLoP 2017: Call for Papers
by Ichiro Hasuo 03 Dec '16

03 Dec '16

(Apologies for multiple copies) 12th Workshop on Games for Logic and Programming Languages (GaLoP 2017) Uppsala, Sweden, 22-23 April http://www.gamesemantics.org GaLoP is an annual international workshop on game-semantic models for logics and programming languages and their applications. This is an informal workshop that welcomes work in progress, overviews of more extensive work, programmatic or position papers and tutorials. GaLoP XII will be held in Uppsala, Sweden, on 22-23 April 2017 as a satellite workshop of ETAPS (http://www.etaps.org/). Areas of interest include: * Games and other interaction-based denotational and operational models; * Game-based program analysis and verification; * Logics for games and games for logics; * Algorithmic aspects of game semantics; * Categorical aspects of game semantics; * Programming languages and full abstraction; * Higher-order automata and Petri nets; * Geometry of interaction; * Ludics; * Epistemic game theory; * Logics of dependence and independence; * Computational linguistics; * Games and multi-valued logics. There will be no formal proceedings but the possibility of a special issue in a journal will be considered. (The 2005, 2008, 2011 and 2014 workshops led to special issues in Annals of Pure and Applied Logic.) // Submission Instructions // Please submit an abstract (up to one page, excluding bibliography) of your proposed talk on the EasyChair submission page below. Supplementary material may be submitted, and will be considered at the discretion of the PC. https://easychair.org/conferences/?conf=galop2017 // Important Dates // Submission: 30 January 2017 Notification: 20 February 2017 Workshop: 22-23 April 2017 // Tutorial // Lauri Hella // Invited talks // Andreas Blass Dan Ghica Erich Grädel Martin Hyland (TBC) // Programme Committee // Dietmar Berwanger Esfandiar Haghverdi Juha Kontinen (Co-Chair) Jim Laird Marina Lenisa (Co-Chair) Pierre Lescanne Luke Ong Jouko Väänänen

1 0

Talk by Bakh Khoussainov and Toru Takisaka (1 Dec 11:00-)
by Tetsuya Sato 24 Nov '16

24 Nov '16

京都大学数理解析研究所の佐藤です。 12月1日11:00から、オークランド大学のBakh Khoussainov先生と京都大学数理解析研究所の滝坂透氏の両名に以下のjoint talkをしていただくことになりましたので、ご連絡いたします。どうぞお気軽にお越しください。 ========== Time: 11:00-12:00, 1 Dec, 2016 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) http://www.kyoto-u.ac.jp/ja/access/campus/map6r_y.htm (34番の建物) Speakers: Bakh Khoussainov (University of Auckland) and Toru Takisaka (RIMS, Kyoto university) Title: On large scale geometries of infinite strings Abstract: Motivated by notions in geometric group theory, we introduce the concept of large scale geometry on infinite strings. Informally, two infinite strings have the same large scale geometry if there is a bi-Lipschitz map between both strings with a finite uniform distortion. We call these maps quasi-isometric maps. Introduction of large scale geometries poses several questions. The first question is related to understanding the partial order induced by quasi-isometric maps on large scale geometries of strings. We prove that there is the greatest large scale geometry and infinitely many minimal large scale geometries. The second is related to understanding the quasi-isometric maps on various classes of strings. The third question address the issue of building quasi-isometric maps between computable infinite strings. We show that the problem is Sigma_3-complete. The fourth question is about understanding sets of large scale geometries given some tools (e.g. Buchi automata) that describe sets of strings. We provide an efficient algorithm that gives a full description of large scale geometries of strings accepted by such automata. Finally, the fifth question asks if it is possible to associate with every large scale geometry an algebraic structure that describes the geometry uniquely. Here we use tools of geometric group theory by invoking the notion of asymptotic cone.

1 0

JAIST Logic Seminar Series
by Hajime Ishihara 22 Nov '16

22 Nov '16

皆様ウィーン工科大学のMatthias Baaz先生の講演のお知らせです。どうぞふるってご参加ください。問合せ先：石原　哉北陸先端科学技術大学院大学情報科学系 e-mail: ishihara(a)jaist.ac.jp ----------------------------------------------- * JAIST Logic Seminar Series * Date: Tuesday 6 December, 2016, 15:20-17:00 Place: JAIST, Collaboration room 6 (I-57g) (Access: http://www.jaist.ac.jp/english/location/access.html) Speaker: Matthias Baaz (Vienna University of Technology) (joint work with Juan.P.Aguilera) Title: Unsound inferences make proofs shorter Abstract: We give examples of calculi that extend Gentzen's sequent calculus LK in such a way that (i) derivations lead only to true sequents (ii) cut free proofs may be non-elementary shorter than cut free LK proofs.

1 0

第19回プログラミングおよびプログラミング言語ワークショップ（PPL2017）論文募集/発表募集
by Isao Sasano 19 Nov '16

19 Nov '16

皆様第19回プログラミングおよびプログラミング言語ワークショップ（PPL2017）のご案内です。投稿・発表申込の詳細について記載しています。是非論文のご投稿をお願いいたします。 ====================================================================== 第19回プログラミングおよびプログラミング言語ワークショップ (PPL2017) https://ppl2017.ipl-e.ai.kyutech.ac.jp/ 論文募集/発表募集主催: 日本ソフトウェア科学会プログラミング論研究会日程: 2017年3月8日(水)～3月10日(金) 会場: 山梨県笛吹市石和温泉「華やぎの章慶山」 PPL2017は，プログラミングとプログラミング言語に関連する幅広い分野の研究者・技術者・学生が一堂に会し，最新の研究成果の発表や，新たな研究課題の提案・討論・アイディア交換を行うことを目的とした，合宿形式の研究集会です．プログラミング方法論，プログラミング言語の理論・設計・実装などに関する研究発表を，カテゴリ別に幅広く募集します．カテゴリ1: 国内外で未発表の論文の発表カテゴリ2: 国際会議・学術雑誌等で既発表であるが，国内では未発表の研究の紹介カテゴリ3: ポスター・デモ発表(既発表・未発表の別を問いません) カテゴリ4: サーベイ・チュートリアル発表(既発表・未発表の別を問いません) カテゴリ1の採択論文の中から，特に独創的なアイディアや顕著な成果を含むものに対して論文賞を授与する予定です．また全論文発表と全ポスター・デモのなかから，聴衆の投票によりそれぞれ，最も優秀な論文プレゼンテーションには発表賞(一般の部，学生の部，既受賞者は除く)，最も優秀なポスター・デモにはポスター賞を授与する予定です．カテゴリ1 (国内外未発表論文) ---------------------------- 完成した理論やシステムの研究発表のみならず，萌芽的なアイディアや問題点の提示等も歓迎します．発展途上の研究内容も積極的に採録する方針です(ただし，PPLでの発表として相応しくないと判断される場合は，この限りではありません)．また，カテゴリ1で発表された研究については，会場での討議や査読コメントをもとにその完成度を高め，将来の学術雑誌・国際会議等での業績に結び付けることを奨励しています．そのため，予稿集の配布は参加者のみへの限定的なものとします．カテゴリ1で発表された研究のうち，PPL2017プログラム委員会により優れていると認められたものは， PPL2017終了後(2017年4月下旬予定)，「コンピュータソフトウェア」誌のPPL2017推薦論文としての投稿が可能です．推薦論文は，PPLプログラム委員が引き続き査読を行うことによる，迅速な査読プロセスを特長としています．カテゴリ2 (国外既発表論文) -------------------------- 査読付の国際会議または学術雑誌等で既発表であるが国内では未発表である研究を紹介する場です．採録決定済みの研究も含みます．PPLへの関連をもとに採否を判定いたしますが，申し込み多数の場合はプログラム委員会で選考致します．カテゴリ3 (ポスター・デモ発表) ------------------------------ 2時間程度のセッション内でのポスター発表またはデモ発表です．既発表・未発表の別を問いません．PPLへの関連をもとに採否を判定いたしますが，申し込み多数の場合はプログラム委員会で選考致します．会場の状況により，ポスターの常設展示を可能とします．ショートプレゼンテーションは行いません．カテゴリ4 (サーベイ・チュートリアル発表) ---------------------------------------- 研究動向の紹介(発表者の研究も含む) や分野間の相互理解と参加者の知識の底上げとなる発表を募集します．既発表・未発表の別を問いません．発表後，発表スライドをPPL2017ウェブページ上にて公開して頂く予定です．PPLへの関連，著者の研究発表実績，トピックや切り口の興味深さをもとに，プログラム委員会で選考致します．招待講演 -------- 神谷年洋（島根大学教授）原田康徳（合同会社デジタルポケット代表）以上お二方の招待講演を予定しております．なお，PPL2017の終了は昼頃〜夕刻を予定しています． ====================================================================== 投稿・発表申込要領すべてのカテゴリの投稿・発表について，次のURLから申し込んでください． https://easychair.org/conferences/?conf=ppl2017 申込にあたってはEasyChairのアカウントが必要です．4つのカテゴリそれぞれに対する申込要領の詳細は以下の通りです．申し込み時にEasychairで入力する氏名，所属の情報はプログラム作成に用いますので，参加者の便宜を考慮し，日本語が良いと考えられる場合には日本語での入力をお願い致します．最新の情報は上記ウェブページでご確認ください．カテゴリ1 (国内外未発表論文) --------------------------- 投稿手続きは2段階です．発表申込を行った上で論文提出を行ってください．発表申込締切: 2016年12月21日(水) 17:00 (JST) 著者名，所属，論文タイトル，論文概要(日本語300〜400字程度もしくは英語200 words 程度)，キーワード(3つ以上)を提出してください．論文提出締切: 2017年1月11日(水) 17:00 (JST) 10ページ程度(最大15ページ，参考文献を含む)の論文(日本語もしくは英語，PDF形式．PPL2017ウェブページにて指定のスタイルファイルを利用のこと)を提出してください．最大ページ数を超える付録は投稿版に入れて構いませんが，最終原稿においては削除してもらいます．著者のweb page等においてソースコードや実験データなどを載せて引用しても構いません．最大ページ数を超える付録やweb page等の情報については査読において考慮されない場合もあります．採否通知：2017年2月3日(金) 最終原稿締切: 2017年2月16日(木) 採録された論文の最終原稿の提出方法は，採否通知にてお知らせいたします． (注) 採録された論文等著作物は，日本ソフトウェア科学会著作権規定にもとづいて利用されますので，予めご確認ください． (注) 投稿論文と類似の論文を，他の会議(予稿集を出版するもの)・論文誌などに同時投稿する場合は，査読の有無に関わらず，その旨を発表申込および論文提出の際に明記してください．PPLでは同時投稿の事実のみをもって論文を不採録とすることはありませんが，採否の決定に利用する場合があります(他の会議との重複を避けるため，発表内容についての条件付採録とすることもあります)．カテゴリ2 (国外既発表論文) ------------------------- 発表申込時に採録が決定している国際会議および国際学術雑誌等の発表論文が対象です．理論系だけではなく実装系の論文の投稿も歓迎いたします．発表申込締切: 2017年1月25日(水) 17:00 (JST) 原論文(ページ数不問，PDF形式)と論文概要(テキスト形式)を，著者名，所属，論文タイトル，キーワード(3つ以上)と併せて提出してください．論文概要にて，原論文の出典(発表会議名，掲載済／予定の別等を含む)についても明記してください．採否通知：2017年2月6日(月) カテゴリ3 (ポスター・デモ発表) ----------------------------- ポスター発表またはデモ発表(あるいは両方)を募集いたします．発表申込締切: 2017年2月8日(水) 17:00 (JST) 希望する発表形態を明記して著者名，所属，発表タイトル，発表概要 (200〜300字程度)，キーワード(3つ以上)を提出してください．発表形態については発表タイトル(Title欄)の最後の部分に括弧（）に入れて，「ポスター」「デモ」「ポスター・デモ」のいずれかを記載してください．採否通知：2017年2月15日(水) カテゴリ4 (サーベイ・チュートリアル発表) --------------------------------------- 発表申込締切: 2017年1月25日(水) 17:00 (JST) 著者名，所属，発表タイトル，キーワード(3つ以上)，発表概要(3ページ以内，PDF形式．目的，カバーする話題，想定する聴衆，必要な知識の記述を含むもの)を提出してください．採否通知：2017年2月6日(月) ====================================================================== 問い合わせ先 ppl2017-oc(a)ipl-e.ai.kyutech.ac.xn--jp()-753c9gpa1b92cqcsg7jrh5d1ix122cxi0h ppl2017-pc-chairs(a)ipl-e.ai.kyutech.ac.xn--jp(/)-m53d8hra6b05cmntd6e6b1719ok76b ====================================================================== プログラム委員会青谷知幸 (東京工業大学) 浅田和之 (東京大学) Reynald Affeldt (産業技術総合研究所) 稲葉一浩 (Google) 上野雄大 (東北大学) 菊池健太郎 (東北大学) 小宮常康 (電気通信大学) 篠埜功 (芝浦工業大学) 佐藤亮介 (東京大学) 首藤一幸 (東京工業大学) 末永幸平 (京都大学) 宋剛秀 (神戸大学) 千葉滋 (東京大学) 土屋達弘 (大阪大学) 中野圭介 (電気通信大学) 鍋島英知 (山梨大学) 番原睦則 (神戸大学) 前田敦司 (筑波大学) 松田一孝 (東北大学) 森畑明昌 (東京大学) 八杉昌宏 (九州工業大学) 組織委員会江本健斗 (九州工業大学) [組織委員長] 平石拓 (京都大学) 佐藤重幸 (高知工科大学) 海野広志 (筑波大学) 対馬かなえ (国立情報学研究所) 塚田武志 (東京大学) 篠埜功 (芝浦工業大学) [プログラム共同委員長] 番原睦則 (神戸大学) [プログラム共同委員長] ====================================================================== 篠埜　功 -- Isao Sasano <sasano(a)sic.shibaura-it.ac.jp>

1 0

1st Call for Papers of The Sixth International Conference on Logic, Rationality and Interaction (LORI-VI): September 11-14, 2017, Hokkaido University, Sapporo, Japan
by Katsuhiko Sano 17 Nov '16

17 Nov '16

皆様、北海道大学の佐野勝彦と申します。来年度9月1日から14日に北海道、札幌で開催される会議 LORI-VI についてご案内いたします。ぜひ奮ってご投稿ください。佐野勝彦 --------------------------------------------------------------------------------------- 1st Call for Papers The Sixth International Conference on Logic, Rationality and Interaction (LORI-VI) September 11-14, 2017, Hokkaido University, Sapporo, Japan Submission deadline: March 31, 2017 The International Conference on Logic, Rationality and Interaction (LORI) conference series aims at bringing together researchers working on a wide variety of logic-related topics that concern the understanding of rationality and interaction. The series aims at fostering a view of Logic as an interdisciplinary endeavour, and supports the creation of an East-Asian community of interdisciplinary researchers. We invite submission of contributed papers on any of the broad themes of LORI series; specific topics of interest include, but are not limited to, formal approaches to - agency - argumentation and agreement - belief representation - cooperation - belief revision and belief merging - strategic reasoning - games - decision making and planning - knowledge and action - epistemology - dynamics of informational attitudes - speech acts - knowledge representation - interaction - norms and normative systems - natural language - rationality - philosophy and philosophical logic - preference and utility - social choice - probability and uncertainty - social interaction - intentions, plans, and goals Submitted papers should be at most 12 pages long, with one additional page for references, in PDF format following the Springer LNCS style. Please submit your paper by Friday March 31, 2017, via EasyChair ( http://easychair.org/conferences/?conf=lori6 ). Accepted papers will be collected as a volume in the FoLLI Series on Logic, Language and Information, and authors may be later invited to submit extended versions of their papers in a special issue of a prestigious journal. For detailed conference information and registration, please visit the website at http://golori.org/lori2017/ . Invited Speakers: Mike Dunn (Indiana University, U.S.A.) Alan Hájek (Australian National University) Nina Gierasimczuk (Technical University of Denmark) Willemien Kets (Northwestern University, U.S.A) Sara Negri (University of Helsinki, Finland) Hiroakira Ono (JAIST, Japan) PC Chairs: Alexandru Baltag (University of Amsterdam, The Netherlands) Jeremy Seligman (University of Auckland, New Zealand) Conference Organiser: Tomoyuki Yamada (Hokkaido University, Japan) Sponsors: LORI, Hokkaido University Contacts: Programme: The PC Chairs mailto:lori6@easychair.org Conference: Tomoyuki Yamada mailto:tomoyuki.s.yamada@gmail.com

1 1

Banquet of RIMS Set Theory Workshop 2016
by Teruyuki YORIOKA 11 Nov '16

11 Nov '16

みなさま静岡大学の依岡です。 RIMS Set Theory Workshop 2016 の懇親会のご案内です。 11月30日（水）18時30分から黄桜じろく亭京都府京都市中京区木屋町通三条下ル一筋目東南角　黄桜木屋町ビル4階 5,000円参加をご希望の方は11月25日（金）までに依岡にメールでお知らせください。皆様のご参加をお待ちしております。なお、11月30日（水）の午後は遠足を予定しています。計画が決まりましたらウェブサイトで公開します。こちらも合わせてご参加ください。 RIMS Set Theory Workshop 2016 http://www.ipc.shizuoka.ac.jp/~styorio/rims16/

1 0

CAPEレクチャーのご案内 (Zach Weber, Nov 14, 2016)
by Hitoshi Omori 02 Nov '16

02 Nov '16

CAPEレクチャーのご案内 (重複してお受け取りの際はご容赦ください。) 以下の通り講演会が開催されます。皆さまのお越しをお待ちしております。 ------------------- 日時：2016年11月14日(月) 16:30--18:00 場所：京都大学文学部校舎１階会議室話者：Prof. Zach Weber (University of Otago) 言語：英語題目： Paraconsistent set theory and inconsistent mathematics 概要： Paraconsistent set theory takes as axiomatic the `naive' comprehension principle that every collection forms a set. The infamous paradoxes are then just theorems. The background logic that makes this coherently possible is substantially weaker than classical logic; but the expressive power of the theory is substantially stronger than classical set theory. With these competing forces in the background, we will look at two interrelated goals: Recapture -- reassurance that nothing too important mathematically is lost Expansion -- where new insights and results are gained, studying novel mathematical objects not visible with any other theory I will survey the development of paraconsistent set theory, showing how the basic properties of ordinal and cardinal numbers can be established, along with new perspectives on `proper classes', the axiom of choice, and the continuum hypothesis. With this foundation, I will mention some further work in inconsistent mathematics: from computability theory, arithmetic, analysis, and topology. Throughout I will call attention to the challenges that this research program faces. ------------------- 大森仁

1 0

homotopy type theory
by logic＠math.tsukuba.ac.jp 30 Oct '16

30 Oct '16

> 圏論に関して質問があります。 > 種々の圏の存在はどのようにして主張されますか？ > > 例えば、公理的集合論では、論理式f(x),集合Xに関して、Xの元xでf(x)を満たすもの > から成る集合{x \in X|f(x)}が存在することが分出公理によって言えますが、圏論に > おいても、圏の存在を主張する公理群が定められていますか？ > 上記のような質問をいただいていますが、これはこの質問者以外の広い範囲の方に関心があることと思われますので、ここにお答えします。質問者の名前等は削除してあります。まず質問を Homotopy type theoryはZFCにかわる数学の基礎づけになるという話であるが、集合論はたとえばComprehensionのような豊かな構成原理をもっているが、HTTはどうなのか？と変形させていただきます。まずHTTのなかではn-typeというHierarchyが定義されます。ｎは−２以上の整数です。これはHomotopy theoryから借用された概念で、n-typeというのはｎを越える次元ではhomotopicalにはtrivialであることを意味します。Homotopy theoryの言葉づかいで言うならば、ｎを越える次元のhomotopy groupsはすべてtrivialであることを意味します。０-typeがいわゆるsetで、ここに話を限定するならば comprehensionをはじめとする集合論的構成はだいたいそのまま行えます。一般にはdependent function typeやdependent pair typeという構成原理を最初から内臓していますが、これだけではもちろん足りません。HTTがもつ強力な構成原理はinductionで、特に higher inductionが重要な役割を演じます。計算機言語のCOQや AGDAは通常にinductionを組み込んでいますが、higher inductive typesはまだ持っておりません。少しslogan的な言い方を許していただければ、 inductive typesはfree monadsに、higher inductive typesはmonadsの表現に対応します。 Inductiveな構成のいい例はCauchy realsの構成です。自然数から有理数を作るのは、古典的な話とあまりかわりません。それで有理数から実数を作るには、Dedekindのやり方とCauchyのやり方がありますが、後者の構成をinductiveにやるとどうなるかが、 https://homotopytypetheory.org/book/ の１１．３節に縷説されています。あるいはcirclesやspheresやsuspensionsはどのようにinductiveに構成されるか、第６章に縷説されています。是非ご覧になってください。にしむら筑波大学数学追伸：オマケです。手持無沙汰な折にどうぞ。 https://www.youtube.com/watch?v=VY01dVHvlFE

2 2

Re: [logic-ml] [jssst-ppl] 上級研究員・研究員・RA・インターン募集のお知らせ
by koba＠kb.is.s.u-tokyo.ac.jp 28 Oct '16

28 Oct '16

皆様、東京大学の小林です。下記のアナウンスに便乗して宣伝させていただきます。科研費基盤S「高階モデル検査の深化と発展」でも特任研究員を募集しておりますので http://www-kb.is.s.u-tokyo.ac.jp/~koba/hmc/call-for-postdoc.txt ご検討ください。（こちらではRAは公募しておりません。博士課程に入っていただければ似た待遇でのRAの雇用は可能かと思います）小林直樹東京大学大学院情報理工学系研究科コンピュータ科学専攻〒113-0033 東京都文京区本郷7-3-1 Phone: 03-5841-4124 Fax: 03-5841-4124 email: koba(a)is.s.u-tokyo.ac.jp From: Ichiro Hasuo <i.hasuo(a)acm.org> Subject: [jssst-ppl] 上級研究員・研究員・RA・インターン募集のお知らせ Date: Fri, 28 Oct 2016 14:28:18 +0900 > みなさま（重複投稿ご容赦ください）， > > 今年の10月から開始した ERATO プロジェクトで，上級研究員・研究員・RA > およびインターンを募集しております．プロジェクトの研究内容，職務内容，および応募・問い合わせについては > http://www-mmm.is.s.u-tokyo.ac.jp/~ichiro/ERATO_MMSD_JobDescr.html > をご覧ください．どうかよろしくお願いいたします． > > 蓮尾一郎 > http://www-mmm.is.s.u-tokyo.ac.jp/~ichiro/ > _______________________________________________ > jssst-ppl mailing list > jssst-ppl(a)fos.kuis.kyoto-u.ac.jp > http://www.fos.kuis.kyoto-u.ac.jp/cgi-bin/mailman/listinfo/jssst-ppl

1 0

24th WoLLIC 2017 - Call for Papers
by 小野寛晰 24 Oct '16

24 Oct '16

WoLLIC 2017 24th Workshop on Logic, Language, Information and Computation July 18-21, 2017 University College London (UCL), London, UK SCIENTIFIC SPONSORSHIP Interest Group in Pure and Applied Logics (IGPL) The Association for Logic, Language and Information (FoLLI) Association for Symbolic Logic (ASL) European Association for Theoretical Computer Science (EATCS) European Association for Computer Science Logic (EACSL) ACM Special Interest Group on Logic and Computation (ACM-SIGLOG) (TBC) Sociedade Brasileira de Computação (SBC) Sociedade Brasileira de Lógica (SBL) ORGANISATION Department of Computer Science, University College London, London, UK School of Electronic Engineering and Computer Science, Queen Mary College, London, UK Centro de Informática, Universidade Federal de Pernambuco, Brazil HOSTED BY Department of Computer Science, University College London, London, UK CALL FOR PAPERS WoLLIC is an annual international forum on inter-disciplinary research involving formal logic, computing and programming theory, and natural language and reasoning. Each meeting includes invited talks and tutorials as well as contributed papers. The twenty-fourth WoLLIC will be held at the School of Electronic Engineering and Computer Science, Queen Mary College, London, UK, from July 18th to 21st, 2017. It is sponsored by the Association for Symbolic Logic (ASL), the Interest Group in Pure and Applied Logics (IGPL), the The Association for Logic, Language and Information (FoLLI), the European Association for Theoretical Computer Science (EATCS), the European Association for Computer Science Logic (EACSL), the Sociedade Brasileira de Computação (SBC), and the Sociedade Brasileira de Lógica (SBL). PAPER SUBMISSION Contributions are invited on all pertinent subjects, with particular interest in cross-disciplinary topics. Typical but not exclusive areas of interest are: foundations of computing and programming; novel computation models and paradigms; broad notions of proof and belief; proof mining, type theory, effective learnability; formal methods in software and hardware development; logical approach to natural language and reasoning; logics of programs, actions and resources; foundational aspects of information organization, search, flow, sharing, and protection; foundations of mathematics; philosophy of mathematics; philosophical logic. Proposed contributions should be in English, and consist of a scholarly exposition accessible to the non-specialist, including motivation, background, and comparison with related works. Articles should be written in the LaTeX format of LNCS by Springer (see authors instructions at http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0 <http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0>). They must not exceed 12 pages, with up to 5 additional pages for references and technical appendices. The paper's main results must not be published or submitted for publication in refereed venues, including journals and other scientific meetings. It is expected that each accepted paper be presented at the meeting by one of its authors. Papers must be submitted electronically at the WoLLIC 2017 EasyChair website. (Please go to http://wollic.org/wollic2017/instructions.html <http://wollic.org/wollic2017/instructions.html> for instructions.) A title and single-paragraph abstract should be submitted by Mar 14, 2017, and the full paper by Mar 21, 2017 (firm date). Notifications are expected by Apr 22, 2017, and final papers for the proceedings will be due by May 6, 2017 (firm date). PROCEEDINGS The proceedings of WoLLIC 2017, including both invited and contributed papers, will be published in advance of the meeting as a volume in Springer's LNCS series. In addition, abstracts will be published in the Conference Report section of the Logic Journal of the IGPL, and selected contributions will be published as a special post-conference WoLLIC 2017 issue of a scientific journal (to be confirmed). INVITED SPEAKERS Hazel Brickhurst (Bristol) (TBC) Ofra Magidor <http://users.ox.ac.uk/~ball1646/> (Oxford University, UK) Peter O'Hearn (UCL) (TBC) Nicole Schweikardt (Humboldt) (TBC) Fan Yang <https://sites.google.com/site/fanyanghp/> (Delft University, The Netherlands) Boris Zilber <https://people.maths.ox.ac.uk/zilber/> (Oxford University, UK) STUDENT GRANTS ASL sponsorship of WoLLIC 2017 will permit ASL student members to apply for a modest travel grant (deadline: May 1st, 2017). See http://www.aslonline.org/studenttravelawards.html <http://www.aslonline.org/studenttravelawards.html> for details. IMPORTANT DATES Mar 14, 2017: Paper title and abstract deadline Mar 21, 2017: Full paper deadline Apr 22, 2017: Author notification May 6, 2017: Final version deadline (firm) PROGRAMME COMMITTEE Matthias Baaz <http://www.logic.tuwien.ac.at/staff/baaz/home.html> (University of Technology, Vienna, Austria) John Baldwin <http://homepages.math.uic.edu/~jbaldwin/> (University of Illinois at Chicago, USA) Dana Bartozová <http://www.math.toronto.edu/bartosov/> (Universidade de São Paulo, Brazil) Agata Ciabattoni <https://www.logic.at/staff/agata/> (University of Technology, Vienna, Austria) Walter Dean <http://www2.warwick.ac.uk/fac/soc/philosophy/people/dean/> (University of Warwick, UK) Erich Grädel <https://logic.rwth-aachen.de/~graedel/> (RWTH Aachen, Germany) Volker Halbach <http://users.ox.ac.uk/~sfop0114/> (University of Oxford, UK) Juliette Kennedy <http://www.math.helsinki.fi/logic/people/juliette.kennedy/> (Helsinki University, Finland) (Chair) Dexter Kozen <http://www.cs.cornell.edu/~kozen/> (Cornell University, USA) Janos Makowsky <http://www.cs.technion.ac.il/~janos/> (Technion - Israel Institute of Technology, Israel) Larry Moss <http://www.indiana.edu/~iulg/moss/> (indiana University, USA) Alessandra Palmigiano <http://www.appliedlogictudelft.nl/alessandra-palmigiano/> (Delft University, The Netherlands) Mehrnoosh Sadrzadeh <http://www.eecs.qmul.ac.uk/people/view/33472/dr-mehrnoosh-sadrzadeh> (Queen Mary, UK) Sonja Smets <http://sonja.tiddlyspot.com/#HOME> (Amsterdam University, The Netherlands) Asger Törnquist <http://www.math.ku.dk/~asgert/> (Københavns Universitet, Denmark) Rineke Verbrugge <http://www.rinekeverbrugge.nl/> (University of Groningen, The Netherlands) Andrés Villaveces <https://avillavecesn.net/> (Universidad Nacional, Colombia) Philip Welch <http://www.maths.bris.ac.uk/~mapdw/> (University of Bristol, UK) STEERING COMMITTEE Samson Abramksy, Johan van Benthem, Anuj Dawar, Joe Halpern, Wilfrid Hodges, Ulrich Kohlenbach, Daniel Leivant, Leonid Libkin, Angus Macintyre, Luke Ong, Hiroakira Ono, Valeria de Paiva, Ruy de Queiroz, Jouko Väänänen. ORGANISING COMMITTEE Alexandra Silva <http://www.alexandrasilva.org/#/main.html> (Univ College London, UK) (Local co-chair) Mehrnoosh Sadrzadeh <http://www.eecs.qmul.ac.uk/people/view/33472/dr-mehrnoosh-sadrzadeh> (Queen Mary, UK) (Local co-chair) Paulo Oliva <http://www.eecs.qmul.ac.uk/~pbo/> (Queen Mary, UK) James Brotherston <http://www0.cs.ucl.ac.uk/staff/J.Brotherston/> (Univ College London, UK) Anjolina G. de Oliveira <http://www.cin.ufpe.br/~ago> (U Fed Pernambuco) Ruy de Queiroz <http://www.cin.ufpe.br/~ruy> (U Fed Pernambuco) (co-chair) FURTHER INFORMATION Contact one of the Co-Chairs of the Organising Committee. WEB PAGE http://wollic.org/wollic2017/ <http://wollic.org/wollic2017/>

1 0

RIMS研究集会「無限組合せ論と強制法理論」
by Teruyuki YORIOKA 24 Oct '16

24 Oct '16

みなさま静岡大学の依岡です。 11月28日（月）から12月1日（木）まで京都大学数理解析研究所で開催されます RIMS研究集会「無限組合せ論と強制法理論」のプログラムを下記のウェブサイトで公開しています。 http://www.ipc.shizuoka.ac.jp/~styorio/rims16/ 11月30日（水）に懇親会などを予定しています。懇親会などの予定はウェブサイトで公開します。みなさまぜひご参加ください。

1 0

第51回MLG数理論理学研究集会（10/27-30箱根）
by Kazushige TERUI 21 Oct '16

21 Oct '16

みなさま第51回MLG数理論理学研究集会のプログラムが確定しましたのでご案内申し上げます。宿泊を伴わない参加は無料ですので、お気軽にお越しください。 Web Page: http://www.kurims.kyoto-u.ac.jp/~terui/mlg2016.html Program: http://www.kurims.kyoto-u.ac.jp/~terui/mlg2016.pdf 照井一成 ------------------------------------------ Kazushige TERUI Research Institute for Mathematical Sciences, Kyoto University. Kitashirakawa Oiwakecho, Sakyo-ku, Kyoto 606-8502, JAPAN. Phone: +81-75-753-7235 Fax: +81-75-753-7276 terui(a)kurims.kyoto-u.ac.jp http://www.kurims.kyoto-u.ac.jp/~terui/

1 0

PEPM 2017: Call for Posters
by Ryosuke SATO 21 Oct '16

21 Oct '16

皆様、（複数受け取られた場合はご容赦ください。）東京大学の佐藤亮介です。 PEPM 2017 のポスター募集のお知らせです．投稿の締め切りは11月8日（火）です．是非，投稿をご検討ください． -- 東京大学大学院情報理工学系研究科佐藤亮介 ryosuke(a)kb.is.s.u-tokyo.ac.jp ------------------------------------------------------------------- CALL FOR POSTERS Workshop on PARTIAL EVALUATION AND PROGRAM MANIPULATION (PEPM 2017) PEPM 2017 information: http://conf.researchr.org/home/PEPM-2017 Submissions: https://pepm17.hotcrp.com/ Paris, France, January 16th - 17th, 2017 (co-located with POPL 2017) PEPM is the premier forum for discussion of semantics-based program manipulation. The first ACM SIGPLAN PEPM symposium took place in 1991, and meetings have been held in affiliation with POPL every year since 2006. PEPM 2017 will be based on a broad interpretation of semantics-based program manipulation, reflecting the expanded scope of PEPM in recent years beyond the traditionally covered areas of partial evaluation and specialization. Posters ------- In order to maintain the dynamic and interactive nature of PEPM, we solicit submission of posters. Poster submissions are 2-page articles in ACM Proceedings style that present preliminary work (see "Submission guidelines" below for more details). If accepted, the work will be presented as part of an interactive poster session at PEPM. Scope ----- Topics of interest for PEPM 2017 include, but are not limited to: * Program and model manipulation techniques such as: supercompilation, partial evaluation, fusion, on-the-fly program adaptation, active libraries, program inversion, slicing, symbolic execution, refactoring, decompilation, and obfuscation. * Program analysis techniques that are used to drive program/model manipulation such as: abstract interpretation, termination checking, binding-time analysis, constraint solving, type systems, automated testing and test case generation. * Techniques that treat programs/models as data objects including metaprogramming, generative programming, embedded domain-specific languages, program synthesis by sketching and inductive programming, staged computation, and model-driven program generation and transformation. * Application of the above techniques including case studies of program manipulation in real-world (industrial, open-source) projects and software development processes, descriptions of robust tools capable of effectively handling realistic applications, benchmarking. Examples of application domains include legacy program understanding and transformation, DSL implementations, visual languages and end-user programming, scientific computing, middleware frameworks and infrastructure needed for distributed and web-based applications, embedded and resource-limited computation, and security. This list of categories is not exhaustive, and we encourage submissions describing applications of semantics-based program manipulation techniques in new domains. If you have a question as to whether a potential submission is within the scope of the workshop, please contact the programme chairs. Submission guidelines --------------------- * Posters should describe work relevant to the PEPM community, and must not exceed 2 pages in ACM Proceedings style. We invite poster submissions that present early work not yet ready for submission to a conference or journal, identify new research problems, showcase tools and technologies developed by the author(s), or describe student research projects. If accepted, the work will be presented as part of an interactive poster session at PEPM. At least one author of each accepted contribution must attend the workshop and present the work. Student participants with accepted poster papers can apply for a SIGPLAN PAC grant to help cover travel expenses and other support. PAC also offers other support, such as for child-care expenses during the meeting or for travel costs for companions of SIGPLAN members with physical disabilities, as well as for travel from locations outside of North America and Europe. For details on the PAC programme, see its web page. Publication ----------- Posters will appear along with accepted papers in formal proceedings published by ACM Press and in the ACM Digital Library. Keynote ------- Neil Jones (DIKU) will give the PEPM keynote talk, titled Compiling Untyped Lambda Calculus to Lower-level Code by Game Semantics and Partial Evaluation Submission ---------- Posters should be submitted electronically via HotCRP. https://pepm17.hotcrp.com/ Authors using LaTeX to prepare their submissions should use the new improved SIGPLAN proceedings style, and specifically the sigplanconf.cls 9pt template. Important Dates --------------- * Poster submission : Tuesday 8th November 2016 * Author notification : Friday 18th November 2016 * Camera ready : Monday 28th November 2016 * Workshop : Monday 16th - Tuesday 17th January 2017 The proceedings will be published 2 weeks pre-conference. AUTHORS TAKE NOTE: The official publication date is the date the proceedings are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of your conference. The official publication date affects the deadline for any patent filings related to published work. (For those rare conferences whose proceedings are published in the ACM Digital Library after the conference is over, the official publication date remains the first day of the conference.). PEPM'17 Programme Committee --------------------------- Elvira Albert (Complutense University of Madrid, Spain) Don Batory (University of Texas at Austin, USA) Martin Berger (University of Sussex, UK) Sebastian Erdweg (TU Delft, Netherlands) Andrew Farmer (Facebook, USA) Matthew Flatt (University of Utah, USA) John Gallagher (Roskilde University, Denmark) Robert Glück (DIKU, Denmark) Jurriaan Hage (Utrecht University, Netherlands) Zhenjiang Hu (National Institute of Informatics, Japan) Yukiyoshi Kameyama (University of Tsukuba, Japan) Ilya Klyuchnikov (Facebook, UK) Huiqing Li (EE, UK) Annie Liu (Stony Brook University, USA) Markus Püschel (ETH Zurich, Switzerland) Ryosuke SATO (University of Tokyo, Japan) Sven-Bodo Scholz (Heriot-Watt University, UK) Ulrik Schultz (co-chair) (University of Southern Denmark) Ilya Sergey (University College London, UK) Chung-chieh Shan (Indiana University, USA) Tijs van der Storm (Centrum Wiskunde & Informatica, Netherlands) Jeremy Yallop (co-chair) (University of Cambridge, UK)

1 0

Kobe Colloquium on Logic, Statistics and Informatics, October 13, 2016
by Hirotaka Kikyo 06 Oct '16

06 Oct '16

Kobe Colloquium on Logic, Statistics and Informatics 以下の要領でコロキウムを開催します。 (2重に受け取られた方はご容赦願います) 日時: 2016/10/13 (木) 3:00pm - 4:30pm 場所: 神戸大学六甲台第2キャンパス自然科学総合研究棟3号館421室講演者： Kaisa Kangas （神戸大・システム情報/Helsinki U.）題目： Group Configuration for Quasiminimal Classes 交通：阪急六甲駅またはJR六甲道駅から神戸市バス36系統「鶴甲団地」行きに乗車，「神大本部工学部前」停留所下車，徒歩すぐ． http://www.kobe-u.ac.jp/guid/access/rokko/rokkodai-dai2.html 連絡先：桔梗宏孝 kikyo(a)kobe-u.ac.jp

1 0

Talk by Adam Prenosil (13 Oct 11:00-)
by Tetsuya Sato 05 Oct '16

05 Oct '16

京都大学数理解析研究所の佐藤です。 10月13日11:00から、チェコ科学アカデミーのAdam Prenosil氏に以下の講演をしていただくことになりましたので、ご連絡いたします。どうぞお気軽にお越しください。 ========== Time: 11:00-12:00, 13 Oct, 2016 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) http://www.kyoto-u.ac.jp/ja/access/campus/map6r_y.htm (34番の建物) Speaker: Adam Prenosil (Czech Academy of Sciences) Title: Classical proof theory, non-classically Abstract: We present an approach to cut elimination in classical logic which appeals to elimination rules.rather than to induction on cut rank and which works equally well for proofs from a non-empty set of sequential premises. As an illustration of the benefits of accepting elimination rules as an integral part of the sequent calculus for classical logic, we use the calculus with elimination rules to provide a particularly simple syntactic proof of a recent non-classical refinement of Craig's interpolation theorem due to Milne. This approach, while non-standard, is in fact natural when we view classical logic as part of the family of super-Belnap logics, that is, extensions of the four-valued Belnap-Dunn logic. We shall therefore start by introducing this family proof-theoretically as the logics which retain the structural and logical rules of classical logic, but relax Identity and Cut (as opposed to substructural logics, which retain Identity and Cut but relax the structural rules of classical logic).

1 0

ワークショップ「2階論理の意味論」
by Makoto Kikuchi 30 Sep '16

30 Sep '16

皆様，以下の要領でワークショップを開催しますのでお知らせします．神戸大学菊池誠日時：2016年11月5日（土）15:45〜17:45 場所：東京大学駒場キャンパス1号館1階108室題目：ワークショップ「 2階論理の意味論」　　科学基礎論学会2016年度秋の研究例会（非会員は参加費1,000円が必要です）　　科学基礎論学会 Web Page：http://phsc.jp オーガナイザ：菊池誠（神戸大学）提題者：　佐藤智哉　2階論理的妥当性の新しい意味論的特徴づけ　池上大祐（東京電機大学）2階論理とブール値2階論理　新井敏康（千葉大学）竹内の基本予想の意味論的証明ワークショップ趣旨：「すべて」や「存在」という量化の対象が「個物」に限定される形式的論理が 1階論理，「個物と概念」であるのが2階論理，そして「個物，概念，概念上の概念，…」のすべてであるのが高階論理である．1階論理が形式的論理の現在の事実上の標準理論である．ただし，BoolosやShapiro，Vaananenの哲学的な議論やFriedmanの逆数学の研究プログラムにも見られるように，今でも2階論理それ自身や2階論理の上で展開される公理系に関心が持たれている． 2階論理の意味論を考える際に問題になるのが「概念」を対象とする2階量化子の解釈である．2階量化子の解釈は「個物全体の集合」の部分集合族を与えることで定められる．最も自然な2階論理の意味論は2階量化子の解釈を与える部分集合族を「個物全体の集合」の冪集合とすることで定められるが，この意味論では通常の公理と推論規則で2階論理の完全性定理は成り立たない． Henkinは2階量化子の解釈を与える部分集合族を「個物全体の集合」の任意に選ばれた部分集合族とすれば，通常の公理と推論規則で2階論理の完全性定理が成り立つことを示した． Henkin流の意味論が2階論理の現在の事実上の標準的な意味論である．しかし，このHenkin流の意味論に基づく2階論理とは実質的には1階論理の特別な場合であり，他の意味論の可能性や必要性がない訳ではない．本ワークショップではHenkin流の意味論以外の2階論理の意味論について，佐藤智哉が哲学の立場から，池上大祐が集合論の立場から最近の研究を紹介し，新井敏康が証明論の立場から古典的な議論を紹介する．提題要旨：提題1：2階論理的妥当性の新しい意味論的特徴づけ　佐藤智哉二階述語論理の標準意味論に関する一つの問題は、標準意味論においては特定の集合の特定の性質に依存するような論証が妥当となることである。そのような集合論の結果に基づく論証は「集合論的妥当」とでも呼ばれるべきで、「論理的妥当」な論証とは区別されなければならない。標準意味論の中で妥当となる論証のうち、どの論証が真の意味での論理的妥当であり、どの論証が集合論的妥当なのか。二階述語言語の論理的妥当性を特徴づけるためには、標準意味論とは別の新しい意味論システムが必要である。本発表の主目的は、そのような標準意味論に代わる新しい意味論システムの紹介である。新しい意味論システムのための一つのアイデアは、論理定項とは何かという哲学的議論が、論理的妥当性と集合論的妥当性の区別に応用できるということである。Tarskiに始まる近年の論理定項研究を紹介した後で、それを使ってどのように二階論理的妥当性が参考文献 D. Bonnay, Logicality and invariance, The Bulletin of Symbolic Logic, 14, 29–68, 2008. S. Feferman, Logic, logics, and logicism, Notre Dame Journal of Formal Logic, 40, 31–54, 1999 G. Sher, The Bounds of Logic: A Generalized View Point, Cambridge, MA: MIT Press, (1991). T. Sato, A new semantic characterization of second-order logical validity (unpublished). A Tarski, What are logical notions? J. Corcoran (Ed.), History and Philosophy of Logic, 7, 143–154, 1986. 提題2：2階論理とブール値2階論理　池上大祐（東京電機大学）二階述語論理の代表的な意味論としてタルスキ意味論（完全意味論）とヘンキン意味論の二つがある。タルスキ意味論を用いると、一階述語論理で表現できない様々な性質を記述できるが、一階述語論理において成り立つ定理（完全性定理、コンパクト性定理など）がことごとく成り立たず、二階述語論理は非常に複雑になる。一方、ヘンキン意味論を用いると、一階述語論理において成り立つ多くの定理が成り立つが、論理の表現力は一階述語論理と全く同じで、一階述語論理と比べて二階述語論理に新しい現象は見られない。本講演では、二階述語論理の意味論としてブール値意味論を導入し、 1) V = L の下ではブール値意味論はタルスキ意味論と同じ複雑さを持つこと 2) 巨大基数とウディンのΩ論理についての適切な仮定をすると、ブール値意味論は、　タルスキ意味論より単純でヘンキン意味論より複雑な意味論になることの二点について論じる。本講演で述べる多くの研究成果は Jouko Vaananen 氏との共同研究によるものである。参考文献 D. Ikegami and J. Vaananen, Boolean-Valued Second-Order Logic, Notre Dame Journal of Formal Logic, 56 (1), 167–190, 2015. 提題3：基本予想の意味論的証明　新井敏康（千葉大学）竹内外史は1953に高階論理GLCを定め，GLCについてCut除去定理が成り立つという基本予想を提示した．GLCの部分体系である2階論理がG1LCであり，竹内外史はG1LCの部分体系で基本予想が成り立つことを構文論的に示した．意味論的には，まずCutを持たない体系の3値モデルに対する完全性がSchutteによって示され，その後，3値モデルを2値モデルに完備化する方法で，G1LCについてはTaitによって，GLCについては高橋元男とPrawitzによって独立に，竹内の基本予想が成り立つことが証明された．その意味論的な議論を紹介する．参考文献新井敏康「竹内の基本予想とは何か，何であるべきか」数理解析研究所講究録, 1442, 1-7, 2005.

1 0

Talk by Yoriyuki Yamagata (6 Oct 11:00-)
by Tetsuya Sato 29 Sep '16

29 Sep '16

京都大学数理解析研究所の佐藤です。 10月6日11:00から、産業技術総合研究所の山形頼之氏に以下の講演をしていただくことになりましたので、ご連絡いたします。どうぞお気軽にお越しください。 ========== Time: 11:00-12:00, 6 Oct, 2016 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) http://www.kyoto-u.ac.jp/ja/access/campus/map6r_y.htm (34番の建物) Speaker: Yoriyuki Yamagata (National Institute of Advanced Industrial Science and Technology) (Website: http://staff.aist.go.jp/yoriyuki.yamagata/en/) Title: Consistency proof of an arithmetic with substitution inside a bounded arithmetic Abstract: Bounded arithmetics are systems of arithmetic in which induction is restricted to bounded formulas. Bounded formulas are formulas in which all quantifiers are bounded by some terms. Among many such systems, Buss's hierarchy of bounded arithmetics have particular interest, because their provably total functions exactly correspond polynomial-time hierarchy. A major open problem on bounded arithmetics is whether Buss's hierarchy collapses or not. If it collapses, for example, it implies P=NP. One strategy to differentiate the hierarchy is to use Gödel sentence of some theories. In this talk, we consider a theory PV by Cook and Urquhart and its restrictions. PV is an equational system, which has roughly the same strength to Buss's S12. Beckmann proved that when induction and substitution are removed from PV, the consistency of the system can be proved by S12. On the other hand, Buss and Ignjatović proved that S12 cannot prove the consistency of the system which obtained by removing just induction, but adding propositional logic and BASIC axioms, from PV. In this talk, we improve the Beckmann by proving that S22 can prove the consistency of the system which obtained by removing just induction from PV. By delineating bounded arithmetics which can prove consistency of various restrictions of PV, we hope to prove non-collapse of Buss's hierarchy, and relatedly, polynomial-time hierarchy.

1 0

締切延長：第51回MLG数理論理学研究集会（10/27-30箱根）
by Kazushige TERUI 26 Sep '16

26 Sep '16

みなさま先日来ご案内しているMLG研究集会についてですが、宿泊・講演ともまだ余裕がありますので、締切を９月２９日（木）まで延長したいと思います。なお今回はチェコ科学アカデミーから以下の方々が参加されます。 Petr Cintula（数理ファジィ論理・抽象代数論理など） Zuzana Hanikova（ファジィ集合論など） Rostislav Horcik（部分構造論理など） Carles Noguera（数理ファジィ論理・抽象代数論理など） Tommaso Moraschini, Adam Prenosil, Igor Sedlar, Amanda Vidal うち数名の方には入門的な講演をお願いする予定です。３泊４日ですが、部分参加も歓迎します。どうぞよろしくお願いします。照井 --------------------------------------------------- 第51回MLG数理論理学研究集会締切延長 MLG数理論理学研究集会は，1971年開始された，この分野の多くの研究者が参加している40年以上続く研究集会です。成果を発表し合ったり，アイデアを交換したりと，ザックバランな雰囲気で行われています。数学の他分野や，広く数理科学，情報科学，哲学の方々や，外国からの研究者を迎えるなど，オープンに運営されています。（昨年度の様子：http://www.kurims.kyoto-u.ac.jp/~terui/mlg2015.html ）日時：2016年10月27日（木）午後 − 30日（日）午前場所：四季の湯強羅静雲荘（ http://gora-seiunsou.jp/ ）参加費用：全参加の場合30,000円（3食つき、懇親会費は別途）参加・講演申し込み： 9月29日（木）までウェブページ：http://www.kurims.kyoto-u.ac.jp/~terui/mlg2016.html 詳細は上記Web Pageをご覧ください。みなさまの参加をお待ちしております。京都大学数理解析研究所照井　一成 ------------------------------------------ Kazushige TERUI Research Institute for Mathematical Sciences, Kyoto University. Kitashirakawa Oiwakecho, Sakyo-ku, Kyoto 606-8502, JAPAN. Phone: +81-75-753-7235 Fax: +81-75-753-7276 terui(a)kurims.kyoto-u.ac.jp http://www.kurims.kyoto-u.ac.jp/~terui/

1 0

correction again
by 吉信康夫 21 Sep '16

21 Sep '16

皆様：吉信＠名古屋大学大学院情報科学研究科です。すでに何人の方からご指摘いただきましたように、セミナーご案内の日時も誤っておりました。重ねてお詫びいたしますとともに、訂正したものを改めて投稿させていただきます。名古屋数学基礎論セミナーのご案内日時：9月23日(金) 15:30- 場所：名古屋大学大学院情報科学研究科棟 2F 206号室講演者：木原貴行 (University of California, Berkeley) タイトル：　多対一次数の一様Martin予想とWadge次数アブストラクト：　多対一次数は，決定問題の計算論的複雑性を測る指標の一つであり，Wadge次数は，ベール空間の部分集合の位相的複雑性を測る指標の一つである．両者の定義は酷似している一方，多対一次数構造は混沌として掴み所がなく，Wadge次数構造は美しく整然としており単純明快である．したがって，それらの酷似した定義とは対照的に，それらの構造は如何なる意味でも同型ではない．それにも関わらず，「自然」な多対一次数の構造と Wadge次数構造が同型であることを示す．　より正確には，Woodinによって提案された決定性公理の拡張であるAD+の下で，任意の better-quasi-order Q に対して，一様次数不変な Q 値多対一次数の構造と Q 値Wadge次数構造が同型であることを示す．

1 0

correction
by 吉信康夫 21 Sep '16

21 Sep '16

皆様：吉信康夫＠名古屋大学大学院情報科学研究科です。先ほどお送りしたセミナーのご案内で、講演者のお名前の字が誤っておりました。お詫びいたしますとともに、訂正したものを改めてお送りいたします。名古屋数学基礎論セミナーのご案内日時：9月13日(金) 15:30- 場所：名古屋大学大学院情報科学研究科棟 2F 206号室講演者：木原貴行 (University of California, Berkeley) タイトル：　多対一次数の一様Martin予想とWadge次数アブストラクト：　多対一次数は，決定問題の計算論的複雑性を測る指標の一つであり，Wadge次数は，ベール空間の部分集合の位相的複雑性を測る指標の一つである．両者の定義は酷似している一方，多対一次数構造は混沌として掴み所がなく，Wadge次数構造は美しく整然としており単純明快である．したがって，それらの酷似した定義とは対照的に，それらの構造は如何なる意味でも同型ではない．それにも関わらず，「自然」な多対一次数の構造と Wadge次数構造が同型であることを示す．　より正確には，Woodinによって提案された決定性公理の拡張であるAD+の下で，任意の better-quasi-order Q に対して，一様次数不変な Q 値多対一次数の構造と Q 値Wadge次数構造が同型であることを示す．

1 0

nagoya logic seminar
by 吉信康夫 21 Sep '16

21 Sep '16

皆様：吉信康夫＠名古屋大学大学院情報科学研究科です。以下の要領で名古屋数学基礎論セミナーを開催します。奮って御参加下さい。日時：9月13日(金) 15:30- 場所：名古屋大学大学院情報科学研究科棟 2F 206号室講演者：木原貴之 (University of California, Berkeley) タイトル：　多対一次数の一様Martin予想とWadge次数アブストラクト：　多対一次数は，決定問題の計算論的複雑性を測る指標の一つであり，Wadge次数は，ベール空間の部分集合の位相的複雑性を測る指標の一つである．両者の定義は酷似している一方，多対一次数構造は混沌として掴み所がなく，Wadge次数構造は美しく整然としており単純明快である．したがって，それらの酷似した定義とは対照的に，それらの構造は如何なる意味でも同型ではない．それにも関わらず，「自然」な多対一次数の構造と Wadge次数構造が同型であることを示す．　より正確には，Woodinによって提案された決定性公理の拡張であるAD+の下で，任意の better-quasi-order Q に対して，一様次数不変な Q 値多対一次数の構造と Q 値Wadge次数構造が同型であることを示す．

1 0

公募
by 泉英明 19 Sep '16

19 Sep '16

皆様千葉工業大学教育センター数学教室の泉です。現在、当数学教室では助教１名の公募を行っております。締切は 2016年10月20日(必着)となっております。詳細については http://www.it-chiba.ac.jp/institute/adoption/ をご覧ください

1 0

(no subject)
by 泉英明 19 Sep '16

19 Sep '16

皆様千葉工業大学教育センター数学教室の泉です。現在、当数学教室では助教１名の公募を行っております。締切は 2016年10月20日(必着)となっております。詳細については http://www.it-chiba.ac.jp/institute/adoption/ をご覧ください。

1 0

数学基礎論とその応用
by Makoto Kikuchi 17 Sep '16

17 Sep '16

皆様，以前にもご案内しましたが，2016年9月26日（月）から29日（木）まで， RIMS 研究集会「数学基礎論とその応用」を開催しますのでお知らせします． http://www2.kobe-u.ac.jp/~mkikuchi/mla2016.html 事前登録なしで参加できます．また，以下の要領で懇親会を開きます．日時：2016年9月28日（水）午後6時から会場：マーブルルーム https://www.hotpepper.jp/strJ000040535/ 場所：京都府京都市中京区先斗町通三条下ル橋下町135先斗町ビル4F 交通：京阪三条駅から徒歩5分，阪急河原町駅から徒歩10分内容：立食（飲み放題）会費：3,000円（当日会場で支払い） 8月に研究集会への参加申し込みをお送り下さった方で，懇親会への出欠の変更のない方はご連絡くださる必要はありません．出欠を変更される方，未定とお答えになられた方，また，参加申し込みをなさっていない方で懇親会への出席をご希望の方は，2016年9月24日（土）までに，研究代表者（菊池）宛に件名「mla2016」として e-mail でご連絡ください．なお，本研究集会は研究交流を目的とするものですが，学部学生を含む学生の方の研究集会および懇親会への参加を歓迎します．午前中の講演は全て日本語です．ご興味をお持ちの方はご遠慮なくご参加ください．菊池誠記 RIMS研究集会　数学基礎論とその応用日時：2016年9月26日(月)11:00 ~ 9月29日(木)15:00 場所：京都大学数理解析研究所111室研究代表者：菊池誠(神戸大)mkikuchi(a)kobe-u.ac.jp プログラム： 9月26日(月) 11:00-11:50 宮元忠敏(南山大) 集合論で試される構造と構成のいくつか 13:30-14:20 Joel David Hamkins(CUNY) The Modal Logic of Set-Theoretic Potentialism 14:30-15:20 樋口幸治郎(日大工) Computably Represented Structures 15:30-16:20 竹内耕太(筑波大) Properties Characterized by Generalized Indiscernible 9月27日(火) 10:00-10:50 新井敏康(千葉大) 角田先生, 証明論を分かって下さい 11:00-11:50 板井昌典(東海大) 1980年代半ば,米国中西部のモデル理論,そして未来-モデル理論賛歌 13:30-14:20 Frank Wager (Lion 大) Recent Interactions between Model Theory and Combinatorics 14:30-15:20 横山啓太(JAIST) On the Proof-Theoretic Strength of Ramsey's Theorem for Pairs 15:30-16:20 丸山善宏(京大) Dynamics of Duality: How Duality Emerges, Changes, and Breaks 9月28日(水) 10:00-10:50 向井国昭(慶応大) Barwiseのモデル論的意味論の周辺と抽象設計学 11:00-11:50 金井康雄(大和大) 公理的集合論の一角を彷徨って 13:30-14:20 Bakh Khoussainov(Auckland 大/京都大) Computably Enumerable Structures: Domain Dependence 14:30-15:20 星野直彦(京都大) Geometry of Interaction and Higher Order Functions 15:30-16:20 Diego Mejia(静岡大) Several Values in Cichon's Diagram 9月29日(木) 10:00-10:50 佐藤洋祐(東理大) 限量子記号消去アルゴリズムとその計算の現状について 11:00-11:50 隈部正博(放送大) Generic Sets の Turing Degrees について 13:30-14:20 Philip Welch(Bristol 大) Generalised Squares and Higher Stationarity

1 0

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

16 Sep '16

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

1 0

Talk by Quentin Heath, 29 Sept.
by koba＠kb.is.s.u-tokyo.ac.jp 16 Sep '16

16 Sep '16

皆様、東京大学の小林です。以下のとおり講演会を開催いたしますので、ご興味のある方はお集まりください。小林直樹東京大学大学院情報理工学系研究科コンピュータ科学専攻〒113-0033 東京都文京区本郷7-3-1 Phone: 03-5841-4124 Fax: 03-5841-4124 email: koba(a)is.s.u-tokyo.ac.jp ================== Time: 3:00pm, Thursday, the 29th September Place: Room 214, 7th Building of Faculty of Science （理学部7号館） Title: Proof certificates as proof theory for model checking Speaker: Quentin Heath (LIX, Ecole polytechnique) Abstract: Model checking has proved valuable on its own for locating errors in finite state computer models and specifications. However, model checkers can also be used to prove properties that will be consumed by other computational logic systems, such as theorem provers. In order for the model checker to be trusted by an external tool, we ask that it outputs its ``proof evidence'' as a formally defined document---a proof certificate---and that this document is checked by a trusted proof checker. We propose such a proof checker based on a first-order variant of linear logic, and justify why this logic is appealing as a foundation for model checking. We also provide a proof system for this logic, and tie in the notion of proof certificates in a way that makes proof checking sound for a minimal amount of work. As a result, a range of model checking computations can be imported in formal proofs and certified by a proof checker that is simple, non idiosyncratic, and easy to certify.

1 0

Nagoya Set Theory seminar
by 吉信康夫 15 Sep '16

15 Sep '16

名古屋集合論セミナーのご案内：(重複して受け取られた方はご容赦ください) 日時：2016年9月16日(金) 午後3時30分より場所：名古屋大学大学院情報科学研究科2階206号室講演者：薄葉季路(早稲田大学) 題目：Ground Axiomの変種について概要：Ground Axiomは「universeがforcing extensionになっていない」ことを主張する公理であるが、forcingをc.c.c., properなどに限定した Ground Axiomの編集について考察し、例えば「c.c.c. forcing extensionではないがproper forcing extensionになる」などのconsistencyを示す。多数のご参加をお待ちしております。名古屋大学大学院情報科学研究科吉信康夫

1 0

第19回プログラミングおよびプログラミング言語ワークショップ（PPL2017）論文募集/発表募集
by Isao Sasano 14 Sep '16

14 Sep '16

皆様第19回プログラミングおよびプログラミング言語ワークショップ（PPL2017）のご案内です。申込方法や詳細につきましては、webページにて確定次第お知らせします。是非ご投稿、ご参加をご検討ください。 ====================================================================== 第19回プログラミングおよびプログラミング言語ワークショップ (PPL2017) https://ppl2017.ipl-e.ai.kyutech.ac.jp/ 論文募集/発表募集主催: 日本ソフトウェア科学会プログラミング論研究会日程: 2017年3月8日(水)～3月10日(金) 会場: 山梨県笛吹市石和温泉「華やぎの章慶山」 PPL2017は，プログラミングとプログラミング言語に関連する幅広い分野の研究者・技術者・学生が一堂に会し，最新の研究成果の発表や，新たな研究課題の提案・討論・アイディア交換を行うことを目的とした，合宿形式の研究集会です．プログラミング方法論，プログラミング言語の理論・設計・実装などに関する研究発表を，カテゴリ別に幅広く募集します．カテゴリ1 (国内外未発表論文) ---------------------------- 完成した理論やシステムの研究発表のみならず，萌芽的なアイディアや問題点の提示等も歓迎します．発展途上の研究内容も積極的に採録する方針です．また，カテゴリ1で発表された研究については，会場での討議や査読コメントをもとにその完成度を高め，将来の学術雑誌・国際会議等での業績に結び付けることを奨励しています．そのため，予稿集の配布は参加者のみへの限定的なものとします．投稿手続きは2段階です．発表申込締切: 2016年12月21日(水) 17:00 (JST) 論文提出締切: 2017年1月11日(水) 17:00 (JST) 採否通知：2017年2月3日(金) カテゴリ2 (国外既発表論文) -------------------------- 査読付の国際会議または学術雑誌等で既発表であるが国内では未発表である研究を紹介する場です．採録決定済みの研究も含みます．PPLへの関連をもとに採否を判定いたしますが，申し込み多数の場合はプログラム委員会で選考致します．発表申込締切: 2017年1月25日(水) 17:00 (JST) 採否通知：2017年2月6日(月) カテゴリ3 (ポスター・デモ発表) ------------------------------ 2時間程度のセッション内でのポスター発表またはデモ発表です．既発表・未発表の別を問いません．PPLへの関連をもとに採否を判定いたしますが，申し込み多数の場合はプログラム委員会で選考致します．発表申込締切: 2017年2月8日(水) 17:00 (JST) 採否通知：2017年2月15日(水) カテゴリ4 (サーベイ・チュートリアル発表) ---------------------------------------- 研究動向の紹介(発表者の研究も含む) や分野間の相互理解と参加者の知識の底上げとなる発表を募集します．既発表・未発表の別を問いません．PPLへの関連，著者の研究発表実績，トピックや切り口の興味深さをもとに，プログラム委員会で選考致します．発表申込締切: 2017年1月25日(水) 17:00 (JST) 採否通知：2017年2月6日(月) 申込方法や詳細につきましては，上記ウェブページにて確定次第お知らせ致します． ====================================================================== 問い合わせ先 ppl2017-oc(a)ipl-e.ai.kyutech.ac.xn--jp()-753c9gpa1b92cqcsg7jrh5d1ix122cxi0h ppl2017-pc-chairs(a)ipl-e.ai.kyutech.ac.xn--jp(/)-m53d8hra6b05cmntd6e6b1719ok76b ====================================================================== プログラム委員会青谷知幸 (東京工業大学) 浅田和之 (東京大学) Reynald Affeldt (産業技術総合研究所) 稲葉一浩 (Google) 上野雄大 (東北大学) 菊池健太郎 (東北大学) 小宮常康 (電気通信大学) 篠埜功 (芝浦工業大学) 佐藤亮介 (東京大学) 首藤一幸 (東京工業大学) 末永幸平 (京都大学) 宋剛秀 (神戸大学) 千葉滋 (東京大学) 土屋達弘 (大阪大学) 中野圭介 (電気通信大学) 鍋島英知 (山梨大学) 番原睦則 (神戸大学) 前田敦司 (筑波大学) 松田一孝 (東北大学) 森畑明昌 (東京大学) 八杉昌宏 (九州工業大学) 組織委員会江本健斗 (九州工業大学) [組織委員長] 平石拓 (京都大学) 佐藤重幸 (高知工科大学) 海野広志 (筑波大学) 対馬かなえ (国立情報学研究所) 塚田武志 (東京大学) 篠埜功 (芝浦工業大学) [プログラム共同委員長] 番原睦則 (神戸大学) [プログラム共同委員長] ====================================================================== 篠埜　功 -- Isao Sasano <sasano(a)sic.shibaura-it.ac.jp>

1 0

第51回MLG数理論理学研究集会参加・講演募集（10/27-30箱根）
by Kazushige TERUI 13 Sep '16

13 Sep '16

第51回MLG数理論理学研究集会参加・講演募集 MLG数理論理学研究集会は，1971年開始された，この分野の多くの研究者が参加している40年以上続く研究集会です。成果を発表し合ったり，アイデアを交換したりと，ザックバランな雰囲気で行われています。数学の他分野や，広く数理科学，情報科学，哲学の方々や，外国からの研究者を迎えるなど，オープンに運営されています。（昨年度の様子：http://www.kurims.kyoto-u.ac.jp/~terui/mlg2015.html ）今回は試験的な試みとして「未解決問題セッション」を設けたいと思います（詳細はHP）。どうぞ奮ってご参加ください。日時：2016年10月27日（木）午後 − 30日（日）午前場所：四季の湯強羅静雲荘（ http://gora-seiunsou.jp/ ）参加費用：全参加の場合30,000円（3食つき、懇親会費は別途）参加・講演申し込み： 9月25日（日）までウェブページ：http://www.kurims.kyoto-u.ac.jp/~terui/mlg2016.html 詳細は上記Web Pageをご覧ください。みなさまの参加をお待ちしております。京都大学数理解析研究所照井　一成 ------------------------------------------ Kazushige TERUI Research Institute for Mathematical Sciences, Kyoto University. Kitashirakawa Oiwakecho, Sakyo-ku, Kyoto 606-8502, JAPAN. Phone: +81-75-753-7235 Fax: +81-75-753-7276 terui(a)kurims.kyoto-u.ac.jp http://www.kurims.kyoto-u.ac.jp/~terui/ ------------------------------------------ Kazushige TERUI Research Institute for Mathematical Sciences, Kyoto University. Kitashirakawa Oiwakecho, Sakyo-ku, Kyoto 606-8502, JAPAN. Phone: +81-75-753-7235 Fax: +81-75-753-7276 terui(a)kurims.kyoto-u.ac.jp http://www.kurims.kyoto-u.ac.jp/~terui/

1 0

第35回量子情報技術研究会(QIT35)のご案内
by NISHIMURA Harumichi 10 Sep '16

10 Sep '16

logic-mlの皆様 QIT35世話人に代わりまして第35回量子情報技術研究会(QIT35)の会告を以下の通り投稿させていただきます．どうぞよろしくお願いいたします．名古屋大学大学院情報科学研究科西村治道 --------------------------------------------------- 第35回量子情報技術研究会(QIT35)のお知らせ情報科学と量子力学を融合させた新しい分野、量子情報科学に関する研究会を下記のとおり開催いたします。ふるってご発表、ご参加ねがいます。 https://staff.aist.go.jp/s-kawabata/qit/qit35 ・日時：平成28年11月24日（木），25日（金）・会場：高エネルギー加速器研究機構（KEK）（〒305-0801 茨城県つくば市大穂1-1）・発表募集分野：量子情報，量子計算，量子暗号など広く量子情報技術に関わる理論的研究，実験的研究，計算機科学的研究，数学的研究，及びその他関連分野・申込締切： - 口頭講演：平成28年10月7日（金） - ポスター発表：平成28年10月21日（金） - 参加登録（事前）：平成28年10月28日（金）・招待講演： - 清水明（東大総合文化）「アンサンブルの等価性の量子破綻にともなう異常な量子状態」 - 長谷川祐司（ウィーン工科大・北大）「残留する確定性：混合状態でも有効な誤差と擾乱の不確定性関係」 - 横倉祐貴（理研）「ネーター不変量としての熱力学エントロピー」・チュートリアル講演 - 高柳匡（京大基研）「Emergent Spacetime from Qubits via Holography」・KEK加速器実験施設の見学ツアーも予定しています。・詳細については下記ウェブページをご覧ください： https://staff.aist.go.jp/s-kawabata/qit/qit35 ・参加費（事前振込）：一般2,500円，学生1,000円（当日払いは+1,000円）懇親会費（事前振込）：一般3,500円，学生2,000円（当日払いは+500円）・定員：200名程度・問合せ先：筒井泉（KEK）、磯暁（KEK）、鶴丸豊広（三菱電機） E-mail: qit35(a)ml.post.kek.jp ・主催：電子情報通信学会量子情報技術時限研究専門委員会共催：応用物理学会量子エレクトロニクス研究会 ---------------------------------------------------

1 0

JAIST Logic Seminar Series
by Hajime Ishihara 09 Sep '16

09 Sep '16

皆様ルートヴィヒ・マクシミリアン大学ミュンヘンのChuangjie Xu博士の講演のお知らせです。どうぞふるってご参加ください。問合せ先：石原　哉北陸先端科学技術大学院大学情報科学系 e-mail: ishihara(a)jaist.ac.jp ----------------------------------------------- * JAIST Logic Seminar Series * * The seminar below is held as a part of JSPS Core-to-Core Program, A. Advanced Research Networks, and EU FP7 Marie Curie Actions IRSES project CORCON. (http://www.jaist.ac.jp/logic/ja/core2core, https://corcon.net/) Date: Wednesday 28 September, 2016, 15:20-17:00 Place: JAIST, Collaboration room 7 (I-56) (Access: http://www.jaist.ac.jp/english/location/access.html) Speaker: Chuangjie Xu (Ludwig-Maximilians-Universität München) Title: Continuity in Type Theory Abstract: If all functions (N -> N) -> N are continuous then 0 = 1. We establish this in intuitionistic type theory, with existence in the formulation of continuity expressed as a Sigma-type via the Curry-Howard interpretation. But with an intuitionistic notion of anonymous existence, defined as the propositional truncation of Sigma, it is consistent that all such functions are continuous. On the other hand, any of these two intuitionistic conceptions of existence give the same, consistent, notion of uniform continuity for functions (N -> 2) -> N. Moreover, we constructively develop a model of uniform continuity and implemented it within type theory using Agda.

1 0

Workshop 参加者募集のお知らせ
by Hideki Tsuiki 07 Sep '16

07 Sep '16

Workshop 参加者募集のお知らせ (再送) Second call for participation 日本学術振興会研究拠点形成事業「数理論理学とその応用に関するワークショップ」 JSPS Core-to-Core Program "Workshop on Mathematical Logic and its Application” http://www.i.h.kyoto-u.ac.jp/~matthew/core2core2016/index.html 2016 年 9月16,17日（金, 土曜日）京都大学、吉田南キャンパス、総合人間学部棟 1401 教室 September 16--17, 2016, Faculty of Integrated Human Studies Building, room 1401 Kyoto University 北陸先端科学技術大学院大学が内外の協力機関および協力者と実施しております日本学術振興会研究拠点形成事業「数理論理学とその応用の国際拠点形成」 (http://www.jaist.ac.jp/logic/core2core) の一環として、表記のワークショップを京都で開催いたします。本拠点形成事業参加研究者のためのワークショップですが、それ以外の方もご参加いただけます。プログラムなどの情報は、上記ホームページを御覧ください。両日とも、朝 9:00 から夕方 5:30 頃まで講演がある予定です。当日参加も可能ですが、本事業参加研究者以外で参加を予定されている方は、下記フォームにて、できるだけ事前にご連絡を頂けますようにお願い申し上げます。ご質問等がございましたら、core2core2016(a)jaist.ac.jp までお寄せください。多くの方のご参加をお待ちしております。オルガナイザー：石原哉立木秀樹照井一成 Matthew de Brecht 根元多佳子 --------------------------------------- 「数理論理学とその応用に関するワークショップ」に参加します。所属：名前：

1 0

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Logic-ml