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

早稲田大学高等研究所セミナー「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

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

JAIST Logic Seminar Series
by Hajime Ishihara 16 Apr '17

16 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

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

年会講演でのノートＰＣ
by Toshio Suzuki 21 Mar '17

21 Mar '17

日本数学会年会（首都大）で講演をされる皆様お世話になっております。年会開催校担当者の鈴木登志雄です。ノートＰＣで講演をされる方は，（１）各自でノートＰＣをご持参いただき，（２）従来型のＶＧＡ端子でプロジェクタへ接続してくださいますようお願いいたします（プログラム冊子 p.35）。ＶＧＡ端子（Wikipedia） https://ja.wikipedia.org/wiki/VGA%E7%AB%AF%E5%AD%90 ＰＣにさすＶＧＡオスケーブルは開催校で用意しております。変換プラグが必要な方は，各自でご用意願います。 -- 鈴木登志雄首都大学東京理工学研究科数理情報科学専攻 toshio-suzuki(a)tmu.ac.jp

1 0

日本数学会年会（首都大）中，どこで昼食をとれるか
by Toshio Suzuki 21 Mar '17

21 Mar '17

数学基礎論および歴史分科会の皆様お世話になっております。このたびの日本数学会年会で，開催校の同分科会担当者を務める鈴木登志雄です。年会中，どこで昼食をとれるかについて，公式情報と非公式情報を織り交ぜてお知らせします。首都大の生協食堂・国際交流会館内レストラン（ルヴェソンヴェール）・カフェテリア館の場所は年会プログラム冊子p.39にあります。しかし，いずれもキャパが不足気味です。ルヴェの昼食は要予約です（ウェブから）。南大沢の駅前にはたくさんお店がありますが，早食いかつ俊足の方でないと，昼休み中の利用はきついと思われます。同一日の午前と午後の講演両方に出席される方は，あらかじめ昼食用のお弁当・お茶などを各自で用意された方が安心かもしれません（p.35）。しかし第III会場はそれほど広くなく，長机ですので，別の場所で昼食を広げたい方もいらっしゃると思います。昼食をとる場所についてあらかじめ作戦を立てていただけるとありがたいです。 p.39に構内図，p.41に１１号館の見取り図があります。１１号館１階の東の端（正門から見て一番奥，１２号館の近く），１１０教室が第III会場です。すぐ隣の１１号館１０９教室が休憩室です。この他，１２号館２階２０３（p.42）も休憩室です。以下，年会プログラム冊子だけからは読みとりにくい非公式情報です。１２号館２階玄関ホール（p.42）および国際交流会館の「図書コーナー」（p.39, p.40）に机・椅子とフリースペースがあります。天気がよく，ご本人が花粉症でなく，かつジーパン履きという条件をクリアできれば，１１号館１０３，１０５の間から池にむけて降りる半円形の階段 (p.41) に腰掛けて食べることもできます。 -- 鈴木登志雄首都大学東京理工学研究科数理情報科学専攻 toshio-suzuki(a)tmu.ac.jp

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

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

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

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

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

分科会便りに掲載する情報（１月１６日（月）しめきり）
by Toshio Suzuki 17 Dec '16

17 Dec '16

数学基礎論および歴史分科会の皆様　　分科会便りに掲載する情報（１月１６日（月）しめきり）お世話になっております．首都大学東京の鈴木登志雄です．評議員からの連絡です．数学通信２１巻４号（２月発送見込み）に会報１６４号が掲載されます．その中の分科会便りに掲載希望のお知らせがありましたら，２０１７年１月１６日（月）までに，鈴木 toshio-suzuki[atmark]tmu.ac.jp へご連絡ください．編集部に掲載を依頼するかどうかの最終判断は評議員にご一任ください．文章の軽微な修正を評議員・編集部が行う場合がありますのでご了承ください．過去の会報は以下の場所でご覧になれます． http://mathsoc.jp/section/logic_and_history/Tayori.html -- 鈴木登志雄首都大学東京理工学研究科数理情報科学専攻 toshio-suzuki(a)tmu.ac.jp

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

年会一般講演申込み状況
by Toshio Suzuki 18 Nov '16

18 Nov '16

基礎論および歴史分科会の皆様いつもお世話になっております。連絡責任評議員の鈴木登志雄です。１１月１８日（金）２１：００現在、年会（春の学会）における当分科会一般講演申込み数は８件、内訳は以下の通りです。歴史　　　５件基礎論　　２件（計算可能性理論１件、非古典論理１件）その他　　１件一般講演申込みは１１月２５日（金）までです。皆様、ふるって一般講演にお申し込みください。 -- 鈴木登志雄首都大学東京理工学研究科数理情報科学専攻 toshio-suzuki(a)tmu.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 16 Nov '16

16 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 10 Nov '16

10 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

リマインド：年会講演申込み
by Toshio Suzuki 10 Nov '16

10 Nov '16

数学基礎論および歴史分科会の皆様　　リマインド：年会講演申込みお世話になっております．首都大学東京の鈴木登志雄です．評議員からの念押しです． 2016年度秋季総合分科会は2016年3月24日（金）から27日（月），首都大学東京で開催されます．一般講演申込期間はすでに始まっており，　　11月4日（金）から11月25日（金）です．皆様の積極的な講演申込を期待しております．年会のウェブサイト： http://mathsoc.jp/meeting/tmu17mar/ -- 鈴木登志雄首都大学東京理工学研究科数理情報科学専攻 toshio-suzuki(a)tmu.ac.jp

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

モデル理論RIMS研究集会のご案内（締切，Web page情報の追加）
by 池田宏一郎 12 Oct '16

12 Oct '16

数学基礎論および歴史分科会のみなさま，法政の池田です．以前，お知らせいたしましたが，下記の要領でRIMS研究集会を開催いたします．モデル理論に関連する話題の研究集会です．モデル理論に関連するテーマでの講演を募集いたします． RIMS研究集会「モデル理論における独立概念と次元の研究」日時：2016年12月12日月曜日午後～2016年12月14日水曜日午前場所：京都大学数理解析研究所110教室研究代表者：池田宏一郎（法政大学） Web page：https://sites.google.com/site/modeltheory2016/ 講演を希望される方は 2016年10月28日までに以下の情報を池田（ikeda(a)hosei.ac.xn--jp)-u63b3a4a5b7b6byd5nwe5834h. ----- (1)氏名 (2)所属 (3)職名/学年 (4)講演題目 (5)旅費援助の希望の有無 (6)参加日程 ------ 旅費の援助は原則として講演者に限らせていただきます．以上，よろしくお願いいたします．池田宏一郎（法政大学）

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

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Kisoron-ml