Kisoron-ml July 2017

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

9 participants
10 discussions

モデル理論夏の学校のお知らせ
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

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

21 Jul '17

（重複して受け取られた場合はご容赦ください） kisoron-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%… 参加費用：１４０００円程度（宿泊費、食事… [View More]

1 0

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

20 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/… [View More]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) [View Less]

1 0

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

18 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: … [View More]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 [View Less]

1 0

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

18 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 … [View More]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 [View Less]

1 0

Workshop in Logic and Philosophy of Mathematics
by Makoto Fujiwara 16 Jul '17

16 Jul '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 … [View More]

2 2

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

14 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 … [View More]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 [View Less]

1 0

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

13 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 … [View More]

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://… [View More]

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 … [View More]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 ============================================ [View Less]

2 1

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Kisoron-ml July 2017