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

論理と論証の哲学日仏集会　１月１５－１６日　(Philosophy of Logic and Proofs (JAN 15-16), TOKYO
by Mitsuhiro Okada 08 Jan '16

08 Jan '16

基礎論学会様、貴学会の会員に興味をもたれる方が多くいらっしゃると思いますので、貴学会のメーリングリストで流していただけるとありがたいです。慶應義塾大学文学部　岡田光弘ーーーーーーーーーーーーーーーーーーーーーーー論理と論証の哲学　(パリ第１大学哲学科、パリ科学史科学哲学研究所との共同企画集会） French-Japanese Workshop on ｏｇｉｃ　and Philosophy of Proofs パリ大学第1校哲学科（及びパリ科学史・科学哲学研究所）からの５名の訪問団を迎え、論理および論証について議論する会を開催します。　参加自由です。 (プログラムの最新版については，以下のURLをご覧ください) http://abelard.flet.keio.ac.jp/seminar/frjp16jan.html また、１５日午前中に同じ会場で非公式研究会を行います。証明の表現、幾何学証明、証明の対象、証明の同一性、証明と論理的規範性などについて議論します。、．ご興味がございましたら是非お立ち寄りください、到着分のabstractsは下ににあります。最新情報については上記ＵＲＬをご覧ください。 --- Date: January 15th–16th, 2016 　１月１５日ー１６日 Place: Distance Learning Room (B4F), South Building, Mita campus of Keio University. TOKYO 場所: 慶應大学三田キャンパス南館地下4階ディスタンスラーニングルーム (最寄駅:JR 田町、地下鉄三田又は赤羽橋) (http://www.keio.ac.jp/en/maps/mita.html 13番の建物です。/ Building #13 on this map.) Speakers: and Discussants フランス側: Pierre Wagner (Professor, Université Paris 1, IHPST) Marco Panza (Professor, Université Paris 1, IHPST) Andrew Arana (Professor, Université Paris 1, IHPST) Alberto Naibo (Associate Professor, Université Paris 1, IHPST) Florencia Di Rocco (Ph.D candidate, Université Paris 1) and others Discussants 日本側: Kengo Okamoto (Tokyo Metropolitan University) Koji Mineshima (Ochanomizu University) Mitsuhiro Okada ( Keio University) Yutaro Sugimoto (Keio University) Yuta Takahashi (Keio University) Yuki Nishimuta (Keio University) Program (tentative): Friday, January 15th (Morning Closed discussion meeting) 14:00 Session I Yuta Takahashi“Philosophy of Gentzen's proof theory'' Koji Mineshima“Combining a type-logical semantics and a wide-coverage statistical parser” Florencia Di Rocco “Logic and Mathematics of Japanese Counters'' Discussion 17:00 Close Saturday, January 16th 10:30 Session II Kengo Okamoto “TBA” Pierre Wagner & Mitsuhiro Okada “TBA” Discussion 12:30 Lunch Break 14:00 Session III Marco Panza “The twofold role of diagrams in Euclid's geometry” Alberto Naibo “Representing inferences and proofs: the case of harmony and conservativity” Andrew Arana “Complexity of proof and purity of methods” Discussion 17:00 Close --- Abstracts: Koji Mineshima “Combining a type-logical semantics and a wide-coverage statistical parser” We present a type-logical semantics for wide-coverage statistical parsers based on Combinatorial Categorical Grammar (CCG) developed for English and Japanese. The system we have been developing enables to map open-domain texts into formulas in higher-order logic that capture a variety of semantic information such as quantification and intensionality. We also discuss how a robust model of lexical knowledge can be integrated into our type-theoretical framework. (Joint work with Pascual Martinez-Gomez, Yusuke Miyao and Daisuke Bekki) Andrew Arana “Complexity of proof and purity of methods” Roughly, a proof of a theorem, is “pure” if it draws only on what is “close” or “intrinsic” to that theorem. Mathematicians employ a variety of terms to identify pure proofs, saying that a pure proof is one that avoids what is “extrinsic”, “extraneous”, “distant”, “remote”, “alien”, or “foreign” to the problem or theorem under investigation. In the background of these attributions is the view that there is a distance measure (or a variety of such measures) between mathematical statements and proofs. Mathematicians have paid little attention to specifying such distance measures precisely because in practice certain methods of proof have seemed self-evidently impure by design: think for instance of analytic geometry and analytic number theory. By contrast mathematicians have paid considerable attention to whether such impurities are a good thing or to be avoided, and some have claimed that they are valuable because generally impure proofs are simpler than pure proofs. This talk is an investigation of this claim, formulated more precisely by proof-theoretic means. Our thesis is that evidence from proof theory does not support this claim. Marco Panza “The twofold role of diagrams in Euclid's geometry” Proposition I.1 of the Elements is, by far, the most popular example used to justify the thesis that many of Euclid's geometric arguments are diagram-based. Many scholars have articulated this thesis in different ways and argued for it. I suggest to reformulate it in a quite general way, by describing what I take to be the twofold role that diagrams play in Euclid's plane geometry (EPG). Euclid's arguments are object dependent. They are about geometric objects. Hence, they cannot be diagram-based unless diagrams are supposed to have an appropriate relation with these objects. I take this relation to be a quite peculiar sort of representation. Its peculiarity depends on the two following claims that I shall argue for: (i) The identity conditions of EPG objects are provided by the identity conditions of the diagrams that represent them; (ii) EPG objects inherit some properties and relations from these diagrams. Alberto Naibo “Representing inferences and proofs: the case of harmony and conservativity” Traditionally, proof-theoretic semantics focuses on the study of logical theories from a general point of view, rather than on specific mathematical theories. Yet, when mathematical theories are analyzed, they seem to behave quite differently from purely logical theories. A well-known example has been given by Prawitz (1994): adding of a set of inferentially harmonious rules to arithmetic does not always guarantee to obtain a theory which is a conservative extension of arithmetic itself. This means that outside logic the nice correspondence between harmony and conservativity (advocated for example by Dummett (1991)) seems to be broken. However, as it has been pointed out by Sundholm (1998), this is not necessarily a consequence due to the passage from a logical setting to a mathematical one. It could depend also on the way in which proofs are represented. In particular, if proofs are seen as composed by rules which act on judgments involving proof-objects, rather than on rules which a ct on propositions, then the aforementioned correspondence can be in fact be reestablished. An analysis of this phenomenon is proposed. In particular, two different ways of representing proof-objects are taken into consideration: the Church-style presentation and the Curry-style presentation. It is then shown that a crucial difference can be obtained by choosing the first rather than the second. Bibliographical references: Dummett, M. (1991). The Logical Basis of Metaphysics. London: Duckworth. Prawitz, D. (1994). Review of 'The Logical Basis of Metaphysics' by Michael Dummett. Mind, NS, 103 (411): 373–376. Sundholm, G. (1998). Proofs as acts and proofs as objects: Some questions for Dag Prawitz. Theoria, 64 (2-3): 187–216. Florencia Di Rocco “Logic and Mathematics of Japanese Counters'' Either a feature of a “conceptual scheme'' -Quine- or a triviality of “syntax'' -Peyraube, Thekla-, the function of counters is traditionally think as that of getting “individuals'' out from the noun they apply to. I will challenge this classical approach by a contextualist position in philosophy of language. Extending linguistics -Hashimoto, Chao- from Chinese to Japanese, I will present counters as operators enlightening contextual relevant features. Through every-day examples in Japanese, we will show how counters work as Austin's “adjuster words'', their “logic'' being ascribed to the dynamics of “language games'' -Wittgenstein- or “rules of adjustment of salience'' in a “well-run conversation'' -David Lewis-. This position will progressively lead to the idea that counting operations do not necessarily deal with “individuals''. We will thus raise up a certain number of problems related to philosophy of mathematics, logic and pragmatics concerned in the use of Jap anese counters -such as the link between unities and individuals, counting and measuring, and between numbers, counters and ordinary concepts- and sketch a wittgensteinian type of answer. By showing their contextual plasticity, I will challenge the mere idea of the existence of rigid “counter words''. お問い合わせ先: 慶應義塾大学文学部岡田研究室内三田ロジックセミナー講演会事務局 E-mail：logic [AT] abelard.flet.keio.ac.jp 主催：慶應義塾大学論理と感性のグローバルリサーチセンター共催：慶應義塾大学次世代研究プロジェクト論理思考の次世代型研究と論理的思考力発達支援への応用研究

1 1

ポスター&参加募集: FLOPS2016
by Yukiyoshi Kameyama 08 Jan '16

08 Jan '16

皆様、(重複して受け取られた場合は、御容赦ください。) 国際会議FLOPS2016 -- Functional and Logic Programming -- ではポスター発表と参加申込みを募集しています。ポスター発表は、FLOPS参加者からのコメントがもらえる貴重な機会かつ学生の方にとっては英語で話をする(練習をする)貴重な機会です。ポスター申込み締切： 1/11 (Mon) any time zone (日本時間 1/12 (Tue) 21:00) [この時点では、ポスターそのものを投稿する必要はなく、簡単な概要で結構です] 参加申し込み締切: 2/8 (Mon) (日本時間) なお、on-site登録も可能です。よろしくおねがいします。 -- 亀山幸義 (筑波大学) http://logic.cs.tsukuba.ac.jp/~kam ------------------------( C U T H E R E )--------------------------- FLOPS 2016: 13th International Symposium on Functional and Logic Programming March 4-6, 2016, Kochi, Japan http://www.info.kochi-tech.ac.jp/FLOPS2016/ Call for Participation and Posters/Demos Registration will be open on Monday, Dec 21, 2015. Early registration deadline is Monday, Feb 8, 2016. Poster/Demo abstract submission deadline is Monday, Jan 11, 2016. FLOPS aims to bring together practitioners, researchers and implementers 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. In addition to the presentations of regular research papers, the FLOPS program includes tutorials, as well as the poster/demo session for demonstrating the tools and systems described during the talks and for presenting works-in-progress and getting the feedback. FLOPS has established a Best Paper award. The winner will be announced at the symposium. CALLS FOR POSTERS AND DEMONSTRATIONS If you wish to present a poster at FLOPS, please send the plain text abstract by e-mail to <flops2016(a)easychair.org> -- by January 11, 2016. The abstract should include the title, the names of the authors and their affiliation, along with enough details to judge its scope and relevance. We will announce the accepted submissions on January 25, 2016. The format of the poster will be announced at that time. Important Dates * Submission due: January 11, 2016 (Monday), any time zone * Notification: January 25, 2016 (Monday) INVITED TALKS Kazunori UEDA (Waseda University) The exciting time and hard-won lessons of the Fifth Generation Computer Project Atze Dijkstra (Utrecht University) UHC: Coping with Compiler Complexity TUTORIALS Andreas Abel, on Agda Atze Dijkstra, on Attribute Grammars Neng-Fa Zhou, on programming in Picat ACCEPTED PAPERS Ki Yung Ahn and Andrea Vezzosi. Executable Relational Specifications of Polymorphic Type Systems using Prolog Markus Triska. The Boolean Constraint Solver of SWI-Prolog: System Description Peng Fu, Ekaterina Komendantskaya, Tom Schrijvers and Andrew Pond. Proof Relevant Corecursive Resolution Jay McCarthy, Burke Fetscher, Max New, Daniel Feltey, and Robert Bruce Findler A Coq Library For Internal Verification of Running-Times Akimasa Morihata. Incremental Computing with Abstract Data Structures Wouter Swierstra and Joao Alpuim. >From proposition to program: embedding the refinement calculus in Coq Andre Van Delft and Anatoliy Kmetyuk. Declarative Programming with Algebra Ian Mackie and Shinya Sato. An interaction net encoding of Godel's System T Arthur Blot, Pierre-Evariste Dagand and Julia Lawall. >From Sets to Bits in Coq Jeremy Yallop, David Sheets and Anil Madhavapeddy. Declarative foreign function binding through generic programming Praveen Narayanan, Jacques Carette, Wren Romano, Chung-Chieh Shan and Robert Zinkov. Probabilistic inference by program transformation in Hakaru: System description Francisco Javier Lopez-Fraguas, Manuel Montenegro and Juan Rodriguez-Hortala. Polymorphic Types in Erlang Function Specifications Remy Haemmerle, Pedro Lopez-Garcia, Umer Liqat, Maximiliano Klemen, John Gallagher and Manuel V. Hermenegildo. A Transformational Approach to Parametric Accumulated-cost Static Profiling Taus Brock-Nannestad. Space-efficient Planar Acyclicity Constraints: A Declarative Pearl ------------------------( C U T H E R E )---------------------------

1 0

[CSC Journals] CFP INTERNATIONAL JOURNAL OF COMPUTATIONAL LINGUISTICS (IJCL)
by J. Steward 06 Jan '16

06 Jan '16

CALL FOR PAPERS International Journal of Computational Linguistics (IJCL) ISSN - 2180-1266 http://www.cscjournals.org/journals/IJCL/description.php Computational linguistics is an interdisciplinary field dealing with the statistical and/or rule-based modeling of natural language from a computational perspective. Today, computational language acquisition stands as one of the most fundamental, beguiling, and surprisingly open questions for computer science. International Journal of Computational Linguistics (IJCL) is a peer review open access bi-monthly journal providing a scientific forum where computer scientists, experts in artificial intelligence, mathematicians, logicians, cognitive scientists, cognitive psychologists, psycholinguists, anthropologists and neuroscientists can present research and experimental studies. The journal publishes papers that describe state-of-the-art techniques, scientific research studies and results in computational linguistics in general but computational models, corpus linguistics, computational theories, information retrieval and extraction, linguistics modeling techniques, linguistics theories, machine translation, natural language processing, quantitative linguistics, speech analysis and speech recognition in particular. IJCL invite linguistic specialists, researchers and scientists from different domains to share their understanding and contributions towards linguistics that set scientific objectives and demonstrate the operation of new methods in the field of computational linguistics. EDITORIAL BOARD MEMBERS Dr. Michal Ptaszynski - Hokkai-Gakuen University (Japan) Dr. Pascaline Merten - HEB-ISTI (Belgium) Dr. Pawel Dybala - Otaru University of Commerce (Japan) Dr. John Hanhong LI - (China) Dr. Stephen Doherty - Dublin City University (Ireland) LIST OF TOPICS Comparative Surveys that Critique Previously Repor Computational Linguistics Computational Models Computational Theories Corpus Linguistics Formal Linguistics-Theoretic and Grammar Induction Information Retrieval and Extraction Language Generation Language Learning Linguistics Modeling Techniques Linguistics Theories Machine Translation Models of Language Change and its Effect on Lingui Models that Address the Acquisition of Word-order Models that Combine Linguistics Parsing Models that Employ Statistical/probabilistic Gramm Models that Employ Techniques from machine learnin Natural Language Processing Quantitative Linguistics Speech Analysis/Synthesis Speech Recognition/Understanding Spoken Dialog Systems Web Information Extraction/Mining IMPORTANT DATES Paper Submission - January 31, 2016 Author Notification - February 28, 2016 Issue Publication - March 2016 PAPER SUBMISSION DETAILS In order to submit the paper, you need to register as author and then submit the paper through Author Dashboard. It is also important to ensure that the manuscript must be formatted as per IJCL Manuscript Preparation Guidelines. For further information, please refer to the following information. IJCL Website - http://www.cscjournals.org/journals/IJCL/description.php Submission Guidelines - http://www.cscjournals.org/journals/IJCL/submission-guidelines.php Register as Author - http://www.cscjournals.org/login.php CSC-OpenAccess Library - http://www.cscjournals.org/library/oa-library.php Call for EDITORS International Journal of Computational Linguistics (IJCL) seeks applications from enthusiastic researchers and scholars who can oversee and maintain the editorial direction of the journal to ensure a steady flow of engaging and thought-provoking original research publications. IJCL is a peer-reviewed International journal dedicated to publishing an open access original research, reports, and reviews. For future improvement and development, IJCL particularly seeks editors who can continue the enduring and ongoing editorial successes to next level and introduce the journal profile to different libraries and research centers around the globe. IJCL welcome applications from editors with strong academic background and Internationally recognized reputation. Applicants with significant publishing or reviewing experience will be preferred. To qualify for the post of editorial board member (EBM), Associate Editor-in-Chief (AEiC) or Editor-in-Chief (EiC) applicants must have PhD degree having wide experience in academic/Industry/ research and international conferences. For more information on editorial role & responsibilities, benefits & privileges and application criteria to apply for editorial collaborations with IJCL-CSC Journals, please refer to the following URLs. Editors Guidelines - http://www.cscjournals.org/editors/editors-guidelines.php Call For Editors - http://www.cscjournals.org/journals/IJCL/call-for-editors.php Please do not hesitate to contact us at cscpress(a)cscjournals.org if you require more information prior to submission. Our team is committed to provide quick response and support from submission to final publication. Sincerely Editorial Board Members International Journal of Computational Linguistics (IJCL) Computer Science Journals (CSC Journals) B-5-8 Plaza Mont Kiara, Mont Kiara 50480, Kuala Lumpur, Malaysia Phone: 00603 6204 5627 Fax: 00603 6204 5628 Url: http://www.cscjournals.org

1 0

MT-CPS Call for Abstracts (Vienna, April 11 2016)
by Ichiro Hasuo 05 Jan '16

05 Jan '16

みなさま，東京大学の蓮尾です．物理情報システム分野の一大イベント CPS Week （次回はウィーン開催です）のワークショップの一つ， MT-CPS の論文募集をお送りします．今回が初開催のインフォーマルなワークショップですが， CPS のモニタリング・テストは産業界との協働も盛んな，近年活発な分野です．ぜひ投稿・参加をご検討ください．どうかよろしくお願いいたします．蓮尾一郎 http://www-mmm.is.s.u-tokyo.ac.jp/~ichiro/ ============== Call for Abstracts 1st Workshop on Monitoring and Testing of Cyber-Physical Systems Part of CPS Week 2016 11 April 2016, Vienna, Austria http://mtcps16.ait.ac.at/ Description ------------------------------------ Cyber-physical systems (CPS) are integrations of heterogeneous collaborative entities that interact between themselves and with their physical environment. CPS exhibit complex and unpredictable behaviors, thus making their correctness and robustness analysis a challenging task. In order to address their full complexity, there is an emergent need for formal, yet efficient and scalable methods for the verification and analysis of CPS. Light-weight verification techniques, such as monitoring and testing, achieve both rigour and efficiency by enabling the evaluation of systems according to the properties of their individual behaviours. The MT CPS workshop aims at bringing together researchers and practitioners interested in the problems of detecting, testing, measuring and extracting qualitative and quantitative properties from CPS behaviors. Topics of interest include (but are not limited to): - Specification languages for monitoring and testing - Runtime verification and monitoring - Black-box and white-box testing - Measuring and statistical information gathering - Simulation-based verification and parameter synthesis - Diagnostics, error localization and repair - Combination of static and dynamic analysis - Applications and case studies Workshop Format ------------------------------------ MT CPS workshop is intended to be a forum for exchanging the latest scientific trends between researchers and practitioners interested in the field of light-weight verification and analysis of CPS. As a consequence, the workshop will NOT have formal proceedings. We encourage submission of abstracts that address any of the aforementioned topics of interest and cover recently published results as well as the work in progress. Important Dates ------------------------------------ Abstract submission deadline: February 14, 2016 Notification: March 5, 2016 Early registration: March 10, 2016 Workshop: April 11, 2016 Submission instructions ------------------------------------ Abstracts are submitted via https://easychair.org/conferences/?conf=mtcps2016. Abstracts should be in PDF form, up to 2 pages in length with 1-inch margins and at least 10-point font size, and may contain up to two figures. Abstracts should list the full names, affiliations, and contact information of all authors, and the submission should indicate whether the abstract will be presented as a poster, orally, or both. Abstracts will be reviewed by the Program Committee. Those that are selected for oral and poster presentations will be distributed to workshop participants and posted on the workshop website. Program Chairs ------------------------------------ Radu Grosu, Vienna University of Technology, Austria Oded Maler, VERIMAG, France Dejan Nickovic, AIT Austrian Institute of Technology GmbH, Austria Program Committee ------------------------------------ Xavier Avon, EASii-IC, France Ezio Bartocci, Vienna University of Technology, Austria Sergiy Bogomolov, IST Austria, Austria Harald Brandl, AVL List GmbH, Austria Thao Dang, VERIMAG, France Jyotirmoy Deshmukh, Toyota Technical Center, USA Alexandre Donzé, UC Berkeley, USA Georgios Fainekos, Arizona State University, USA Thomas Ferrère, Mentor Graphics, France Christoph Grimm, Kaiserslautern University of Technology, Germany Radu Grosu, Vienna University of Technology, Austria Ichiro Hasuo, University of Tokyo, Japan Thomas Klotz, Bosch Sensortec GmbH, Germany Scott Little, Intel, USA Oded Maler, VERIMAG, France Thang Nguyen, Infineon Technologies AG, Austria Dejan Nickovic, AIT Austrian Institute of Technology GmbH, Austria Sriram Sankaranarayanan, University of Colorado at Boulder, USA

1 0

Fwd: Kobe Colloquium on Logic, Statistics and Informatics, January 7 (Paul Larson)
by Joerg Brendle 04 Jan '16

04 Jan '16

Kobe Colloquium on Logic, Statistics and Informatics 以下の要領でコロキウムを開催します。日時：2016年1月7日（木）14:00~15:30 講演者：Paul Larson （マイアミ大学）場所：神戸大学自然科学総合研究棟3号館4階421室（プレゼンテーション室） ============================================================ 題目：Canonical models for fragments of the Axiom of Choice. アブストラクト：We present technology for investigation of natural forcing extensions of the model L(R) which satisfy such statements as “there is a nonprincipal ultrafilter on the integers” or “there is a total selector for the Vitali equivalence relation”. The technology reduces many questions about ZF implications between consequences of the axiom of choice to natural ZFC forcing problems. ======================================================== 交通：阪急六甲駅またはJR六甲道駅から神戸市バス36系統「鶴甲団地」行きに乗車，「神大本部工学部前」停留所下車，徒歩すぐ． http://www.kobe-u.ac.jp/info/access/rokko/rokkodai-dai2.htm

1 0

[CSC Journals] CFP INTERNATIONAL JOURNAL OF ENGINEERING (IJE)
by J. Steward 04 Jan '16

04 Jan '16

Call for Papers International Journal of Engineering (IJE) ISSN - 1985-2312 http://www.cscjournals.org/journals/IJE/description.php International Journal of Engineering (IJE) is devoted in assimilating publications that document development and research results within the broad spectrum of subfields in the engineering sciences. The journal is publishing scientific research relating to various disciplines of the engineering field from theoretical, practical and analytical research to physical implications and theoretical or quantitative discussion intended for both academic and industrial progress. IJE is a peer review open access journal and aims to provide scientific knowledge to its readers in the field of aerospace engineering, biomedical engineering, civil & structural engineering, electrical engineering, electronic engineering, fluid engineering, mechanical engineering and nuclear engineering etc. IJE intended audience is comprised of scientists, researchers, mathematicians, practicing engineers, among others working in Engineering and welcomes them to publish their research in their particular disciplines. Besides targeting different research communities, IJE mainly focuses on engineers and researchers relevant to aerospace, agriculture, manufacturing, mechanics, mining and nuclear by publishing relevant research articles that will help them to learn from real time experiences, logics and conclusions drawn by other researchers and industrial experts. ASSOCIATE EDITORS Professor Ernest Baafi - University of Wollongong (Australia) Dr. Tarek M. Sobh - University of Bridgeport (United States of America) Assistant Professor Aleksandar Vujovic - Univeristy of Montenegro (Montenegro) Dr. Jelena Jovanovic - University of Montenegro (Serbia and Montenegro) Dr. Xuefei Guan - Siemens Corporate Research (United States of America) Dr. Cheng-Xian (Charlie) Lin - Florida International University (United States of America) EDITORIAL BOARD MEMBERS Associate Professor Fichera Sergio - University of Catania (Italy) Professor Jing Zhang - University of Alaska Fairbanks (United States of America) Dr. Tao Chen - Nanyang Technological University (Singapore) Dr. Oscar Hui - University of Hong Kong (Hong Kong) Associate Professor Aidy Ali - Universiti Putra Malaysia (Malaysia) Dr. Alireza Bahadori - Curtin University (Australia) Dr. Wanquan Liu - Curtin University (Australia) Dr. Xing-Gang Yan - University of Kent (United Kingdom) Dr. Reza Shadnam - KPMG (Canada) Associate Professor Miladin Stefanovic - University of Kragujevac (Serbia and Montenegro) Associate Professor Hong-Hu Zhu - Nanjing University (China) Professor Dr Mazlina Esa - Universiti Teknologi Malaysia (Malaysia) Associate Professor Mohd Amri Lajis - Universiti Tun Hussein Onn Malaysia (Malaysia) Associate Professor Khalifa Saif Al-Jabri - Sultan Qaboos University (Oman) Professor Tarek Abdel-Salam - East Carolina University (United States of America) Dr. Mohamed Rahayem - Örebro University (Sweden) Professor Zdravko Krivokapic - University of Montenegro (Serbia and Montenegro) Dr. Rosli - Universiti Tun Hussein Onn Malaysia (Malaysia) Professor Qingling Zhang - Northeastern University (China) Dr. Guoxiang Liu - University of North Dakota (United States of America) Dr. Nam Nguyen Dang - PetroVietnam University (Vietnam) Professor Dr.-Eng. Shehata E. Abdel Raheem - Assiut University - Egypt/Taibah University - KSA (Saudi Arabia) LIST OF TOPICS Aerospace Engineering Agricultural Engineering Biomedical Engineering Chemical Engineering Civil & Structural Engineering Computer Engineering Control Systems Engineering Education Engineering Electrical Engineering Electronic Engineering Engineering Mathematics Engineering Science Environmental Engineering Fluid Engineering Geotechnical Engineering Industrial Engineering Manufacturing Engineering Materials & Technology Engineering Mechanical Engineering Mineral & Mining Engineering Nuclear Engineering Optical Engineering Petroleum Engineering Robotics & Automation Engineering Telecommunications Engineering IMPORTANT DATES Paper Submission January 31, 2016 Author Notification February 28, 2016 Issue Publication March 2016 PAPER SUBMISSION DETAILS In order to submit the paper, you need to register as author and then submit the paper through Author Dashboard. It is also important to ensure that the manuscript must be formatted as per IJE Manuscript Preparation Guidelines. For further information, please refer to the following information. IJE Website - http://www.cscjournals.org/journals/IJE/description.php Submission Guidelines - http://www.cscjournals.org/journals/IJE/submission-guidelines.php Register as Author - http://www.cscjournals.org/login.php CSC-OpenAccess Library - http://www.cscjournals.org/library/oa-library.php Call for EDITORS International Journal of Engineering (IJE) seeks applications from enthusiastic researchers and scholars who can oversee and maintain the editorial direction of the journal to ensure a steady flow of engaging and thought-provoking original research publications. IJE is a peer-reviewed International journal dedicated to publishing an open access original research, reports, and reviews. For future improvement and development, IJE particularly seeks editors who can continue the enduring and ongoing editorial successes to next level and introduce the journal profile to different libraries and research centers around the globe. IJE welcome applications from editors with strong academic background and Internationally recognized reputation. Applicants with significant publishing or reviewing experience will be preferred. To qualify for the post of editorial board member (EBM), Associate Editor-in-Chief (AEiC) or Editor-in-Chief (EiC) applicants must have PhD degree having wide experience in academic/Industry/ research and international conferences. For more information on editorial role & responsibilities, benefits & privileges and application criteria to apply for editorial collaborations with IJE-CSC Journals, please refer to the following URLs. Editors Guidelines - http://www.cscjournals.org/editors/editors-guidelines.php Call For Editors - http://www.cscjournals.org/journals/IJE/call-for-editors.php Please do not hesitate to contact us at cscpress(a)cscjournals.org if you require more information prior to submission. Our team is committed to provide quick response and support from submission to final publication. Sincerely Editorial Board Members International Journal of Engineering (IJE) Computer Science Journals (CSC Journals) B-5-8 Plaza Mont Kiara, Mont Kiara 50480, Kuala Lumpur, Malaysia Phone: 00603 6204 5627 Fax: 00603 6204 5628 Url: http://www.cscjournals.org

1 0

MLG数理論理学研究集会(1/8-1/10京都）
by Kazushige TERUI 03 Jan '16

03 Jan '16

みなさま今週末に開かれるＭＬＧ数理論理学研究集会のご案内をさせていただきます。講演・宿泊は締め切りましたが、参加は自由となっておりますので近隣に在住の方はよろしければご参加ください。照井 -------------------------- 第50回MLG数理論理学研究集会 MLG数理論理学研究集会は，1971年開始された，この分野の多くの研究者が参加している40年以上続く研究集会です。成果を発表し合ったり，アイデアを交換したりと，ザックバランな雰囲気で行われています。数学の他分野や，広く数理科学，情報科学，哲学の方々や，外国からの研究者を迎えるなど，オープンに運営されています。（昨年度の様子：https://sites.google.com/site/mlg2014kaga/ ）日時：２０１６年１月８日（金）午後 ― １０日（日）場所：京の民宿大原の里（京都府） http://www.oohara-no-sato.co.jp/ プログラム： http://www.kurims.kyoto-u.ac.jp/~terui/mlg2015.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

23rd WoLLIC 2016 (Puebla, Mexico) - 2nd Call for Papers
by 小野寛晰 02 Jan '16

02 Jan '16

[Please circulate. Apologies for any duplicates] WoLLIC 2016 23rd Workshop on Logic, Language, Information and Computation August 16th-19th, 2016 Puebla, Mexico 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 SIGLOG (to be confirmed) ORGANISATION Fundación Universidad de las Américas, Puebla, Mexico Benemérita Universidad Autónoma de Puebla, Mexico Centro de Informática, Universidade Federal de Pernambuco, Brazil HOSTED BY Benemérita Universidad Autónoma de Puebla, Mexico 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-third WoLLIC will be held at the Department of Computer Science, Benemérita Universidad Autónoma de Puebla, Mexico, from August 16th to 19th, 2016. 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; 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. They must not exceed 15 pages (in font 10 or higher), 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 2016 EasyChair website. (Please go to http://wollic.org/wollic2016/instructions.html <http://wollic.org/wollic2016/instructions.html> for instructions.) A title and single-paragraph abstract should be submitted by Mar 14, 2016, and the full paper by Mar 21, 2016 (firm date). Notifications are expected by Apr 22, 2016, and final papers for the proceedings will be due by May 6, 2016 (firm date). PROCEEDINGS The proceedings of WoLLIC 2016, including both invited and contributed papers, will be published in advance of the meeting as a volume in Springer's LNCS series (FoLLI subseries). In addition, abstracts will be published in the Conference Report section of the Logic Journal of the IGPL (Oxford U Press), and selected contributions will be published as a special post-conference WoLLIC 2016 issue of a scientific journal (to be confirmed). INVITED SPEAKERS Pablo Barceló (Santiago de Chile) Alessandra Parmigiano (Delft) Sonja Smets (Amsterdam) Andres Villaveces (Bogotá) (more to be confirmed) SPECIAL SCREENING - A TRIBUTE TO THE LEGACY OF GEORGE BOOLE In celebration of the 200th anniversary of George Boole's birth (1815), there will be a special session with a screening of the documentary film "The Genius of George Boole" (2015, 58min). (to be confirmed) STUDENT GRANTS ASL sponsorship of WoLLIC 2016 will permit ASL student members to apply for a modest travel grant (deadline: May 1st, 2016). See http://www.aslonline.org/studenttravelawards.html <http://www.aslonline.org/studenttravelawards.html> for details. IMPORTANT DATES Mar 14, 2016: Paper title and abstract deadline Mar 21, 2016: Full paper deadline Apr 22, 2016: Author notification May 6, 2016: Final version deadline (firm) PROGRAM COMMITTEE Samson Abramsky <http://www.cs.ox.ac.uk/samson.abramsky/> (U Oxford, UK) Dietmar Berwanger <http://www.lsv.ens-cachan.fr/~dwb/> (ENS Cachan, France) Guram Bezhanishvili <http://sierra.nmsu.edu/gbezhani/> (New Mexico State U, USA) Arnaud Durand <http://www.logique.jussieu.fr/~durand/> (U Paris 7, France) Pietro Galliani <https://tuhat.halvi.helsinki.fi/portal/en/persons/pietro-galliani(f7840cff-…> (U Helsinki, Finland) Nina Gierasimczuk <http://www.ninagierasimczuk.com/> (U Amsterdam, The Netherlands) Jeroen Groenendijk <http://www.uva.nl/over-de-uva/organisatie/medewerkers/content/g/r/j.a.g.gro…> (U Amsterdam, The Netherlands) Lauri Hella <http://www.sis.uta.fi/~malahe/> (U Tampere, Finland) Wesley Holliday <https://philosophy.berkeley.edu/holliday> (U Calif Berkeley, USA) Juha Kontinen <http://www.helsinki.fi/~jkontine/> (Helsinki U, Finland) Larry Moss <http://www.indiana.edu/~iulg/moss/> (Indiana U, USA) André Nies <https://www.cs.auckland.ac.nz/~nies/> (U Auckland, New Zealand) Aarne Ranta <http://www.cse.chalmers.se/~aarne/> (Chalmers U, Sweden) Mehrnoosh Sadrzadeh <http://www.eecs.qmul.ac.uk/people/view/33472/dr-mehrnoosh-sadrzadeh> (Queen Mary Coll, UK) Norma Short <http://www.ceperc.cnrs.fr/spip.php?article161&lang=fr> (U Aix-Marseille, France) Jouko Väänänen <http://www.math.helsinki.fi/logic/people/jouko.vaananen/> (U Helsinki, Finland & U Amsterdam, The Netherlands) (CHAIR) Rineke Verbrugge <http://www.rinekeverbrugge.nl/> (U Groningen, The Netherlands) Heribert Vollmer <http://www.thi.uni-hannover.de/vollmer.html> (U Hannover, Germany) Dag Westerståhl <http://www.philosophy.su.se/english/research/our-researchers/faculty/dag-we…> (Stockholm U, Sweden) 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. ORGANISING COMMITTEE Mauricio Osorio (Fundación Universidad de las Américas, Puebla) (Local co-chair) Claudia Zepeda Cortés (Facultad de Ciencias de la Computación, Benemérita Universidad Autónoma de Puebla) (Local co-chair) José R. Arrazola Ramírez (Facultad de Ciencias Físico Matemáticas, Benemérita Universidad Autónoma de Puebla) (Local co-chair) Anjolina G. de Oliveira (U Fed Pernambuco) Ruy de Queiroz (U Fed Pernambuco) (co-chair) FURTHER INFORMATION Contact one of the Co-Chairs of the Organising Committee. WEB PAGE http://wollic.org/wollic2016/ <http://wollic.org/wollic2016/>

1 0

【〆切延長：1/8】情報処理学会第108回プログラミング研究発表会発表募集【2/28〜2/29@東大駒場キャンパス】
by Kazutaka Matsuda 25 Dec '15

25 Dec '15

logic-ml関係者の皆様，東北大学の松田です．複数受け取られた場合はご容赦ください。発表申し込み〆切が1/8に延長されましたので，三度，この場をお借りいたしまして，来たる2016年2月28日〜29日に開催される情報処理学会第108回プログラミング研究会の発表募集のご案内させていただきます．どうぞ，発表や投稿をご検討いただけますと幸いです． ========================================================== 情報処理学会第108回プログラミング研究発表会発表募集プログラミング研究会（PRO）は，・プログラミング言語の設計，処理系の実装・プログラミングの理論，基本概念・プログラミング環境，支援システム・プログラミング方法論，パラダイム・これらを応用したシステムの開発事例・その他，プログラミングに関する面白い話題を対象とした研究発表の場で，1998年度から毎年3〜4回のペースで論文誌を発行しています．PRO論文誌は研究会と密接にリンクしており，研究会で発表されたもののうちあらかじめ論文投稿を希望し，論文原稿を提出されているものが査読の対象となっています（論文誌投稿を希望しない発表も歓迎します）．おおむね研究会から3週間で論文の採否が決定されるという迅速さも大きな特徴です．2016年2月の研究会も多くの発表ならびに論文投稿をお待ちしております．参加費は無料です．申込締切は 1月8日（金）【延長いたしました】，投稿締切は1月28日（木）です．よろしくご検討ください．なお，多数の発表申込みがある場合には，発表をお断りすることがございますので，お早めにお申し込みください．発表申込時で必要なのはタイトルと概要などとなっております．なお，「情報処理学会論文誌：プログラミング (PRO) 」に掲載される英文論文の出版形態に変更があります．英文論文をご投稿される場合，または，採録後の英語化をご検討の方は，以下のアナウンスをご確認ください． http://sigpro.ipsj.or.jp/english-paper-encouragement/ 第108回プログラミング研究会（PRO-2015-5）発表募集日程：2016年2月28日（日）・29日（月）会場：東京大学駒場キャンパス 15号館 409号室　　　〒153-8902東京都目黒区駒場3-8-1 発表申込締切：　　　　2016年1月8日（金）投稿論文原稿提出締切：2016年1月28日（木）申込先：松田一孝（東北大学）　　　　E-mail: kztk [at] ecei.tohoku.ac.jp 案内ページ：http://sigpro.ipsj.or.jp/pro2015-5/ ・申込みに当たっての注意はプログラミング研究会のページ　http://sigpro.ipsj.or.jp/を参照してください．・申込みの際には整理のために，Subject欄に以下をご指定ください．　　「PRO2015-5発表申込み」（カッコ不要）・論文投稿を伴う発表希望者のための手引き．　http://sigpro.ipsj.or.jp/trans-author/ ・発表のみを希望する方のための手引き．　http://sigpro.ipsj.or.jp/presentation/ ・できるだけE-mailでお願いします．・申込み後3日以内に返信がない場合はご連絡下さい．

1 0

締切延長: PPL2016 第18回プログラミングおよびプログラミング言語ワークショップ論文募集
by Takahito Aoto 21 Dec '15

21 Dec '15

PPL2016 カテゴリ1の締切を延長しました：発表申込締切: 2015年12月28日(月) 17:00 (JST) 論文提出締切: 2016年1月12日(火) 17:00 (JST) ぜひ，申し込みをご検討ください． --- 青戸等人(新潟大学) ====================================================================== 第18回プログラミングおよびプログラミング言語ワークショップ (PPL2016) http://logic.cs.tsukuba.ac.jp/ppl2016/ 論文募集主催: 日本ソフトウェア科学会プログラミング論研究会日程: 2016年3月7日(月)〜3月9日(水) 会場: 岡山県玉野市たまの温泉「ダイヤモンド瀬戸内マリンホテル」http://www.marine-hotel.co.jp/ PPL2016は，プログラミングおよびプログラミング言語に関する研究者が一堂に会し，最新の研究成果の発表，および新たな研究課題についての討論やアイディア交換等を行うことを目的とした，合宿形式のワークショップです．プログラミングおよびプログラミング言語の理論・設計・実装・処理系などに関する研究発表を，カテゴリ別に幅広く募集します．カテゴリ1: 国内外で未発表の論文の発表カテゴリ2: 国際会議・学術雑誌等で既発表であるが，国内では未発表の研究の紹介カテゴリ3: ポスター・デモ発表(既発表・未発表の別を問いません) カテゴリ4: サーベイ・チュートリアル発表(既発表・未発表の別を問いません) カテゴリ1の採択論文の中から，特に独創的なアイディアや顕著な成果を含むものに対して論文賞を授与する予定です．また全論文発表と全ポスター・デモのなかから，聴衆の投票によりそれぞれ，最も優秀な論文プレゼンテーションには発表賞(一般の部，学生の部，既受賞者は除く)，最も優秀なポスター・デモにはポスター賞を授与する予定です．カテゴリ1 (国内外未発表論文) ---------------------------- 完成した理論やシステムの研究発表のみならず，萌芽的なアイディアや問題点の提示等も歓迎します．発展途上の研究内容も積極的に採録する方針です(ただし，PPLでの発表として相応しくないと判断される場合は，この限りではありません)．また，カテゴリ1で発表された研究については，会場での討議や査読コメントをもとにその完成度を高め，将来の学術雑誌・会議等での業績に結び付けることを奨励しています．そのため，予稿集の配布はウェブを用いる場合を含め，参加者のみへの限定的なものとします．カテゴリ1で発表された研究のうち，PPL2016プログラム委員会により優れていると認められたものは，PPL2016終了後(2016年4月下旬予定)，「コンピュータソフトウェア」誌のPPL2016推薦論文としての投稿が可能です．推薦論文は，PPL プログラム委員が引き続き査読を行うことによる，迅速な査読プロセスを特長としています．カテゴリ2 (国外既発表論文) -------------------------- 査読付の国際会議または学術雑誌等で既発表であるが国内では未発表である研究を紹介する場です．採録決定済みの研究も含みます．PPLへの関連をもとに採否を判定いたしますが，申し込み多数の場合はプログラム委員会での選考により，発表をご遠慮いただく可能性もございますので，その旨をご了承の上ご投稿ください．カテゴリ3 (ポスター・デモ発表) ----------------------------- 2時間程度のセッション内でのポスター発表またはデモ発表です．既発表・未発表の別を問いません．PPLへの関連をもとに採録を判定いたします．また，申し込み多数の場合はプログラム委員会での選考により採否を決定します．会場の状況により，ポスターの常設展示を可能とします．ショートプレゼンテーションは行いません．カテゴリ4 (サーベイ・チュートリアル発表) -------------------------------------- 研究動向の紹介(発表者の研究も含む)や分野間の相互理解と参加者の知識の底上げとなる発表を募集します．既発表・未発表の別を問いません．発表後，発表スライドをPPL2016ウェブページ上にて公開して頂く予定です．PPLへの関連，著者の研究発表実績，トピックや切り口の興味深さをもとに，プログラム委員会で選考致します．なお，PPL2015と同様，PPL2016の終了は夕刻(14:00〜16:00頃)を予定しています． ====================================================================== 投稿・発表申込要領すべてのカテゴリの投稿・発表について，次のURLから申し込んでください． https://www.easychair.org/conferences/?conf=ppl2016 申込にあたってはEasyChairのアカウントが必要です．4つのカテゴリそれぞれに対する申込要領の詳細は以下の通りです．最新の情報は上記ウェブページでご確認ください．カテゴリ1 (国内外未発表論文) --------------------------- 投稿手続きは2段階です．発表申込を行った上で論文提出を行ってください．発表申込締切: 2015年12月28日(月) 17:00 (JST) [延長しました] 著者名，所属，論文タイトル，論文概要(日本語300〜400字程度もしくは英語200 words 程度)，キーワード(3つ以上)を提出してください．論文提出締切: 2016年1月12日(火) 17:00 (JST) [延長しました] 10ページ程度(最大15ページ)の論文(日本語もしくは英語，PDF形式． PPL2016ウェブページにて指定のスタイルファイルを利用のこと)を提出してください．採否通知: 2016年2月2日(火) 最終原稿締切: 2016年2月15日(月) 採録された論文の最終原稿の提出方法は，採否通知にてお知らせいたします．ページ数制限は投稿版と同じ予定です． (注) 採録された論文等著作物は，日本ソフトウェア科学会著作権規定にもとづいて利用されますので，予めご確認ください． (注) 投稿論文と類似の論文を，他の会議(予稿集を出版するもの)・論文誌などに同時投稿する場合は，査読の有無に関わらず，その旨を発表申込および論文提出の際に明記してください．PPLでは同時投稿の事実のみをもって論文を不採録とすることはありませんが，採否の決定に利用する場合があります (他の会議との重複を避けるため，発表内容についての条件付採録とすることもあります)．カテゴリ2 (国外既発表論文) ------------------------- 発表申込時に採録が決定している国際会議および国際学術雑誌等の発表論文が対象です．理論系だけではなく実装系の論文の投稿も歓迎いたします．発表申込締切: 2016年1月25日(月) 17:00 (JST) 原論文(ページ数不問，PDF形式)と論文概要(テキスト形式)を，著者名，所属，論文タイトル，キーワード(3つ以上)と併せて提出してください．論文概要にて，原論文の出典(発表会議名，掲載済／予定の別等を含む)についても明記してください．採否通知: 2016年2月5日(金) カテゴリ3 (ポスター・デモ発表) ----------------------------- ポスター・デモの区別を行わずに募集いたします．デモを行う場合は，発表概要においてその旨を説明してください．発表申込締切: 2016年2月8日(月) 17:00 (JST) 希望する発表形態(ポスター・デモの別)を明記して，著者名，所属，発表タイトル，発表概要(200〜300字程度)，キーワード(3つ以上) を提出してください．採否通知: 2016年2月15日(月) カテゴリ4 (サーベイ・チュートリアル発表) --------------------------------------- 発表申込締切: 2016年1月25日(月) 17:00 (JST) 著者名，所属，発表タイトル，キーワード(3つ以上)，発表概要 (3ページ以内，PDF形式．目的，カバーする話題，想定する聴衆，必要な知識の記述を含むもの)を提出してください．採否通知: 2016年2月5日(金) ====================================================================== ワークショップ全般に関する問い合わせ先： ppl2016-oc(a)logic.cs.tsukuba.ac.jp ====================================================================== プログラム委員会青戸等人新潟大学安部達也理化学研究所岩崎英哉電気通信大学上野雄大東北大学鵜川始陽高知工科大学江本健斗九州工業大学角谷良彦東京大学河内谷清久仁日本IBM 木村大輔東邦大学櫻井孝平金沢大学佐藤重幸東京大学佐藤芳樹東京大学佐藤亮介東京大学滝本宗宏東京理科大学田辺良則鶴見大学対馬かなえ国立情報学研究所平井洋一 FireEye Dresden 平石拓京都大学森口草介関西学院大学八杉昌宏九州工業大学横山哲郎南山大学組織委員会海野広志筑波大学 [組織委員長] 塚田武志東京大学対馬かなえ国立情報学研究所松田一孝東北大学末永幸平京都大学上野雄大東北大学青戸等人新潟大学 [プログラム共同委員長] 鵜川始陽高知工科大学 [プログラム共同委員長] ======================================================================

1 0

CFP: PPL2016 第18回プログラミングおよびプログラミング言語ワークショップ論文募集
by Takahito Aoto 14 Dec '15

14 Dec '15

カテゴリ1の申込締切まであと1週間となりましたので再送させて頂きます (論文提出の締切は1月8日です)．どうぞよろしくご検討ください． --- 青戸等人(新潟大学) ====================================================================== 第18回プログラミングおよびプログラミング言語ワークショップ (PPL2016) http://logic.cs.tsukuba.ac.jp/ppl2016/ 論文募集主催: 日本ソフトウェア科学会プログラミング論研究会日程: 2016年3月7日(月)〜3月9日(水) 会場: 岡山県玉野市たまの温泉「ダイヤモンド瀬戸内マリンホテル」http://www.marine-hotel.co.jp/ PPL2016は，プログラミングおよびプログラミング言語に関する研究者が一堂に会し，最新の研究成果の発表，および新たな研究課題についての討論やアイディア交換等を行うことを目的とした，合宿形式のワークショップです．プログラミングおよびプログラミング言語の理論・設計・実装・処理系などに関する研究発表を，カテゴリ別に幅広く募集します．カテゴリ1: 国内外で未発表の論文の発表カテゴリ2: 国際会議・学術雑誌等で既発表であるが，国内では未発表の研究の紹介カテゴリ3: ポスター・デモ発表(既発表・未発表の別を問いません) カテゴリ4: サーベイ・チュートリアル発表(既発表・未発表の別を問いません) カテゴリ1の採択論文の中から，特に独創的なアイディアや顕著な成果を含むものに対して論文賞を授与する予定です．また全論文発表と全ポスター・デモのなかから，聴衆の投票によりそれぞれ，最も優秀な論文プレゼンテーションには発表賞(一般の部，学生の部，既受賞者は除く)，最も優秀なポスター・デモにはポスター賞を授与する予定です．カテゴリ1 (国内外未発表論文) ---------------------------- 完成した理論やシステムの研究発表のみならず，萌芽的なアイディアや問題点の提示等も歓迎します．発展途上の研究内容も積極的に採録する方針です(ただし，PPLでの発表として相応しくないと判断される場合は，この限りではありません)．また，カテゴリ1で発表された研究については，会場での討議や査読コメントをもとにその完成度を高め，将来の学術雑誌・会議等での業績に結び付けることを奨励しています．そのため，予稿集の配布はウェブを用いる場合を含め，参加者のみへの限定的なものとします．カテゴリ1で発表された研究のうち，PPL2016プログラム委員会により優れていると認められたものは，PPL2016終了後(2016年4月下旬予定)，「コンピュータソフトウェア」誌のPPL2016推薦論文としての投稿が可能です．推薦論文は，PPL プログラム委員が引き続き査読を行うことによる，迅速な査読プロセスを特長としています．カテゴリ2 (国外既発表論文) -------------------------- 査読付の国際会議または学術雑誌等で既発表であるが国内では未発表である研究を紹介する場です．採録決定済みの研究も含みます．PPLへの関連をもとに採否を判定いたしますが，申し込み多数の場合はプログラム委員会での選考により，発表をご遠慮いただく可能性もございますので，その旨をご了承の上ご投稿ください．カテゴリ3 (ポスター・デモ発表) ----------------------------- 2時間程度のセッション内でのポスター発表またはデモ発表です．既発表・未発表の別を問いません．PPLへの関連をもとに採録を判定いたします．また，申し込み多数の場合はプログラム委員会での選考により採否を決定します．会場の状況により，ポスターの常設展示を可能とします．ショートプレゼンテーションは行いません．カテゴリ4 (サーベイ・チュートリアル発表) -------------------------------------- 研究動向の紹介(発表者の研究も含む)や分野間の相互理解と参加者の知識の底上げとなる発表を募集します．既発表・未発表の別を問いません．発表後，発表スライドをPPL2016ウェブページ上にて公開して頂く予定です．PPLへの関連，著者の研究発表実績，トピックや切り口の興味深さをもとに，プログラム委員会で選考致します．なお，PPL2015と同様，PPL2016の終了は夕刻(14:00〜16:00頃)を予定しています． ====================================================================== 投稿・発表申込要領すべてのカテゴリの投稿・発表について，次のURLから申し込んでください． https://www.easychair.org/conferences/?conf=ppl2016 申込にあたってはEasyChairのアカウントが必要です．4つのカテゴリそれぞれに対する申込要領の詳細は以下の通りです．最新の情報は上記ウェブページでご確認ください．カテゴリ1 (国内外未発表論文) --------------------------- 投稿手続きは2段階です．発表申込を行った上で論文提出を行ってください．発表申込締切: 2015年12月21日(月) 17:00 (JST) 著者名，所属，論文タイトル，論文概要(日本語300〜400字程度もしくは英語200 words 程度)，キーワード(3つ以上)を提出してください．論文提出締切: 2016年1月8日(金) 17:00 (JST) 10ページ程度(最大15ページ)の論文(日本語もしくは英語，PDF形式． PPL2016ウェブページにて指定のスタイルファイルを利用のこと)を提出してください．採否通知: 2016年2月2日(火) 最終原稿締切: 2016年2月15日(月) 採録された論文の最終原稿の提出方法は，採否通知にてお知らせいたします．ページ数制限は投稿版と同じ予定です． (注) 採録された論文等著作物は，日本ソフトウェア科学会著作権規定にもとづいて利用されますので，予めご確認ください． (注) 投稿論文と類似の論文を，他の会議(予稿集を出版するもの)・論文誌などに同時投稿する場合は，査読の有無に関わらず，その旨を発表申込および論文提出の際に明記してください．PPLでは同時投稿の事実のみをもって論文を不採録とすることはありませんが，採否の決定に利用する場合があります (他の会議との重複を避けるため，発表内容についての条件付採録とすることもあります)．カテゴリ2 (国外既発表論文) ------------------------- 発表申込時に採録が決定している国際会議および国際学術雑誌等の発表論文が対象です．理論系だけではなく実装系の論文の投稿も歓迎いたします．発表申込締切: 2016年1月25日(月) 17:00 (JST) 原論文(ページ数不問，PDF形式)と論文概要(テキスト形式)を，著者名，所属，論文タイトル，キーワード(3つ以上)と併せて提出してください．論文概要にて，原論文の出典(発表会議名，掲載済／予定の別等を含む)についても明記してください．採否通知: 2016年2月5日(金) カテゴリ3 (ポスター・デモ発表) ----------------------------- ポスター・デモの区別を行わずに募集いたします．デモを行う場合は，発表概要においてその旨を説明してください．発表申込締切: 2016年2月8日(月) 17:00 (JST) 希望する発表形態(ポスター・デモの別)を明記して，著者名，所属，発表タイトル，発表概要(200〜300字程度)，キーワード(3つ以上) を提出してください．採否通知: 2016年2月15日(月) カテゴリ4 (サーベイ・チュートリアル発表) --------------------------------------- 発表申込締切: 2016年1月25日(月) 17:00 (JST) 著者名，所属，発表タイトル，キーワード(3つ以上)，発表概要 (3ページ以内，PDF形式．目的，カバーする話題，想定する聴衆，必要な知識の記述を含むもの)を提出してください．採否通知: 2016年2月5日(金) ====================================================================== ワークショップ全般に関する問い合わせ先： ppl2016-oc(a)logic.cs.tsukuba.ac.jp ====================================================================== プログラム委員会青戸等人新潟大学安部達也理化学研究所岩崎英哉電気通信大学上野雄大東北大学鵜川始陽高知工科大学江本健斗九州工業大学角谷良彦東京大学河内谷清久仁日本IBM 木村大輔東邦大学櫻井孝平金沢大学佐藤重幸東京大学佐藤芳樹東京大学佐藤亮介東京大学滝本宗宏東京理科大学田辺良則鶴見大学対馬かなえ国立情報学研究所平井洋一 FireEye Dresden 平石拓京都大学森口草介関西学院大学八杉昌宏九州工業大学横山哲郎南山大学組織委員会海野広志筑波大学 [組織委員長] 塚田武志東京大学対馬かなえ国立情報学研究所松田一孝東北大学末永幸平京都大学上野雄大東北大学青戸等人新潟大学 [プログラム共同委員長] 鵜川始陽高知工科大学 [プログラム共同委員長] ======================================================================

1 0

FLOPS2016 ポスター/デモ発表募集 & 参加募集
by Yukiyoshi Kameyama 11 Dec '15

11 Dec '15

皆様、(重複して受け取られた場合は、御容赦ください。) 国際会議FLOPS2016 -- Functional and Logic Programming -- のポスターおよびデモ発表の募集 & 参加募集をお送りします。 FLOPS2016 は PPL2016 の直前に、比較的近い場所で開催されます。2件の招待講演: Kazunori UEDA (Waseda University) The exciting time and hard-won lessons of the Fifth Generation Computer Project Atze Dijkstra (Utrecht University) UHC: Coping with Compiler Complexity のほか、興味深い話題でのチュートリアル3件も予定されています。 Andreas Abel, on Agda Atze Dijkstra, on Attribute Grammars Neng-Fa Zhou, on programming in Picat FLOPS2016でポスターもしくはデモを行えば、招待講演者を含む参加者の方々からのコメントを多く得られることと思います。なお、これまで、日程は「2016/3/3-6 のうち 3日間程度」という曖昧な書き方をしていましたが、「2016/3/4-6」に確定させました。(PPL2016 は 3/7-9 です。) 多くの皆様のポスター/デモ発表、参加をお待ちしています。 -- 亀山幸義 (筑波大学) http://logic.cs.tsukuba.ac.jp/~kam --------------------------------------------------------------------- Call for Participation and Posters/Demos --------------- FLOPS 2016: 13th International Symposium on Functional and Logic Programming March 4-6, 2016, Kochi, Japan http://www.info.kochi-tech.ac.jp/FLOPS2016/ Registration will be open on Monday, Dec 21, 2015. Early registration deadline is Monday, Feb 8, 2016. Poster/Demo abstract submission deadline is Monday, Jan 11, 2016. FLOPS aims to bring together practitioners, researchers and implementers 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. In addition to the presentations of regular research papers, the FLOPS program includes tutorials, as well as the poster/demo session for demonstrating the tools and systems described during the talks and for presenting works-in-progress and getting the feedback. FLOPS has established a Best Paper award. The winner will be announced at the symposium. CALLS FOR POSTERS AND DEMONSTRATIONS If you wish to present a poster at FLOPS, please send the plain text abstract by e-mail to <flops2016(a)easychair.org> -- by January 11, 2016. The abstract should include the title, the names of the authors and their affiliation, along with enough details to judge its scope and relevance. We will announce the accepted submissions on January 25, 2016. The format of the poster will be announced at that time. Important Dates * Submission due: January 11, 2016 (Monday), any time zone * Notification: January 25, 2016 (Monday) INVITED TALKS Kazunori UEDA (Waseda University) The exciting time and hard-won lessons of the Fifth Generation Computer Project Atze Dijkstra (Utrecht University) UHC: Coping with Compiler Complexity TUTORIALS Andreas Abel, on Agda Atze Dijkstra, on Attribute Grammars Neng-Fa Zhou, on programming in Picat ACCEPTED PAPERS Ki Yung Ahn and Andrea Vezzosi. Executable Relational Specifications of Polymorphic Type Systems using Prolog Markus Triska. The Boolean Constraint Solver of SWI-Prolog: System Description Peng Fu, Ekaterina Komendantskaya, Tom Schrijvers and Andrew Pond. Proof Relevant Corecursive Resolution Jay McCarthy, Burke Fetscher, Max New and Robert Bruce Findler. A Coq Library For Internal Verification of Running-Times Akimasa Morihata. Incremental Computing with Abstract Data Structures Wouter Swierstra and Joao Alpuim. >From proposition to program: embedding the refinement calculus in Coq Andre Van Delft and Anatoliy Kmetyuk. Declarative Programming with Algebra Ian Mackie and Shinya Sato. An interaction net encoding of Godel's System T Arthur Blot, Pierre-Evariste Dagand and Julia Lawall. >From Sets to Bits in Coq Jeremy Yallop, David Sheets and Anil Madhavapeddy. Declarative foreign function binding through generic programming Praveen Narayanan, Jacques Carette, Wren Romano, Chung-Chieh Shan and Robert Zinkov. Probabilistic inference by program transformation in Hakaru: System description Francisco Javier Lopez-Fraguas, Manuel Montenegro and Juan Rodriguez-Hortala. Polymorphic Types in Erlang Function Specifications Remy Haemmerle, Pedro Lopez-Garcia, Umer Liqat, Maximiliano Klemen, John Gallagher and Manuel V. Hermenegildo. A Transformational Approach to Parametric Accumulated-cost Static Profiling Taus Brock-Nannestad. Space-efficient Planar Acyclicity Constraints: A Declarative Pearl

1 0

【発表募集：〆切12/24】情報処理学会第108回プログラミング研究発表会【2/28〜2/29@東大駒場キャンパス】
by Kazutaka Matsuda 11 Dec '15

11 Dec '15

logic-ml関係者の皆様，東北大学の松田です．複数受け取られた場合はご容赦ください。発表申し込み〆切（12/24！）が近付いてまいりましたので，再び，この場をお借りいたしまして，来たる2016年2月28日〜29日に開催される情報処理学会第108回プログラミング研究会の発表募集のご案内させていただきます．どうぞ，発表や投稿をご検討いただけますと幸いです． ========================================================== 情報処理学会第108回プログラミング研究発表会発表募集プログラミング研究会（PRO）は，・プログラミング言語の設計，処理系の実装・プログラミングの理論，基本概念・プログラミング環境，支援システム・プログラミング方法論，パラダイム・これらを応用したシステムの開発事例・その他，プログラミングに関する面白い話題を対象とした研究発表の場で，1998年度から毎年3〜4回のペースで論文誌を発行しています．PRO論文誌は研究会と密接にリンクしており，研究会で発表されたもののうちあらかじめ論文投稿を希望し，論文原稿を提出されているものが査読の対象となっています（論文誌投稿を希望しない発表も歓迎します）．おおむね研究会から3週間で論文の採否が決定されるという迅速さも大きな特徴です．2016年2月の研究会も多くの発表ならびに論文投稿をお待ちしております．参加費は無料です．申込締切は 12月24日（木），投稿締切は1月28日（木）です．よろしくご検討ください．なお，多数の発表申込みがある場合には，発表をお断りすることがございますので，お早めにお申し込みください．発表申込時で必要なのはタイトルと概要などとなっております．なお，「情報処理学会論文誌：プログラミング (PRO) 」に掲載される英文論文の出版形態に変更があります．英文論文をご投稿される場合，または，採録後の英語化をご検討の方は，以下のアナウンスをご確認ください． http://sigpro.ipsj.or.jp/english-paper-encouragement/ 第108回プログラミング研究会（PRO-2015-5）発表募集日程：2016年2月28日（日）・29日（月）会場：東京大学駒場キャンパス 15号館 409号室　　　〒153-8902東京都目黒区駒場3-8-1 発表申込締切：　　　　2015年12月24日（木）投稿論文原稿提出締切：2016年1月28日（木）申込先：松田一孝（東北大学）　　　　E-mail: kztk [at] ecei.tohoku.ac.jp 案内ページ：http://sigpro.ipsj.or.jp/pro2015-5/ ・申込みに当たっての注意はプログラミング研究会のページ　http://sigpro.ipsj.or.jp/を参照してください．・申込みの際には整理のために，Subject欄に以下をご指定ください．　　「PRO2015-5発表申込み」（カッコ不要）・論文投稿を伴う発表希望者のための手引き．　http://sigpro.ipsj.or.jp/trans-author/ ・発表のみを希望する方のための手引き．　http://sigpro.ipsj.or.jp/presentation/ ・できるだけE-mailでお願いします．・申込み後3日以内に返信がない場合はご連絡下さい．

1 0

Kobe Colloquium on Thu., Dec. 17
by Hirotaka Kikyo 09 Dec '15

09 Dec '15

Kobe Colloquium on Logic, Statistics and Informatics 以下の要領でコロキウムを開催します。日時：2015年12月17日（木）14:00-15:00 講演者：Byunghan Kim （延世大学）場所：神戸大学自然科学総合研究棟3号館4階421室（プレゼンテーション室）題目：The Lascar group, and the strong types of hyperimaginaries. 日時：2015年12月17日（木）15:30-16:30 講演者：Anand Pillay （ノートルダム大学）場所：神戸大学自然科学総合研究棟3号館4階421室（プレゼンテーション室）題目：Manin-Mumford Conjecture and Mordell-Lang Conjecture ======================================================== 交通：阪急六甲駅またはJR六甲道駅から神戸市バス36系統「鶴甲団地」行きに乗車，「神大本部工学部前」停留所下車，徒歩すぐ． http://www.kobe-u.ac.jp/info/access/rokko/rokkodai-dai2.htm

1 0

MLG数理論理学研究集会(1/8-10京都)　締切延長
by Kazushige TERUI 07 Dec '15

07 Dec '15

みなさま先日ご案内差し上げたMLG研究集会についてですが、講演も参加もまだ大幅に！余裕がありますので締切を１２月１３日（日）まで延長したいと思います。迷っていらっしゃる方、どうか助けると思ってご参加いただければと思います。なにとぞよろしくお願いします。 ----------------------- 第50回MLG数理論理学研究集会参加・講演募集 MLG数理論理学研究集会は，1971年開始された，この分野の多くの研究者が参加している40年以上続く研究集会です。成果を発表し合ったり，アイデアを交換したりと，ザックバランな雰囲気で行われています。数学の他分野や，広く数理科学，情報科学，哲学の方々や，外国からの研究者を迎えるなど，オープンに運営されています。（昨年度の様子：https://sites.google.com/site/mlg2014kaga/ ）日時：２０１６年１月８日（金）午後 ― １０日（日）場所：京の民宿大原の里（京都府） http://www.oohara-no-sato.co.jp/ 費用：全参加の場合、宿泊費・食費込で１万７千円程度（飲み代除く）。申し込み：参加希望の方は１２月７日（月）までに下記のフォームを記入の上　　　　　照井一成 terui(a)kurims.kyoto-u.ac.jp までご送付ください。世話人の怠慢により、募集が直前になってしまい大変申し訳ありません。急な話ではありますが、できるだけ多くの皆様にご参加いただければと思います。講演内容については、必ずしも新しい成果である必要はなく、サーヴェイ、萌芽的アイデア、未解決問題、周辺領域の紹介など幅広く募集したいと思います。どうぞよろしくお願いします。世話人：照井一成（京都大学） ----- 参加申込書 ----- １．お名前２．所属・身分３．参加日程（a,b,cのうち必要なものを残してください） a. 1月8日宿泊（夕食・朝食込） b. 1月9日昼食 c. 1月9日宿泊（夕食・朝食込）４．講演する・しない５．講演する場合タイトル（未定でも可）６．備考 ------------------------------------------ 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

FSCD'16 Second Call for Papers
by hassei＠kurims.kyoto-u.ac.jp 07 Dec '15

07 Dec '15

皆様、来年６月に開催される国際会議FSCD 2016の(2nd) call for papers です。 FSCD (Formal Structures for Computation and Deduction)は、 RTA (Rewriting Techniques and Applications)とTLCA (Typed Lambda Calculi and Applications)を融合・発展させた新しい会議です。論文の投稿をご検討いただけますと幸いです。長谷川真人京都大学数理解析研究所 -- SECOND CALL FOR PAPERS First International Conference on Formal Structures for Computation and Deduction (FSCD'16) 22 June -- 26 June 2016, Porto, Portugal http://fscd2016.dcc.fc.up.pt/ [NEW: INVITED SPEAKERS, CONFERENCE AWARDS, SPECIAL ISSUE, SATELLITE EVENTS] ========================================================================== IMPORTANT DATES Abstract Submission: 29 January 2016 Paper Submission : 5 February 2016 Rebuttal : 21 - 23 March 2016 Notification : 6 April 2016 ========================================================================== 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 and homotopy type theory. The name of the new conference comes from an unpublished but important book by Gerard Huet that strongly influenced many researchers in the area. Suggested, but not exclusive, list of topics for submission are: 1 Calculi * Lambda calculus * Logics (first-order, higher-order, equational, modal, linear, classical, constructive, etc.) * Rewriting systems (string, term, higher-order, graph, conditional, modulo, infinitary, etc.) * Proof theory (natural deduction, sequent calculus, proof nets, etc.) * Type theory and logical frameworks * Homotopy type theory 2. Methods in Computation and Deduction * Type systems (polymorphism, dependent, recursive, intersection, session, etc.) * Induction, coinduction * Matching, unification, completion, orderings * Strategies (normalization, completeness, etc.) * Tree automata * Model building and model checking * Proof search (resolution, paramodulation, narrowing, focusing, etc.) * Constraint solving and decision procedures 3. Semantics * Operational semantics and abstract machines * Game Semantics and applications * Domain theory and categorical models * Quantitative models (timing, probabilities, resources, etc.) * Quantum computation and emerging models in computation 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 (proof assistants, automated theorem prover, proof checkers, specialized provers, dependently typed languages, etc.) * Verification tools (abstract interpretation, termination, confluence, specialized provers, etc.) * Libraries for proof assistants and interactive theorem provers (support for variable bindings, nominal, polynomial, equality, etc.) * Case studies in proof assistants and interactive theorem provers (formalizations, mechanizations, certifications) * Certifications (theorems, rewriting techniques, etc.) * Applications of formal systems inside and outside of CS (biology, linguistics, physics, education, etc.) INVITED SPEAKERS Amal Ahmed (USA) Ichiro Hasuo (Japan) Gerard Huet (France) Tobias Nipkow (Germany) PROGRAM CHAIRS Delia Kesner (Univ. Paris-Diderot) Brigitte Pientka (McGill University) fscd16(a)easychair.org PROGRAM COMMITTEE Andreas Abel (Gothenburg Univ.) Zena Ariola (Univ. Oregon) Patrick Baillot (CNRS & ENS Lyon) Andrej Bauer (Univ. Ljubljana) Eduardo Bonelli (Univ. Quilmes) Patricia Bouyer (ENS Cachan) Ugo Dal Lago (Univ. Bologna) Nachum Dershowitz (Univ. Tel Aviv) Mariangiola Dezani-Ciancaglini (Univ. Torino) Derek Dreyer (MPI-SWS) Santiago Figueira (Univ. Buenos Aires) Marcelo Fiore (Univ. Cambridge) Juergen Giesl (Univ. Aachen) Nao Hirokawa (JAIST) Martin Hofmann (LMU Munchen) Delia Kesner (Univ. Paris-Diderot) Naoki Kobayashi (Univ. Tokyo) Dan Licata (Wesleyan Univ.) Chris Lynch (Clarkson Univ.) Narciso Marti-Oliet (Univ. Complutense) Aart Middeldorp (Univ. Innsbruck) Dale Miller (INRIA Saclay) Cesar Munoz (NASA) Vivek Nigam (Univ. Paraiba) Brigitte Pientka (McGill Univ.) Jakob Rehof (Univ. Dortmund) Xavier Rival (ENS Paris) Peter Selinger (Dalhousie Univ.) Paula Severi (Univ. Leicester) Jakob Grue Simonsen (Univ. Copenhagen) Matthieu Sozeau (INRIA Rocquencourt) Sophie Tison (Univ. Lille) Femke van Raamsdonk (VU Univ. Amsterdam) Nobuko Yoshida (Imperial College) CONFERENCE CHAIR Sandra Alves (University of Porto) FSCD STEERING COMMITTEE: Thorsten Altenkirch (Univ. Nottingham) Gilles Dowek (INRIA) Santiago Escobar (Univ. Politecnica de Valencia) Maribel Fernandez (King's College London) Masahito Hasegawa (Univ. Kyoto) Hugo Herbelin (INRIA) Nao Hirokawa (JAIST) Luke Ong (Chair, Univ. Oxford) Jens Palsberg (UCLA) Kristoffer Rose (Two Sigma Investments) Rene Thiemann (Univ. Innsbruck) Pawel Urzyczyn (Univ. Warsaw) Femke van Raamsdonk (VU Univ. Amsterdam) PUBLICATION The proceedings will be published as an electronic volume in the Leibniz International Proceedings in Informatics (LIPIcs). All LIPIcs proceedings are open access. SUBMISSION GUIDELINES Submissions can be made in two categories: regular research papers and system descriptions. Submissions of research papers must present original research which is unpublished and not submitted elsewhere. They must not exceed 15 pages (including figures and bibliography). Submissions of research papers will be judged on originality, significance, correctness, and readability. Submission of system descriptions must describe a working system which has not been published or submitted elsewhere. They must not exceed 10 pages and should contain a link to a working system. System descriptions will be judged on originality, significance, usefulness, and readability. Proofs of theoretical results that do not fit within the page limit, executables of systems, code of case studies, benchmarks used to evaluate a given system, should be made available, via a reference to a website or in an appendix of the paper. Reviewers will be encouraged to consider this additional material, but are not obliged to. Submissions must be self-contained within the respective page limit; considering the additional material should not be necessary to assess the merits of a submission. Submissions must be formatted using the LIPIcs style files using the instructions at http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/ A condition of submission is that, if accepted, one of the authors must attend the conference to give the presentation. Papers should be submitted via easychair. The submission site is at https://easychair.org/conferences/?conf=fscd16 CONFERENCE AWARDS Two awards will be selected: one for the best paper and another one for the best student paper. SPECIAL ISSUE After the conference, authors of selected papers will be invited to submit extended versions of their work to a special issue published in the open-access journal Logical Methods in Computer Science (LMCS). SATELLITE EVENTS The following meetings and workshops are colocated with FSCD 2016: CL&C, DCM, HDRA, HOR, IFIP Working Group 1.6, ITRS, Linearity, LFMTP, LSFA, UNIF, WPTE, WWV. ORGANISING COMMITTEE Sandra Alves (Univ. Porto) Sabine Broda (Univ. Porto) Jose Espirito-Santo (Univ. do Minho) Mario Florido (Univ. Porto) Nelma Moreira (Univ. Porto) Luis Pinto (Univ. do Minho) Rogerio Reis (Univ. Porto) Ana Paula Tomas (Univ. Porto) Pedro Vasconcelos (Univ. Porto)

1 0

証明論研究集会 & SLACS のご案内
by Toshihiko Kurata 07 Dec '15

07 Dec '15

皆様，証明論研究集会とSLACSの講演申込みを有難うございました．暫定版プログラムなど詳しい情報はHP https://sites.google.com/site/ptslacs2015/ から御確認頂けたらと思います．現状で枠に若干の余裕が出来ましたので，埋まるまでの間は講演の募集を続けることとなりました．希望をされる方は申し込みを頂けますと幸いです．あと，都合により懇親会は月曜日に行うこととなりました．御不便をお掛けしますが，よろしくお願いいたします．佐々木克巳（南山大学）倉田俊彦（法政大学）

1 0

講演: 海野さん（筑波大）
by Kohei SUENAGA 05 Dec '15

05 Dec '15

皆様、京大の末永です。12月8日（火）の 13:00 から筑波大の海野さんに講演をお願いしています。ご参加をお待ちしております。末永幸平 -- 日時：2015年12月8日（火）　13:00-14:00 場所：総合研究7号館情報3講義室講演者：海野広志（筑波大学大学院システム情報工学研究科コンピュータサイエンス専攻助教）講演題目：帰納法によるホーン節制約解消法と関数型プログラムの関係的仕様自動検証への応用概要：Verification problems of programs in various paradigms (e.g. imperative, functional, and concurrent) can be reduced to constraint solving problems of Horn clauses over predicate variables, which represent unknown inductive invariants to be inferred. In this talk, we present a novel constraint solving method based on inductive theorem proving: the method reduces Horn constraint solving to validity checking of first-order formulas with inductively-defined predicates,which are then checked by induction on the derivation of the predicates. The method here uses an SMT solver to automate inductive proofs. The main advantage of our constraint solving method over existing methods is that it can verify relational specifications (e.g., the equivalence, associativity, commutativity, distributivity, monotonicity, idempotency, and non-interference) where multiple function calls need to be analyzed simultaneously. Furthermore, our novel combination of Horn constraint solving and inductive theorem proving extends the reach of induction-based verification from pure total functions to impure partial procedures in various paradigms. We have implemented a prototype Horn constraint solver based on the proposed method and obtained promising results in preliminary experiments. -- 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

証明論研究集会 & SLACS のご案内
by Toshihiko Kurata 27 Nov '15

27 Nov '15

皆様，以前御連絡しました「証明論研究集会とSLACS」の案内を再送させて頂きます．題目などの情報は後から御連絡頂いても構いませんので，話題をお持ちの方はお気軽に申し込み頂けますと幸いです．よろしくお願いいたします．佐々木克巳（南山大学）倉田俊彦（法政大学） ------------------------------------- 2015年度の「証明論研究集会」と「記号論理と情報科学研究集会（SLACS）」について，合同開催の案内をメイルさせて頂きます．どちらの研究集会も数理論理学，計算の理論，情報科学などの理論・応用に関係する様々な話題が発表されていて研究者・学生の貴重な相互交流の場となっています．完成された研究のみならず発展途上の話題も大歓迎ですので，気軽に講演・参加を御検討下さい．開催日：2015年12月14日（月）〜16日（水）場所：南山大学名古屋キャンパスS棟(教室棟)7階S74教室世話役：佐々木克巳（南山大学）倉田俊彦（法政大学）詳細はHP https://sites.google.com/site/ptslacs2015/ をご覧頂けたらと思います．講演を希望される方は，御手数ですが ------------------------------------- 題目講演者名所属 e-mail アドレス概要講演時間懇親会参加希望その他の希望（講演日など） ------------------------------------- を pt.slacs2015(a)gmail.com までメイル下さい．申込の期限は12月04日（金）と設定していますので，よろしくお願いいたします．

1 0

MLG数理論理学研究集会(1/8-1/10京都）：参加・講演募集
by Kazushige TERUI 25 Nov '15

25 Nov '15

第50回MLG数理論理学研究集会参加・講演募集 MLG数理論理学研究集会は，1971年開始された，この分野の多くの研究者が参加している40年以上続く研究集会です。成果を発表し合ったり，アイデアを交換したりと，ザックバランな雰囲気で行われています。数学の他分野や，広く数理科学，情報科学，哲学の方々や，外国からの研究者を迎えるなど，オープンに運営されています。（昨年度の様子：https://sites.google.com/site/mlg2014kaga/ ）日時：２０１６年１月８日（金）午後 ― １０日（日）場所：京の民宿大原の里（京都府） http://www.oohara-no-sato.co.jp/ 費用：全参加の場合、宿泊費・食費込で１万８千円程度の予定（飲み代除く）。申し込み：参加希望の方は１２月７日（月）までに下記のフォームを記入の上　　　　　照井一成 terui(a)kurims.kyoto-u.ac.jp までご送付ください。世話人の怠慢により、募集が直前になってしまい大変申し訳ありません。急な話ではありますが、できるだけ多くの皆様にご参加いただければと思います。講演内容については、必ずしも新しい成果である必要はなく、サーヴェイ、萌芽的アイデア、未解決問題、周辺領域の紹介など幅広く募集したいと思います。どうぞよろしくお願いします。世話人：照井一成（京都大学） ----- 参加申込書 ----- １．お名前２．所属・身分３．参加日程（a,b,cのうち必要なものを残してください） a. 1月8日宿泊（夕食・朝食込） b. 1月9日昼食 c. 1月9日宿泊（夕食・朝食込）４．講演する・しない５．講演する場合タイトル（未定でも可）６．備考 ------------------------------------------ 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

セミナー案内
by KASHIMA Ryo 17 Nov '15

17 Nov '15

数理論理学セミナーのお知らせ日時：1月23日(金) 16:00から場所：東京工業大学大岡山西８号館Ｗ棟10階 W1008 話者：鈴木信行（静岡大学）題目：中間述語論理におけるExistence Propertyに関する話題 --- 小野の問題P52とその周辺 --- 概要：始めに中間述語論理の簡単な紹介をします。ざっくり言うと、中間述語論理とは、直観主義述語論理と古典述語論理の「中間」にある述語論理です。つぎに、existence property と disjunction property と言う性質を考えます。これらは、直観主義論理の構成性(constructivity)を示す顕著な性質として知られています。中間述語論理の枠組みでこれらを考察してみると、この2つの性質が独立であることが解ります。これは、小野の問題P52として知られる問題に否定的解決を与えます。今回は、これにまつわる若干のことがらも報告したいと思います。 ------ 本セミナーは定期的に東工大で開催しているものです。初めて参加を希望される方はご一報ください。 ----- 鹿島亮東京工業大学大学院情報理工学研究科数理・計算科学専攻 kashima(a)is.titech.ac.jp

1 3

Kyoto Nonclassical Logic Workshopのご案内
by Hitoshi Omori 16 Nov '15

16 Nov '15

Kyoto Nonclassical Logic Workshopのご案内 (重複してお受け取りの際はご容赦ください。) 京都大学の大森仁です。直前の案内になってしまいましたが、以下の通り非古典論理に関するワークショップを開催いたします。概要などの詳細はウェブサイトをご覧ください。 ------------------------------------- Kyoto Nonclassical Logic Workshop 【日時】2015年11月19日、20日【場所】京都大学吉田泉殿【ウェブサイト】https://sites.google.com/site/hitoshiomori/home/workshops/kncl2015 【プログラム】 11月19日 13:00-14:10: Zach Weber: On closure and truth in substructural theories of truth 14:10-15:20: Hidenori Kurokawa: Labelled sequent calculi for substructural logics I: relevant logics 15:20-15:40: coffee break 15:40-16:50: Ryosuke Igarashi: Inferentialism on Negation 16:50-18:00: Shunsuke Yatabe: A constructive naive set theory and infinity 11月20日 10:30-11:40: Kazushige Terui: Substructural logics and fixed points 11:40-13:00: lunch break 13:00-14:10: Colin Caret: Pluralism and Contextualism 14:10-15:20: Yasuo Deguchi: Compartmentalizing Trivialism; Nishida's Contradictory Self-identity Viewed from a Non-classical Logic 15:20-15:40: coffee break 15:40-16:50: Katsuhiko Sano: Cut-Elimination Theorem for Expansions of Belnap-Dunn's Four Valued Logic via Functional Weak-Completeness 16:50-18:00: Petr Cintula: Substructural Logics: Deduction theorems and generalized disjunctions ------------------------------------- 会場の都合上、参加を希望される場合は hitoshiomori[at]gmail[dot]com までご一報いただければ幸いです。どうぞよろしくお願いいたします。大森仁

1 0

「証明、計算、哲学」International Workshop "Proofs, Computation and Philosophy"
by Mitsuhiro Okada 16 Nov '15

16 Nov '15

*************************************************************** 「証明、計算、哲学」International Workshop "Proofs, Computation and Philosophy" 11月28-29日Nov28-29th慶応大三田Campus Mita,Keio Univ (Mita Campus) (Apologies for multiple copies due to cross posting) ***************************************************************** 証明とカット消去の概念について議論することを目的として、「証明」の哲学と計算機科学について、次のような国際ワークショップの開催を予定しています。参加自由です。またこの案内は転送自由です。会議のupdated informationについてはつぎのURLをご覧ください。 http://abelard.flet.keio.ac.jp/seminar/girard2015.html 到着したAbstractsもここに貼っていきます。（この国際ワークショップとは別に、Girard教授による連続講義が開催されています。この案内の最後を参照ください。） ****国際ワークショップ情報International Workshop Information***** Date: November 28th(Sat)-29th(Sun), 2015 日時: 2015年11月28日(土)-29日(日) Place: Conference Hall, 3F of North Building, Mita campus of Keio University 場所: 慶應大学三田キャンパス北館3階会議場　 Campus Maphttp://www.keio.ac.jp/en/maps/mita.html Building #1 on this map. / 1番の建物です。注意：２８日土曜日はどの門からもお入りに慣れますが、２９日日曜日は正門のみしか書いていない場合がありますので、ご注意ください。 One can access to the North Building through any gates on Saturday 28^th , but We strongly recommend to use the MAIN GATE on SUNDAY because other gates Often close on Sundays. List of the invited speakers: １・Jean-Yves Girard, (Mathematics Institute of Marseille, Univ Marseille/CNRS) Special Lectures　　（上記連続講義とは独立なself-containedな証明論レクチャーです。Transcendental syntaxを別な観点から、より技術的に導入なさいます。　） 2. Philip Scott (Dept. of Mathematics and Statistics, University of Ottawa) "AF Inverse Monoids and the Coordinatization of MV-algebras" 3. Jean-Baptiste Joinet (Faculte de philosophie, Universite Jean Moulin - Lyon 3) "Logic and Naturalness : from Gentzen to Girard" 4. Paolo Pistone (Philosophy, IMM, Univ Marseille/CNRS) "Proofs, programs and the library of Babel" 5. V. Michele Abrusci (Philosophy, Univ Rome 3) “Philosophical aspects of proof-nets” 6. Masahiro Hamano "Geometry of Interaction for MALL via Hughes-van Glabbeek Proof-Nets" 7Kazushige Terui (Research Institute for Mathematical Sciences, Kyoto University) TBA 8. Takeshi Tsukada (Graduate School of Information Science and Technology, University of Tokyo) "A bifibrational account of LC" 9. Naohiko Hoshino (Research Institute for Mathematical Sciences, Kyoto University) "Geometry of Interaction and coherence spaces" ------- Tentative PROGRAM (see the Workshop webpage for updated information) November 28^th (Saturday) 9:30- registration 9:50-10:00 Introductory Remark, Mitsuhiro Okada 10:00-11:20 Jean-Yves Girard Special lecture, Some technical aspects of transcendental syntax I (tentative) (Univ Lyon 3 and ENS-Paris) 11:20-11:30 Break 11:30-12:30 Michele Abrusci (Univ Rome 3),” Philosophical aspects of proof-nets” 12:30-14:00 Lunch Break 14:00-15:00 Jean-Baptiste Joinet (Univ Marseille), "Logic and Naturalness : from Gentzen to Girard" 15:00-15:10 Break 15:10-15:50 Takeshi Tsukada (Univ Tokyo) , "A bifibrational account of LC" 15:50-16:50 Paolo Pistone (Univ Marseille/CNRS) "Proofs, programs and the library of Babel" 16:50-17:40 Discussion with the speakers of the first day ( coordinator: M. Okada) November 29^th (Sunday) 10:00-11:20 Jean-Yves Girard Special Lecture , Some technical aspects of transcendental syntax II (tentative) 11:20-11:30 Break 11:30-12:10 Naohiko Hoshino (RIMS, Univ Kyoto) "Geometry of Interaction and coherence spaces" 12:10-12:30 Discussion 12:30-14:00 Lunch Break 14:00-15:00 Phil Scott (Univ Ottawa) "AF Inverse Monoids and the Coordinatization of MV-algebras" 15:00-15:40 Masahiro Hamano, "Geometry of Interaction for MALL via Hughes-van Glabbeek Proof-Nets" 15:40-16:00 Break 16:00-16:40 Kazushige Terui (RIMS, Univ Kyoto) TBA 16:40-17:30 Discussion with the speakers of the second day (coordinator: M.Okada9 Local organizing committee: Mitsuhiro Okada, Keio University(Chair) Yutaro Sugimoto, Keio University Yuta Takahashi, Keio University 主催: Mita Logic Seminar 事務局(科学研究費　新学術領域　「予測と行動判断の論理と計算」）共催: 慶應義塾大学論理と感性のグローバル研究センター問合せ先: Mita Logic Seminar 事務局 logic(a)abelard.flet.keio.ac.jp ------------------------- なお、このワークショップとは別に、１１月１７日、２４日の午後６時より、大学院棟１階３１３番教室でGirard教授の公開講義が行われます。参加自由です。

1 1

Kobe Colloquium: Nov 19, 2015, Matthias Schirn
by Makoto Kikuchi 14 Nov '15

14 Nov '15

Kobe Colloquium on Logic, Statistics and Informatics 以下の要領でコロキウムを開催します。 Date: 2015/11/19 (Thu) 1.30pm - 5.00pm Place: Room 421 Speaker: Matthias Schirn (Munich) Time: 1.30pm - 3.00pm Title: Second-ordert abstraction before and after Russell's paradox Abstract: In this talk, I analyze several aspects of Frege’s paradigms of second-order abstraction: Axiom V and Hume’s Principle. The issues dealt with include self-evidence and epistemic (non-)triviality with particular emphasis on Axiom V, Frege’s attitude towards Axiom V before and after Russell’s discovery of the contradiction, as well as the possible role and the status of Hume’s Principle in the face of Russell’s paradox. In the central part, I pursue a threefold aim: (a) to shed new light on the connection between Frege’s way of introducing the primitive function-names of his logical system and the requisite self-evidence of his axioms in whose expression such a function-name occurs; (b) to analyze the semantic nature of the formal linguistic expression of Axiom V, and (c) to examine the conflict between the requirements of self-evidence and real epistemic value or genuine knowledge arising inevitably and invariably from Fregean abstraction principles, if they are singled out as axioms of a theory T. If time allows, I conclude by making some critical remarks on Frege’s reactions to Russell’s paradox in the period 1902-1906. Time: 3:30pm - 5.00pm Title: Truth and judgement Abstract: What the German logician and philosopher Gottlob Frege has bequeathed to us regarding the concept of truth is not a homogeneous, coherent and systematically worked out conception. It is rather an agglomeration of remarks, scattered throughout several of his writings, on the nature of judgement and assertion, the conception of the two truth-values the True and the False as the references of assertoric sentences (as objects), the relation of a (true) thought to the True, the role and the purportedly unique sense of the word “true” and its alleged redundancy on the level of both sense and assertion, the characterization of logic as the science of the most general laws of truth, the “truth-conditional“ approach concerning the semantics of his formal language — to mention some issues, but not all. The core of my lecture will be a critical examination of what Frege says in some key passages about truth, the True and “is true”. Where it seems useful and enlightening, aspects of the current discussion of the concept of truth (for example, the role of this concept in minimalism about truth) will be taken into account. I shall argue (a) that Frege’s reflections on the relation of a (true) thought to the True are incoherent; (b) that he fails to offer a convincing argument for rejecting the view according to which a sentence of the form “The thought that p is true” expresses the subsumtion of a thought (qua object) under the concept is true; (c) that Frege seems to overlook the fact that in such a sentence, even if it is interpreted as expressing a subsumtion of this kind, we still have the relation of sense to reference, of a thought to a truth- value; (d) that he falls short of providing a cogent argument for the purported synonymy of “p” and “The thought that p is true” and thus for the alleged redundancy of “is true” on the semantic level; (e) that, contrary to what he says, he has to concede that the word “true” makes an essential contribution to the thought expressed by “The thought that p is true”; (f) that there are indispensable uses of the truth-predicate anyway, not only in sentences such as „Everything Peter says is true“ but also, for example, in informal “metalogical” discourse; (g) that, contrary to what Frege appears to claim, he is committed to acknowledging that true is a property (of true thoughts); (h) that it remains unclear what truth qua that which is acknowledged (not predicated) in a judgement is supposed to be if it is neither the True nor the concept is true. 交通：阪急六甲駅またはJR六甲道駅から神戸市バス36系統「鶴甲団地」行きに乗車，「神大本部工学部前」停留所下車，徒歩すぐ． http://www.kobe-u.ac.jp/guid/access/rokko/rokkodai-dai2.html 連絡先：菊池誠　mkikuchi(a)kobe-u.ac.jp

1 0

CFP: PPL2016 第18回プログラミングおよびプログラミング言語ワークショップ論文募集
by Takahito Aoto 12 Nov '15

12 Nov '15

今年も皆様のご投稿，ご参加をお待ちしております．--- 青戸等人(新潟大学) ====================================================================== 第18回プログラミングおよびプログラミング言語ワークショップ (PPL2016) http://logic.cs.tsukuba.ac.jp/ppl2016/ 論文募集主催: 日本ソフトウェア科学会プログラミング論研究会日程: 2016年3月7日(月)〜3月9日(水) 会場: 岡山県玉野市たまの温泉「ダイヤモンド瀬戸内マリンホテル」http://www.marine-hotel.co.jp/ PPL2016は，プログラミングおよびプログラミング言語に関する研究者が一堂に会し，最新の研究成果の発表，および新たな研究課題についての討論やアイディア交換等を行うことを目的とした，合宿形式のワークショップです．プログラミングおよびプログラミング言語の理論・設計・実装・処理系などに関する研究発表を，カテゴリ別に幅広く募集します．カテゴリ1: 国内外で未発表の論文の発表カテゴリ2: 国際会議・学術雑誌等で既発表であるが，国内では未発表の研究の紹介カテゴリ3: ポスター・デモ発表(既発表・未発表の別を問いません) カテゴリ4: サーベイ・チュートリアル発表(既発表・未発表の別を問いません) カテゴリ1の採択論文の中から，特に独創的なアイディアや顕著な成果を含むものに対して論文賞を授与する予定です．また全論文発表と全ポスター・デモのなかから，聴衆の投票によりそれぞれ，最も優秀な論文プレゼンテーションには発表賞(一般の部，学生の部，既受賞者は除く)，最も優秀なポスター・デモにはポスター賞を授与する予定です．カテゴリ1 (国内外未発表論文) ---------------------------- 完成した理論やシステムの研究発表のみならず，萌芽的なアイディアや問題点の提示等も歓迎します．発展途上の研究内容も積極的に採録する方針です(ただし，PPLでの発表として相応しくないと判断される場合は，この限りではありません)．また，カテゴリ1で発表された研究については，会場での討議や査読コメントをもとにその完成度を高め，将来の学術雑誌・会議等での業績に結び付けることを奨励しています．そのため，予稿集の配布はウェブを用いる場合を含め，参加者のみへの限定的なものとします．カテゴリ1で発表された研究のうち，PPL2016プログラム委員会により優れていると認められたものは，PPL2016終了後(2016年4月下旬予定)，「コンピュータソフトウェア」誌のPPL2016推薦論文としての投稿が可能です．推薦論文は，PPL プログラム委員が引き続き査読を行うことによる，迅速な査読プロセスを特長としています．カテゴリ2 (国外既発表論文) -------------------------- 査読付の国際会議または学術雑誌等で既発表であるが国内では未発表である研究を紹介する場です．採録決定済みの研究も含みます．PPLへの関連をもとに採否を判定いたしますが，申し込み多数の場合はプログラム委員会での選考により，発表をご遠慮いただく可能性もございますので，その旨をご了承の上ご投稿ください．カテゴリ3 (ポスター・デモ発表) ----------------------------- 2時間程度のセッション内でのポスター発表またはデモ発表です．既発表・未発表の別を問いません．PPLへの関連をもとに採録を判定いたします．また，申し込み多数の場合はプログラム委員会での選考により採否を決定します．会場の状況により，ポスターの常設展示を可能とします．ショートプレゼンテーションは行いません．カテゴリ4 (サーベイ・チュートリアル発表) -------------------------------------- 研究動向の紹介(発表者の研究も含む)や分野間の相互理解と参加者の知識の底上げとなる発表を募集します．既発表・未発表の別を問いません．発表後，発表スライドをPPL2016ウェブページ上にて公開して頂く予定です．PPLへの関連，著者の研究発表実績，トピックや切り口の興味深さをもとに，プログラム委員会で選考致します．なお，PPL2015と同様，PPL2016の終了は夕刻(14:00〜16:00頃)を予定しています． ====================================================================== 投稿・発表申込要領すべてのカテゴリの投稿・発表について，次のURLから申し込んでください． https://www.easychair.org/conferences/?conf=ppl2016 申込にあたってはEasyChairのアカウントが必要です．4つのカテゴリそれぞれに対する申込要領の詳細は以下の通りです．最新の情報は上記ウェブページでご確認ください．カテゴリ1 (国内外未発表論文) --------------------------- 投稿手続きは2段階です．発表申込を行った上で論文提出を行ってください．発表申込締切: 2015年12月21日(月) 17:00 (JST) 著者名，所属，論文タイトル，論文概要(日本語300〜400字程度もしくは英語200 words 程度)，キーワード(3つ以上)を提出してください．論文提出締切: 2016年1月8日(金) 17:00 (JST) 10ページ程度(最大15ページ)の論文(日本語もしくは英語，PDF形式． PPL2016ウェブページにて指定のスタイルファイルを利用のこと)を提出してください．採否通知: 2016年2月2日(火) 最終原稿締切: 2016年2月15日(月) 採録された論文の最終原稿の提出方法は，採否通知にてお知らせいたします．ページ数制限は投稿版と同じ予定です． (注) 採録された論文等著作物は，日本ソフトウェア科学会著作権規定にもとづいて利用されますので，予めご確認ください． (注) 投稿論文と類似の論文を，他の会議(予稿集を出版するもの)・論文誌などに同時投稿する場合は，査読の有無に関わらず，その旨を発表申込および論文提出の際に明記してください．PPLでは同時投稿の事実のみをもって論文を不採録とすることはありませんが，採否の決定に利用する場合があります (他の会議との重複を避けるため，発表内容についての条件付採録とすることもあります)．カテゴリ2 (国外既発表論文) ------------------------- 発表申込時に採録が決定している国際会議および国際学術雑誌等の発表論文が対象です．理論系だけではなく実装系の論文の投稿も歓迎いたします．発表申込締切: 2016年1月25日(月) 17:00 (JST) 原論文(ページ数不問，PDF形式)と論文概要(テキスト形式)を，著者名，所属，論文タイトル，キーワード(3つ以上)と併せて提出してください．論文概要にて，原論文の出典(発表会議名，掲載済／予定の別等を含む)についても明記してください．採否通知: 2016年2月5日(金) カテゴリ3 (ポスター・デモ発表) ----------------------------- ポスター・デモの区別を行わずに募集いたします．デモを行う場合は，発表概要においてその旨を説明してください．発表申込締切: 2016年2月8日(月) 17:00 (JST) 希望する発表形態(ポスター・デモの別)を明記して，著者名，所属，発表タイトル，発表概要(200〜300字程度)，キーワード(3つ以上) を提出してください．採否通知: 2016年2月15日(月) カテゴリ4 (サーベイ・チュートリアル発表) --------------------------------------- 発表申込締切: 2016年1月25日(月) 17:00 (JST) 著者名，所属，発表タイトル，キーワード(3つ以上)，発表概要 (3ページ以内，PDF形式．目的，カバーする話題，想定する聴衆，必要な知識の記述を含むもの)を提出してください．採否通知: 2016年2月5日(金) ====================================================================== ワークショップ全般に関する問い合わせ先： ppl2016-oc(a)logic.cs.tsukuba.ac.jp ====================================================================== プログラム委員会青戸等人新潟大学安部達也理化学研究所岩崎英哉電気通信大学上野雄大東北大学鵜川始陽高知工科大学江本健斗九州工業大学角谷良彦東京大学河内谷清久仁日本IBM 木村大輔東邦大学櫻井孝平金沢大学佐藤重幸東京大学佐藤芳樹東京大学佐藤亮介東京大学滝本宗宏東京理科大学田辺良則鶴見大学対馬かなえ国立情報学研究所平井洋一 FireEye Dresden 平石拓京都大学森口草介関西学院大学八杉昌宏九州工業大学横山哲郎南山大学組織委員会海野広志筑波大学 [組織委員長] 塚田武志東京大学対馬かなえ国立情報学研究所松田一孝東北大学末永幸平京都大学上野雄大東北大学青戸等人新潟大学 [プログラム共同委員長] 鵜川始陽高知工科大学 [プログラム共同委員長] ======================================================================

1 0

数学基礎論若手の会　追加募集
by kota takeuchi 10 Nov '15

10 Nov '15

筑波大学の竹内耕太と申します。11月末に行われる数学基礎論若手の会にたくさんの申し込みをいただきありがとうございます。申し込み締め切り後に調整しましたところ、「宿泊・食事申し込み」に多少の余裕がありましたので11月15日日曜日まで参加を受け付けることとしました。（多数の場合は先着順。講演申し込みは締め切りました。）プログラムも公開されておりますので参考にしていただければと思います。若手の会2015webページ：http://www.math.tsukuba.ac.jp/~kota/wakate2015.html プログラム：http://www.math.tsukuba.ac.jp/~kota/wakate2015program.pdf 竹内耕太

1 0

[CSC Journals] : INVITATION FOR OPEN ACCESS PUBLICATIONS
by J. Steward 05 Nov '15

05 Nov '15

CALL FOR PAPERS International Journal of Computational Linguistics (IJCL) ISSN - 2180-1266 http://www.cscjournals.org/journals/IJCL/description.php Computational linguistics is an interdisciplinary field dealing with the statistical and/or rule-based modeling of natural language from a computational perspective. Today, computational language acquisition stands as one of the most fundamental, beguiling, and surprisingly open questions for computer science. International Journal of Computational Linguistics (IJCL) is a peer review open access bi-monthly journal providing a scientific forum where computer scientists, experts in artificial intelligence, mathematicians, logicians, cognitive scientists, cognitive psychologists, psycholinguists, anthropologists and neuroscientists can present research and experimental studies. The journal publishes papers that describe state-of-the-art techniques, scientific research studies and results in computational linguistics in general but computational models, corpus linguistics, computational theories, information retrieval and extraction, linguistics modeling techniques, linguistics theories, machine translation, natural language processing, quantitative linguistics, speech analysis and speech recognition in particular. IJCL invite linguistic specialists, researchers and scientists from different domains to share their understanding and contributions towards linguistics that set scientific objectives and demonstrate the operation of new methods in the field of computational linguistics. EDITORIAL BOARD MEMBERS Dr. Michal Ptaszynski - Hokkai-Gakuen University (Japan) Dr. Pascaline Merten - HEB-ISTI (Belgium) Dr. Pawel Dybala - Otaru University of Commerce (Japan) Dr. John Hanhong LI - (China) Dr. Stephen Doherty - Dublin City University (Ireland) LIST OF TOPICS Comparative Surveys that Critique Previously Repor Computational Linguistics Computational Models Computational Theories Corpus Linguistics Formal Linguistics-Theoretic and Grammar Induction Information Retrieval and Extraction Language Generation Language Learning Linguistics Modeling Techniques Linguistics Theories Machine Translation Models of Language Change and its Effect on Lingui Models that Address the Acquisition of Word-order Models that Combine Linguistics Parsing Models that Employ Statistical/probabilistic Gramm Models that Employ Techniques from machine learnin Natural Language Processing Quantitative Linguistics Speech Analysis/Synthesis Speech Recognition/Understanding Spoken Dialog Systems Web Information Extraction/Mining IMPORTANT DATES Paper Submission - November 30, 2015 Author Notification - December 31, 2015 Issue Publication - January 2016 PAPER SUBMISSION DETAILS In order to submit the paper, you need to register as author and then submit the paper through Author Dashboard. It is also important to ensure that the manuscript must be formatted as per IJCL Manuscript Preparation Guidelines. For further information, please refer to the following information. IJCL Website - http://www.cscjournals.org/journals/IJCL/description.php Submission Guidelines - http://www.cscjournals.org/journals/IJCL/submission-guidelines.php Register as Author - http://www.cscjournals.org/login.php CSC-OpenAccess Library - http://www.cscjournals.org/library/oa-library.php Please do not hesitate to contact us at cscpress(a)cscjournals.org if you require more information prior to submission. Our team is committed to provide quick response and support from submission to final publication. Sincerely Editorial Board Members International Journal of Computational Linguistics (IJCL) Thank you, J. Stewart Computer Science Journals (CSC Journals) B-5-8 Plaza Mont Kiara, Mont Kiara 50480, Kuala Lumpur, Malaysia Phone: 00603 6204 5627 Fax: 00603 6204 5628 Url: http://www.cscjournals.org

1 0

研究会のご案内
by Suzuki, Nobu-Yuki 04 Nov '15

04 Nov '15

皆様早稲田大学の金子守先生の代理で研究会のご案内をお送りします。重複してお受け取りのお方には、ご寛恕を賜りますよう。認識論理・様相論理研究会日時：２０１５年１２月４日（金）―５日（土）場所：早稲田キャンパス１０号館２０５室（正門から入って正面奥）この研究会は研究情報・考え・意見の交換を目的としています。興味のある方の参加を歓迎します。また懇親会に参加希望の方は金子守（mkanekoepi(a)waseda.xn--jp)-373b4ak8d3b3b5762mgesb い（２０００円程度）。幹事：金子守、黒川英徳、秋吉亮太プログラムは添付のpdfファイルをご覧ください。 2015/11/04(水) %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 鈴木信行(Nobu-Yuki SUZUKI) 静岡大学理学部数学教室〒422-8529 静岡市駿河区大谷836 電話 054-238-4729(dial in) Fax 054-238-4549(学科共通) 電子メイル：suzuki.nobuyuki(a)shizuoka.ac.jp 静岡大学では、上記の新アドレスに移行中です。しばらくは、旧アドレスも併用されます。

1 0

ジャンイヴ・ジラール教授公開連続講義（１１月１０日より）のお知らせ
by Mitsuhiro Okada 03 Nov '15

03 Nov '15

次の講演会の案内をさせていただきます。慶應義塾大学文学部哲学専攻　岡田光弘ーーーー ----------------------------------------------------------------------------------------------------------------- ジャンイヴ・ジラール教授公開連続講義（１１月１０日より）のお知らせ Jean-Yves GIRARD open lectures (Nov. 10^th , 17^th , 24^th, ) (三田ロジックセミナー) ***Apologies for multiple copies due to cross-posting*** ------------------------------------------------------------------------------------------------------------------ 慶應義塾大学に滞在されているジャンイヴ　ジラール教授に、インフォーマルな連続講義をお願いしていますので、ご案内させていただきます。 Transcendental Syntaxをテーマとした連続講義です。(同一タイトルの近刊書籍の中核的部分を解説していただきます。)　Proof-Normalization, 線形論理、Proofnests, Geometry of Interaction、ludicsなどのこれまでのご研究を基にした,　証明論、証明論の哲学についての彼の新しい研究パラダイムをご紹介いただきます。（初回は、証明論の初歩以外の専門的知識なしで聴講できるIntroductionから始めていただきます。） In this series of lectures Prof. Jean-Yves Girard is giving his new research paradigm“Transcendental Syntax”, which is based on his past researches (such as proof normalization, linear logic, proofnets, geometry of interaction, Ludics and others)　No particular background knowledge is required except for elementary proof theoretic ideas.. 講師　Jean-Yves Girard (Ｍathematics Institute, Univ de Marseille/CNRS, 現在慶應義塾大学にDistinguished Guest Professor (Global)として滞在中) Ist lecture １１月１０日１８：００－１９：３０（Nov,10^th 18:00-19:30） 2^nd lecture １１月１７日１８：００－１９：３０（Nov,17th 18:00-19:30） 3^rd Lecture １１月２４日１８：００－１９：３０（Nov,24th 18:00-19:30）会場慶應義塾大学三田キャンパス大学院棟１階３１３号 Graduate School Building the ground floor, room 313. なお、これとは別に、１１月２８日―２９日に証明論、証明論の哲学、計算機科学についての国際ワークショップを予定しております。詳細が決まりましたらお知らせいたします。 JR-田町駅、地下鉄三田駅、地下鉄赤羽橋駅から徒歩約7分 7 minutes along distance from JR-Tamachi, Subway-Mita, Subway-Akabanebashi See campus-map below/ http://www.keio.ac.jp/en/maps/mita.html 大学院棟は８番の建物です。Graduate School Building is #8 on this map. この会合案内は転送自由です。 ――――――――――――――――――――――――――――――――― お問い合わせ先：慶應義塾大学文学部哲学専攻岡田光弘研究室三田ロジックセミナー講演会事務局 philosophy(a)abelard.flet.keio.ac.jp

1 0

Talk by Bart Jacobs, Mon 2 Nov
by Toshiki Kataoka 29 Oct '15

29 Oct '15

皆様，以下のように，来週月曜日，Radboud大学のBart Jacobsさんをお招きして講演をしていただきます。 Jacobsさんは量子計算等の圏論的意味論において先進的な研究をされている方です。ぜひご参加ください。 -- 片岡俊基 (Toshiki Kataoka, http://www-mmm.is.s.u-tokyo.ac.jp/~tos/) -------------------- Mon 2 Nov 2015, 16:30–18:00 Room 214, School of Science Bldg. No. 7 (理学部7号館214) Access: http://www-mmm.is.s.u-tokyo.ac.jp/access.html Bart Jacobs (Radboud U.), Introduction to Effectus Theory Effectus theory provides a novel categorical approach to models of probabilistic and quantum computation and logic. The talk will introduce the main aspects and examples of effectuses. http://lmcs-online.org/ojs/viewarticle.php?id=1766&layout=abstract

1 0

WoLLIC 2016 - Call for Papers
by 小野寛晰 28 Oct '15

28 Oct '15

[Please circulate. Apologies for the duplicates.] WoLLIC 2016 23rd Workshop on Logic, Language, Information and Computation August 16th-19th, 2016 Puebla, Mexico 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) ORGANISATION Fundación Universidad de las Américas, Puebla, Mexico Benemérita Universidad Autónoma de Puebla, Mexico Centro de Informática, Universidade Federal de Pernambuco, Brazil HOSTED BY Benemérita Universidad Autónoma de Puebla, Mexico 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-third WoLLIC will be held at the Department of Computer Science, Benemérita Universidad Autónoma de Puebla, Mexico, from August 16th to 19th, 2016. 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; 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. They must not exceed 15 pages (in font 10 or higher), 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 2016 EasyChair website. (Please go to http://wollic.org/wollic2016/instructions.html <http://wollic.org/wollic2016/instructions.html> for instructions.) A title and single-paragraph abstract should be submitted by Mar 14, 2016, and the full paper by Mar 21, 2016 (firm date). Notifications are expected by Apr 22, 2016, and final papers for the proceedings will be due by May 6, 2016 (firm date). PROCEEDINGS The proceedings of WoLLIC 2016, 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 2016 issue of a scientific journal (to be confirmed). INVITED SPEAKERS (tbc) STUDENT GRANTS ASL sponsorship of WoLLIC 2016 will permit ASL student members to apply for a modest travel grant (deadline: May 1st, 2016). See http://www.aslonline.org/studenttravelawards.html <http://www.aslonline.org/studenttravelawards.html> for details. IMPORTANT DATES Mar 14, 2016: Paper title and abstract deadline Mar 21, 2016: Full paper deadline Apr 22, 2016: Author notification May 6, 2016: Final version deadline (firm) PROGRAM COMMITTEE Arnaud Durand <http://www.logique.jussieu.fr/~durand/> (U Paris 7, France) Nina Gierasimczuk <http://www.ninagierasimczuk.com/> (U Amsterdam, The Netherlands) Lauri Hella <http://www.sis.uta.fi/~malahe/> (U Tampere, Finland) Wesley Holliday <https://philosophy.berkeley.edu/holliday> (U Calif Berkeley, USA) Juha Kontinen <http://www.helsinki.fi/~jkontine/> (Helsinki U, Finland) Larry Moss <http://www.indiana.edu/~iulg/moss/> (Indiana U, USA) Jouko Väänänen <http://www.math.helsinki.fi/logic/people/jouko.vaananen/> (U Helsinki, Finland & U Amsterdam) (CHAIR) Heribert Vollmer <http://www.thi.uni-hannover.de/vollmer.html> (U Hannover, Germany) Dag Westerståhl <http://www.philosophy.su.se/english/research/our-researchers/faculty/dag-we…> (Stockholm U, Sweden) (more to be added) 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. ORGANISING COMMITTEE Mauricio Osorio (Fundación Universidad de las Américas, Puebla) (Local co-chair) Claudia Zepeda Cortés (Facultad de Ciencias de la Computación, Benemérita Universidad Autónoma de Puebla) (Local co-chair) José R. Arrazola Ramírez (Facultad de Ciencias Físico Matemáticas, Benemérita Universidad Autónoma de Puebla) (Local co-chair) Anjolina G. de Oliveira (U Fed Pernambuco) Ruy de Queiroz (U Fed Pernambuco) (co-chair) FURTHER INFORMATION Contact one of the Co-Chairs of the Organising Committee. WEB PAGE http://wollic.org/wollic2016/ <http://wollic.org/wollic2016/>

1 0

Talk by Petr Cintula (29 Oct 11:00-)
by Tetsuya Sato 27 Oct '15

27 Oct '15

(重複して受け取られた場合はご容赦ください) 京都大学数理解析研究所の佐藤です。 10月29日11:00から、チェコ科学アカデミーのPetr Cintula氏に以下の講演をしていただくことになりましたので、ご連絡いたします。どうぞお気軽にお越しください。 ========== Time: 11:00-12:00, 29 Oct, 2015 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: Petr Cintula (The Czech Academy of Sciences) Title: Logic and mathematics with lattice-valued predicates Abstract: Classical predicate logic interprets n-ary predicates as mappings from the n-th power of a given domain into the two-valued boolean algebra 2. The idea of replacing 2 by a more general structure is very natural and was shown to lead to a very interesting mathematics: prime examples are the boolean-valued or Heyting-valued models of set theory (or even more general models proposed by Takeuti & Titani (1992), Titani (1999), and Hajek & Hanikova (2001)). In the first part of the talk we present a framework for the study of logics where predicates can take values in a lattice (with additional operators) from a given class satisfying certain minimal conditions (our framework covers previous approaches of Rasiowa & Sikorski (1963), Horn (1969), Rasiowa (1974), Hajek (1998), and others). For each such logic we first describe its `propositional' part and then use it to give an axiomatization of the full first-order logic. The second part of the talk shows that the proposed logical formalism is rich enough to support non-trivial mathematical theories. We illustrate it by proving `graded' variant of the well-know relation between equivalences and partitions. The goal of the example is to illustrate the contrast between very general semantical interpretation of the proven fact and its almost classical proof.

1 0

FSCD'16 Call for Papers
by Nao Hirokawa 22 Oct '15

22 Oct '15

皆様来年6月にポルトガルのポルトで開催されます FSCD 2016 の論文募集をご案内致します。書換えとラムダ計算のホームカンファレンスである RTA と TLCA は長らく RDP として共催されてきましたが、先の会議でついに統合が実現しまして、今回より Formal Structures for Computation and Deduction (FSCD) として開催されます。皆様、ぜひ論文の投稿をご検討下さい。廣川　直 (JAIST) ----------------------------------------------------------------- PRELIMINARY CALL FOR PAPERS First International Conference on Formal Structures for Computation and Deduction (FSCD'16) 22 June -- 26 June 2016, Porto, Portugal http://fscd2016.dcc.fc.up.pt/ ========================================================================== IMPORTANT DATES Abstract Submission: 29 January 2016 Paper Submission : 5 February 2016 Rebuttal : 21 - 23 March 2016 Notification : 6 April 2016 ========================================================================== 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 and homotopy type theory. The name of the new conference comes from an unpublished but important book by Gerard Huet that strongly influenced many researchers in the area. Suggested, but not exclusive, list of topics for submission are: 1 Calculi * Lambda calculus * Logics (first-order, higher-order, equational, modal, linear, classical, constructive, etc.) * Rewriting systems (string, term, higher-order, graph, conditional, modulo, infinitary, etc.) * Proof theory (natural deduction, sequent calculus, proof nets, etc.) * Type theory and logical frameworks * Homotopy type theory 2. Methods in Computation and Deduction * Type systems (polymorphism, dependent, recursive, intersection, session, etc.) * Induction, coinduction * Matching, unification, completion, orderings * Strategies (normalization, completeness, etc.) * Tree automata * Model building and model checking * Proof search (resolution, paramodulation, narrowing, focusing, etc.) * Constraint solving and decision procedures 3. Semantics * Operational semantics and abstract machines * Game Semantics and applications * Domain theory and categorical models * Quantitative models (timing, probabilities, resources, etc.) * Quantum computation and emerging models in computation 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 (proof assistants, automated theorem prover, proof checkers, specialized provers, dependently typed languages, etc.) * Verification tools (abstract interpretation, termination, confluence, specialized provers, etc.) * Libraries for proof assistants and interactive theorem provers (support for variable bindings, nominal, polynomial, equality, etc.) * Case studies in proof assistants and interactive theorem provers (formalizations, mechanizations, certifications) * Certifications (theorems, rewriting techniques, etc.) * Applications of formal systems inside and outside of CS (biology, linguistics, physics, education, etc.) INVITED SPEAKERS Amal Ahmed (USA) Ichiro Hasuo (Japan) Gerard Huet (France) Tobias Nipkow (Germany) PROGRAM CHAIRS Delia Kesner (Univ. Paris-Diderot) Brigitte Pientka (McGill University) fscd16(a)easychair.org PROGRAM COMMITTEE Andreas Abel (Gothenburg Univ.) Zena Ariola (Univ. Oregon) Patrick Baillot (CNRS & ENS Lyon) Andrej Bauer (Univ. Ljubljana) Eduardo Bonelli (Univ. Quilmes) Patricia Bouyer (ENS Cachan) Ugo Dal Lago (Univ. Bologna) Nachum Dershowitz (Univ. Tel Aviv) Mariangiola Dezani-Ciancaglini (Univ. Torino) Derek Dreyer (MPI-SWS) Santiago Figueira (Univ. Buenos Aires) Marcelo Fiore (Univ. Cambridge) Juergen Giesl (Univ. Aachen) Nao Hirokawa (JAIST) Martin Hofmann (LMU Munchen) Delia Kesner (Univ. Paris-Diderot) Naoki Kobayashi (Univ. Tokyo) Dan Licata (Wesleyan Univ.) Chris Lynch (Clarkson Univ.) Narciso Marti-Oliet (Univ. Complutense) Aart Middeldorp (Univ. Innsbruck) Dale Miller (INRIA Saclay) Cesar Munoz (NASA) Vivek Nigam (Univ. Paraiba) Brigitte Pientka (McGill Univ.) Jakob Rehof (Univ. Dortmund) Xavier Rival (ENS Paris) Peter Selinger (Dalhousie Univ.) Paula Severi (Univ. Leicester) Jakob Grue Simonsen (Univ. Copenhagen) Matthieu Sozeau (INRIA Rocquencourt) Sophie Tison (Univ. Lille) Femke van Raamsdonk (VU Univ. Amsterdam) Nobuko Yoshida (Imperial College) CONFERENCE CHAIR Sandra Alves (University of Porto) FSCD STEERING COMMITTEE: Thorsten Altenkirch (Univ. Nottingham) Gilles Dowek (INRIA) Santiago Escobar (Univ. Politecnica de Valencia) Maribel Fernandez (King's College London) Masahito Hasegawa (Univ. Kyoto) Hugo Herbelin (INRIA) Nao Hirokawa (JAIST) Luke Ong (Chair, Univ. Oxford) Jens Palsberg (UCLA) Kristoffer Rose (Two Sigma Investments) Rene Thiemann (Univ. Innsbruck) Pawel Urzyczyn (Univ. Warsaw) Femke van Raamsdonk (VU Univ. Amsterdam) PUBLICATION The proceedings will be published as an electronic volume in the Leibniz International Proceedings in Informatics (LIPIcs). All LIPIcs proceedings are open access. SUBMISSION GUIDELINES Submissions can be made in two categories: regular research papers and system descriptions. Submissions of research papers must present original research which is unpublished and not submitted elsewhere. They must not exceed 15 pages (including figures and bibliography). Submissions of research papers will be judged on originality, significance, correctness, and readability. Submission of system descriptions must describe a working system which has not been published or submitted elsewhere. They must not exceed 10 pages and should contain a link to a working system. System descriptions will be judged on originality, significance, usefulness, and readability. Proofs of theoretical results that do not fit within the page limit, executables of systems, code of case studies, benchmarks used to evaluate a given system, should be made available, via a reference to a website or in an appendix of the paper. Reviewers will be encouraged to consider this additional material, but are not obliged to. Submissions must be self-contained within the respective page limit; considering the additional material should not be necessary to assess the merits of a submission. Submissions must be formatted using the LIPIcs style files using the instructions at http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/ A condition of submission is that, if accepted, one of the authors must attend the conference to give the presentation. Papers should be submitted via easychair. The submission site is at https://easychair.org/conferences/?conf=fscd16 ORGANISING COMMITTEE Sandra Alves (Univ. Porto) Sabine Broda (Univ. Porto) Jose Espirito-Santo (Univ. do Minho) Mario Florido (Univ. Porto) Nelma Moreira (Univ. Porto) Luis Pinto (Univ. do Minho) Rogerio Reis (Univ. Porto) Ana Paula Tomas (Univ. Porto) Pedro Vasconcelos (Univ. Porto)

1 0

【発表募集】情報処理学会第108回プログラミング研究発表会【2/28〜2/29@東大駒場キャンパス】
by Kazutaka Matsuda 16 Oct '15

16 Oct '15

logic-ml関係者の皆様，東北大学の松田です．複数受け取られた場合はご容赦ください。この場をお借りいたしまして，来たる2016年2月28日〜29日に開催される情報処理学会第108回プログラミング研究会の発表募集のご案内させていただきます．どうぞ発表を投稿をご検討いただけますと幸いです．第107回と異なり，今回は「短い発表」の募集はございませんのでご注意ください． ========================================================== 情報処理学会第108回プログラミング研究発表会発表募集プログラミング研究会（PRO）は，・プログラミング言語の設計，処理系の実装・プログラミングの理論，基本概念・プログラミング環境，支援システム・プログラミング方法論，パラダイム・これらを応用したシステムの開発事例・その他，プログラミングに関する面白い話題を対象とした研究発表の場で，1998年度から毎年3〜4回のペースで論文誌を発行しています．PRO論文誌は研究会と密接にリンクしており，研究会で発表されたもののうちあらかじめ論文投稿を希望し，論文原稿を提出されているものが査読の対象となっています（論文誌投稿を希望しない発表も歓迎します）．おおむね研究会から3週間で論文の採否が決定されるという迅速さも大きな特徴です．2016年2月の研究会も多くの発表ならびに論文投稿をお待ちしております．参加費は無料です．申込締切は 12月24日（木），投稿締切は1月28日（木）です．よろしくご検討ください．なお，多数の発表申込みがある場合には，発表をお断りすることがございますので，お早めにお申し込みください．発表申込時で必要なのはタイトルと概要などとなっております．なお，「情報処理学会論文誌：プログラミング (PRO) 」に掲載される英文論文の出版形態に変更があります．英文論文をご投稿される場合，または，採録後の英語化をご検討の方は，以下のアナウンスをご確認ください． http://sigpro.ipsj.or.jp/english-paper-encouragement/ 第108回プログラミング研究会（PRO-2015-5）発表募集日程：2016年2月28日（日）・29日（月）会場：東京大学駒場キャンパス 15号館 409号室　　　〒153-8902東京都目黒区駒場3-8-1 発表申込締切：　　　　2015年12月24日（木）投稿論文原稿提出締切：2016年1月28日（木）申込先：松田一孝（東北大学）　　　　E-mail: kztk [at] ecei.tohoku.ac.jp 案内ページ：http://sigpro.ipsj.or.jp/pro2015-5/ ・申込みに当たっての注意はプログラミング研究会のページ　http://sigpro.ipsj.or.jp/を参照してください．・申込みの際には整理のために，Subject欄に以下をご指定ください．　　「PRO2015-5発表申込み」（カッコ不要）・論文投稿を伴う発表希望者のための手引き．　http://sigpro.ipsj.or.jp/trans-author/ ・発表のみを希望する方のための手引き．　http://sigpro.ipsj.or.jp/presentation/ ・できるだけE-mailでお願いします．・申込み後3日以内に返信がない場合はご連絡下さい．

1 0

特任研究員の募集
by koba 16 Oct '15

16 Oct '15

＃複数受け取られましたらご容赦ください．東京大学の小林と申します．当研究室では現在，高階モデル検査（高階再帰スキームのモデル検査）とそのプログラム検証などへの応用をテーマとした研究を精力的に進めており，プロジェクトに携わる特任研究員若干名を探しております．身近にご興味のある方がいらっしゃいましたら，10月15日までに小林 (koba(a)is.s.u-tokyo.ac.jp) までメールでお知らせいただければ幸いです。その際、できれば略歴および論文リスト（フォーマット自由）もメールに添えるかまたは郵送でお送りください。（後日、さらに詳細な資料をお願いする可能性があります）．募集の条件は概ね以下のとおりです。 ================ 着任時期：2016年4月（数ヵ月の前後は応相談）任期：年度単位の更新で、業績により最長2020年3月まで延長可能給与：月額35～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 1

Call for papers for Workshop on Williamson's philosophy
by 小野寛晰 07 Oct '15

07 Oct '15

Workshop on Williamson’s Philosophy First Announcement– Call for Papers 6(Thursday) − 7(Friday) October, 2016 The Program for Logic, Mind and Methodology (LMM), Department of Philosophy, National Taiwan University, Taiwan http://www.philo.ntu.edu.tw/lmmgroup/ <https://mail.ntu.edu.tw/owa/redir.aspx?SURL=VQSmOL0kp3hcT3CTqb3Xk6CFzdirbbX…> You are cordially invited to submit an abstract of a contributed talk to the Workshop on Williamson's Philosophy, to be held during the Joint Conference of AWPL-TPLC 2016. Deadline of the submission: 30 April, 2016. Introduction This will be a one-day plus workshop on Timothy Williamson’s philosophy, hosted by the Department of Philosophy, National Taiwan University, during the joint conference of the 3rd Asian Workshop on Philosophical Logic and the 3rd Taiwan Philosophical Logic Colloquium (AWPL-TPLC 2016), which is organized by The Program for Logic, Mind and Methodology (LMM), Department of Philosophy, National Taiwan University, and will be held during 5-8 October 2016. The aim of this conference is to strengthen the connection between logic and philosophy. In particular, we are hoping that more attention in future research will be paid to the study of philosophical logic, specifically, the study of the construction, and application, of logical framework appropriate for not only the analysis of philosophical concepts, but also the theorization of philosophical doctrines. For further information, see http://www.philo.ntu.edu.tw/lmmgroup/ <https://mail.ntu.edu.tw/owa/redir.aspx?SURL=VQSmOL0kp3hcT3CTqb3Xk6CFzdirbbX…> In view of the substantial contribution that Professor Timothy Williamson has made in the last few decades to contemporary philosophy, the organizing committee has set as the ultimate priority to organize a one-day plus workshop on Williamson’s philosophy during the joint conference. This project has been approved by Professor Williamson and more importantly he has accepted our invitation to come and join us on this special occasion. The Core Special attention will be paid to Williamson’s five seminal books: Identity and Discrimination, 2nd ed. (1st ed. 1990), Oxford: Blackwell, 2013. Vagueness, London: Routledge, 1994. Knowledge and Its Limits <http://en.wikipedia.org/wiki/Knowledge_and_Its_Limits>, Oxford: Oxford University Press, 2000. The Philosophy of Philosophy, Oxford: Blackwell, 2007. Modal Logic as Metaphysics, Oxford: Oxford University Press, 2013. The format (The workshop will contain at least 7 sessions) The workshop will start with a keynote speech by Williamson, followed by four sessions on the 6th of October, and will be continued, together with a final session for Williamson’s replies on the 7th of October. 1st session (90 mins): A brief introduction (about 5-10 minutes) of Williamson’s contribution in the last few decades (by the chair) A keynote speech (about 60 minutes plus 10-20 minutes for discussion) by Timothy Williamson 2nd-6th sessions: Each session (90 minutes) focuses on one of Williamson’s five books, and includes 4 parts: (3-5 minutes) An introduction to the book under discussion (by the chair) (60-70 minutes) One talk by an invited speaker, followed by a contributed talk. (10-15 minutes) Williamson’s replies. (10-15 minutes) Discussion 7th session (90 minutes): (5-10 minutes) A summary from the chair (30-40 minutes) a final response from Williamson (especially to the talks which are not included in the special workshop) (20-30 minutes) discussions. Submission of Abstracts for Contributed Talks All researchers who are interested in Williamson’s philosophy are cordially invited to submit their abstracts by 30 April 2016. Authors should submit an (extended) abstract no less than one page but no more than four pages (A4 size, single space). Abstracts must be submitted as PDF files and sent to D.-M. Deng [dmdeng(a)ntu.edu.tw <mailto:dmdeng@ntu.edu.tw>] S.C.-M. Yang [cmyang(a)ntu.edu.tw] Memo: 1. Associated with each book, there is at least one session, containing two talks to address some issues on the themes of that book. 2. The organizing committee have also invited some renowned scholars to focus on the themes of each book, if possible. So far we have invited: Katalin Farkas (Central European University, Hungary, on themes from Identity and Discrimination.) Greg Restall (University of Melbourne, Australia, on themes from Modal Logic as Metaphysics.) Nick Smith (University of Sydney, Australia, on themes from Vagueness) 3. Extra contributed talks will be welcome. If the accepted abstracts for contributed talks on Williamson’s philosophy are more than originally scheduled, the Programme Committee will be very glad to put the extra ones in some other sessions before the conclusion session so that Williamson may have some comments/replies to those speakers as well. 4. A full length manuscript of a contributed talk on this workshop should be sent to the organizer by the 15th of September 2016 in order for Professor Williamson to read it before the workshop. 5. The chair of each session will provide a brief survey of the book (that session focuses on). 6. The organizing committee will try to find some well-known publisher to consider the possibility of publishing a post-conference proceedings, provided this proposal is approved by Williamson. The details will be announced when this proposal is also approved by the publisher. 7. A final remark: Professor Williamson has thoughtfully promised to offer young scholars in Taiwan, who contribute papers to this workshop, a one-on-one tutorial/supervision to discuss their papers before the conference. Tutorial time will be scheduled in two afternoons before the conference. [The details will be announced in due course.] For any enquiry/information please contact: D.-M. Deng (dmdeng(a)ntu.edu.tw <mailto:dmdeng@ntu.edu.tw>) S. C.-M. Yang (cmyang(a)ntu.edu.tw <mailto:cmyang@ntu.edu.tw>)

1 0

Call for papers for AWPL-TPLC 2016
by 小野寛晰 07 Oct '15

07 Oct '15

The Joint Conference of The 3rd Asian Workshop on Philosophical Logic (AWPL 2016) & The 3rd Taiwan Philosophical Logic Colloquium (TPLC 2016) First Announcement– Call for Papers 5 (Wed.) − 8 (Sat.) October, 2016 The Program for Logic, Mind and Methodology (LMM), Department of Philosophy, National Taiwan University, Taipei, Taiwan http://www.philo.ntu.edu.tw/lmmgroup/ <https://mail.ntu.edu.tw/owa/redir.aspx?SURL=VQSmOL0kp3hcT3CTqb3Xk6CFzdirbbX…> We are pleased to invite you to submit an abstract of a contributed talk to the Joint Conference of AWPL-TPLC 2016. Deadline of the submission: 31 May, 2016. DESCRIPTION OF THE JOINT CONFERENCE This is a joint conference of the Third Asian Workshop on Philosophical Logic (AWPL-2016, http://www.philo.ntu.edu.tw/lmmgroup/ <https://mail.ntu.edu.tw/owa/redir.aspx?SURL=VQSmOL0kp3hcT3CTqb3Xk6CFzdirbbX…>) and the Third Taiwan Philosophical Logic Colloquium (TPLC-2016, http://www.philo.ntu.edu.tw/lmmgroup/ <https://mail.ntu.edu.tw/owa/redir.aspx?SURL=VQSmOL0kp3hcT3CTqb3Xk6CFzdirbbX…>), organized by The Program for Logic, Mind and Methodology (LMM), Department of Philosophy, National Taiwan University, and held during 5-8 October 2016. The aim of this conference is to strengthen the connection between logic and philosophy. In particular, we are hoping that more attention in future research will be paid to the philosophical study of logic, specifically, the study of the construction, and application, of logical framework appropriate for not only the analysis of philosophical concepts, but also the theorization of philosophical doctrines. SPECIAL SESSIONS Workshop on Williamson’s Philosophy (organized by S. C.-M. Yang) Workshop on Mereology (organized by H.-C. Tsai) SPEAKERS Plenary/Keynote lectures Robert Goldblatt (Victoria University of Wellington, New Zealand). Hiroakira Ono (Japan Advance Institute of Science and Technology, Japan) Achille C. Varzi (Columbia University, USA, for Workshop on Mereology) Timothy Williamson (Oxford University, UK, for Workshop on Williamson’s philosophy) Invited speakers Katalin Farkas (Central European University, Hungary, on themes from Identity and Discrimination.) Paul Hovda (Reed College, USA, for workshop on mereology) Fenrong Liu (Tsinghua University, China) Hanti Lin (University of California at Davis, USA) Greg Restall (University of Melbourne, Australia, on themes from Modal Logic as Metaphysics.) Nick Smith (University of Sydney, Australia, on themes from Vagueness) Hsing-chien Tsai (Chung-Cheng University, Taiwan, for workshop on mereology) JiJi Zhang (Lingnan University, Hong Kong) SUBMISSION OF ABSTRACTS FOR CONTRIBUTED TALKS All researchers working on various aspects of philosophical logic are cordially invited to submit their abstracts by 31 May, 2016. Please note that deadline for the submission of abstracts for talks contributed to Workshop on Williamson’s philosophy is due 30 April, 2016. Authors should submit an (extended) abstract no less than one page but no more than four pages (A4 size, single space). Abstracts must be submitted as PDF files and sent to D.-M. Deng [dmdeng(a)ntu.edu.tw <mailto:dmdeng@ntu.edu.tw>] H.-C. Tsai [cccsthc(a)gmail.com] (esp. for Workshop on Mereology) S. C.-M. Yang [cmyang(a)ntu.edu.tw] (esp. for Workshop on Williamson’s philosophy) Each submission will be reviewed. The Colloquium is open to everyone, and practical info will be available soon on the website. POST-CONFERENCE PUBLICATION: We are planning to publish a post-conference proceedings for the joint conference. It seems likely that a post-conference proceedings will be published as a volume of the LIAA-series by Springer. All authors of papers presented at the joint conference will be encouraged to submit a full length paper, and the deadline of the submission of full-length manuscripts will be around the end of December of 2016. All papers submitted will be refereed to high journal standards, and acceptance as a presentation is no guarantee that the post-conference paper will be published. Detailed information about the submission of full length papers will be announced later. TRAVEL AWARDS Free accommodation and travel awards for students and young researchers have been made available by the local 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. The deadline for travel award applications is June 30, 2016. However, it is strongly recommended that as long as you have the intention of submitting an abstract, please send us a note at your convenience as hotel-room preservation can be made the earlier the easier. ORGANIZATION COMMITTEE Fenrong Liu Robert Goldblatt Hanti Lin Hiroakira Ono H.-C. Tsai S. C.-M. Yang (Chair) LOCAL ORGANIZATION COMMITTEE D.-M. Deng (National Taiwan University), H.-C. Fu (Chinese Cultural University), C.-J. Liau (The Institute of Information Science, Academia Sinica), H.-C. Tsai (National Chung Cheng University <https://www.google.com.tw/url?sa=t&rct=j&q=&esrc=s&source=web&cd=1&cad=rja&…>), K. Y. Lee (National Chung Cheng University <https://www.google.com.tw/url?sa=t&rct=j&q=&esrc=s&source=web&cd=1&cad=rja&…>), S. C.-M. Yang (Chair), J. J. Yuann (National Taiwan University) FURTHER CONTACT: For any enquiry/information please contact: D.-M. Deng (dmdeng(a)ntu.edu.tw <mailto:dmdeng@ntu.edu.tw>) S. C.-M. Yang (cmyang(a)ntu.edu.tw <mailto:cmyang@ntu.edu.tw>) Appendix A: INTRODUCTION TO ASIAN WORKSHOP ON PHILOSOPHICAL LOGIC (AWPL-SERIES) Asian Workshop on Philosophical Logic, a series of biennial events established since 2012, intends to promote mutual understandings among researchers on philosophical logic in Asian countries and/or Australasian region, and to establish closer collaborations in future. Each workshop is open to all philosophers and logicians around these regions, who share a certain common interest in a variety of logical/philosophical issues. The scope of the Workshop includes, but not exclusively, the family of non-classical logics, algebraic logic, computer science, cognitive science, linguistics, game theory, etc., and their applications in a variety of philosophical issues. The First Asian Workshop on Philosophical Logic (AWPL-2012) was held at the Research Center for Integrated Science <http://www.jaist.ac.jp/rcis/> (RCIS), Japan Advanced Institute of Science and Technology <http://www.jaist.ac.jp/> (JAIST) on February 15-17, 2012. More than twenty scholars were invited and a special session for discussing the possibility of collaborations in the near future. It was then widely agreed that the workshop should be extended to a biennial event henceforth. The Second Asian Workshop on Philosophical Logic (AWPL-2014) was held at the Institute of Logic and Cognition, Sun Yat-sen University, April 12-13, 2014. A collection based on some selected papers from AWPL-2014, entitled ‘Modality, Semantic and Interpretation’, was published as the first volume of the book series ‘Logic in Asia’ (LIAA) by Springer. Appendix B INTRODUCTION TO TAIWAN PHILOSOPHICAL LOGIC COLLOQUIUM (TPLC-SERIES) TPLC is a series of biennial conferences established since 2012 and is hosted by Department of Philosophy, National Taiwan University, Taiwan. The aim of the TPLC-series is to provide a forum for dialogues amongst philosophers and logicians with regard to a variety of issues and topics of current interest. We intend to bring together a group of logic-minded philosophers and philosophically oriented logicians so as to promote the development of logic and analytic philosophy in Asian area, especially in Taiwan. The TPLC-series are open not only to interested local scholars. We also invite several distinguished international scholars as plenary/keynote/invited speakers and welcome contributed talks from abroad as well. To strengthen a closer connection with other philosophy communities in the neighbourhood, at the early stage of this series, the invited philosophers and logicians are mainly from Asian and Australasian regions. The scope of this series of colloquium will cover: philosophical logic (in a broad sense), non-classical logics, algebraic logic, all kinds of semantics/logics relating to metaphysical/epistemological concepts and some issues in philosophy of language, philosophy of logic/mathematics, and their applications in computer science and cognitive science. The first Taiwan Philosophical Colloquium (TPLC-2012) was held on December 7, 2012; and TPLC-2014 was held on October 24-25, 2014. Apart from two keynote speeches delivered by Robert Goldblatt and Hiroakira Ono, there were sixteen invited/ contributed talks by scholars from Australia, China, Japan, Hong Kong, Netherlands, and local scholars. A post-conference proceedings of TPLC-2014, entitled Structural Analysis of Non-Classical Logics, will be published as the second volume of the newly established book series ‘Logic in Asia’ (LIAA), by Springer in October 2015.

1 0

job openings at AIRC, Japan
by Ken Satoh 30 Sep '15

30 Sep '15

Research Scientist/Engineer Positions at AIRC, Japan (Natural Language Processing, Computer Vision, and Machine Learning) Applications are invited for research scientist/engineer positions for a research project focused on natural language processing and computer vision at the Artificial Intelligence Research Center (AIRC) (https://unit.aist.go.jp/airc//index.en.html) under the auspices of the National Institute for Advanced Industrial Science and Technology (AIST) (http://www.aist.go.jp/index_en.html). Applicants are required to 1. Have (or be expected to obtain) a PhD in Computer Science or have excellent skills in software development. 2. Have a proven track-record of research or software development in natural language processing, computer vision, machine learning, or closely related fields. 3. Be eager to explore new fields and to make scientific contributions to the society either through publications or software development. This project aims to develop new data/knowledge-driven artificial intelligence technology and has the following subthemes: a. text understanding and generation b. generic object/behavior recognition c. knowledge acquisition from text and images d. question answering on databases and images e. deep learning for natural language processing and computer vision f. software development for supporting research on the above themes Successful candidates will work at AIRC under the supervision of one of the following senior researchers, in close collaboration with other members of the project. Naoaki Okazaki (Tohoku University) Hiroya Takamura (Tokyo Institute of Technology) Yoshimasa Tsuruoka (University of Tokyo) Hiroyuki Tokunaga (SmartNews) Hideki Nakayama (University of Tokyo) Yusuke Miyao (National Institute of Informatics) Applicants are encouraged to choose one (or more) subtheme(s) from the above subthemes when sending their application. Informal inquiries about the research themes can be made to the above researchers. We have three categories of post-doctoral research fellows. The duration of employment for all three categories is initially 24 months, with a possible extension of 36 months or longer, depending on performance. The starting date of employment will be 1st December 2015 at the earliest. [Category A: Post-Doctoral Research Fellow] Salary 5,500,000 JPY to 7,000,000 JPY per annum [Category B: Senior Post-Doctoral Research Fellow] Salary 7,000,000 JPY to 10,000,000 JPY per annum [Category C: Distinguished Research Fellow] Salary 10,000,000 JPY per annum Research Environment: AIST is one of the largest publicly funded research institutes in Japan and a single research institute under the Ministry of Economy, Trade and Industry (METI). AIRC is the newest research center within AIST, established in May, 2015. As a core research center of AI in Japan, we have been establishing close cooperation with researchers at Japanese and international institutes, which include the University of Tokyo, Tokyo Institute of Technology, Riken, Osaka University, Tohoku University, National Institute of Informatics, Toyota Technology Institute in Chicago, CMU, University of Manchester and DFKI. AIRC is located in Odaiba, which is in one of the central districts of Tokyo, a bustling international city and the capital of Japan. Tokyo offers both the modern urban lifestyle of Japan as well as a rich Japanese heritage. Interested candidates are invited to send, via electronic mail, the following items to the Director of Artificial Intelligence Research Center (AIST), Prof. Junichi Tsujii (airc-recruit-ml(a)aist.go.jp) (a) A cover letter that clearly indicates their main research interests (b) Curriculum Vitae (c) The contact details of 3 referees (d) Copies of maximum of 3 publications that you have (co-)authored, and which are representative of your past research achievements. Each publication should be accompanied by a short summary that highlights its major contributions (e) An agenda of future research goals. This should be no longer than one page, including figures Informal enquiries can be made to airc-recruit-ml(a)aist.go.jp Closing date: 16th October 2015. PLEASE NOTE: Plesase send your application to airc-recruit-ml(a)aist.go.jp directly via e-mail, and not by post. It is NOT necessary to follow the specific CV formats specified on the AIRC website.

1 0

TMC 2015 and Cresswell's lectures
by 小野寛晰 21 Sep '15

21 Sep '15

国立台湾大学哲学科　楊金穆教授主催の会合の案内です。　　小野寛晰 ————————————————— Dear All: Attached please find two files: (i) Call for Papers for the 2nd Taiwan Metaphysics Colloquium (TMC-2015); and (ii) Schedule for Professor Max Cresswell's lectures for 2015 Wendy Huang Visiting Fellowship. You are cordially invited to join us on these events and we look forward to meeting you then! With best wishes Syraya Chin-Mu

1 0

LATD 2016 (First Announcement)
by 小野寛晰 19 Sep '15

19 Sep '15

Logic, Algebra and Truth Degrees (LATD) 2016 28 - 30 June 2016 Phalaborwa, South Africa First Announcement The fifth instalment of the conference Logic, Algebra and Truth Degrees (LATD) will take place in Phalaborwa, South Africa from 28 - 30 June 2016. The conference will be hosted by the Faculty of Science of the University of the Witwatersrand, Johannesburg, at the Hans Merensky Hotel, situated on the border of the world renowned Kruger National Park Game Reserve. Detailed travel information is available on the conference website. Mathematical Fuzzy Logic is the sub-discipline of Mathematical Logic that is concerned with the notion of comparative truth. The assumption that "truth comes in degrees" has proved to be very useful in many theoretical and applied areas of Mathematics, Computer Science, and Philosophy. This conference series started as an official meeting of the working group on Mathematical Fuzzy Logic and has evolved into a wider meeting in algebraic logic and related areas. Its main goal is to foster collaboration between researchers in these areas, and to promote communication and cooperation with members of neighbouring fields. We encourage contributions on any relevant aspects of logical systems (including fuzzy, substructural, modal and quantum logics, and many-valued logics in general). The featured topics include: - Proof theory and computational complexity - Algebraic semantics and abstract algebraic logic - First, higher-order and modal formalisms - Applications and foundational issues - Geometric and game theoretic aspects Potential participants are encouraged to complete the expression of interest form: http://www.latd2016.co.za/ExpressionOfInterest.html <http://www.latd2016.co.za/ExpressionOfInterest.html> Important Dates: Deadline for submissions: 24 February 2016 Notification of acceptance: 31 March 2016 Early registration closes: 27 April 2016 Registration closes: 15 June 2016 Conference dates: 28 - 30 June 2016 Programme committee: James Raftery (Chair), University of Pretoria Xavier Caicedo, Universidad de los Andes Agata Ciabattoni, Vienna University of Technology Petr Cintula, Czech Academy of Sciences Nikolaos Galatos, University of Denver Rostislav Horcik, Czech Academy of Sciences Rosalie Iemhoff, Utrecht University, The Netherlands Hiroakira Ono, Japan Advanced Institute of Science and Technology Philip Scott, University of Ottawa. Kazushige Terui, Kyoto University. Constantine Tsinakis, Vanderbilt University. Steering committee: Petr Hájek (honorary chair), Czech Academy of Sciences Matthias Baaz, Vienna University of Technology Agata Ciabattoni, Vienna University of Technology Petr Cintula, Czech Academy of Sciences Vincenzo Marra, University of Milan George Metcalfe, University of Bern Carles Noguera, Czech Academy of Sciences James Raftery, University of Pretoria Kazushige Terui, Kyoto University Local organising committee: Clint van Alten (Chair), University of the Witwatersrand, Johannesburg Willem Conradie, University of Johannesburg Andrew Craig, University of Johannesburg Wilmari Morton, University of Johannesburg Further information concerning invited speakers and submission procedures will be sent out in the coming months. More information is available from the conference website: http://www.latd2016.co.za/ <http://www.latd2016.co.za/> Please send any queries to info(a)latd2016.co.za <mailto:info@latd2016.co.za> With best regards, The local organising committee

1 0

JAIST Logic Seminar Series (6th Oct. 2015 by Hsing-chien Tsai)
by Katsuhiko Sano 18 Sep '15

18 Sep '15

皆様 National Chung-Cheng UniversityのHsing-chien Tsai先生の講演のお知らせです。どうぞふるってご参加ください。問合せ先：佐野勝彦北陸先端科学技術大学院大学情報科学研究科 e-mail: v-sano(a)jaist.ac.jp ------------------------------ * JAIST Logic Seminar Series * Date and Time: Tuesday, 6th October 2015, 15:30--17:00 Title: On Some General Methods of Proving Decidability or Undecidability Place: Collaboration room No.7, 5th floor of IS building No. 3, JAIST (Access: http://www.jaist.ac.jp/english/location/access.html) Speaker: Hsing-chien Tsai (Department of Philosophy, National Chung-Cheng University) Abstract: This talk will first introduce some useful general methods of proving the decidability or the undecidability of a first-order logical theory, and then will show some applications of those methods. The methods to be looked into are heavily involved with checking whether or not two models (or two classes of models) stand in certain relations. Here the two most-checked relations between two models are back-and-forth equivalence and definability (that is, defining one into another). In this light, this talk will also briefly discuss some general theorems concerning the two aforementioned model theoretical relations. -- Katsuhiko Sano School of Information Science Japan Advanced Institute of Science and Technology IS building No.1 7F, 1-1 Asahidai, Nomi, Ishikawa, 923-1292, Japan

1 0

証明論研究集会 & SLACS のご案内
by Toshihiko Kurata 17 Sep '15

17 Sep '15

皆様， 2015年度の「証明論研究集会」と「記号論理と情報科学研究集会（SLACS）」について，合同開催の案内をメイルさせて頂きます．どちらの研究集会も数理論理学，計算の理論，情報科学などの理論・応用に関係する様々な話題が発表されていて研究者・学生の貴重な相互交流の場となっています．完成された研究のみならず発展途上の話題も大歓迎ですので，気軽に講演・参加を御検討下さい．開催日：2015年12月14日（月）〜16日（水）場所：南山大学名古屋キャンパスS棟(教室棟)7階S74教室世話役：佐々木克巳（南山大学）倉田俊彦（法政大学）詳細はHP https://sites.google.com/site/ptslacs2015/ をご覧頂けたらと思います．講演を希望される方は，御手数ですが ------------------------------------- 題目講演者名所属 e-mail アドレス概要講演時間懇親会参加希望その他の希望（講演日など） ------------------------------------- を pt.slacs2015(a)gmail.com までメイル下さい．申込期限は12月04日（金）とします．それでは，よろしくお願いいたします． -- Toshihiko Kurata, Hosei University e-mail: kurata(a)hosei.ac.jp

1 0

RIMS研究集会「モデル理論における独立概念と次元の研究」のご案内
by Hirotaka Kikyo 14 Sep '15

14 Sep '15

（重複して受け取られた場合はご容赦ください）下記の要領で、RIMS研究集会を開催いたします。モデル理論に関連する話題の研究集会です。モデル理論に関連するテーマでの発表を募集いたします。 Anand Pillay 教授、Byunghan Kim教授を含む数名の外国人がすでに参加を表明されてます。概要 RIMS研究集会「モデル理論における独立概念と次元の研究」日時：2015年12月14日月曜日午後〜2015年12月16日水曜日午前場所：京都大学数理解析研究所110教室研究代表者：桔梗宏孝　副代表：池田宏一郎数理研：http://www.kurims.kyoto-u.ac.jp/~kyodo/workshop-ja.html 集会ホームページ：https://sites.google.com/site/modeltheory2015/ 講演を希望される人は次の情報を代表者の桔梗までお知らせください。 (連絡先：kikyo(a)kobe-u.ac.jp) ----- (1)氏名 (2)所属 (3)職名/学年 (4)講演題目 (5)旅費援助の希望の有無 (6)参加日程 ------ 旅費の援助は原則として講演者に限らせていただきます。桔梗宏孝神戸大学大学院システム情報学研究科

1 0

数学基礎論若手の会2015のご案内
by kota takeuchi 14 Sep '15

14 Sep '15

（重複して受け取られた場合はご容赦ください）皆様筑波大学の竹内耕太と申します。2015年度の数学基礎論若手の会のお知らせをさせていただきます。皆様の周りに基礎論の勉強をされている学生や興味を持っておられる方がいらっしゃいましたらぜひお勧めしていただければ幸いです。また必ずしも若手ではない方の参加も歓迎しています。皆様のご参加をお待ちしています。 ---------------------------------------------------------------------------------------------------- 数学基礎論若手の会2015のご案内数学基礎論若手の会は，数学基礎論を専攻する学生および若手研究者の研究交流を目的とする合宿形式の研究集会です．講演はオリジナルの成果発表に限らず，研究の途中報告や研究内容の紹介など幅広く募集しています．また，これから数学基礎論を勉強したいと思っている方のご参加も歓迎します．多くの方のご参加・ご講演をお待ちしています．概要日時：2015年11月27日（金）午後 - 2015年11月29日（日）午前場所：筑波大学館山研修所（千葉県館山市）幹事：竹内耕太（筑波大学） E-mail：kota(a)math.tsukuba.ac.jp ウェブページ：http://www.math.tsukuba.ac.jp/~kota/wakate2015.html アクセス：東京から館山方面のバスにお乗りになるか、千葉駅からＪＲ内房線にて館山に行くことができます。詳細はウェブページをご確認ください。参加費用：宿泊料金：1人1泊2000円(相部屋) 食事料金：朝食500円、昼食700円、夕食900円（部分的な参加も可能です．懇親会の会費は別途（～1000円）いただく予定です．）参加申し込み：参加をご希望の方は，以下の情報を幹事の竹内（kota(a)math.tsukuba.ac.xn--jp)-u63b3a4a5b9eucvn0er468j. 申し込み締切：2015年11月6日(金) ---------------------------------------------------------------- (1)氏名： (2)所属： (3)職名/学年： (4)講演希望の有無（タイトルは後日でも可）: (5)研修施設での宿泊と食事の要/不要: 27日：宿泊・夕食 28日：宿泊・朝食・昼食・夕食 29日：朝食 (6)その他：ご質問, 部屋割り希望, 講演希望日など。 ---------------------------------------------------------------- 竹内耕太筑波大学数理物質系数学域

1 0

FLOPS2016 論文募集 (deadline extension)
by Yukiyoshi Kameyama 08 Sep '15

08 Sep '15

皆様、(重複して受け取られた場合は、御容赦ください。) 国際会議FLOPS2016 -- Functional and Logic Programming -- の論文募集(最終)をお送りします。投稿締切が延長され、9/25 (any time zone) となっています。 (abstract の締切は 9/21 (any time zone) です。) 論文投稿をよろしくおねがいします。 -- 亀山幸義 (筑波大学) http://logic.cs.tsukuba.ac.jp/~kam ------------------------------------------------------------------------------ NEW: revised submission deadlines (Sep 21 for abstracts, Sep 25 for papers) FLOPS 2016: March 3-6, 2016, Kochi, Japan Final Call For Papers http://www.info.kochi-tech.ac.jp/FLOPS2016/ 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. 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 Monday, September 21, 2015 (any time zone): Abstract Submission Friday, September 25, 2015 (any time zone): Submission deadline (FIRM) Monday, November 16, 2015: Author notification March 3-6, 2016: FLOPS Symposium March 7-9, 2016: PPL Workshop Invited Talks - Kazunori UEDA (Waseda University) The exciting time and hard-won lessons of the Fifth Generation Computer Project - Atze Dijkstra (Utrecht University) UHC: Coping with Compiler Complexity 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=flops2016 Program Committee Andreas Abel Gothenburg University, Sweden Lindsay Errington USA Makoto Hamana Gunma University, Japan Michael Hanus CAU Kiel, Germany Jacob Howe City University London, UK Makoto Kanazawa National Institute of Informatics, Japan Andy King University of Kent, UK (PC Co-Chair) Oleg Kiselyov Tohoku University, Japan (PC Co-Chair) Hsiang-Shang Ko National Institute of Informatics, Japan Julia Lawall Inria-Whisper, France Andres Loeh Well-Typed LLP, UK Anil Madhavapeddy Cambridge University, UK Jeff Polakow USA Marc Pouzet Ecole normale superieure, France Vitor Santos Costa Universidade do Porto, Portugal Tom Schrijvers KU Leuven, Belgium Zoltan Somogyi Australia Alwen Tiu Nanyang Technological University, Singapore Sam Tobin-Hochstadt Indiana University, USA Hongwei Xi Boston University, USA Neng-Fa Zhou CUNY Brooklyn College and Graduate Center, USA Organizers Andy King University of Kent, UK (PC Co-Chair) Oleg Kiselyov Tohoku University, Japan (PC Co-Chair) Yukiyoshi Kameyama University of Tsukuba, Japan (General Chair) Kiminori Matsuzaki Kochi University of Technology, Japan (Local Chair) flops2016 at logic.cs.tsukuba.ac dot jp

1 0

JAIST Logic Seminar Series
by Hajime Ishihara 05 Sep '15

05 Sep '15

皆様ジーゲン大学のDieter Spreen先生の講演のお知らせです。どうぞふるってご参加ください。問合せ先：石原　哉北陸先端科学技術大学院大学情報科学研究科 e-mail: ishihara(a)jaist.ac.jp ----------------------------------------------- * JAIST Logic Seminar Series * * This seminar is held as a part of JSPS Core-to-Core Program, A. Advanced Research Networks, and EU FP7 Marie Curie Actions IRSES project COMPUTAL (http://computal.uni-trier.de/). Date: Thursday 7 May, 2015, 13:30-15:00 Place: JAIST, Collaboration room 6 (I-57g) (Access: http://www.jaist.ac.jp/english/location/access.html) Speaker: Dieter Spreen (University of Siegen) Title: Digit Spaces - Topological Foundations Abstract: Digit spaces have been introduced by Ulrich Berger as a framework for extracting programs that deal with continuous data from formal proofs. The essential idea was to represent objects as streams of unary contractions on a complete metric space and to use coinduction on the logical side. In recent joint work on an extension of this approach to hyperspaces like the space of nonempty compact subsets of a digit space, it turned out that compact cannot be represented by such streams in general: instead one has to deal with infinite trees the nodes of which are labeled by contraction similar to the stream case. It was realized, however, that one will obtain a uniform theory, if the contractions, also called digits, are allowed to be multi-ary.

2 2

第33回量子情報技術研究会 (QIT33) のご案内
by Yasuhiro Takahashi 03 Sep '15

03 Sep '15

皆様，（重複して受け取られた場合はご容赦ください） NTT の高橋と申します．第33回量子情報技術研究会 (QIT33) の案内を転送させて頂きます．よろしくお願い致します． ---------------------------------------------------------- 第33回量子情報技術研究会(QIT33) 研究会の内容：　情報科学と量子力学を融合させた新しい分野，量子情報科学に関する研究会です．情報を担う物理系の量子力学的側面を積極的に活かした新しい情報処理原理の研究とそこから開かれる新しい学問体系の構築および新しい情報技術パラダイムの創生を目指して，情報科学，物理学，光エレクトロニクスを含む理学，工学，数理科学に携わる研究者間に自由な討論の場を提供し，この研究分野の発展を図ることを目的としています．　第33回研究会を下記のように開催いたします．現在この分野で活躍する研究者は勿論，自分の研究資産が何らかの形で使えそうだと予感している研究者・技術者など，広く関連する分野の研究者・技術者からの発表を募集致します．聴講のみの参加も歓迎致しますので，奮ってお申し込みください．日時: 2015年11月24日(火)-25日(水) 会場: NTT厚木研究開発センタ講堂　　（〒243-0198 神奈川県厚木市森の里若宮3-1）発表募集分野 (申し込み状況によっては査読の可能性あり) 　量子情報，量子計算，量子暗号など広く量子情報技術に関わる理論的研究，　実験的研究，計算機科学的研究，数学的研究，および，その他関連分野．チュートリアル・招待講演者　中村泰信 (東京大学) 　小芦雅斗（東京大学）　西村治道（名古屋大学）定員: 200名程度参加費: 事前振込み一般2,500円，学生1,000円　　　　　（当日会場払いは一般3,500円，学生2,000円）懇親会費: 事前振込み一般3,500円，学生2,000円　　　　　　（当日会場払いは余裕がある限り．一般4,000円，学生2,500円）研究会参加申込要領　参加申込は下記 Web にて受付けます　https://staff.aist.go.jp/s-kawabata/qit/qit33/ 　講演 (口頭，ポスター) の申込，予稿集原稿 PDF の提出は，　電子情報通信学会の Web システムを使用．【口頭講演申込締切】2015年10月9日(金) 【ポスター講演申込締切】2015年10月23日(金) 【予稿原稿提出締切】2015年10月23日(金) 【参加申込締切】2015年10月30日(金) 【問合せ先】　河野泰人 (NTTコミュニケーション科学基礎研究所) 　高橋康博 (NTTコミュニケーション科学基礎研究所) 　森越文明 (NTT物性科学基礎研究所) 　東　浩司 (NTT物性科学基礎研究所) 　Email:qit33@lab.ntt.co.jp 主催: 量子情報技術時限研究専門委員会 (委員長: 富田章久(北海道大学)) 共催: 応用物理学会量子エレクトロニクス研究会 ---------------------------------------------------------- -- 高橋康博 (Yasuhiro Takahashi) NTT コミュニケーション科学基礎研究所メディア情報研究部情報基礎理論研究グループ〒243-0198 神奈川県厚木市森の里若宮3-1 Tel: 046-240-3678 Fax: 046-240-4709 Email: takahashi.yasuhiro(a)lab.ntt.co.jp

1 0

「数学の哲学と証明論」ワークショップ、9月10日(木)-11日(金)、慶應義塾大学
by Yuta Takahashi 03 Sep '15

03 Sep '15

慶應義塾大学非常勤講師の高橋優太と申します。ワークショップ「数学の哲学と証明論」のご案内をお送りいたします。ぜひご参加ください。 --------------------------------------------------------------------- We apologize if you receive this message more than once. --------------------------------------------------------------------- カーネギーメロン大学W.Sieg教授をお招きして次のようなワークショップ「Philosophy of Mathematics and Proof Theory」を予定しております。参加自由です。（なお、次回はG-Y Girard教授をお招きして、11月28日-29日に開催する予定です。 Sieg教授は9月18日にも早稲田大学で別テーマの講演をなさいます。 URL:http://www.waseda.jp/wias/event/symposium/sym_150918.html ） ---- "Philosophy of Mathematics and Proof Theory" Workshop 「数学の哲学と証明論」ワークショップ Date: September 10th(Thu)-21th(Fri), 2015 日時: 2015年9月10日(木)-11日(金) Place: Hall (8F), East Building, Mita campus of Keio University. 場所: 慶應大学三田キャンパス東館8階ホール (http://www.keio.ac.jp/en/maps/mita.html ) 講演アブストラクトを始め会議のupdated informationについてはつぎのURLをご覧ください。 http://abelard.flet.keio.ac.jp/seminar/sieg2015.html ---- Tentative Program: 9/10: 13:00-13:10 Opening Remark, Mitsuhiro Okada and Ryota Akiyoshi 13:00-14:00 Kengo Okamoto (Tokyo Metropolitan University) "TBA" 14:00-15:00 Mamoru Kaneko (Waseda University) "Game Theoretic Decidability and Undecidability" (with Tai-Wei Hu) 15:00-15:20 Break 15:20-16:20 Ryota Akiyoshi (Waseda Institute for Advanced Study) "Some results in proof-theory for $\Pi^{1}_{1}$-$CA$" 16:20-17:50 Wilfried Sieg (Carnegie Mellon University) "Dedekind’s structuralism: creating concepts and deriving theorems" 17:50-18:20 Discussion 9/11: 13:30-14:20 Yuta Takahashi (Keio University) "Gentzen's 1935/36 Consistency Proofs as Means of Ascribing Constructive Senses" 14:20-15:00 Mitsuhiro Okada (Keio University) "Husserl's universal arithmatic and his proof theoretical view of formal mathematics" 15:00-15:20 Break 15:20-16:50 Wilfried Sieg (Carnegie Mellon University) "The ways of Hilbert's axiomatics: structural and formal" 16:50-17:20 Concluding Discussion --------------------------------------------------------------------- Organisers: Mitsuhiro Okada (co-chair) Ryota Akiyoshi (co-chair) Yutaro Sugimoto Yuta Takahashi 主催: 三田ロジックセミナー共催: 慶應義塾大学論理と感性のグローバル研究センター問合せ先: Mita Logic Seminar 事務局 logic(a)abelard.flet.keio.ac.jp --------------------------------------------------------------------- ABSTRACTS 9/10: Mamoru Kaneko (Waseda University) "Game Theoretic Decidability and Undecidability" (with Tai-Wei Hu) Abstract: We study the possibility of prediction/decision making in a finite 2--person game with pure strategies, following the Nash-Johansen noncooperative solution theory. We adopt the infinite-regress logic EIR² (a fixed-point extension) of the epistemic logic KD² to capture individual decision making from the viewpoint of logical inference. In the logic EIR², prediction/decision making is described by the belief set Δ_{i}(g) for player i, where g specifies a game. Our results on prediction/decision making differ between solvable and unsolvable games. For the former, we show that player i can decide whether each of his strategies is a final decision or not. For the latter, we obtain undecidability, i.e., he can neither decide some strategy to be a possible decision nor disprove it. Thus, the theory (EIR²;Δ_{i}(g)) is incomplete in the sense of Gödel's incompleteness theorem for an unsolvable game g. This result is related to "self-referential", but its main source is a discord generated by interdependence of payoffs and independent prediction/decision making. Ryota Akiyoshi (Waseda Institute for Advanced Study): "Some results in proof-theory for $\Pi^{1}_{1}$-$CA$" Abstract: In 2000's, Tait asked the question whether we can prove without ordinal notations that all proofs in $\Pi^{1}_{1}$-$CA$ with (Sch\"{u}tte's) $\omega$-rule are transformed into cut-free ones. Inspired by this, the author and Mints formulated an extension of Buchholz' $\Omega$-rule using Takeuti's distinction of explicit/implicit inference and proved the complete cut-elimination theorem for it. An answer to Tait's question is given by combining this with the author's work on "finite notations for infinitary derivations" for this kind of $\Omega$-rule. In the first part of the talk, we will explain the result with Mints. Next, we explain a connection between the $\Omega$-rule and the computability predicate by Tait-Girard. In 2008, Mints suggested that there should be a connection between these two methods because they would have a common aim to solve the difficulty how to deal with the substitution of a set term $T$ into a free second-order variable $X$ in $A(X)$. The author and Terui recently found this connection by formulating the $\Omega$-rule in the framework of the computability. We report and discuss our result. Wilfried Sieg (Carnegie Mellon University) "Dedekind's structuralism: creating concepts and deriving theorems" Abstract: Dedekind's structuralism is a crucial source for the structuralism of mathematical practice with its focus on abstract concepts like groups and fields. It plays an equally central role for the structuralism of philosophical analysis with its focus on particular mathematical objects like natural and real numbers. Tensions between these structuralisms are palpable in Dedekind's work, but are resolved in his essay Was sind und was sollen die Zahlen? In a radical shift, Dedekind extends his mathematical approach to “the” natural numbers. He creates the abstract concept of a simply infinite system, proves the existence of a “model”, insists on the stepwise derivation of theorems, and defines structure-preserving mappings between different systems that fall under the abstract concept. Crucial parts of these considerations were added only to the penultimate manuscript, for example, the very concept of a simply infinite system. The methodological consequences of this radical shift are elucidated by an analysis of Dedekind's metamathematics. Our analysis provides a deeper understanding of the essay and, in addition, illuminates its impact on the evolution of the axiomatic method and of “semantics” before Tarski. This understanding allows us to make connections to contemporary issues in the philosophy of mathematics and science. (This reports on work with Rebecca Morris.) 9/11: Yuta Takahashi (Keio University) "Gentzen's 1935/36 Consistency Proofs as Means of Ascribing Constructive Senses" Abstract: Gentzen's three consistency proofs for number theory have a common aim that originates from Hilbert's Program, namely, the aim to justify the application of classical reasoning to quantified propositions in number theory. In addition to this common aim, Gentzen gave a constructive interpretation to every number-theoretic proposition in his 1935/36 consistency proofs, while Hilbert's Program included no such interpretation. In this talk, we claim that Gentzen's interpretation took a part of his response to an objection posed by Brouwer against the significance of consistency proofs. Specifically, we argue as follows. According to Brouwer, consistency proofs for classical mathematics are of no significance, because its theorems have no sense whether or not its consistency is proved by using the methods of the Hilbert School. In order to respond to this objection, Gentzen aimed at ascribing a constructive sense to each theorem of classical number theory by means of his interpretation. Mitsuhiro Okada (Keio University) "Husserl's universal arithmatic and his proof theoretical view of formal mathematics" Abstract: We discuss Husserl's development of the conception of universal arithmatic,, with the special focus on his Double-Lecture and other manuscripts in 1901. We can see how his work is influenced from former formalists' work and, at the same time, how it is sharply contrasted to those,. such as Hankel's and Hilbert's former work. We discuss Husserl's view of proof-theoretic and computational notion of "manifold (in his own sense), and his term-rewrite theoretic notion of "definiteness" of manifold. We also discuss some significance of the Husserlian proof theoretic view of mathematics as well as some limitation (for which Wittgenstein partly solved much later). Wilfried Sieg (Carnegie Mellon University) "The ways of Hilbert's axiomatics: structural and formal" Abstract: It is a remarkable fact that Hilbert's programmatic papers from the 1920s still shape, almost exclusively, the standard contemporary perspective of his views concerning (the foundations of) mathematics; even his own, quite different work on the foundations of geometry and arithmetic from the late 1890s is often understood from that vantage point. My essay pursues one main goal, namely, to contrast Hilbert's formal axiomatic method from the early 1920s with his existential axiomatic approach from the 1890s, deeply influenced by Dedekind. Such a contrast illuminates the circuitous beginnings of the finitist consistency program and connects the complex emergence of existential axiomatics with transformations in mathematics and philosophy during the 19th century; the sheer complexity and methodological difficulties of the latter development are partially reflected in the well known, but not well understood correspondence between Frege and Hilbert. Taking seriously the goal of formalizing mathematics in an effective logical framework leads also to contemporary tasks, not just historical and systematic insights.

1 0

第33回量子情報技術研究会 (QIT33) のご案内
by Yasuhiro Takahashi 03 Sep '15

03 Sep '15

皆様， NTT の高橋と申します．第33回量子情報技術研究会 (QIT33) の案内を転送させて頂きます．よろしくお願い致します． ---------------------------------------------------------- 第33回量子情報技術研究会(QIT33) 研究会の内容：　情報科学と量子力学を融合させた新しい分野，量子情報科学に関する研究会です．情報を担う物理系の量子力学的側面を積極的に活かした新しい情報処理原理の研究とそこから開かれる新しい学問体系の構築および新しい情報技術パラダイムの創生を目指して，情報科学，物理学，光エレクトロニクスを含む理学，工学，数理科学に携わる研究者間に自由な討論の場を提供し，この研究分野の発展を図ることを目的としています．　第33回研究会を下記のように開催いたします．現在この分野で活躍する研究者は勿論，自分の研究資産が何らかの形で使えそうだと予感している研究者・技術者など，広く関連する分野の研究者・技術者からの発表を募集致します．聴講のみの参加も歓迎致しますので，奮ってお申し込みください．日時: 2015年11月24日(火)-25日(水) 会場: NTT厚木研究開発センタ講堂　　（〒243-0198 神奈川県厚木市森の里若宮3-1）発表募集分野 (申し込み状況によっては査読の可能性あり) 　量子情報，量子計算，量子暗号など広く量子情報技術に関わる理論的研究，　実験的研究，計算機科学的研究，数学的研究，および，その他関連分野．チュートリアル・招待講演者　中村泰信 (東京大学) 　小芦雅斗（東京大学）　西村治道（名古屋大学）定員: 200名程度参加費: 事前振込み一般2,500円，学生1,000円　　　　　（当日会場払いは一般3,500円，学生2,000円）懇親会費: 事前振込み一般3,500円，学生2,000円　　　　　　（当日会場払いは余裕がある限り．一般4,000円，学生2,500円）研究会参加申込要領　参加申込は下記 Web にて受付けます　https://staff.aist.go.jp/s-kawabata/qit/qit33/ 　講演 (口頭，ポスター) の申込，予稿集原稿 PDF の提出は，　電子情報通信学会の Web システムを使用．【口頭講演申込締切】2015年10月9日(金) 【ポスター講演申込締切】2015年10月23日(金) 【予稿原稿提出締切】2015年10月23日(金) 【参加申込締切】2015年10月30日(金) 【問合せ先】　河野泰人 (NTTコミュニケーション科学基礎研究所) 　高橋康博 (NTTコミュニケーション科学基礎研究所) 　森越文明 (NTT物性科学基礎研究所) 　東　浩司 (NTT物性科学基礎研究所) 　Email:qit33@lab.ntt.co.jp 主催: 量子情報技術時限研究専門委員会 (委員長: 富田章久(北海道大学)) 共催: 応用物理学会量子エレクトロニクス研究会 ---------------------------------------------------------- -- 高橋康博 (Yasuhiro Takahashi) NTT コミュニケーション科学基礎研究所メディア情報研究部情報基礎理論研究グループ〒243-0198 神奈川県厚木市森の里若宮3-1 Tel: 046-240-3678 Fax: 046-240-4709 Email: takahashi.yasuhiro(a)lab.ntt.co.jp

1 0

ワークショップ「Computations, Proofs, and Intuitions: A Workshop on Philosophy of Mathematics」
by Ryota Akiyoshi 01 Sep '15

01 Sep '15

早稲田大学高等研究所の秋吉と申します。以下の要領でワークショップ「Computations, Proofs, and Intuitions: A Workshop on Philosophy of Mathematics」(WIAS Top Runners’ Lecture Collection of Science) 開催のご案内をさせて頂きます。ご都合よろしければぜひご参加ください。 ------------------------------------------------------------------------------------------------------------------------ ***Please accept our apologies if you receive multiple copies of this email. *** ワークショップご案内：“Computations, Proofs, and Intuitions: A Workshop on Philosophy of Mathematics” We are pleased to invite you to a workshop titled “Computations, Proofs, and Intuitions: A Workshop on Philosophy of Mathematics” (WIAS Top Runners’ Lecture Collection). ワークショップ「Computations, Proofs, and Intuitions: A Workshop on Philosophy of Mathematics」(WIAS Top Runners’ Lecture Collection of Science) 開催のご案内をさせて頂きます。参加自由です。お気軽にご参加ください。 ---- Title: Computations, Proofs, and Intuitions: A Workshop on Philosophy of Mathematics 「計算，証明，直観」：数学の哲学ワークショップ Date: September 18 (Fri.), 2015 Time: 10:00 – 18:00 Place: International Conference Center (Meeting Room 2, 3rd floor), Waseda University. 日時: 2015年9月18日(金) 10:00 – 18:00 会場: 早稲田大学早稲田キャンパス国際会議場 3階第2会議室 *（*https://www.waseda.jp/top/access/waseda-campus#anc_8*）* http://www.waseda.jp/top/assets/uploads/2015/08/waseda-campus-map.pdf * Bldg. 18 on the map. PROGRAM ************* 10:00-10:10 Opening Remarks 10:10-11:10 “Game Theory and "Symbolic" Logic” Speaker: Mamoru Kaneko (Waseda University) 11:10-12:10 “Proof theory of the lambda-calculus” Speaker: Masahiko Sato (Kyoto University) 12:10-14:00 Lunch Break 14:00-15:20 “The *concept* of computation - an axiomatic characterization” Speaker: Wilfried Sieg (Carnegie Mellon University) 15:20-15:40 Break 15:40-16:40 “Kant on mathematical intuition: from an educational point of view” Speaker: Yasuo Deguchi (Kyoto University) 16:40-17:00 Break 17:00-18:00 “Aspects of the notion of computability” Speaker: Makoto Kikuchi (Kobe University) --------------------------------------------------------------------- 世話人: 秋吉亮太（早稲田高等研究所助教）主催: 早稲田高等研究所問合せ先: 秋吉亮太 georg.logic(a)gmail.com --------------------------------------------------------------------- ABSTRACTS ************* [Speaker] Mamoru Kaneko (Waseda University) [Title] Game Theory and "Symbolic" Logic [Abstract] In game theory, a player chooses/adjusts his behavior based on his understanding of the game situation and his decision/prediction criterion. In logic, a (ideal) mathematician calculates/proves a target theorem from his assumptions. An engine for such adjustments and calculations is logical inference. Such behavior is of a highly symbolic nature. However, it has been customary in the fields of mathematics as well as game theory that real targets are actual models but not symbolic expressions (axiomatizations). This attitude should be reversed when we take game theory as a serious study of human behavior/decision-making in social contexts including considerations of experiential sources for individual beliefs. This is very compatible with the basic idea of “symbolic” logic. In this presentation, we discuss various problems related to this interpretation. [Speaker] Masahiko Sato (Kyoto University) [Title] Proof theory of the lambda-calculus [Abstract] We present a new representation of lambda-terms as a subalgebra of a free algebra. As elements of the free algebra, lambda-terms are constructed without employing the abstraction operation, and this construction of lambda-terms enables us to study lambda-terms as natural finitary objects. In this setting, we will develop the lambda-calculus by defining reductions as derivations and study the proof theory of the lambda-calculus. We will develop the theory in the Minlog proof assistant developed by Helmut Schwichtenberg. [Speaker] Wilfried Sieg (Carnegie Mellon University) [Title] The *concept *of computation - an axiomatic characterization [Abstract] Computations are pervasive in contemporary science and life; they are visible everywhere. However, the *concept *of computation emerged in an almost invisible corner of our intellectual life. I will describe the context for the emergence of computability as a crucial notion in mathematics and logic with a normative philosophical component. My analysis of the emergence of this concept provides a novel perspective on *the central methodological issue *that surrounds computations, the “Church-Turing Thesis”. We focus on *calculable functions *on natural numbers and *mechanical operations *on syntactic configurations. The latter analysis leads to boundedness and locality conditions that motivate axioms for *computable dynamical systems*. Models of these axioms are all reducible to Turing machines. Cellular automata and a variety of artificial neural nets can be shown to satisfy them. Finally, I draw connections and point out directions for fascinating work. As to connections, I will emphasize that my novel perspective is rooted in the radical transformation of mathematics of the 19th century; especially, in the new form of structural axiomatics introduced by Dedekind and Hilbert. [Speaker] Yasuo Deguchi (Kyoto University) [Title] Kant on mathematical intuition: from an educational point of view [Abstract] Kantian notion of mathematical intuition has been criticized, notably by Frege, as too psychological or private to be the proper base of mathematics. This talk will challenge such an allegation by paying attentions to its historical backgrounds, especially that of German mathematical education. First, it focuses on Kantian notion of arithmetical intuition, and identifies one of its main resources; ’Segner’s arithmetic'. Since Vaihinger published his influential commentary of the first critique, Kantians of many variants have almost unanimously believed that it was one of his books; i.e., ‘Principle’. But this talk claims that it is his another book; i.e., ‘Lectures’. Segner’s ‘Lecture’ rather than ‘principle’ occupies a significant position in German history of mathematical education: it is a complement to the pedagogical tradition, so called, 'formal cultivation’ that was initiated by Ch. Wolff. In ‘Lectures', Segner employed such intuitive representations of numbers as points and asterisks, to make the rigid formality of mathematical thinking more approachable to the younger audiences. Since Segner’s intuitive examples of numbers and arithmetic operations were intended to be used in the context of classroom education, they should be publicly available for both teachers and students, and therefore visible and even manipulatable. Based on those observations, this talk claims that Kantian notion of mathematical intuition inherited this visibility, manipulability and public nature of Segner’s exemplars, and is not to be interpreted as being psychological or private. [Speaker] Makoto Kikuchi (Kobe University) [Title] Aspects of the notion of computability [Abstract] There are two important subclasses of the set of partial recursive functions. One is the set of primitive recursive functions and the other is the set of general or total recursive functions. The notion of computability had been scrutinized and expanded in 1930's and nowadays it is widely believed that we have succeeded in formulating the notion of computability accurately and adequately by reaching the concept of partial recursive functions. In this talk, we observe the two gaps of the three classes of computable functions and argue that the former expansion from primitive recursive functions to general recursive functions is somewhat mathematical while the latter enlargement from general recursive functions to partial recursive functions is rather philosophical. We discuss also consequences of observations of the discontinuity in the latter transition in the notion of computability.

1 0

訃報：角田譲先生
by Makoto Kikuchi 28 Aug '15

28 Aug '15

皆様，神戸大学名誉教授の角田譲先生が病気のため2015年8月27日に御逝去されました．通夜，告別式等の詳細はメールにて菊池までお問い合わせください．神戸大学菊池誠 mkikuchi(a)kobe-u.ac.jp

1 0

Last CFP: TPP 2015
by Jacques Garrigue 27 Aug '15

27 Aug '15

Dear all, (English letter and CFP below) PPLおよびlogic-mlの皆様、今年のTPP（Theorem Proving and Provers meeting）の最終案内をお送りいたします。準備（特に懇親会！）の都合上、下記要領のように、８月３１日までに参加のお知らせをいただきたいと希望しています。確実でなくとも、参加の可能性があれば是非お知らせください。講演についても、講演の可能性があれば、題目は未定(TBA/to be announced)でも構いませんのでお知らせください。 TPPmark11 の課題も添付にて再送いたします。 TPP2015のweb site <https://sites.google.com/a/progsci.info.kanagawa-u.ac.jp/tpp2015/>にもアップロードしてあります。多数の解答が寄せられるよう期待しています。 TPP2015幹事 (神奈川大学　木下佳樹) -------------------------[CFP: TPP2015]------------------------------- TPPミーティングについてのご案内です．第11回 TPPミーティングを 9月16日(水)-17日(木) に神奈川大学理学部情報科学科（平塚市）にて開催します．このミーティングは，2005年から年に1回開催され，定理証明系を作っている人から使う側の人まで幅広い人たちが集まり，様々な側面からの話をしてアイディアの交換をしてきたものです．ミーティング期間中の討論 (discussion) を大切にしたいと考えていますので出来上がった仕事の講演だけでなく、進行中の仕事、未完成の仕事についての講演も歓迎します。参加者には可能な限りご講演いただきたいと希望しています。日時： 2015年 9月16日(水) 13:00頃〜 9月17日(木) 15:00頃　（予定）場所：神奈川大学湘南ひらつかキャンパス　11号館サーカムホール〒259-1293 神奈川県平塚市土屋2946 参加者と講演の概数を把握したいので、参加される（かもしれない）方は、 8月31日までに下の参加申し込みを下記メールアドレスまでお送りください．＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊　参加（するかもしれない）申込締切：　８月３１日＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊申込み・問い合わせ先: yoshiko(a)progsci.info.kanagawa-u.ac.jp <mailto:yoshiko@progsci.info.kanagawa-u.ac.jp> (神奈川大学理学部情報科学科木下佳樹研究室松本佳子) URL: https://sites.google.com/a/progsci.info.kanagawa-u.ac.jp/tpp2015/ <https://sites.google.com/a/progsci.info.kanagawa-u.ac.jp/tpp2015/> ------------------------------------------------------------------------- TPP 2015 参加申し込みお名前：ご所属：参加　　　　：する／するかもしれない講演　　　　：する／しない講演する場合　講演題目：　　（TBAでもかまいません．）　概要：懇親会に参加：する／しない ------------------------------------------------------------------------- ========================================================================= This is the LAST CALL for participation for the 11th TPP meeting (Theorem Proving and Provers meeting), to be held on Sep. 16(Wed) - 17(Thu), 2015 at Kanagawa University. Date and Time: 2015/9/16 around 1pm to 9/17 around 3pm Place: Shonan-Hiratsuka Campus, Kanagawa University Circum Hall (Bld. 11) TPP is a series of annual meetings for developers as well as users of theorem provers. Discussions from various aspects as well as exchanges of ideas took place in the past ten meetings. We regard the discussions during the meeting to be most important. As such, not only the talks about completed work, but those about ongoing work and half-baked work are also welcome. We hope all participants would consider giving a talk. If you are planning to attend the meeting, even if not yet decided to do so, please send the information slip below to the indicated address by 31 August. ***************************************** * participation application deadline: 31 August, 2015. ***************************************** Submission/questions to: yoshiko(a)progsci.info.kanagawa-u.ac.jp <mailto:yoshiko@progsci.info.kanagawa-u.ac.jp> (Keiko Matsumoto , Kinoshita lab.) URL: https://sites.google.com/a/progsci.info.kanagawa-u.ac.jp/tpp2015/ <https://sites.google.com/a/progsci.info.kanagawa-u.ac.jp/tpp2015/> ------------------------------------------------------------------------- TPP 2015 Registration Name: Affiliation: Will participate: Yes/No/Maybe Will give a talk: Yes/No In case of Yes: Title: (If it is not decided yet, TBA is OK.) Abstract: Will join the dinner: Yes/No -------------------------------------------------------------------------

1 0

CFP: Ninth International Workshop on Juris-informatics (JURISIN 2015)
by Ken Satoh 27 Aug '15

27 Aug '15

Call for Papers Ninth International Workshop on Juris-informatics (JURISIN 2015) http://research.nii.ac.jp/~ksatoh/jurisin2015 associated with JSAI International Symposia on AI 2015 (IsAI-2015) https://www.ai-gakkai.or.jp/isai/ Date: November 16 - 18, 2015 Place: Raiosha Building, Keio University Kanagawa, Japan http://www.keio.ac.jp/en/maps/hiyoshi.html 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. Important Dates Submission Deadline: August 28, 2015 Notification October 1, 2015 Camera-ready due October 15, 2015 Workshop: November 16 - 18, 2015 Topics 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 ubiquitous computing / multi-agent system / the Internet * 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 Bar Exam Competition JURISIN invites participation in a legal information extraction and entailment competition. Previous conferences/workshops have not conducted such a shared task on a large legal data collection, so we hope that the 2015 workshop will help establish a major experimental effort in the legal information extraction/retrieval field. The motivation for the competition is to help create a research community of practice for the capture and use of legal information. Please visit the homepage of the bar exam competition: "http://webdocs.cs.ualberta.ca/~miyoung2/COLIEE2015/" Invited Speakers Giovanni Sartor (University of Bologna/European University Institute of Florence) Phan Minh Dung (Asian Institute of Technology, Thailand, (under negotiation)) 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 2015 (The 28th International Conference on Legal Knowledge and Information Systems) "http://jurix2015.di.uminho.pt/". The double submission policy with JURIX 2015 is as follows: 1. Papers being submitted both to JURISIN2015 and JURIX2015 must note this on the title page. 2. A paper to be presented at JURISIN2015 must be withdrawn from JURIX2015 and vice versa according to the choice by the authors. 3. If the authors do not follow this double submission policy, the paper by the authors will not be included in the proceedings of JURISIN 2015. 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. Please submit a paper at "https://easychair.org/conferences/?conf=jurisin2015". Post Proceedings We are under negotiation with Springer Verlag for publication of Post Proceedings as the preivous arragements. Workshop Chairs Takehiko Kasahara, Toin Yokohama University, Japan 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 Katie Atkinson, University of Liverpool, UK Marina De Vos,University of Bath, UK Randy Goebel, University of Alberta, Canada Guido Governatori, NICTA, Australia Tokuyasu Kakuta, Nagoya University, Japan Yoshinobu Kano, Shizuoka University, Japan Takehiko Kasahara, Toin Yokohama University, Japan Mi-Young Kim, University of Alberta, Canada Robert Kowalski, Imperial College London, UK Masahiro Kozuka, Okayama University, Japan Nguyen Le Minh, Japan Advanced Institute of Science and Technology(JAIST), Japan Beishui Liao, Zhejiang University, China Minghui Ma, Southwest University, China Makoto Nakamura, Nagoya University, Japan Katumi Nitta, Tokyo Institute of Technology, Japan Paulo Novais, University of Minho, Portugal Antonino Rotolo, University of Bologna, Italy Seiichiro Sakurai, Meiji Gakuin University, Japan Katsuhiko Sano, Japan Advanced Institute of Science and Technology(JAIST), Japan Ken Satoh, National Institute of Informatics and Sokendai, Japan Akira Shimazu, Japan Advanced Institute of Science and Technology(JAIST), Japan Hirotoshi Taira, Osaka Institute of Technology, Japan Fumihiko Takahashi, Meiji Gakuin University, Japan Satoshi Tojo, Japan Advanced Institute of Science and Technology(JAIST), Japan Katsuhiko Toyama, Nagoya University, Japan Minghui Xiong, Sun Yat-sen University, China Baosheng Zhang, China University of Political Science and Law, China Previous JURISIN workshops * JURISIN2007 <http://research.nii.ac.jp/%7Eksatoh/jurisin.html> * JURISIN2008 <http://www.ntt.dis.titech.ac.jp/jurisin2008/> * JURISIN2009 <http://research.nii.ac.jp/%7Eksatoh/jurisin2009.html> * JURISIN2010 <http://research.nii.ac.jp/%7Eksatoh/jurisin2010.html> * JURISIN2011 <http://research.nii.ac.jp/%7Eksatoh/jurisin2011.html> * JURISIN2012 <http://www.kl.i.is.nagoya-u.ac.jp/jurisin2012/> * JURISIN2013 <http://www.ntt.dis.titech.ac.jp/jurisin2013/> * JURISIN2014 <http://www.jaist.ac.jp/org/jurisin2014/> For any inquiry concerning the workshop, please send it to "ksatoh[at]nii.ac.jp"

1 1

ELC Seminar (Norbert Müller), Tue Sep 8
by Akitoshi Kawamura 27 Aug '15

27 Aug '15

皆様新学術領域研究「計算限界解明」（ELC）では以下のセミナーを開催しますので御案内申し上げます。奮って御参加下さい。 http://www.al.ics.saitama-u.ac.jp/elc/event/list.cgi?regid=20150908-0000-20… ------------------------------------------- Real numbers and computers Norbert Müller (Universität Trier) ------------------------------------------- Tuesday 14:00-, September 8, 2015 CELC seminar room 404 http://www.al.ics.saitama-u.ac.jp/elc/celc/ Abstract: Sometimes, people think that computers could compute correctly. Unfortunately, this is not true in general: Overflows, underflows, rounding errors and truncation errors can lead to grossly wrong results, even if the used algorithm is implemented with care. This can often be traced down to use of "double precision numbers" as a replacement for the "real numbers". In the talk we present how a computer can compute more precisely or even "exact", just using basic concepts of object-oriented programming. Additionally, we present some of the basic ideas that are used to get an efficient implementation of exact real arithmetic. 御参考：iRRAM: Exact real arithmetic in C++ http://irram.uni-trier.de/ -- 河村彰星東京大学総合文化研究科広域システム科学系

1 0

CTFM 2015 Call for Participation
by YOKOYAMA Keita 24 Aug '15

24 Aug '15

皆様、北陸先端大の横山です。参加登録期限が近づきましたので、研究集会 Computability Theory and Foundations of Mathematics 2015 (2015年9月7日(月)～9月11日(金)，東京工業大学大岡山キャンパス) の情報を再送致します。なお、研究集会のプログラムが http://www.jaist.ac.jp/CTFM/CTFM2015/timetable.html にアップされております。横山啓太 ---------- Forwarded message ---------- 皆様、北陸先端大の横山です。以下の要領で研究集会 Computability Theory and Foundations of Mathematics 2015 (2015年9月7日(月)～9月11日(金)，東京工業大学大岡山キャンパス) を開催いたします．詳しい情報については、下記のホームページをご覧ください。 http://www.jaist.ac.jp/CTFM/CTFM2015/index.html 本研究集会では、田中一之先生の還暦を記念して、田中先生の研究にちなんだセッションも行う予定です。現在、参加登録を受付中です。参加登録の締め切りは8月21日となります。宜しくご参加をご検討ください。 ============================================================ Computability Theory and Foundations of Mathematics (Tokyo Institute of Technology, Tokyo, Japan, September 7-11, 2015) http://www.jaist.ac.jp/CTFM/CTFM2015/index.html ============================================================ Computability Theory and Foundations of Mathematics (CTFM) aims to develop computability theory and logical foundations of Mathematics. The scope involves the topics Computability Theory, Reverse Mathematics, Nonstandard Analysis, Proof Theory, Set Theory, Philosophy of Mathematics, Constructive Mathematics, Theory of Randomness and Computational Complexity Theory. In honor of Professor Kazuyuki Tanaka's 60th birthday, this year's conference will include sessions covering areas in which Professor Tanaka has worked. This conference is held jointly with a workshop of Bilateral Joint Research Project sponsored by the Japan Society for the Promotion of Science and the National University of Singapore. See the previous workshop on this project JSPS-NUS Joint Workshop in Mathematical Logic and Foundations of Mathematics (March 6 - 8, 2015, Kanazawa, Japan). This is the fifth conference of CTFM conference series. See also the last year conference Computability Theory and Foundations of Mathematics 2014 (February 17 - 20, 2014, Tokyo, Japan). -------------------------------------------- Invited Speakers Ali Enayat (University of Gothenburg) Sy Friedman (Kurt Gödel Research Center) Leszek Kołodziejczyk (University of Warsaw) Alberto Marcone (The University of Udine) Nik Weaver (Washington University) Stephen Binns (King Fahd University of Petroleum and Minerals) Keng Meng Ng (Nanyang Technological University) Guohua Wu (Nanyang Technological University) Liang Yu (Nanjing University) Sakae Fuchino (Kobe University) Joel Hamkins (City University of New York) Dilip Raghavan (National University of Singapore) Hiroshi Sakai (Kobe University) Walter Dean (University of Warwick) Hidenori Kurokawa (Kobe University) Kengo Okamoto (Tokyo Metropolitan University) Toshio Suzuki (Tokyo Metropolitan University) Tin Lok Wong (Kurt Gödel Research Center) Keisuke Yoshii (Okinawa National College of Technology) -------------------------------------------- Programme Committee Chi Tat Chong (National University of Singapore, co-chair) Kojiro Higuchi (Chiba University) Makoto Kikuchi (Kobe University) Takako Nemoto (JAIST) Stephen G. Simpson (Pennsylvania State University, co-chair) Toshimichi Usuba (Kobe University) Andreas Weiermann (Ghent University) Takeshi Yamazaki (Tohoku Universigy) Yang Yue (National University of Singapore) Keita Yokoyama (JAIST / UC Berkeley) -------------------------------------------- Organising Committee Makoto Fujiwara (JAIST) Ryo Kashima (Tokyo Institute of Technology, local chair) Takayuki Kihara (UC Berkeley) Takako Nemoto (JAIST) Florian Pelupessy (Tohoku University) Takeshi Yamazaki (Tohoku University, co-chair) Keita Yokoyama (JAIST / UC Berkeley, co-chair) -------------------------------------------- どうぞよろしくお願い致します。横山啓太 -- Keita Yokoyama y-keita(a)jaist.ac.jp -- Keita Yokoyama y-keita(a)jaist.ac.jp

2 1

JAIST Logic Seminar Series
by Hajime Ishihara 20 Aug '15

20 Aug '15

皆様トリア大学のNorbert Mueller先生の講演のお知らせです。どうぞふるってご参加ください。問合せ先：石原　哉北陸先端科学技術大学院大学情報科学研究科 e-mail: ishihara(a)jaist.ac.jp ----------------------------------------------- * JAIST Logic Seminar Series * * This seminar is held as a part of JSPS Core-to-Core Program, A. Advanced Research Networks, and EU FP7 Marie Curie Actions IRSES project COMPUTAL (http://computal.uni-trier.de/). Date: Tuesday 25 August, 2015, 15:10-16:40 Place: JAIST, Collaboration room 6 (I-57g) (Access: http://www.jaist.ac.jp/english/location/access.html) Speaker: Norbert Mueller (University of Trier) Title: Real numbers and computers Abstract: Sometimes, people think that computers could compute correctly. Unfortunately, this is not true in general: Overflows, underflows, rounding errors and truncation errors can lead to grossly wrong results, even if the used algorithm is implemented with care. This can often be traced down to use of "double precision numbers" as a replacement for the "real numbers". In the talk we present how a computer can compute more precisely or even "exact", just using basic concepts of object-oriented programming. Additionally, we present some of the basic ideas that are used to get an efficient implementation of exact real arithmetic.

1 0

CFP: 43rd TRS Meeting
by Yoshihito Toyama 18 Aug '15

18 Aug '15

Dear all, This is a gentle reminder that the deadline of registration of the next TRS meeting is ** TOMORROW **. Best regards, Takahito and Yoshihito --------------------------------------------------------------------- Call for Participation 43rd TRS Meeting September 8 - 10, 2015, Morioka, Japan http://www.nue.riec.tohoku.ac.jp/trs-meeting15/ The Term Rewriting Meeting (TRS Meeting) is a biannual informal workshop that aims at promoting the research on term rewriting and related areas. Every participant is highly encouraged to present recent works possibly in progress. It is perfectly acceptable to explain a paper written by someone else. Date: September 8th (Tue) - 10th (Thu), 2015 Venue: Yumori Hotel Taikan http://www.japanican.com/en/hotel/detail/2327001/?aff=rsv http://www.hotel-taikan.com/ Fee: 10,086 yen / day (inc. breakfast, dinner and tax) Tentative Schedule: Opening 13:30, September 8 / Closing 12:00, September 10 Registration: Please fill in the following registration form and send it to our secretary Sagae-san (sagae [at] nue.riec.tohoku.ac.jp) by e-mail no later than August 19 (Wed). Items marked with * can be sent later. -------------------------------------------------------------------- Registration Form of the 42nd TRS Meeting name: affiliation: * title of talk: * approximate duration of talk (15 - 60 minutes): -------------------------------------------------------------------- Further information can be found at the website of the meeting. Best regards, Takahito Aoto and Yoshihito Toyama Research Institute of Electrical Communication Tohoku University

1 0

rims研究集会
by shioya＠math.tsukuba.ac.jp 16 Aug '15

16 Aug '15

皆様 RIMS研究集会「公理的集合論の最近の進展」への参加申込みありがとうございました。日程：２０１５年９月１６日（水）午後ー１８日（金）会場：京都大学数理解析研究所４２０号室現在、講演と旅費の補助の双方に若干の余裕があります。申込みはお早めにどうぞ。 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 氏名：所属機関：職名／学年：講演予定：あり／なし講演題目：出張期間：旅費補助の希望：あり／なしメールアドレス： %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 講演予定の皆様へ英文タイトルをお知らせ下さい。変更は随時受け付けますのでお早めに。プログラムは以下のサイトで公開します： http://sites.google.com/a/math.tsukuba.ac.jp/rims2015/ どうぞよろしくお願いします。塩谷真弘筑波大学数理物質系

1 1

PEPM2016 論文募集
by Yukiyoshi Kameyama 15 Aug '15

15 Aug '15

皆様、(重複して受け取られた場合は、御容赦ください。) 来年1月のPOPL に併設して開催される国際会議 PEPM の論文募集をお送りします。日程は、 * Abstract submission: Tue, September 8, 2015 * Paper submission: Sun, September 13, 2015 (FIRM) * Author notification: Tue, October 20, 2015 となっていて、査読が素早く行われるという特徴があります。是非、投稿をご検討ください。 -- 亀山幸義 (筑波大学) http://logic.cs.tsukuba.ac.jp/~kam --------------------------------------------------------------------- CALL FOR PAPERS Workshop on PARTIAL EVALUATION AND PROGRAM MANIPULATION (PEPM 2016) St. Petersburg, Florida, January 18 - 19, 2016 http://conf.researchr.org/track/POPL-2016/pepm-2016-main The 2016 PEPM workshop will be based on a broad interpretation of semantics-based program manipulation and continues efforts to expand the scope of PEPM beyond the traditionally covered areas of partial evaluation and specialization. Specifically, PEPM will include practical applications of program transformations such as refactoring tools, and practical implementation techniques such as rule-based transformation systems. In addition, the scope of PEPM covers manipulation and transformations of program and system representations such as structural and semantic models that occur in the context of model-driven development. In order to reach out to practitioners, a separate category of tool demonstration papers will be solicited. Topics of interest for PEPM’16 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, resource-limited computation, and security. To maintain the dynamic and interactive nature of PEPM, we will continue the category of `short papers’ for tool demonstrations and for presentations of exciting if not fully polished research, and of interesting academic, industrial and open-source applications that are new or unfamiliar. 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 program, see its web page. All accepted papers, short papers included, will appear in formal proceedings published by ACM Press. Accepted papers will be included in the ACM Digital Library. Selected papers from PEPM’16 will be published in a special issue of the journal Science of Computer Programming. PEPM has also established a Best Paper Award. The winner will be announced at the workshop. Submission Categories and Guidelines Regular Research Papers must not exceed 12 pages in ACM Proceedings style (including appendix). Tool demonstration papers and short papers must not exceed 6 pages in ACM Proceedings style (including appendix). 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’16 web site. Papers should be submitted electronically via EasyChair. easychair.org/conferences/?conf=pepm2016 Authors using LaTeX to prepare their submissions should use the new improved SIGPLAN proceedings style. Specifically, use the sigplanconf.cls 9pt template. Important Dates * Abstract submission: Tue, September 8, 2015 * Paper submission: Sun, September 13, 2015 (FIRM) * Author notification: Tue, October 20, 2015 * Camera ready copies: Fri, November 20, 2015 * Workshop: Monday, January 18 - Tuesday, January 19, 2016 Note: The paper submission deadline is firm. The above schedule is tight: We have absolutely no time to wait for late submissions, and we will have no deadline extension. ---------------------------------------------------------------------

1 0

HSCC 2016: Call for Papers
by Ichiro Hasuo 13 Aug '15

13 Aug '15

みなさま，東京大学の蓮尾です．物理情報システム分野の一大イベント CPS Week （来年はウィーン開催です）のメイン会議の一つ， HSCC の論文募集をお送りします．コミュニティとしては，主にプログラム検証・システム検証の人たちと，制御理論の人たちが，協力して研究を行っている印象です．よろしければぜひ，論文投稿や参加をご検討ください．どうかよろしくお願いいたします．蓮尾一郎 http://www-mmm.is.s.u-tokyo.ac.jp/~ichiro/ ========= 19th International Conference on Hybrid Systems: Computation and Control (HSCC) April 12-14, 2016, Vienna, Austria URL: http://www.cs.ox.ac.uk/conferences/hscc2016/ Important dates Abstract Submission deadline (required): October 8, 2015. (no extensions possible) Paper Submission deadline: October 23, 2015. (no extensions possible) Rebuttal phase: November 27 to December 4, 2015. Author notification: December 18, 2015. Camera-ready submission: TBA. Demos/posters submission deadline: TBA. Conference dates: April 12-14, 2016. Conference Scope Hybrid Systems: Computation and Control (HSCC) has long been the leading, single-track conference on foundations, techniques, and tools for analysis, verification, control, synthesis, implementation, and applications of dynamical systems that exhibit continuous and discrete (hybrid) dynamics. Applications deal broadly with cyber-physical systems (CPS), and include mixed signal circuits, robotics, large-scale infrastructure networks, as well as natural systems such as biochemical and physiological models. We solicit theoretical as well as applied research papers that present original work combining ideas from computer science and control systems. Topics of interest include, but are not limited to: - Design, synthesis, planning and control - Analysis, automated verification (Boolean or quantitative) - Certification, validation, and testing - Model building from data (via learning) and model simulation - Mathematical foundations, computability and complexity - Programming languages, specification formalisms - Software tool engineering and experimentation - Real-time and resource-aware control - Network science and control over networks - Applications in cyber-physical systems, and in particular: automotive, avionics, energy and power, mobile and autonomous robotics, medical devices, manufacturing, transportation, systems and synthetic biology, models for the life sciences, and other areas. HSCC 2016 will be held as part of the eighth Cyber Physical Systems Week (CPS Week), alongside the International Conference on Cyber-Physical Systems (ICCPS), the International Conference on Information Processing in Sensor Networks (IPSN), the Real-Time and Embedded Technology and Applications Symposium (RTAS), and CPS-related workshops. Special Issue: Authors of distinguished papers may be invited to submit an extended version of their work for possible publication in a special issue of a leading journal in the CPS research area. Best Student Paper Award: As established in the previous years, a best student paper award will be given to a contribution primarily authored by a student. Repeatability Evaluation: HSCC has a history of publishing strong papers emphasising computational contributions; however, subsequent re-creation of these computational elements is often challenging because details of the implementation are unavoidably absent in the paper. Authors of papers accepted to HSCC (in any track) that contain a computational component will be invited to participate in an optional repeatability evaluation process after final submission of the paper in February. Papers that pass will be highlighted at the conference and in the proceedings, and all submissions will receive confidential feedback from independent reviewers on any challenges faced in recreating the computational results. Further details will be posted at the conference web page. Submission Guidelines Submitted papers should present unpublished original research, not under review elsewhere. Regular papers: maximum 10 pages in the 10pt, two-column ACM format. Tool and Case Study papers: maximum 6 pages in the 10pt, two-column ACM format. Tool Papers should describe an implemented tool and its novel features. Case studies should present hybrid systems tools or techniques. Demo/posters: Maximum 2 pages. Demo/poster descriptions serve the sole purpose of selecting contributions for the demo and poster session and will not be published in the conference proceedings. Submissions Submissions of Regular, Tool and Case-Study papers should be made through the HSCC 2016 EasyChair submission website: https://easychair.org/conferences/?conf=hscc2016 Submissions deadline is October 23, 2015 - corresponding abstracts should be submitted by October 8, 2015. ACM templates can be found at: http://www.acm.org/sigs/publications/proceedings-templates Demo/poster submissions: The submission deadline will be announced sometime in the beginning of 2016. Submission will be through email to hscc2016(a)easychair.org with "HSCC demo/poster submission" in the subject line. Questions should be directed to the same address. Committees for HSCC 2016 Program Committee Chairs Alessandro Abate, University of Oxford, UK Georgios Fainekos, Arizona State University, USA Publicity Chair Sayan Mitra, Univ. of Illinois at Urbana Champaign, USA Repeatability Evaluation Chair Ian M. Mitchell, University of British Columbia, Canada Demo/Poster Chair James Kapinski, Toyota Motors, USA Program Committee Shun-ichi Azuma, Kyoto University, Japan Christel Baier, TU Dresden, Germany Ezio Bartocci, TU Vienna, Austria Calin Belta, Boston University, USA Spring Berman, Arizona State University, USA Mireille Broucke, University of Toronto, Canada Krishnendu Chatterjee, IST Austria, Austria Alessandro Cimatti, Fondazione Bruno Kessler, Italy Alessandro D'Innocenzo, University of L'Aquila, Italy Thao Dang, VERIMAG, France Jyotirmoy Deshmukh, Toyota Motors, USA Xu Chu Ding, United Technology Research Center, USA Alexandre Donzé, UC Berkeley, USA Martin Fränzle, University in Oldenburg, Germany Antoine Girard, University of Grenoble, France Ichiro Hasuo, University of Tokyo, Japan Jun-ichi Imura, Tokyo Institute of Technology, Japan Franjo Ivancic, Google NY, USA Taylor Johnson, UT Arlington, USA Agung Julius, Rensselaer Polytechnic institute, USA Sertac Karaman, MIT, USA Joost-Pieter Katoen, RWTH Aachen University, Germany Marta Kwiatkowska, University of Oxford, UK Jun Liu, University of Waterloo, Canada Daniele Magazzeni, King's College London, UK Manuel Mazo Jr, TU Delft, The Netherlands Sayan Mitra, Univ. of Illinois at Urbana Champaign, USA Jens Oehlerking, Robert Bosch GmbH, Germany Meeko Oishi, University of New Mexico, USA Necmiye Ozay, University of Michigan, USA Andreas Podelski, University of Freiburg, Germany Pavithra Prabhakar, Kansas State University, USA Maria Prandini, Politecnico di Milano, Italy Akshay Rajhans, The MathWorks, USA S Ramesh, General Motors R&D, India Sriram Sankaranarayanan, Univ. of Colorado, Boulder, USA Oleg Sokolsky, University of Pennsylvania, USA Herbert Tanner, University of Delaware, USA Ufuk Topcu, UT Austin, USA Ashuthosh Trivedi, IIT Bombay, India Jana Tumova, KTH, Sweden Verena Wolf, Saarland University, Germany Majid Zamani, Technical University of Munich, Germany Naijun Zhan, Chinese Academy of Sciences, PR China Paolo Zuliani, Newcastle University, UK Steering Committee Rajeev Alur, University of Pennsylvania, USA Werner Damm, OFFIS, Germany John Lygeros, ETH Zurich, Switzerland Oded Maler, Verimag, France Paulo Tabuada, UCLA, USA Claire Tomlin, University of California Berkeley, USA

1 0

Kobe Colloquium on Logic, Statistics and Informatics, August 21 (Arkady Leiderman)
by Joerg Brendle 09 Aug '15

09 Aug '15

Kobe Colloquium on Logic, Statistics and Informatics 以下の要領でコロキウムを開催します。日時：2015年8月21日（金）16:00-17:00 講演者：Arkady Leiderman （ベングリオン大学）場所：神戸大学自然科学総合研究棟3号館4階421室（プレゼンテーション室） ============================================================ 題目： Open G-bases and compact resolutions in topological groups and locally convex spaces. アブストラクト： A (Hausdorff) topological group G is said to have a {G}-base if G admits a base of neighbourhoods of the unit {U_alpha: alpha in N^N} such that U_alpha is contained in U_beta whenever beta leq alpha for all alpha, beta in N^N. The class of all metrizable topological groups is a proper subclass of the class TG_{G} of all topological groups having a {G}-base. A relation to the known combinatorial cardinal invariants b and d has been established: If a topological group G is in TG_{G}, then chi(G) in { 1, aleph_0 } cup [b,d]. We prove that a topological group G is metrizable iff G is Fréchet-Urysohn and has a {G}-base. We also show that any precompact set in a topological group G in TG_{G} is metrizable, and hence G is strictly angelic. We deduce from this result that an almost metrizable group G is metrizable iff G has a {G}-base. Characterizations of metrizability of topological vector spaces, in particular C_c(X), are given using {G}-bases. We obtain a result stating that if X is a submetrizable k_omega-space, then the free abelian topological group A(X) and the free locally convex topological space L(X) have a {G}-base. Another class TG_CR of topological groups with a compact resolution swallowing the compact sets appears naturally in this article. We show that the classes TG_CR and TG_{G} in some sense are dual to each other. We show also that the strong Pytkeev property for general topological groups is closely related to the notion of a {G}-base. We pose a dozen open questions. References: 1) On topological groups with a small base and metrizability, Saak Gabriyelyan, Jerzy Kąkol and Arkady Leiderman, Fund. Math. 229 (2015), 129-158. 2) The strong Pytkeev property for topological groups and topological vector spaces*,* S. S. Gabriyelyan , J. Ka̧kol and A. Leiderman, Monatshefte für Mathematik, December 2014, Volume 175, Issue 4, pp 519-542. ======================================================== 交通：阪急六甲駅またはJR六甲道駅から神戸市バス36系統「鶴甲団地」行きに乗車，「神大本部工学部前」停留所下車，徒歩すぐ． http://www.kobe-u.ac.jp/info/access/rokko/rokkodai-dai2.htm

1 0

CTFM 2015 Call for Participation
by YOKOYAMA Keita 03 Aug '15

03 Aug '15

皆様、北陸先端大の横山です。以下の要領で研究集会 Computability Theory and Foundations of Mathematics 2015 (2015年9月7日(月)～9月11日(金)，東京工業大学大岡山キャンパス) を開催いたします．詳しい情報については、下記のホームページをご覧ください。 http://www.jaist.ac.jp/CTFM/CTFM2015/index.html 本研究集会では、田中一之先生の還暦を記念して、田中先生の研究にちなんだセッションも行う予定です。現在、参加登録を受付中です。参加登録の締め切りは8月21日となります。宜しくご参加をご検討ください。 ============================================================ Computability Theory and Foundations of Mathematics (Tokyo Institute of Technology, Tokyo, Japan, September 7-11, 2015) http://www.jaist.ac.jp/CTFM/CTFM2015/index.html ============================================================ Computability Theory and Foundations of Mathematics (CTFM) aims to develop computability theory and logical foundations of Mathematics. The scope involves the topics Computability Theory, Reverse Mathematics, Nonstandard Analysis, Proof Theory, Set Theory, Philosophy of Mathematics, Constructive Mathematics, Theory of Randomness and Computational Complexity Theory. In honor of Professor Kazuyuki Tanaka's 60th birthday, this year's conference will include sessions covering areas in which Professor Tanaka has worked. This conference is held jointly with a workshop of Bilateral Joint Research Project sponsored by the Japan Society for the Promotion of Science and the National University of Singapore. See the previous workshop on this project JSPS-NUS Joint Workshop in Mathematical Logic and Foundations of Mathematics (March 6 - 8, 2015, Kanazawa, Japan). This is the fifth conference of CTFM conference series. See also the last year conference Computability Theory and Foundations of Mathematics 2014 (February 17 - 20, 2014, Tokyo, Japan). -------------------------------------------- Invited Speakers Ali Enayat (University of Gothenburg) Sy Friedman (Kurt Gödel Research Center) Leszek Kołodziejczyk (University of Warsaw) Alberto Marcone (The University of Udine) Nik Weaver (Washington University) Stephen Binns (King Fahd University of Petroleum and Minerals) Keng Meng Ng (Nanyang Technological University) Guohua Wu (Nanyang Technological University) Liang Yu (Nanjing University) Sakae Fuchino (Kobe University) Joel Hamkins (City University of New York) Dilip Raghavan (National University of Singapore) Hiroshi Sakai (Kobe University) Walter Dean (University of Warwick) Hidenori Kurokawa (Kobe University) Kengo Okamoto (Tokyo Metropolitan University) Toshio Suzuki (Tokyo Metropolitan University) Tin Lok Wong (Kurt Gödel Research Center) Keisuke Yoshii (Okinawa National College of Technology) -------------------------------------------- Programme Committee Chi Tat Chong (National University of Singapore, co-chair) Kojiro Higuchi (Chiba University) Makoto Kikuchi (Kobe University) Takako Nemoto (JAIST) Stephen G. Simpson (Pennsylvania State University, co-chair) Toshimichi Usuba (Kobe University) Andreas Weiermann (Ghent University) Takeshi Yamazaki (Tohoku Universigy) Yang Yue (National University of Singapore) Keita Yokoyama (JAIST / UC Berkeley) -------------------------------------------- Organising Committee Makoto Fujiwara (JAIST) Ryo Kashima (Tokyo Institute of Technology, local chair) Takayuki Kihara (UC Berkeley) Takako Nemoto (JAIST) Florian Pelupessy (Tohoku University) Takeshi Yamazaki (Tohoku University, co-chair) Keita Yokoyama (JAIST / UC Berkeley, co-chair) -------------------------------------------- どうぞよろしくお願い致します。横山啓太 -- Keita Yokoyama y-keita(a)jaist.ac.jp

1 0

MACIS 2015
by Akitoshi Kawamura 01 Aug '15

01 Aug '15

皆様ニューヨーク大の葉先生の御依頼により、本年11月にドイツで開催される Sixth International Conference on Mathematical Aspects of Computer and Information Sciences http://macis2015.zib.de/ の御案内をお送り致します。詳しくはウェブページをご覧下さい。締切間近のお知らせですみませんが、短篇の投稿区分もありますので、御検討いただければ幸いです。河村彰星東京大学総合文化研究科広域システム科学系 --------------------------------------------------------- Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS 2015) November 11-13, 2015 Zuse Institute Berlin (ZIB) http://macis2015.zib.de/ --------------------------------------------------------- MACIS is a series of biennial conferences focusing on research in mathematical and computational aspects of computing and information science. It is broadly concerned with algorithms, their complexity and their embedding in larger logical systems. At the algorithmic level, there is the rich interplay along the Numerical/Algebraic/Geometric/Topological axes. At the logical level, there are issues of data organization, interpretation and associated tools. These issues often arise in scientific and engineering computation where we need experimental and case studies to validate or enrich the theory. MACIS is interested in outstanding and emerging problems in all these areas. MACIS 2015 will be held in the renowned Zuse Institute Berlin (ZIB) located in the south-west area of the capital of Germany, very close to the north campus of the Freie Universitaet Berlin. Named after Konrad Zuse, the inventor of the first programmable computer, ZIB is an interdisciplinary research institute for applied mathematics and data-intensive high-performance computing. Its research areas in modeling, simulation and optimization in partnership with academia and industry is exemplary of the goals of MACIS. MACIS 2015 aims to span two conference cultures, that of computer science and of mathematics: mathematical conferences allow informal presentations in order to allow rapid dissemination of ideas and feedback from the community. But their talk abstracts are expected to turn into peer-reviewed journal papers. Computer science conferences expect close to final research papers that appear in pre-conference proceedings. Often such papers might be the only publication (perhaps because the field has moved on). In recognition of the value of both modes of scientific communication, MACIS 2015 will accept two categories of papers, SHORT and REGULAR. To facilitate your travel planning, we will make decisions on SHORT papers on a rolling basis, normally 10-15 days after submission. All accepted SHORT or REGULAR papers will appear in a post-conference proceedings published by LNCS. In addition, REGULAR papers have the opportunity to be considered for post-conference special issues of the journal Mathematics in Computer Science (MCS http://www.cc4cm.org/mcs) by Birkhauser/Springer. For details, see http://macis2015.zib.de/ Important Dates Deadline for all Submissions: Aug 11, 2015 (SHORT papers are decided on a rolling basis) Notification of Decision for REGULAR Papers: Sep 30, 2015 Camera-ready copy due: Nov 30, 2015 Conference: November 11-13, 2015

1 0

FLOPS2016 論文募集
by Yukiyoshi Kameyama 31 Jul '15

31 Jul '15

皆様、(重複して受け取られた場合は、御容赦ください。) 国際会議FLOPS2016 -- Functional and Logic Programming -- の論文募集(2回目)をお送りします。投稿締切は 9/14 (金) です。論文投稿をよろしくおねがいします。 News 1. Best paper award を設定することになりました。 2. 招待講演者としてお二人が決まりました。 - Kazunori UEDA (Waseda University) The exciting time and hard-won lessons of the Fifth Generation Computer Project - Atze Dijkstra (Utrecht University) UHC: Coping with Compiler Complexity 3. ACM SIGPLAN の後援 (in cooperation with ACM SIGPLAN) が決まりました。 -- 亀山幸義 (筑波大学) http://logic.cs.tsukuba.ac.jp/~kam --------------------------------------------------------------------- FLOPS 2016: 13th International Symposium on Functional and Logic Programming March 3-6, 2016, Kochi, Japan Call For Papers http://www.info.kochi-tech.ac.jp/FLOPS2016/ New: best paper award; in-cooperation with ACM SIGPLAN; two invited talks 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. 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 Monday, September 14, 2015 (any time zone): Submission deadline Monday, November 16, 2015: Author notification March 3-6, 2016: FLOPS Symposium March 7-9, 2016: PPL Workshop Invited Talks - Kazunori UEDA (Waseda University) The exciting time and hard-won lessons of the Fifth Generation Computer Project - Atze Dijkstra (Utrecht University) UHC: Coping with Compiler Complexity 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=flops2016 Program Committee Andreas Abel Gothenburg University, Sweden Lindsay Errington USA Makoto Hamana Gunma University, Japan Michael Hanus CAU Kiel, Germany Jacob Howe City University London, UK Makoto Kanazawa National Institute of Informatics, Japan Andy King University of Kent, UK (PC Co-Chair) Oleg Kiselyov Tohoku University, Japan (PC Co-Chair) Hsiang-Shang Ko National Institute of Informatics, Japan Julia Lawall Inria-Whisper, France Andres Loeh Well-Typed LLP, UK Anil Madhavapeddy Cambridge University, UK Jeff Polakow PivotCloud, USA Marc Pouzet Ecole normale superieure, France Vitor Santos Costa Universidade do Porto, Portugal Tom Schrijvers KU Leuven, Belgium Zoltan Somogyi Australia Alwen Tiu Nanyang Technological University, Singapore Sam Tobin-Hochstadt Indiana University, USA Hongwei Xi Boston University, USA Neng-Fa Zhou CUNY Brooklyn College and Graduate Center, USA Organizers Andy King University of Kent, UK (PC Co-Chair) Oleg Kiselyov Tohoku University, Japan (PC Co-Chair) Yukiyoshi Kameyama University of Tsukuba, Japan (General Chair) Kiminori Matsuzaki Kochi University of Technology, Japan (Local Chair) flops2016 at logic.cs.tsukuba.ac dot jp

1 0

CSセミナーin桐生
by Fujita Kenetsu 27 Jul '15

27 Jul '15

(* Apologies for any cross-postings. *) 皆様，暑中お見舞い申し上げます．コンピュータ・サイエンスのセミナーのご案内です．　http://www.cs.gunma-u.ac.jp/~fujita/research/20150730Seminar.html どうぞお気軽にお越し下さい．問い合わせ先：群馬大学　藤田憲悦 fujita(a)cs.gunma-u.ac.jp ****************************** +++Computer Science Seminar in Kiryu+++ Programme Thursday, July 30, 2015 15:00--16:30 in the media room Kiryu Campus, Gunma University "Gödel logics, Hyper Sequent Calculus, and Hyper Natural Deduction" Prof. Preining Norbert (JAIST) Abstract: In this talk we introduce Gödel logics, one of the few many-valued logics with well-behaved (e.g., axiomatizable) first order logic, the Hyper Sequent Calculus which provides an analytic sequent calculus admitting cut-elimination, and Hyper Natural Deduction, an extension of Gentzen's Natural Deduction for Intuitionistic Logic. We show that Hyper Natural Deduction is sound and complete for Gödel Logic, and discuss normalization for the new system. ****************************** Access to Kiryu campus, Gunma University: http://www.st.gunma-u.ac.jp/other/14.html Map of Kiryu campus: http://www.st.gunma-u.ac.jp/other/13.html For more information, please contact at the following \beta-normal form: (\lambda A.fujitA(a)cs.gunmA-u.Ac.jp)a (Ken-etsu Fujita, Gunma University). ----------------------------------------------------------------------------

1 0

ALGIの暫定プログラムのお知らせと懇親会の参加募集
by 西澤弘毅 27 Jul '15

27 Jul '15

logic-mlメーリングリストの皆様，神奈川大学の西澤弘毅と申します。第二十六回 ALGI（代数，論理，幾何と情報科学研究集会）の暫定プログラムのお知らせと懇親会の参加募集をさせていただきます。また、講演の募集も引き続きお待ちしています。 **************************************************************** * 第二十六回 ALGI（代数，論理，幾何と情報科学研究集会） * * * * 2015年8月31日（月）13:45～9月1日（火）12:45 * * 公立鳥取環境大学本部講義棟27講義室（鳥取県鳥取市） * * * * 暫定プログラムのお知らせ * **************************************************************** < 重複してお受け取りの節はご容赦願います。> ALGI (Algebra, Logic, Geometry and Informatics) は、代数学や論理学、幾何学の情報科学への応用について、および情報科学の代数学や論理学、幾何学への応用についての研究集会で、年一回の頻度で開催されています。 ALGIの趣旨や過去の集会の情報がウェブページ http://sakura.imi.kyushu-u.ac.jp/algi/ にありますので、参考までに御覧ください。このたび、第二十六回ALGIを開催することになりました。暫定プログラムを以下に記します。上記のウェブページにも記載されています。８月３１日（月） 13:45 ～ 14:00 オープニング＋連絡など 14:00 ～ 14:30 未定 14:30 ～ 15:00 春山栞（奈良女子大学）（共著者鴨浩靖、酒井千尋、春山栞）演題：ユークリッド幾何の問題の数式処理システムへの応用 15:00 ～ 15:15 休憩 15:15 ～ 15:45 西田美幸（奈良女子大学）（共著者西田美幸、大和田菜摘）演題：証明図エディタの作成(仮) 15:45 ～ 16:15 河野友亮（東京工業大学）演題：最小量子論理の特殊な含意とカット除去定理について 16:15 ～ 16:30 休憩 16:30 ～ 17:00 未定 17:00 ～ 17:30 未定夕方懇親会（鳥取駅周辺）９月１日（火） 9:00 ～ 9:30 蔵岡誉司（国立米子工業高等専門学校）演題：TBA 9:30 ～ 10:00 田中康平（信州大学）演題：Discrete Euler integration and sensor networks 10:00 ～ 10:15 休憩 10:15 ～ 10:45 未定 10:45 ～ 11:15 未定 11:15 ～ 11:30 休憩 11:30 ～ 12:00 未体 12:00 ～ 12:30 未定 12:30 ～ 12:45 クロージング＋連絡など懇親会への参加を希望される方は、8/27（木）までに西澤 (nishizawa AT kanagawa-u.ac.jp) にメールでお知らせください。引き続き講演も募集しておりますので、講演を希望される方は、・題目・講演者名・e-mail address ・所属・梗概・希望時間・講演に必要な道具などの情報を西澤までお寄せください。なお、会場の手配などは公立鳥取環境大学の吉田聡先生にお願いしています。できるだけ多くの皆さんのご講演・ご参加をお待ちしております。西澤弘毅（神奈川大学工学部）古澤仁（鹿児島大学理学部） -- 西澤弘毅神奈川大学工学部情報システム創成学科〒221-8686 神奈川県横浜市神奈川区六角橋3-27-1 nishizawa(a)kanagawa-u.ac.jp TEL（代表）045-481-5661 （内線：3378）

1 0

TPP2015 Theorem Proving and Provers 集会のお知らせ
by Jacques Garrigue 27 Jul '15

27 Jul '15

Dear all, (English letter and CFP below) 今年のTPP（Theorem Proving and Provers meeting）の案内をお送りします。是非参加をご検討頂きたく、何卒よろしくお願いいたします。 TPP2015幹事 (神奈川大学　木下佳樹) （今年は準備をJacques Garrigue さんにもお手伝いいただいています。感謝。） -------------------------[CFP: TPP2015]------------------------------- TPPミーティングについてのご案内です．第11回 TPPミーティングを 9月16日(水)-17日(木) に神奈川大学理学部情報科学科（平塚市）にて開催します．このミーティングは，2005年から年に1回開催され，定理証明系を作っている人から使う側の人まで幅広い人たちが集まり，様々な側面からの話をしてアイディアの交換をしてきたものです．ミーティング期間中の討論 (discussion) を大切にしたいと考えていますので出来上がった仕事の講演だけでなく、進行中の仕事、未完成の仕事についての講演も歓迎します。参加者には可能な限りご講演いただきたいと希望しています。日時： 2015年 9月16日(水) 13:00頃〜 9月17日(木) 15:00頃　（予定）場所：神奈川大学湘南ひらつかキャンパス　11号館サーカムホール〒259-1293 神奈川県平塚市土屋2946 参加者と講演の概数を把握したいので、参加される（かもしれない）方は、 8月31日までに下の参加申し込みを下記メールアドレスまでお送りください．＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊　参加（するかもしれない）申込締切：　８月３１日＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊申込み・問い合わせ先: yoshiko(a)progsci.info.kanagawa-u.ac.jp (神奈川大学理学部情報科学科木下佳樹研究室松本佳子) URL: https://sites.google.com/a/progsci.info.kanagawa-u.ac.jp/tpp2015/ ------------------------------------------------------------------------- TPP 2015 参加申し込みお名前：ご所属：参加　　　　：する／するかもしれない講演　　　　：する／しない講演する場合　講演題目：　　（TBAでもかまいません．）　概要：懇親会に参加：する／しない ------------------------------------------------------------------------- ========================================================================= This is a call for participation for the 11th TPP meeting (Theorem Proving and Provers meeting), to be held on Sep. 16(Wed) - 17(Thu), 2015 at Kanagawa University. Date and Time: 2015/9/16 around 1pm to 9/17 around 3pm Place: Shonan-Hiratsuka Campus, Kanagawa University Circum Hall (Bld. 11) TPP is a series of annual meetings for developers as well as users of theorem provers. Discussions from various aspects as well as exchanges of ideas took place in the past ten meetings. We regard the discussions during the meeting to be most important. As such, not only the talks about completed work, but those about ongoing work and half-baked work are also welcome. We hope all participants would consider giving a talk. If you are planning to attend the meeting, even if not yet decided to do so, please send the information slip below to the indicated address by 31 August. ***************************************** * participation application deadline: 31 August, 2015. ***************************************** Submission/questions to: yoshiko(a)progsci.info.kanagawa-u.ac.jp (Keiko Matsumoto , Kinoshita lab.) URL: https://sites.google.com/a/progsci.info.kanagawa-u.ac.jp/tpp2015/ ------------------------------------------------------------------------- TPP 2015 Registration Name: Affiliation: Will participate: Yes/No/Maybe Will give a talk: Yes/No In case of Yes: Title: (If it is not decided yet, TBA is OK.) Abstract: Will join the dinner: Yes/No -------------------------------------------------------------------------

1 0

Kobe Colloquium (July 28, 2015, J. Makowsky)
by fuchino＠diamond.kobe-u.ac.jp 23 Jul '15

23 Jul '15

Kow Colloquium on Logic, Statistics and Informatics =================================================== 以下の要領でコロキウムを開催します。日時：2015年7月28日（火）13:30 -- 15:00 場所：神戸大学自然科学総合研究棟3号館4階421室（プレゼンテーション室）講演者： Johann Makowsky (https://en.wikipedia.org/wiki/Johann_Makowsky) ======================================================================== 題目： Is P=NP over fields and rings? ======================================================================== アブストラクト： We discuss the complexity classes P and NP for algebraic computation (Blum-Shub-Smale model of computation) over fields and rings. We present Poizat' Theorem relating P=NP to quantifier elimination. We discuss the current state of affairs and relate it to descriptive complexity theory in the Turing model. ======================================================================== 交通：阪急六甲駅またはJR六甲道駅から神戸市バス36系統「鶴甲団地」行きに乗車，「神大本部工学部前」停留所下車，徒歩すぐ． http://www.kobe-u.ac.jp/info/access/rokko/rokkodai-dai2.htm 連絡先：渕野昌 fuchino(a)diamond.kobe-u.ac.jp

1 0

講演のお知らせ (吉田展子さん，7/29)
by Atsushi Igarashi 22 Jul '15

22 Jul '15

皆様，京都大学の五十嵐です．以下の内容で，イギリス Imperial College の吉田展子さんによる講演を行います．奮ってご参加ください．吉田さんは当日午前中から夕方まで京大におり，懇親会(18:00頃から四条方面で)を企画しております．日中お話をされたい方や懇親会に参加できる方は五十嵐まで(日中の場合は希望の時間帯を)ご連絡ください．日時: 7/29(水) 14:45〜16:00(ごろ) 場所: 京都大学吉田キャンパス総合研究７号館１階情報２講義室タイトル: Multiparty Session Types and their Applications Abstract: In this talk, I give a summary of our recent research developments on multiparty session types for verifying distributed and concurrent programs, and our collaborations with industry partners and a major, long-term, NSF-funded project (Ocean Observatories Initiatives) to provide an ultra large-scale cyberinfrustracture (OOI CI) for 25-30 years of sustained ocean measurements to study climate variability, ocean circulation and ecosystem dynamics. I shall first talk how Robin Milner, Kohei Honda and Yoshida started collaborations with industry to develop a web service protocol description language called Scribble and discovered the theory of multiparty session types through the collaborations. I then talk about the recent developments in Scribble and the runtime session monitoring framework used in the OOI CI. Finally I summarise our recent other results on Multiparty Session Types. -- 五十嵐淳 (IGARASHI Atsushi) E-mail: igarashi(a)kuis.kyoto-u.ac.jp url: http://www.fos.kuis.kyoto-u.ac.jp/~igarashi/

1 0

CFP: 43rd TRS Meeting
by Yoshihito Toyama 21 Jul '15

21 Jul '15

Call for Participation 43rd TRS Meeting September 8 - 10, 2015, Morioka, Japan http://www.nue.riec.tohoku.ac.jp/trs-meeting15/ The Term Rewriting Meeting (TRS Meeting) is a biannual informal workshop that aims at promoting the research on term rewriting and related areas. Every participant is highly encouraged to present recent works possibly in progress. It is perfectly acceptable to explain a paper written by someone else. Date: September 8th (Tue) - 10th (Thu), 2015 Venue: Yumori Hotel Taikan http://www.japanican.com/en/hotel/detail/2327001/?aff=rsv http://www.hotel-taikan.com/ Fee: 10,086 yen / day (inc. breakfast, dinner and tax) Tentative Schedule: Opening 13:30, September 8 / Closing 12:00, September 10 Registration: Please fill in the following registration form and send it to our secretary Sagae-san (sagae [at] nue.riec.tohoku.ac.jp) by e-mail no later than August 19 (Wed). Items marked with * can be sent later. -------------------------------------------------------------------- Registration Form of the 42nd TRS Meeting name: affiliation: * title of talk: * approximate duration of talk (15 - 60 minutes): -------------------------------------------------------------------- Further information can be found at the website of the meeting. Best regards, Takahito Aoto and Yoshihito Toyama Research Institute of Electrical Communication Tohoku University

1 0

数学基礎論サマースクール2015
by Makoto Kikuchi 18 Jul '15

18 Jul '15

皆様，先日ご案内いたしました数学基礎論サマースクール（8/18〜8/21）において，初日の午前中に，数理論理学の予備知識を全く持たない人を対象とする，数理論理学のチュートリアルを実施します．詳細はホームページ（http://www2.kobe-u.ac.jp/~mkikuchi/ss2015.html）でご確認ください．数学基礎論サマースクール世話人菊池誠 -- 数学基礎論サマースクール2015のご案内参加申込〆切：2015年7月31日（金）以下の要領で数学基礎論サマースクール2015を開催します．ご参加希望の方は下記の要領でお申込下さい．皆様のご参加を心よりお待ちしています．【注意】学部学生，数学基礎論を専門としない大学院生や研究者の参加を歓迎します．　初日の午前中に数理論理学の予備知識を全く持たない人を対象とする，　数理論理学のチュートリアルを実施します．（要申込）【概要】様相論理入門と，証明や真理に関する様相論理の話題についての講義．　また，様相論理と他分野との関係や発展的内容についての特論．【日時】2015年8月18日（火）15:10 ～ 21日（金）15:00 【場所】神戸大学六甲台第2キャンパス内工学部教室棟LR501教室（戎記念ホール）【住所】〒657-8501神戸市灘区六甲台町1-1 【ホームページ】http://www2.kobe-u.ac.jp/~mkikuchi/ss2015.html 【講師】薄葉季路（神戸大），金子守（早稲田大），倉橋太志（木更津高専），　黒川英徳（神戸大），佐藤雅彦（京大名誉教授），佐野勝彦（JAIST），渕野昌（神戸大）【参加費】無料【参加申込】以下の内容を e-mail で件名「ss2015」として，mkikuchi(a)kobe-u.ac.jp 宛にお送りください．・氏名（ふりがな）：・所属：・懇親会出欠：出席／欠席申込〆切：2015年7月31日（金）【内容】〈講義〉（各3コマ） 1. 様相論理入門（佐野）　様相論理の構文論と意味論，正規様相論理，最近の発展と歴史的背景 2. 証明可能性論理（倉橋）　算術と不完全性定理，ゲーデル・レーブ論理と算術的完全性定理，証明可能性論理の拡張 3. 強制法と様相論理（薄葉）　公理的集合論と強制法，ジェネリック拡大と強制関係，強制様相論理 4. 真理と様相（黒川）　タルスキの真理論と知者のパラドックス，クリプキの真理論，真理の改定理論〈特論〉（各1コマ） 1. 認識論理のゲーム論的意思決定への応用（金子） 2. 計算機科学と様相論理（佐藤） 3. 公理的集合論と様相論理（渕野）〈その他〉 1. チュートリアル　時間：10:00-12:30，講師：依岡輝幸（静岡大），場所：LR501教室　内容：数理論理学の予備知識を全く持たない人を対象とする少人数の講義．　受講ご希望の方は参加申込と同時に，または別便で件名「ss2015」として本文中に　「チュートリアル受講希望」と書いて mkikuchi(a)kobe-u.ac.jp までご連絡下さい． 2. 導入　時間：14:00-15:00，担当：菊池誠（神戸大・世話人），場所：LR501教室　内容：今回のサマースクールの背景および企画意図の説明．【懇親会】19日夜に神戸大学内で懇親会を開催します．　日時：2015年8月19日（水）午後7時から　会場：和風レストランさくら http://www.kucoop.jp/info/shop-belbox.html 　場所：神戸大学六甲台第1キャンパス内 BEL BOX 3階　会費：3,500円（予定）【アドバイザ】新井敏康（千葉大），鈴木信行（静岡大），松原洋（名古屋大）【世話人】神戸大学大学院システム情報学研究科菊池誠，酒井拓史【連絡先】菊池誠 mkikuchi(a)kobe-u.ac.jp

1 0

CFP: LENLS12 (Logic and Engineering of Natural Language Semantics 12)
by Koji Mineshima 17 Jul '15

17 Jul '15

（重複して受け取られた場合はご容赦ください）今年の１１月に東京で開催される LENLS 12 国際ワークショップのご案内をお送り致します。皆様のご投稿・ご参加をお待ちしております。峯島宏次（お茶の水女子大学） [Apologies for multiple copies] ================================================================= SECOND CALL FOR PAPERS Logic and Engineering of Natural Language Semantics 12 (LENLS 12) Workshop Site : (15th) Ochanomizu University Room 207-209, Science Building 3, Tokyo, Japan (The bldg. #20 in the "campus map" in the following webpage) http://www.ocha.ac.jp/en/access/index.html (16th,17th) Raiousha Building, Keio University Kanagawa, Japan http://www.keio.ac.jp/en/maps/hiyoshi.html Dates : November 15-17, 2015 Contact Person: Eric McCready (Aoyama Gakuin University) Contact Email : lenls12[[at]]easychair.org Website : http://www.is.ocha.ac.jp/~bekki/lenls/ ================================================================= Chair: Eric McCready (Aoyama Gakuin University) Co-chair: Daisuke Bekki (Ochanomizu University/National Institute of Informatics/JST CREST) Koji Mineshima (Ochanomizu University/JST CREST) Invited Speakers: - Nicholas Asher (CNRS, Institut de Recherche en Informatique de Toulouse/Universit'e Paul Sabatier) - Stefan Kaufmann (University of Connecticut) - Magdalena Kaufmann (University of Connecticut) - Robert Henderson (University of Arizona) - Tomohiro Sakai (Waseda University) LENLS is an annual international workshop on formal syntax, semantics and pragmatics. It will be held as one of the workshops of the 7th JSAI International Symposia on AI (isAI2015) (https://www.ai-gakkai.or.jp/isai/) sponsored by the Japan Society for Artificial Intelligence (JSAI) (http://www.ai-gakkai.or.jp/en). The first day of LENLS will include a half-day workshop on politeness and honorification with talks by Nicholas Asher, Daisuke Bekki and Eric McCready. These talks will consider the lexical semantics of honorifics, syntactic and semantic aspects of composition with honorifics, and strategic aspects of politeness and formality. The workshop is open to the public and is funded by JSPS Kiban C Grant #25370441. 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 - Continuations in natural language - 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://www.easychair.org/conferences/?conf=lenls12 When the abstract is accepted, the author is expected to submit a full paper (10-14 pages) before the workshop. The proceedings of the workshop will be available at the conference site for registered persons. Important dates: ================ Abstract submission deadline: August 23, 2015 Notification of acceptance: September 30, 2015 Deadline for camera-ready copy: October, 2015 Half-day workshop on politeness: November 15, 2015 LENLS12: November 15-17, 2015 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: ====================================== - Eric McCready (Aoyama Gakuin University) - Daisuke Bekki (Ochanomizu University/National Institute of Informatics/JST CREST) - Koji Mineshima (Ochanomizu University/JST CREST) - Alastair Butler (Tohoku University) - Richard Dietz (University of Tokyo) - Yoshiki Mori (University of Tokyo) - Yasuo Nakayama (Osaka University) - Katsuhiko Sano (Japan Advanced Institute of Science and Technology) - Katsuhiko Yabushita (Naruto University of Education) - Tomoyuki Yamada (Hokkaido University) - Shunsuke Yatabe (West Japan Railway Company) - Kei Yoshimoto (Tohoku University)

1 0

セミナー案内
by KASHIMA Ryo 13 Jul '15

13 Jul '15

数理論理学セミナーのお知らせ日時：7月17日(金)15:10から場所：東京工業大学大岡山西８号館Ｗ棟10階 W1008 【１】話者：横溝恭平（日本大学）題目：中間命題論理の断片に関する保存性の問題について概要： Sを→(ならば)を元にもつ命題論理記号の集合とする。ヒルベルト流の直観主義論理Hに対しその断片論理H_Sは、Hの公理型とその代入をS論理式(論理記号がSの元のみ出現する論理式) に制限した論理H_Sであることが知られている。本発表では、このHに関する性質が中間論理でも成り立つかについて、つまり S論理式の集合Σに対し、中間論理H + ΣがH_S + Σの保存拡大になる条件について、代数的な視点で考察する。参考文献： [1] A. Horn, The separation theorem of intuitionist propositional calculus, J. Symbolic Logic, vol.27, pp391-399 (1962) [2] C. G. McKay, The decidability of certain intermediate propositional logics, J. Symbolic Logic, vol.33, pp.258-264 (1968) [3] V. A. Jankov, Conjunctively indecomposable formulas in propositional calculi, USSR-Izvestiya, vol.3, num.1, pp.17-35 (1969) 【２】話者：梅北拓朗題目：集合論における強制法と様相論理概要：集合論において、強制法とはZFCのモデルを拡大してある命題（例えば連続体仮説）が成立するようなモデルを構成する手法であるが、 Hamkinsは「あるZFCのモデルが別のモデルの強制法による拡大になっている」という関係をKripkeフレームにおける到達可能関係とみなす「様相論理の強制法的解釈」において、様相論理の公理のいくつかが自然にZFCで成立し、また(5)という名前で知られる論理式（◇□φ→□φ）は、それをZFCに加えても無矛盾であることを見出した。これらの結果について紹介する。予備知識は特に仮定しない。 ----- 本セミナーは定期的に東工大で開催しているものです。初めて参加を希望される方はご一報ください。 ----- 鹿島亮東京工業大学大学院情報理工学研究科数理・計算科学専攻 kashima(a)is.titech.ac.jp

1 0

Fwd: Kobe Colloquium on Logic, Statistics and Informatics, July 14 (Olivier Finkel)
by Joerg Brendle 08 Jul '15

08 Jul '15

Kobe Colloquium on Logic, Statistics and Informatics 以下の要領でコロキウムを開催します。日時：2015年7月14日（火）13:30-15:00 講演者：Olivier Finkel （パリ第７大学）場所：神戸大学自然科学総合研究棟3号館4階421室（プレゼンテーション室） ============================================================ 題目： Logic, Complexity and Infinite Computations アブストラクト： The theory of automata reading infinite words, which is closely related to infinite games, is a rich theory which is used for the specification and verification of non-terminating systems. We prove that the Wadge hierarchy of omega-languages accepted by 1-counter Büchi automata (or by 2-tape Büchi automata) is equal to the Wadge hierarchy of omega-languages accepted by Büchi Turing machines, which forms the class of effective analytic sets. Moreover the topological complexity of an omega-language accepted by a 1-counter Büchi automaton, or of an infinitary rational relation accepted by a 2-tape Büchi automaton, is not determined by the axiomatic system ZFC. In particular, there is a 1-counter Büchi automaton A (respectively, a 2-tape Büchi automaton B) and two models V1 and V2 of ZFC such that the omega-language L(A) (respectively, the infinitary rational relation L(B)) is Borel in V1 but not in V2. We prove that the determinacy of Gale-Stewart games whose winning sets are accepted by real-time 1-counter Büchi automata (or by 2-tape Büchi automata) is equivalent to the determinacy of (effective) analytic Gale-Stewart games which is known to be a large cardinal assumption. Using some results of set theory we prove that one can effectively construct a 1-counter Büchi automaton (respectively, a 2-tape Büchi automaton) A such that: (1) There exists a model of ZFC in which Player 1 has a winning strategy in the Gale-Stewart game G(L(A)); but the winning strategies cannot be recursive and not even hyperarithmetical. (2) There exists a model of ZFC in which the Gale-Stewart game is not determined. We also prove that the determinacy of Wadge games between two players in charge of omega-languages accepted by real-time 1-counter Büchi automata (or by 2-tape Büchi automata) is equivalent to the effective analytic determinacy, and thus is not provable in ZFC. ======================================================== 交通：阪急六甲駅またはJR六甲道駅から神戸市バス36系統「鶴甲団地」行きに乗車，「神大本部工学部前」停留所下車，徒歩すぐ． http://www.kobe-u.ac.jp/info/access/rokko/rokkodai-dai2.htm

1 0

数学基礎論サマースクール2015
by Makoto Kikuchi 04 Jul '15

04 Jul '15

数学基礎論サマースクール2015のご案内参加申込〆切：2015年7月31日（金）以下の要領で数学基礎論サマースクール2015を開催します．ご参加希望の方は下記の要領でお申込下さい．皆様のご参加を心よりお待ちしています．【概要】様相論理入門と，証明や真理に関する様相論理の話題についての講義．　また，様相論理と他分野との関係や発展的内容についての特論．【日時】2015年8月18日（火）13:30 ～ 21日（金）15:00 【場所】神戸大学六甲台第2キャンパス内工学部教室棟LR501教室（戎記念ホール）【住所】〒657-8501神戸市灘区六甲台町1-1 【ホームページ】http://www2.kobe-u.ac.jp/~mkikuchi/ss2015.html 【講師】薄葉季路（神戸大），金子守（早稲田大），倉橋太志（木更津高専），　黒川英徳（神戸大），佐藤雅彦（京大名誉教授），佐野勝彦（JAIST），渕野昌（神戸大）【参加費】無料【参加申込】以下の内容を e-mail で件名「ss2015」として，mkikuchi(a)kobe-u.ac.jp 宛にお送りください．・氏名（ふりがな）：・所属：・懇親会出欠：出席／欠席申込〆切：2015年7月31日（金）【内容】〈講義〉（各3コマ） 1. 様相論理入門（佐野） 2. 証明可能性論理（倉橋） 3. 強制法と様相論理（薄葉） 4. 真理と様相（黒川）〈特論〉（各1コマ） 1. 認識論理のゲーム論的意思決定への応用（金子） 2. 計算機科学と様相論理（佐藤） 3. 公理的集合論と様相論理（渕野）【懇親会】19日夜に神戸大学内で懇親会を開催します．　日時：2015年8月19日（水）午後7時から　会場：和風レストランさくら http://www.kucoop.jp/info/shop-belbox.html 　場所：神戸大学六甲台第1キャンパス内 BEL BOX 3階　会費：3,500円（予定）【世話人】神戸大学大学院システム情報学研究科菊池誠，酒井拓史【連絡先】菊池誠 mkikuchi(a)kobe-u.ac.jp

1 0

1st CFP: 4th International Workshop on Formal Techniques for Safety-Critical Systems (FTSCS2015)
by Takashi Kitamura 03 Jul '15

03 Jul '15

皆様、産総研の北村崇師と申します。 11月にパリで開催される国際ワークショップ FTSCS2015 の案内（論文募集）をお送りいたします。よろしくお願いいたします。 --------------------------------------------------------------------- Call for Papers FTSCS 2015 4th International Workshop on Formal Techniques for Safety-Critical Systems Paris, November 6, 2015 (satellite workshop of ICFEM 2015) http://www.ftscs.org --------------------------------------------------------------------- *** Science of Computer Programming special issue *** *** Springer CCIS proceedings *** Aims and Scope: There is an increasing demand for using formal methods to validate and verify safety-critical systems in fields such as power generation and distribution, avionics, automotive systems, and medical systems. In particular, newer standards, such as DO-178C (avionics), ISO 26262 (automotive systems), IEC 62304 (medical devices), and CENELEC EN 50128 (railway systems), emphasize the need for formal methods and model-based development, thereby speeding up the adaptation of such methods in industry. The aim of this workshop is to bring together researchers and engineers who are interested in the application of formal and semi-formal methods to improve the quality of safety-critical computer systems. FTSCS strives to promote research and development of formal methods and tools for industrial applications, and is particularly interested in industrial applications of formal methods. Specific topics include, but are not limited to: * case studies and experience reports on the use of formal methods for analyzing safety-critical systems, including avionics, automotive, medical, railway, and other kinds of safety-critical and QoS-critical systems * methods, techniques and tools to support automated analysis, certification, debugging, etc., of complex safety/QoS-critical systems * analysis methods that address the limitations of formal methods in industry (usability, scalability, etc.) * formal analysis support for modeling languages used in industry, such as AADL, Ptolemy, SysML, SCADE, Modelica, etc. * code generation from validated models. The workshop will provide a platform for discussions and the exchange of innovative ideas, so submissions on work in progress are encouraged. Submission: We solicit submissions reporting on: A- original research contributions (15 pages max, LNCS format); B- applications and experiences (15 pages max, LNCS format); C- surveys, comparisons, and state-of-the-art reports (15 pages max, LNCS); D- tool papers (5 pages max, LNCS format); E- position papers and work in progress (5 pages max, LNCS format) related to the topics mentioned above. All submissions must be original, unpublished, and not submitted concurrently for publication elsewhere. Paper submission is done via EasyChair at https://easychair.org/conferences/?conf=ftscs2015. The final version of the paper must be prepared in LaTeX, adhering to the LNCS format available at http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0. Publication: All accepted papers will appear in the pre-proceedings of FTSCS 2015. Accepted papers in the categories A-D above will appear in the workshop proceedings that will be published as a volume in Springer's CCIS series. The authors of a selected subset of accepted papers will be invited to submit extended versions of their papers to appear in a special issue of the Science of Computer Programming journal. Important dates: Submission deadline: September 5, 2015 Notification of acceptance: October 5, 2015 Workshop: November 6/7, 2015 Venue: Paris, France (city center!) Program chairs: Cyrille Artho AIST, Japan Peter Olveczky University of Oslo, Norway Program committee: Musab AlTurki King Fahd U. of Petroleum and Minerals, Saudi Arabia Etienne Andre University Paris 13, France Toshiaki Aoki JAIST, Japan Cyrille Artho AIST, Japan Kyungmin Bae Carnegie Mellon University, USA David Broman KTH, Sweden and UC Berkeley, USA Bernd Fischer Stellenbosch University, South Africa Osman Hasan National U. of Sciences & Technology, Pakistan Klaus Havelund NASA JPL, USA Fuyuki Ishikawa National Institute of Informatics, Japan Takashi Kitamura AIST, Japan Alexander Knapp Augsburg University, Germany Brian Larson Kansas State University, USA Wenchao Li SRI International, USA Robi Malik University of Waikato, New Zealand Frederic Mallet INRIA Sophia Antipolis, France Roberto Nardone University of Napoli "Federico II", Italy Thomas Noll RWTH Aachen University, Germany Peter Olveczky University of Oslo, Norway Charles Pecheur Universite catholique de Louvain, Belgium Paul Pettersson Malardalen University, Sweden Camilo Rocha Escuela Colombiana de Ingenieria, Colombia Markus Roggenbach Swansea University, UK Ralf Sasse ETH Zurich, Switzerland Oleg Sokolsky University of Pennsylvania, USA Sofiene Tahar Concordia University, Canada Jean-Pierre Talpin INRIA Rennes, France Jackie Wang McMaster University, Canada Alan Wassyng McMaster University, Canada Michael Whalen University of Minnesota, USA Huibiao Zhu East China Normal University, China Contact: (web) http://www.ftscs.org (email) peterol(a)ifi.uio.no and c.artho(a)aist.go.jp -- Takashi KITAMURA t.kitamura(a)aist.go.jp http://staff.aist.go.jp/t.kitamura/ Nat. Inst. of Advanced Industrial Science and Technology (AIST) Nakoji 3-11-46, Amagasaki, Hyogo 661-0974, Japan Tel: +81-6-6494-8054 Internal Tel: *33-274-71902 Fax: +81-6-6494-8073

1 0

NLCS'15 Program
by Makoto Kanazawa 30 Jun '15

30 Jun '15

*********************** Call for Participation *********************** Third Workshop on Natural Language and Computer Science NLCS '15 July 5, 2015 Kyoto, Japan http://www.indiana.edu/~iulg/nlcs.html Program with abstracts: http://easychair.org/smart-program/NLCS'15/index.html Venue: Kyoto University, Clock Tower Centennial Hall, 2nd Floor, Conference Room 3 http://www.kurims.kyoto-u.ac.jp/icalp-lics2015/workshops.html Schedule: 10:30-11:00 Coffee Break 11:00-12:30 Session 1 11:00 Makoto Kanazawa, Distributional Learning of Formal Languages: A Logic-Based Approach (invited talk) 12:00 Philippe de Groote, On Logical Relations and Conservativity 12:30-14:00 Lunch Break 14:00-15:30 Session 2 14:00 Bruno Mery, Lexical Semantics with Linear Types 14:30 Gabriel Gaudreault, Bidirectional Functional Semantics for Pregroup Grammars 15:00 Glyn Morrill and Oriol Valentín, Computational Coverage of TLG: Nonlinearity 15:30-16:00 Coffee Break 16:00-17:00 Session 3 16:00 Gerard de Melo, Learning to Reason about the World using Big Data (invited talk) 17:00-17:15 Short Break without Coffee 17:15-18:15 Session 4 17:15 Oleg Kiselyov, Applicative Abstract Categorial Grammar 17:45 Sylvain Salvati, Non-linear Second Order Abstract Categorial Grammars and Deletion ------------------------------------- Contact: Makoto Kanazawa

1 0

モデル理論夏の学校（講演申込み締切）
by ikeda＠hosei.ac.jp 27 Jun '15

27 Jun '15

皆様，以前，メールいたしました「モデル理論夏の学校」に関して，講演（および参加）申込み締切を７月１１日に延長しました．講演予定でまだ申込みをされていない方は申込みの手続き，よろしくお願いいたします．池田宏一郎（法政大学） ------------------------------------------------------------------ 皆様，法政大学の池田と申します．今年８月に法政大学で研究集会「モデル理論夏の学校2015」が開催されます．この研究集会は毎年夏に開催されるモデル理論および関連分野に関する研究集会です．モデル理論に興味のある方の参加をお待ちしております．・日程：２０１５年８月２２日（土）- ２４日（月）・会場：法政大学市ヶ谷キャンパス５５年館５５１教室・所在地：〒102-8160東京都千代田区富士見2-17-1 ・世話人：池田宏一郎（法政大学経営学部，ikeda(at)hosei.ac.jp）・Web page：https://sites.google.com/site/modeltheorysummer2015/ 参加を希望される方は，下記のフォームに必要事項を記入の上，池田宛に電子メールでお申し込みください．なお，旅費補助は講演者を優先に考えております． %%%%%%%%%%モデル理論夏の学校・参加申し込みフォーム%%%%%%%%%% ・氏名：・所属機関：・職名／学年：・講演：する／しない・講演題目：・旅費補助の希望：する／しない %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 池田宏一郎（法政大学）

2 1

千葉 logic seminar (2015年7月8日)
by Naohi Eguchi 24 Jun '15

24 Jun '15

千葉 logic seminar の第6回のお知らせです。どなたでも参加できますのでどうぞ気軽にいらっしゃって下さい。問合せ先江口（千葉大学） Naohi Eguchi <neguchi(a)g.math.s.chiba-u.ac.jp> --------------------------------------- 千葉 Logic Seminar https://sites.google.com/site/chibalogicseminar/home/seminar 日時：2015年7月8日(水)15:00-16:00 場所：千葉大学理学部2号館105号室アクセスは http://www.chiba-u.ac.jp/campus_map/nishichiba/index.html の地図の黄色い理学部の中で数字2が付いている建物の1階です。 Speaker: Martin Avanzini (University of Innsbruck) Title: Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order Abstract: In this talk I will outline the content of our recent ICFP paper. Here, we shows how the runtime complexity of higher-order functional programs can be analysed automatically by applying program transformations to a defunctionalized versions of them, and feeding the result to existing tools for the complexity analysis of first-order term rewrite systems. Crucial, all involved transformations are complexity reflecting. As a consequence, a complexity certificate on the first-order system can be relayed back (asymptotically) to the initial higher-order program. Reference: Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order Martin Avanzini, Ugo Dal Lago and Georg Moser Proc. ICFP 2015, to appear. Long version: http://arxiv.org/abs/1506.05043

1 0

Klaus Keime 教授講演会
by Hideki Tsuiki 23 Jun '15

23 Jun '15

京都大学人間・環境学研究科の立木です。 7 月 3 日 (LICS サテライト Workshop の前日) に、Darmstadt 工科大学の Klaus Keimel 先生による講演会を京都大学で行います。どうぞ、お気軽にお越しください。講演会の後に、一緒にお食事に行こうと考えています。人数を把握しておきたいので、お食事に来られる方は、あらかじめメールでご連絡頂けると幸いです。多くの方のご参加をお待ちしております。立木 ------------------------------------------------------------ 講演会のお知らせ日時： 7月3日（金） 16:30 より場所：京都大学総合人間学部棟 1401 教室 (吉田南キャンパスに入って左側の建物の４Fです）講演者： Klaus Keimel (Darmstadt 工科大学名誉教授) 題目： On the equivalence of state transformer semantics and predicate transformer semantics The meaning of a program may be modeled by the input-output behavior, we call it 'state transformer semantics'. Alternatively, for verifying programs one will be interested in properties A of the output and one wants to find conditions on the input that guarantee property A for the output. One will work with the transformation that assigns to property A of the output the weakest precondition p(A) on the input that guarantees property A for the output; let us call it 'predicate transformer semantics'. In the presence of computational effects like nondeterministic or probabilistic choice, a computation will not be modeled by a function that transforms inputs from a input domain X to an output domain Y but by a state transformer t:X --> T(Y), where T is an appropriate computational monad. The corresponding predicate transformer p associates predicates on Y to predicates on X. Not all predicate transformers will correspond to state transformers, and one looks for necessary and, if possible, sufficient conditions for predicate transformers to correspond to state transformers t:X --> T(Y). Such conditions are sometimes called 'healthiness' conditions. Most examples in the literature dealing with the equivalence of the two semantics can be seen to be based on a domain R of 'observations' and a monad T 'subordinate' to the continuation monad [[(-) --> R] --> R]. For the continuation monad predicates on objects X take values in R. For the continuation monad the state transformers t and the predicate transformers p corresponding to another are related by 'swapping arguments': t(x)(A)= p(A)(x) for x in X and predicates A on Y. It is the aim of this paper to describe a framework of an algebraic/order theoretical nature for the monad T so that the equivalence between state and predicate transformer semantics described above for the continuation monad can be carried over. This framework always yields necessary healthiness conditions. The sufficiency criterion has to be verified in each special situation separately. We illustrate our methods by several examples. As semantic domains we use dcpos (directed complete partially ordered sets). But the same methods can be applied to other Cartesian closed categories and beyond, as we indicate in the concluding remarks.

1 0

Sylvain Salvati at NII Logic Seminar 7/1
by Makoto Kanazawa 23 Jun '15

23 Jun '15

Lecture by Sylvain Salvati at NII Logic Seminar Date and Time: July 1, 16:00-17:00 Place: National Institute of Informatics, Conference Room 1208 (12th floor) 場所: 国立情報学研究所 12階 1208室 (半蔵門線,都営地下鉄三田線・新宿線神保町駅または東西線竹橋駅より徒歩5分) (地図 http://www.nii.ac.jp/about/access/) Speaker: Sylvain Salvati (INRIA Bordeaux Sud-Ouest) Title: Model construction for higher-order model-checking Abstract: When dealing with finite state properties, it is usual to have some finite algebraic structures (e.g. finite monoids in the case of finite state automata on strings) that represent those properties. When dealing with logical properties of programs that are computed by finite state automaton, the question of what is an "adequate" finite algebraic structure arises. Having such a structure would entail a sort of modularity in program verification, but it also gives some strong understanding of how the properties can be checked. In the context of higher-order verification, programs are models as lambda-terms and it is natural to think about denotational domains as a possible candidate. Finitary Scott domains only capture very simple properties of the Bohm trees generated by higher-order programs. This talk will illustrate how to enrich Scott domains so that they can capture wider classes of finite state properties. 問合せ先: 金沢誠 (国立情報学研究所) e-mail: kanazawa(a)nii.ac.jp

1 0

CTFM2015 Call for abstracts
by YOKOYAMA Keita 19 Jun '15

19 Jun '15

皆様、北陸先端大の横山です。締め切りが近づきましたので、下記の研究集会の情報を再送致します。横山啓太 ---------- Forwarded message ---------- From: YOKOYAMA Keita <y-keita(a)jaist.ac.jp> Date: 2015-05-14 22:49 GMT-07:00 Subject: Fwd: CTFM2015 Call for abstracts To: logic-ml(a)fos.kuis.kyoto-u.ac.jp, kisoron-ml(a)fos.kuis.kyoto-u.ac.jp ****************************** 以下の要領で研究集会 Computability Theory and Foundations of Mathematics 2015 (2015年9月7日(月)～9月11日(金)，東京工業大学大岡山キャンパス) を開催いたします．詳しい情報については、下記のホームページをご覧ください。 http://www.jaist.ac.jp/CTFM/CTFM2015/index.html 講演の募集の締め切りは6月15日となっております。また、講演受理の連絡は6月25日までにお送りする予定です。宜しく参加・講演をご検討ください。 ============================================================ Computability Theory and Foundations of Mathematics (Tokyo Institute of Technology, Tokyo, Japan, September 7-11, 2015) http://www.jaist.ac.jp/CTFM/CTFM2015/index.html ============================================================ Computability Theory and Foundations of Mathematics (CTFM) aims to develop computability theory and logical foundations of Mathematics. The scope involves the topics Computability Theory, Reverse Mathematics, Nonstandard Analysis, Proof Theory, Set Theory, Philosophy of Mathematics, Constructive Mathematics, Theory of Randomness and Computational Complexity Theory. In honor of Professor Kazuyuki Tanaka's 60th birthday, this year's conference will include sessions covering areas in which Professor Tanaka has worked. This conference is held jointly with a workshop of Bilateral Joint Research Project sponsored by the Japan Society for the Promotion of Science and the National University of Singapore. See the previous workshop on this project JSPS-NUS Joint Workshop in Mathematical Logic and Foundations of Mathematics (March 6 - 8, 2015, Kanazawa, Japan). This is the fifth conference of CTFM conference series. See also the last year conference Computability Theory and Foundations of Mathematics 2014 (February 17 - 20, 2014, Tokyo, Japan). -------------------------------------------- Submission deadline for Presentations: June 15, 2015 -------------------------------------------- Invited Speakers Ali Enayat (University of Gothenburg) Sy Friedman (Kurt Gödel Research Center) Alberto Marcone (The University of Udine) Nik Weaver (Washington University) Guohua Wu (Nanyang Technological University) Stephen Binns (King Fahd University of Petroleum and Minerals) Liang Yu (Nanjing University) Sakae Fuchino (Kobe University) Joel Hamkins (City University of New York) Dilip Raghavan (National University of Singapore) Hidenori Kurokawa (Kobe University) Kengo Okamoto (Tokyo Metropolitan University) Toshio Suzuki (Tokyo Metropolitan University) Tin Lok Wong (Kurt Gödel Research Center) -------------------------------------------- Programme Committee Chi Tat Chong (National University of Singapore, co-chair) Kojiro Higuchi (Chiba University) Makoto Kikuchi (Kobe University) Takako Nemoto (JAIST) Stephen G. Simpson (Pennsylvania State University, co-chair) Toshimichi Usuba (Kobe University) Andreas Weiermann (Ghent University) Takeshi Yamazaki (Tohoku Universigy) Yang Yue (National University of Singapore) Keita Yokoyama (JAIST / UC Berkeley) -------------------------------------------- Organising Committee Makoto Fujiwara (JAIST) Ryo Kashima (Tokyo Institute of Technology, local chair) Takayuki Kihara (UC Berkeley) Takako Nemoto (JAIST) Florian Pelupessy (Tohoku University) Takeshi Yamazaki (Tohoku University, co-chair) Keita Yokoyama (JAIST / UC Berkeley, co-chair) -------------------------------------------- どうぞよろしくお願い致します。横山啓太 -- Keita Yokoyama y-keita(a)jaist.ac.jp

1 1

Talk by Matthew de Brecht (25 Jun 11:00-)
by Tetsuya Sato 19 Jun '15

19 Jun '15

京都大学数理解析研究所の佐藤です。 6月25日11:00から、情報通信研究機構・脳情報通信融合研究センターの Matthew de Brecht氏に以下の講演をしていただくことになりましたので、ご連絡いたします。どうぞお気軽にお越しください。 ========== Time: 11:00-12:00, 25 Jun, 2015 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: Matthew de Brecht (NICT, CiNet) Title: Towards a descriptive set theory for QCB spaces. Abstract: QCB spaces (quotients of countably based spaces) are a convenient cartesian closed category of topological spaces with important applications in computable analysis and for modeling the semantics of programming languages. However, they generally fail to be countably based and have very complicated topologies, which so far has been a major obstacle for obtaining a deep understanding of these spaces. In this talk, I will present recent joint work with M. Schroeder and V. Selivanov concerning a classification of QCB0 spaces according to the descriptive complexity of defining a basis for their topologies. Our approach provides useful tools for analyzing when one QCB space can be embedded into another, and has deep connections with the projective hierarchy from descriptive set theory. We will present some applications concerning the existence of universal QCB-spaces, as well as some results on the Kleene-Kreisel continuous functionals.

1 0

ICALP Satellite Workshop on Quantum Computational Complexity
by NISHIMURA Harumichi 16 Jun '15

16 Jun '15

logic-ml の皆様，国際会議ICALP2015のサテライトワークショップとして以下のような量子計算量に関するワークショップを開催します．ご興味のある方の積極的なご参加をお待ちしております．名古屋大学大学院情報科学研究科西村治道 --------------------------------------------------------------------------- 7月4日京都大学百周年時計台記念館において、ICALP2015のSatellite Workshopとして，量子計算の分野で著名な以下の研究者による講演会を企画しました． URL: http://cs.e.yamagata-u.ac.jp/qcc/ -Richard Cleve (Waterloo University / IQC) -Matthew Coudron (MIT) -Joseph Fitzsimons (Singapore University of Technology and Design) -Keisuke Fujii (Kyoto University) -Troy Lee (CQT Singapore) -Jamie Sikora (CQT Singapore) -Seiichiro Tani (NTT) ICALPに参加されない方でも当日5,000円で参加できます．研究費などから補助がない学生の方の参加費を新学術領域研究「計算限界解明」プロジェクトから補助可能です．詳しくは，下記までお問い合わせください． Email: qcc2015(a)cs.e.yamagata-u.ac.jp ---------------------------------------------------------------------------

1 0

[Last CFP] Symposium on Foundations & Practice of Security (10/26-28, France)
by Lu Yifeng 16 Jun '15

16 Jun '15

皆様直前のＣＦＰで恐縮ですが、下記の国際会議の call-for-papers をお送りいたします。ご投稿をお待ちしております。小川瑞史（北陸先端大） --------------------------------------------------------------------- ****** PLease forgive me if you receive multiple copies ****** Call for Papers =============== **The 8th International Symposium on Foundations & Practice of Security (FPS 2015), Clermont-Ferrand, France, 26-28 October 2015.** Conference Website ------------------ <http://confiance-numerique.clermont-universite.fr/fps2015/> Scope ----- Protecting the communication and data infrastructure of an increasingly inter-connected world has become vital to the normal functioning of all aspects of our world. Security has emerged as an important scientific discipline whose many multifaceted complexities deserve the attention and synergy of the mathematical, computer science and engineering communities. After the previous meetings held in La Rochelle, Montreal, Grenoble, Toronto and Paris, this 8th edition of the FPS symposium will be held in Clermont-Ferrand, France. The aim of FPS is to discuss and exchange theoretical and practical ideas that address security issues in inter-connected systems. It aims to provide scientific presentations as well as to establish links, promote scientific collaboration, joint research programs, and student exchanges between institutions involved in this important and fast moving research field. We also invite papers from researchers and practitioners working in security, privacy, trustworthy data systems and related areas to submit their original papers. The main topics, but not limited to, include: * Computer and Network Security * Formal foundations in Information or Operational Security * Security of Service Oriented Architectures * Information Theoretic Security * Security of Cloud Computing * Security Management and Security Policies * Policy-based Security Architectures * Security of P2P systems * Security & Privacy on Social Networks * Access Control Languages * Data Mining & Watermarking * Cryptography & Cryptanalysis * Threat Analysis and Trust Management * Privacy & Sensitive Data Management * Policy-based Distributed Information Systems * Security in Sensor Networks and RFIDs * Security of Cloud Computing, Grid Computing * Security of Distributed Embedded Middleware * Distributed Security Protocols & Policies * Security and Privacy in Digital Currencies * Malware, Botnet and Advanced Persistent Threats * Code Reverse Engineering and Vulnerability Exploitation * Side Channel & Physical Attacks * Social Engineering Submissions Guidelines ---------------------- Full papers should be at most 16 pages, including the bibliography and appendices. Short papers should be up to 8 pages. Authors should indicate whether their paper is a "position paper" to differentiate them from regular ones (you mention "Position paper" in the title). Committee members are not required to read the appendices, so the paper should be intelligible without them. All submissions must be written in English. Authors must submit their papers by the deadline indicated below, using the EasyChair web site (using the link http://www.easychair.org/conferences/?conf=fps2015) and following the requirements stated there. All papers will be refereed. The submitted contribution should be formatted according to Springer's LNCS style. Submissions by PhD students as well as surveys and controversial ideas are encouraged. Case studies (successful or not) are also encouraged. Publication ----------- As in previous editions, proceedings will be published by Springer-Verlag in the Lecture Notes in Computer Science (LNCS) series. At least one author of each accepted paper must register to the symposium, by the date indicated by the organizers, and present the paper. Committees ------------------ General Chair Pascal Lafourcade (Universite d'Auvergne) Program Committee Co-Chairs Guillaume Bonfante (Mines de Nancy) Joaquin Garcia-Alfaro (Telecom SudParis) Evangelos Kranakis (Carleton University) Publicity Co-Chairs Asia: Mizuhito Ogawa (Japan Advanced Institute of Science and Technology) Europe: Giovanni Livraga (University of Milan) North America: Zhiqiang Lin (University of Texas at Dallas) Program Committee Michel Barbeau (Carleton University) Jordi Castella-Roca (Rovira i Virgili Univ.) Frederic Cuppens (Telecom Bretagne) Nora Cuppens-Boulahia (Telecom Bretagne) Mila Dalla Preda (University of Verona) Josep Domingo-Ferrer (Universitat Rovira i Virgili) Jean-Luc Danger (Telecom ParisTech) Sara Foresti (Univ. degli Studi di Milano) Marc Frappier (Univ. de Sherbrook) Martin Gagne (Wheaton College) Sebastien Gambs (Universite de Rennes) Flavio D. Garcia (University of Birmingham) Diala Haidar (Dar Al Hekma College) Jordi Herrera-Joancomarti (Univ. Aut. de Barcelona) Bruce Kapron (University of Victoria, Canada) Hyoungshick Kim (Sungkyunkwan University) Giovanni Livraga (Univ. degli Studi di Milano) Luigi Logrippo (Univ. du Quebec en Outaouais) Javier Lopez (University of Mﾃ｡laga) Flaminia Luccio (Ca'Foscari University of Venice) Joan Melia-Segui (Universitat Oberta de Catalunya) Ali Miri (Ryerson University) Guillermo Navarro (Univ. Aut. de Barcelona) Jordi Nin (Universitat Politecnica de Catalunya) Melek Onen (Eurecom) Andreas Pashalidisi (K. U. Leuven) Marie-Laure Potet (Ensimag) Silvio Ranise (FBK, Security and Trust Unit) Claudio Soriente (ETH Zurich) Chamseddine Talhi (ETS, Montreal) Nadia Tawbi (Universite LAVAL) Emmanuel Thome (INRIA Lorraine) Alexandre Viejo (Rovira i Virgili University) Lena Wiese (Gottingen University) Nicola Zannone (Eindhoven Univ. of Technology) Nur Zincir Heywood (Dalhousie University) Steering Committee Frederic Cuppens (Telecom Bretagne) Nora Cuppens-Boulahia (Telecom Bretagne) Mourad Debbabi (Concordia University) Joaquin Garcia-Alfaro (Telecom SudParis) Evangelos Kranakis (Carleton University) Pascal Lafourcade (Universite d'Auvergne) Jean-Yves Marion (Mines de Nancy) Ali Miri (Ryerson University) Rei Safavi-Naini (Calgary University) Nadia Tawbi (Universite Laval) Submission Website ------------------ <http://www.easychair.org/conferences/?conf=fps2015> Important Dates --------------- Submission Deadline: | June 14, 2015 Acceptance Notification: | August 17, 2015 Camera Ready: | September 13, 2015 Conference: | October 26-28, 2015, Clermont-Ferrand, France

2 2

ALGI（代数，論理，幾何と情報科学研究集会）の講演募集のお知らせ
by 西澤弘毅 15 Jun '15

15 Jun '15

logic-mlメーリングリストの皆様，神奈川大学の西澤弘毅と申します。第二十六回 ALGI（代数，論理，幾何と情報科学研究集会）の開催のお知らせと講演の募集をさせていただきます。 **************************************************************** * 第二十六回 ALGI（代数，論理，幾何と情報科学研究集会） * * * * 2015年8月31日（月）午後～9月1日（火） * * 公立鳥取環境大学本部講義棟27講義室（鳥取県鳥取市） * * * * 開催のお知らせと講演の募集 * **************************************************************** < 重複してお受け取りの節はご容赦願います。> ALGI (Algebra, Logic, Geometry and Informatics) は、代数学や論理学、幾何学の情報科学への応用について、および情報科学の代数学や論理学、幾何学への応用についての研究集会で、年一回の頻度で開催されています。 ALGIの趣旨や過去の集会の情報がウェブページ http://sakura.imi.kyushu-u.ac.jp/algi/ にありますので、参考までに御覧ください。このたび、第二十六回ALGIを開催することになりました。開催期間及び開催場所は上記のとおりです。会場の手配などは公立鳥取環境大学の吉田聡先生にお願いしています。初日は午後から開催いたします。最終日の午後まで開催するかどうかは、講演の数によります。講演を希望される方は、・題目・講演者名・e-mail address ・所属・梗概・希望時間・講演に必要な道具などの情報を nishizawa(a)kanagawa-u.ac.jp までお寄せください。「講演したいと思っている」程度の不完全情報でも結構です。時間の空きがある限り、開催直前まで講演申込を受け付けるつもりですが、申込順に発表時間を割り当てていきますので、講演をお考えの方は、なるべくお早めにお知らせいただけますようにお願い致します。申し込み不要で自由にご参加いただけます。ただし懇親会については事前に詳細を告知し参加申し込みを受け付けます。できるだけ多くの皆さんのご講演・ご参加をお待ちしております。西澤弘毅（神奈川大学工学部）古澤仁（鹿児島大学理学部） -- 西澤弘毅神奈川大学工学部情報システム創成学科〒221-8686 神奈川県横浜市神奈川区六角橋3-27-1 nishizawa(a)kanagawa-u.ac.jp TEL（代表）045-481-5661 （内線：3378）

1 0

セミナー案内
by KASHIMA Ryo 13 Jun '15

13 Jun '15

数理論理学セミナーのお知らせ【本セミナーは定期的に東工大で開催しているものです。初めて参加される方は前日までにご連絡ください。】日時：6月19日(金) 16:30 場所：東京工業大学大岡山西８号館Ｗ棟10階 W1008 話者：田中一之（東北大）題目：決定問題とオートマトン概要： 1920年代にヒルベルト学派が数理論理学の中心テーマとして掲げた「決定問題」は，狭義には1階論理における真偽を判定する手続きを求める問題である．これはゲーデルやチューリングによってすぐに否定的に解かれたが，その後も様々な角度から類似の問題が提起され，肯定的にも否定的にも豊富な結果と解決手法が生れた．肯定的な手法としてはオートマトンの利用がしばしば有効であることが知られているが，その方法はもちろん万能ではなく，決定可能と不可能の分水嶺となる興味深い現象も数多く見られる．本講演では，周辺の話題に広く触れ，予備知識を仮定せずに決定問題の数理へと誘いたい。参考文献：D．クライアン他著田中訳『ロジックの世界』講談社ブルーバックス 2015年3月．田中一之『ゲーデル、チューリング、超パズル』東京大学出版会 UP 2015年5月号．田中一之『「イミテーション・ゲーム」と数学映画の楽しみ方』数学セミナー2015年7月号． ----- 鹿島亮東京工業大学大学院情報理工学研究科数理・計算科学専攻 kashima(a)is.titech.ac.jp

1 0

CCA 2015 と併設ワークショップの御案内
by Akitoshi Kawamura 06 Jun '15

06 Jun '15

皆様計算可能解析学の国際会議　　Twelfth International Conference on Computability and Complexity in Analysis (CCA 2015) 　　平成27年7月12～15日　明治大学駿河台キャンパス（東京都千代田区）　　http://cca-net.de/cca2015/ の参加登録を受付けておりますので御案内申し上げます。 http://www.graco.c.u-tokyo.ac.jp/~kawamura/cca2015-local/ こちらのページより御登録下さい（参加費12000円（懇親会ナシの場合2000円）は当日受付にてお支払い下さい）。早期・晩期の参加費の違いは設けておりませんが、準備の都合上なるべく早めに登録頂けますと幸いです。特に懇親会参加の場合は今月中の御登録をお願い致します。初日である7月12日（日）には　　日独ワークショップ「実数計算の理論と実際」を開催します。こちらは計算理論と数値計算の協働的発展を目指し、双方の専門家が基礎から最近の話題まで紹介するワークショップで、この日だけなら参加無料・申込不要です。詳しくは上記ウェブページを御覧下さい。皆様の御参加をお待ち申し上げます。 -- 河村彰星東京大学大学院総合文化研究科広域科学専攻広域システム科学系 2015-02-03 11:39 GMT+09:00 Hajime Ishihara <ishihara(a)jaist.ac.jp>: > First Call for Papers: > > Twelfth International Conference on > > Computability and Complexity in Analysis (CCA 2015) > http://cca-net.de/cca2015/ > > July 12-15, 2015, Tokyo, JAPAN > > ______________________________________________________________ > > > Scientific Program Committee > > * Andrej Bauer (Ljubljana, Slovenia) > * Stephen A. Cook (Toronto, Canada) > * Guido Gherardi (Munich, Germany) > * Daniel Graça (Faro, Portugal) > * Hajime Ishihara (Ishikawa, Japan) > * Ker-I Ko (Hsinchu, Taiwan) > * Timothy McNicholl (Ames, USA) > * André Nies (Auckland, New Zealand) > * Mariko Yasugi (Kyoto, Japan) > * Martin Ziegler, chair (Darmstadt, Germany) > > > Organizing Committee > > * Naohi Eguchi (Chiba University, Japan) > * Kojiro Higuchi (Chiba University, Japan) > * Akitoshi Kawamura, chair (University of Tokyo, Japan) > * Kenshi Miyabe (Meiji University, Japan) > * Ryuhei Mori (Tokyo Institute of Technology, Japan) > * Hideki Tsuiki (Kyoto University, Japan) > > > Submissions > > Authors are invited to submit 1-2 pages abstracts in PDF format > by March 31st via https://easychair.org/conferences/?conf=cca2015 > > > Conference Web Page > > http://cca-net.de/cca2015/ > > > > _______________________________________________ > Kisoron-ml mailing list > Kisoron-ml(a)fos.kuis.kyoto-u.ac.jp > http://www.fos.kuis.kyoto-u.ac.jp/cgi-bin/mailman/listinfo/kisoron-ml

1 0

APLAS 2015: Deadline extension (June 15)
by Kohei SUENAGA 05 Jun '15

05 Jun '15

皆様，京都大学の末永です． APLAS 2015 の締め切りが延長となりました．投稿をご検討ください．よろしくお願いいたします．末永幸平 -- ** DEADLINE EXTENSION FOR SUBMISSIONS TO APLAS 2015: ** - Paper submission deadline: June 15, 2015. ********************************************************************* APLAS 2015, Call for Papers 13th Asian Symposium on Programming Languages and Systems Pohang, Korea, November 30 - December 2, 2015 < http://pl.postech.ac.kr/aplas2015/> ********************************************************************* *IMPORTANT DATES* Submission deadline: June 15, 2015 Author notification: August 17, 2015 Final version: September 7, 2015 Conference: November 30 - December 2, 2015 *INVITED SPEAKERS* Peter O'Hearn, Facebook Sukyoung Ryu, KAIST Eran Yahav, Technion Hongseok Yang, University of Oxford *ABOUT* APLAS aims to stimulate programming language research by providing a forum for the presentation of latest results and the exchange of ideas in programming languages and systems. APLAS is based in Asia, but is an international forum that serves the worldwide programming language community. APLAS is sponsored by the Asian Association for Foundation of Software (AAFS), founded by Asian researchers in cooperation with many researchers from Europe and the USA. Past APLAS symposiums were successfully held in Singapore ('14), Melbourne ('13), Kyoto ('12), Kenting ('11), Shanghai ('10), Seoul ('09), Bangalore ('08), Singapore ('07), Sydney ('06), Tsukuba ('05), Taipei ('04) and Beijing ('03) after three informal workshops. Proceedings of the past symposiums were published in Springer's LNCS. *TOPICS* The symposium is devoted to foundational and practical issues in programming languages and systems. Papers are solicited on topics such as * semantics, logics, foundational theory * design of languages, type systems and foundational calculi * domain-specific languages * compilers, interpreters, abstract machines * program derivation, synthesis and transformation * program analysis, verification, model-checking * logic, constraint, probabilistic and quantum programming * software security * concurrency and parallelism * tools and environments for programming and implementation Topics are not limited to those discussed in previous symposiums. Papers identifying future directions of programming and those addressing the rapid changes of the underlying computing platforms are especially welcome. Demonstration of systems and tools in the scope of APLAS are welcome to the System and Tool presentations category. Authors concerned about the appropriateness of a topic are welcome to consult with program chair prior to submission. *SUBMISSION* We solicit submissions in two categories: a) Regular research papers - describing original scientific research results, including tool development and case studies. Regular research papers should not exceed 18 pages in the Springer LNCS format, including bibliography and figures. They should clearly identify what has been accomplished and why it is significant. Submissions will be judged on the basis of significance, relevance, correctness, originality, and clarity. In case of lack of space, proofs, experimental results, or any information supporting the technical results of the paper could be provided as an appendix or a link to a web page, but reviewers are not obliged to read them. b) System and tool presentations - describing systems or tools that support theory, program construction, reasoning, or program execution in the scope of APLAS. System and Tool presentations are expected to be centered around a demonstration. The paper and the demonstration should identify the novelties of the tools and use motivating examples. System and Tool papers should not exceed 8 pages in the Springer LNCS format, including bibliography and figures. Submissions will be judged based on both the papers and the described systems or tools. It is highly desirable that the tools are available on the web. Papers should be submitted electronically via the submission web page <https://easychair.org/conferences/?conf=aplas2015> using EasyChair. Acceptable formats are PostScript or PDF. Submitted papers must be unpublished and not submitted for publication elsewhere. Papers must be written in English. The proceedings will be published as a volume in Springer's LNCS series. Accepted papers must be presented at the conference. *ORGANIZERS* General Chair: Sungwoo Park (Pohang Univ. of Science and Technology (POSTECH), Korea) Program Chair: Xinyu Feng (Univ. of Science and Technology of China, China) Program Committee: James Brotherston (Univ. College London, UK) James Cheney (Univ. of Edinburgh, UK) Huimin Cui (Institute of Computing Technology, CAS, China) Mike Dodds (Univ. of York, UK) Xinyu Feng (Univ. of Science and Technology of China, China) Nate Foster (Cornell Univ., USA) Alexey Gotsman (IMDEA Software Institute, Spain) Aquinas Hobor (School of Computing, National Univ. of Singapore / Yale-NUS College) Chung-Kil Hur (Seoul National Univ., Korea) Radha Jagadeesan (DePaul Univ., USA) Annie Liu (Stony Brook Univ., USA) Andreas Lochbihler (ETH Zurich, Switzerland) Santosh Nagarakatte (Rutgers Univ., USA) David A. Naumann (Stevens Inst. of Tech., USA) Michael Norrish (NICTA, Australia) Hakjoo Oh (Korea Univ., Korea) Murali Krishna Ramanathan (Indian Institute of Science, India) Xavier Rival (CNRS / ENS / INRIA, France) Kohei Suenaga (Kyoto Univ., Japan) Gang Tan (Lehigh Univ., USA) Alwen Tiu (Nanyang Technological University, Singapore) Martin Vechev (ETH Zurich, Switzerland) Bow-Yaw Wang (Academia Sinica, Taiwan) Nobuko Yoshida (Imperial College London, UK) Lijun Zhang (Institute of Software, CAS, China) -- 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

数学基礎論サマースクール2015
by Makoto Kikuchi 05 Jun '15

05 Jun '15

数学基礎論サマースクール2015のご案内以下の要領で数学基礎論サマースクール2015を開催します． 7月初旬に参加申し込みの案内をお送りします．皆様のご参加を心よりお待ちしています．【概要】様相論理入門と，証明や真理に関する様相論理の話題についての講義．　また，様相論理と他分野との関係や発展的内容についての特論．【日時】2015年8月18日（火）13:30 ～ 21日（金）15:00 【場所】神戸大学六甲台第2キャンパス内工学部教室棟LR501教室（戎記念ホール）【住所】〒657-8501神戸市灘区六甲台町1-1 【ホームページ】http://www2.kobe-u.ac.jp/~mkikuchi/ss2015.html 【講師】薄葉季路（神戸大），金子守（早稲田大），倉橋太志（木更津高専），　黒川英徳（神戸大），佐藤雅彦（京大名誉教授），佐野勝彦（JAIST），渕野昌（神戸大）【内容】〈講義〉（各3コマ） 1. 様相論理入門（佐野） 2. 証明可能性論理（倉橋） 3. 強制法と様相論理（薄葉） 4. 真理と様相（黒川）〈特論〉（各1コマ） 1. 認識論理のゲーム論的意思決定への応用（金子） 2. 計算機科学と様相論理（佐藤） 3. 公理的集合論と様相論理（渕野）【懇親会】18日夜に神戸大学内で懇親会を開催する予定です．【世話人】神戸大学大学院システム情報学研究科菊池誠，酒井拓史【連絡先】菊池誠 mkikuchi(a)kobe-u.ac.jp

1 0

モデル理論研究集会のお知らせ
by ikeda＠hosei.ac.jp 03 Jun '15

03 Jun '15

皆様，法政大学の池田と申します．今年８月に法政大学で研究集会「モデル理論夏の学校2015」が開催されます．この研究集会は毎年夏に開催されるモデル理論および関連分野に関する研究集会です．モデル理論に興味のある方の参加をお待ちしております．・日程：２０１５年８月２２日（土）- ２４日（月）・会場：法政大学市ヶ谷キャンパス５５年館５５１教室・所在地：〒102-8160東京都千代田区富士見2-17-1 ・世話人：池田宏一郎（法政大学経営学部，ikeda(at)hosei.ac.jp）・Web page：https://sites.google.com/site/modeltheorysummer2015/ 参加を希望される方は，下記のフォームに必要事項を記入の上，池田宛に電子メールでお申し込みください．（講演申込み締切は６月３０日） %%%%%%%%%%モデル理論夏の学校・参加申し込みフォーム%%%%%%%%%% ・氏名：・所属機関：・職名／学年：・講演：する／しない・講演題目： %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 池田宏一郎（法政大学）

1 0

ポスドクの公募（＠産総研関西センター）のお知らせ
by Takashi Kitamura 03 Jun '15

03 Jun '15

*** 重複して受け取られた場合はご容赦ください *** みなさま、産業技術総合研究所の北村と申します。本 ML をお借りいたしまして、産総研（関西センター）でのポスドク公募のお知らせをさせていただきます。弊所情報技術研究部門ソフトウェアアナリティクス研究グループでは、現在、ポスドクの公募を行っております。採用者は、当研究グループが開発するモデルベーストのソフトウェアテスト技術に関する研究プロジェクトに従事していただきます。主な仕事内容は以下の通りとなります。・テスト自動化のためのアルゴリズムの研究やプログラムコードの開発・企業と共同実施による本技術の実証実験・ソフトウェアテストに関するチュートリアルやセミナの開発・研究論文の執筆本プロジェクトでは、ソフトウェアツール開発が重要な項目であり、C++ によるプログラムコードの開発技術・経験が求められます。また研究対象となる技術はソフトウェアテストに関するものですが、アルゴリズムや論理学、形式手法の側面も強く、これらについて素養があることが望ましいです。（ただし、必須ではないです。）雇用条件・応募方法等は以下をご参照ください。 https://unit.aist.go.jp/hrd/keiyaku_koubo/list_dith_1_kansai.html#itri https://unit.aist.go.jp/hrd/keiyaku_koubo/27-itri_0028.html 応募締め切りが「平成27年6月8日(月)」とありますが、延長可能ですので、興味のある方やまずはお早めに、私のほうにメールだけでもいただければと存じます。以上、よろしくお願いいたします。 -- Takashi KITAMURA Ph.D. t.kitamura(a)aist.go.jp http://staff.aist.go.jp/t.kitamura/ National Institute of Advanced Industrial Science and Technology (AIST) Nakoji 3-11-46, Amagasaki, Hyogo 661-0974, Japan Tel: +81-6-6494-8054 Internal Tel: *33-274-71902 Fax: +81-6-6494-8073

1 0

APLAS 2015: Final Call for Papers
by Kohei SUENAGA 27 May '15

27 May '15

皆様， APLAS 2015 の call for papers をお送りします．よろしくお願いいたします．末永幸平 ********************************************************************* APLAS 2015, Call for Papers 13th Asian Symposium on Programming Languages and Systems Pohang, Korea, November 30 - December 2, 2015 < http://pl.postech.ac.kr/aplas2015/> ********************************************************************* *IMPORTANT DATES* Submission deadline: June 5, 2015 Author notification: August 17, 2015 Final version: September 7, 2015 Conference: November 30 - December 2, 2015 *INVITED SPEAKERS* Peter O'Hearn, Facebook Sukyoung Ryu, KAIST Eran Yahav, Technion Hongseok Yang, University of Oxford *ABOUT* APLAS aims to stimulate programming language research by providing a forum for the presentation of latest results and the exchange of ideas in programming languages and systems. APLAS is based in Asia, but is an international forum that serves the worldwide programming language community. APLAS is sponsored by the Asian Association for Foundation of Software (AAFS), founded by Asian researchers in cooperation with many researchers from Europe and the USA. Past APLAS symposiums were successfully held in Singapore ('14), Melbourne ('13), Kyoto ('12), Kenting ('11), Shanghai ('10), Seoul ('09), Bangalore ('08), Singapore ('07), Sydney ('06), Tsukuba ('05), Taipei ('04) and Beijing ('03) after three informal workshops. Proceedings of the past symposiums were published in Springer's LNCS. *TOPICS* The symposium is devoted to foundational and practical issues in programming languages and systems. Papers are solicited on topics such as * semantics, logics, foundational theory * design of languages, type systems and foundational calculi * domain-specific languages * compilers, interpreters, abstract machines * program derivation, synthesis and transformation * program analysis, verification, model-checking * logic, constraint, probabilistic and quantum programming * software security * concurrency and parallelism * tools and environments for programming and implementation Topics are not limited to those discussed in previous symposiums. Papers identifying future directions of programming and those addressing the rapid changes of the underlying computing platforms are especially welcome. Demonstration of systems and tools in the scope of APLAS are welcome to the System and Tool presentations category. Authors concerned about the appropriateness of a topic are welcome to consult with program chair prior to submission. *SUBMISSION* We solicit submissions in two categories: a) Regular research papers - describing original scientific research results, including tool development and case studies. Regular research papers should not exceed 18 pages in the Springer LNCS format, including bibliography and figures. They should clearly identify what has been accomplished and why it is significant. Submissions will be judged on the basis of significance, relevance, correctness, originality, and clarity. In case of lack of space, proofs, experimental results, or any information supporting the technical results of the paper could be provided as an appendix or a link to a web page, but reviewers are not obliged to read them. b) System and tool presentations - describing systems or tools that support theory, program construction, reasoning, or program execution in the scope of APLAS. System and Tool presentations are expected to be centered around a demonstration. The paper and the demonstration should identify the novelties of the tools and use motivating examples. System and Tool papers should not exceed 8 pages in the Springer LNCS format, including bibliography and figures. Submissions will be judged based on both the papers and the described systems or tools. It is highly desirable that the tools are available on the web. Papers should be submitted electronically via the submission web page <https://easychair.org/conferences/?conf=aplas2015> using EasyChair. Acceptable formats are PostScript or PDF. Submitted papers must be unpublished and not submitted for publication elsewhere. Papers must be written in English. The proceedings will be published as a volume in Springer's LNCS series. Accepted papers must be presented at the conference. *ORGANIZERS* General Chair: Sungwoo Park (Pohang Univ. of Science and Technology (POSTECH), Korea) Program Chair: Xinyu Feng (Univ. of Science and Technology of China, China) Program Committee: James Brotherston (Univ. College London, UK) James Cheney (Univ. of Edinburgh, UK) Huimin Cui (Institute of Computing Technology, CAS, China) Mike Dodds (Univ. of York, UK) Xinyu Feng (Univ. of Science and Technology of China, China) Nate Foster (Cornell Univ., USA) Alexey Gotsman (IMDEA Software Institute, Spain) Aquinas Hobor (School of Computing, National Univ. of Singapore / Yale-NUS College) Chung-Kil Hur (Seoul National Univ., Korea) Radha Jagadeesan (DePaul Univ., USA) Annie Liu (Stony Brook Univ., USA) Andreas Lochbihler (ETH Zurich, Switzerland) Santosh Nagarakatte (Rutgers Univ., USA) David A. Naumann (Stevens Inst. of Tech., USA) Michael Norrish (NICTA, Australia) Hakjoo Oh (Korea Univ., Korea) Murali Krishna Ramanathan (Indian Institute of Science, India) Xavier Rival (CNRS / ENS / INRIA, France) Kohei Suenaga (Kyoto Univ., Japan) Gang Tan (Lehigh Univ., USA) Alwen Tiu (Nanyang Technological University, Singapore) Martin Vechev (ETH Zurich, Switzerland) Bow-Yaw Wang (Academia Sinica, Taiwan) Nobuko Yoshida (Imperial College London, UK) Lijun Zhang (Institute of Software, CAS, China)

1 0

Kobe set theory seminar on Tue 2 June.
by Daisuke Ikegami 27 May '15

27 May '15

皆様神戸大学の池上です。来週の火曜日13:30から行われる神戸集合論セミナーのお知らせです。講演者は、筑波大学でポスドクをしている Monroe Eskew さんです。どうぞお気軽にお越しください。 ========================================================================= 日時：2015年6月2日（火）13:30-15:00 講演者：Monroe Eskew （筑波大学）場所：神戸大学自然科学総合研究棟3号館4階421室（プレゼンテーション室）交通：阪急六甲駅またはJR六甲道駅から神戸市バス36系統「鶴甲団地」行きに乗車、「神大本部工学部前」停留所下車、徒歩すぐ。 http://www.kobe-u.ac.jp/guid/access/rokko/rokkodai-dai2.html （「ローカルマップ」の59番の建物）題目： An aleph_2 saturated ideal on aleph_3. アブストラクト： We give some more information about which regular cardinals can carry uniform, countably complete, aleph_2 saturated ideals. We extend a negative result of Kunen and Foreman about some “forbidden cardinals,” answering a question of Foreman. Then we show that there can exist a uniform, countably complete, aleph_2 saturated ideal on aleph_3, using results of Foreman and Woodin. It was previously unknown whether there can exist such uniform ideals on aleph_n for n > 2, and it is still open whether there can exist such an ideal on aleph_4. Some of our arguments are quite specific to the cardinals involved. ========================================================================= 問合せ先：池上大祐神戸大学大学院システム情報学研究科 E-mail: ikegami(a)people.kobe-u.ac.jp

1 0

Re: [logic-ml] ICALP/LICS 2015 Call for Participation
by Hasegawa Masahito 25 May '15

25 May '15

$B3'MM!"(B $B8m$C$FJT=8ESCf$N$b$N$r$*Aw$j$7$F$7$^$$$^$7$?!#(B $BBgJQ<:NiCW$7$^$7$?!#;22C$r$48!F$$$$?$@$1$^$9$h$&!"(B $B2~$a$F$*4j$$?=$7>e$2$^$9!#(B $BD9C+@n???M(B $B5~ETBg3X?tM}2r@O8&5f=j(B Subject: ICALP/LICS 2015 Call for Participation Date: Mon, 25 May 2015 16:01:24 +0900 From: Hasegawa Masahito <hassei(a)kurims.kyoto-u.ac.jp> $B3'MM!"(B 7$B7n$K5~ET$G3+:E$5$l$k9q:]2q5D(BICALP2015$B5Z$S(BLICS2015$B$N(B $B;22CJg=8$r$*Aw$j$7$^$9!#J;@_%o!<%/%7%g%C%W$b$"$o$;!"(B $B@'Hs;22C$r$48!F$D:$1$^$9$h$&!"$*4j$$?=$7>e$2$^$9!#(B $BD9C+@n???M(B $B5~ETBg3X?tM}2r@O8&5f=j(B ***** Call for Participation, ICALP/LICS 2015 in Kyoto ***** Joint Conference of The 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015) and The Thirtieth Annual ACM/IEEE Symposium on LOGIC IN COMPUTER SCIENCE (LICS) will be held in July 6-10, 2015, in Kyoto. Eleven invited talks and about 200 papers on all areas of theoretical computer science and logic in computer science will be presented at Grand Prince Hotel Kyoto. Also, seven workshops will take place at Kyoto University on July 4 and 5. The registration page and the hotel reservation page are already open. For more details please visit our conference webpage: http://www.kurims.kyoto-u.ac.jp/icalp-lics2015 Looking forward to seeing you in Kyoto! Local Organizers: Masahito Hasegawa (Kyoto University) Atsushi Igarashi (Kyoto University) Kazuo Iwama (Kyoto University) Kazuhisa Makino (Kyoto University) Contact: icalp-lics2015(a)kurims.kyoto-u.ac.jp

1 0

ICALP/LICS 2015 Call for Participation
by Hasegawa Masahito 25 May '15

25 May '15

$B3'MM!"(B 7$B7n$K5~ET$G3+:E$5$l$k9q:]2q5D(BICALP2015$B5Z$S(BLICS2015$B$N(B $B;22CJg=8$r$*Aw$j$7$^$9!#J;@_%o!<%/%7%g%C%W$b$"$o$;!"(B $B@'Hs;22C$r$48!F$D:$1$^$9$h$&!"$*4j$$?=$7>e$2$^$9!#(B $BD9C+@n???M(B $B5~ETBg3X?tM}2r@O8&5f=j(B ***** Call for Participation, ICALP/LICS 2015 in Kyoto ***** Joint Conference of The 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015) and The Thirtieth Annual ACM/IEEE Symposium on LOGIC IN COMPUTER SCIENCE (LICS) will be held in July 6-10, 2015, in Kyoto. Eleven invited talks and about 200 papers on all areas of theoretical computer science and logic in computer science will be presented at Grand Prince Hotel Kyoto. Also, seven workshops will take place at Kyoto University on July 4 and 5. The registration page and the hotel reservation page are already open. For more details please visit our conference webpage: http://www.kurims.kyoto-u.ac.jp/icalp-lics2015 Looking forward to seeing you in Kyoto! Local Organizers: Masahito Hasegawa (Kyoto University) Atsushi Igarashi (Kyoto University) Kazuo Iwama (Kyoto University) Kazuhisa Makino (Kyoto University) Contact: icalp-lics2015(a)kurims.kyoto-u.ac.jp - ------------ From: Masahito Hasegawa <masahito.hasegawa(a)gmail.com> Subject: Re: call for participation Date: Tue, 19 May 2015 11:06:04 +0900 > $B4d4V@h@8!"(B > > $B$"$j$,$H$&$4$6$$$^$9!#(B > $B;d$O:n@.$7$FD:$$$?0F$GNI$$$H;W$$$^$9!#(B > $BIU$1B-$9$H$7$?$i!"(Bearly registration$B$N!:@Z$H!"(B > 4-5 July$B$N%o!<%/%7%g%C%W$N$3$H$/$i$$$G$7$g$&$+!)(B > > $BD9C+@n???M(B > > > 2015-05-19 10:56 GMT+09:00 Kazuo Iwama <iwama(a)kuis.kyoto-u.ac.jp>: >> call for participation $B$rN.$7$^$7$g$&!%J8>O$O0J2<$N46$8$G$O$$$+$,$G$7$g(B >> $B$&$+!%!!!!4d4V(B >> >> Subject: ICALP/LICS 2015 Call for Participation >> >> ***** Call for Participation, ICALP/LICS 2015 in Kyoto ***** >> >> Joint Conference of The 42nd International Colloquium on Automata, >> Languages, and Programming (ICALP 2015) and The Thirtieth Annual >> ACM/IEEE Symposium on LOGIC IN COMPUTER SCIENCE (LICS) will be held in >> July 6-10, 2015, in Kyoto. >> >> Eleven invited talks and about 240 papers on all areas of theoretical >> computer science and logic in computer science will be presented at >> Grand Prince Hotel Kyoto. The registration page and hotel reservation >> page are already open. For more details please visit our conference >> webpage: >> >> http://www.kurims.kyoto-u.ac.jp/icalp-lics2015 >> >> Looking forward to seeing you in Kyoto! >> >> Local Organizers: >> Masahito Hasegawa (Kyoto University) >> Atsushi Igarashi (Kyoto University) >> Kazuo Iwama (Kyoto University) >> Kazuhisa Makino (Kyoto University) >> >> Contact: icalp-lics2015(a)kurims.kyoto-u.ac.jp >> ------- End of Forwarded Message

1 0

AQIS2015のご案内
by NISHIMURA Harumichi 21 May '15

21 May '15

logic-mlの皆様，量子情報科学の国際会議AQIS2015のCALL FOR PAPERSを代理投稿させていただきます．よろしくお願いいたします．名古屋大学大学院情報科学研究科西村治道 ----------------------------------------------------------------------------- 8月24～30に韓国ソウルで開催される15th Asian Quantum Information Science Conference (AQIS'15)の投稿締切が 6月11日と近づいて来ましたので、MLをお借りして以下の案内をさせて頂きます。ご投稿をご検討頂ければ幸です。＃重複してお受け取りの際は，何卒御容赦ください． ------------------------------ Apologies if you receive this mulitple times. Please forward to interested colleagues. ================== CALL FOR PAPERS 15th Asian Quantum Information Science Conference (AQIS'15) - http://aqis-conf.org/2015/ - August 24-30, 2015 at KIAS in SEOUL, KOREA - Tutorials: August 24 - Main Conference: August 25-28 - Satellite Meeting "Implementation of QIP": August 29-30 - Hosted by Korea Institute for Advanced Study (KIAS), Seoul, Korea Important Dates: [all 23:59 Anywhere on Earth(AoE) in 2015] - Submission deadline: June 11 - Acceptance notification: July 11 - Final manuscript deadline: July 25 - Early Registration deadline: July 25 We would like to draw your attention, and that of the quantum information community, to the 15th edition of the Asian Quantum Information Science Conference (AQIS'15). It is the leading conference in the subject in Asia, its highly successful predecessors having been EQIS'01-05 and AQIS'06-14. The topics covered include, but are not limited to, quantum computing, quantum information theory and experiment, quantum communication and cryptography, and foundations of quantum mechanics. Details about the conference can be found on the website: http://aqis-conf.org/2015/ Please check repeatedly as the information there will be updated regularly. Like its previous editions, AQIS'15 will consist of invited talks and tutorials, as well as oral and poster presentations, selected by a high-profile international programme committee. Invited speakers include [to be completed]: *Scott Aaronson (MIT) *Sergey Bravyi (IBM) *Kihwan Kim (Tsinghua U) *Christian Kurtsiefer (NUS, Singapore) *Yasunobu Nakamura (RIKEN and U Tokyo) *Jian Wei Pan (USTC, Hefei) *Renato Renner (ETH, Zurich) Tutorial Speakers include [to be completed]: *Dagmar Bruss (U Duesseldorf) *Daniel Nagaj (Solvak Acad. Sciences) Contributions are solicited in (but not limited to) the following areas: - Quantum computation, algorithms and complexity - Quantum information theory - Quantum decoherence fighting concepts, methods and tools - Quantum cryptography - Quantum communications experiments and theory - Quantum technologies (optics, atomic physics, and solid-state physics, etc.) - Quantum processor and computer design The submission deadline is June 11, 2015, 23:59 Anywhere on Earth (AoE). All submissions must follow the guidelines specified on the web site. We are looking forward to seeing you in Seoul, Korea! Committee Chairs Steering Committee: Jozef Gruska (Masaryk U, Brno) Conference: Jaewan Kim (KIAS, Seoul) Organizing Committee: Jaewan Kim (KIAS, Seoul) & Shigeru Yamashita (Ritsumeikan U) Program Committee: Richard Jozsa (U Cambridge) & Harald Weinfurter (LMU Munich) Contact: aqis15(a)kias.re.kr =======================

1 0

Fwd: CTFM2015 Call for abstracts
by YOKOYAMA Keita 15 May '15

15 May '15

皆様、北陸先端大の横山です。たびたび申し訳ありません。先ほどのメールの情報が一部間違っておりましたので、再送致します。 ****************************** 以下の要領で研究集会 Computability Theory and Foundations of Mathematics 2015 (2015年9月7日(月)～9月11日(金)，東京工業大学大岡山キャンパス) を開催いたします．詳しい情報については、下記のホームページをご覧ください。 http://www.jaist.ac.jp/CTFM/CTFM2015/index.html 講演の募集の締め切りは6月15日となっております。また、講演受理の連絡は6月25日までにお送りする予定です。宜しく参加・講演をご検討ください。 ============================================================ Computability Theory and Foundations of Mathematics (Tokyo Institute of Technology, Tokyo, Japan, September 7-11, 2015) http://www.jaist.ac.jp/CTFM/CTFM2015/index.html ============================================================ Computability Theory and Foundations of Mathematics (CTFM) aims to develop computability theory and logical foundations of Mathematics. The scope involves the topics Computability Theory, Reverse Mathematics, Nonstandard Analysis, Proof Theory, Set Theory, Philosophy of Mathematics, Constructive Mathematics, Theory of Randomness and Computational Complexity Theory. In honor of Professor Kazuyuki Tanaka's 60th birthday, this year's conference will include sessions covering areas in which Professor Tanaka has worked. This conference is held jointly with a workshop of Bilateral Joint Research Project sponsored by the Japan Society for the Promotion of Science and the National University of Singapore. See the previous workshop on this project JSPS-NUS Joint Workshop in Mathematical Logic and Foundations of Mathematics (March 6 - 8, 2015, Kanazawa, Japan). This is the fifth conference of CTFM conference series. See also the last year conference Computability Theory and Foundations of Mathematics 2014 (February 17 - 20, 2014, Tokyo, Japan). -------------------------------------------- Submission deadline for Presentations: June 15, 2015 -------------------------------------------- Invited Speakers Ali Enayat (University of Gothenburg) Sy Friedman (Kurt Gödel Research Center) Alberto Marcone (The University of Udine) Nik Weaver (Washington University) Guohua Wu (Nanyang Technological University) Stephen Binns (King Fahd University of Petroleum and Minerals) Liang Yu (Nanjing University) Sakae Fuchino (Kobe University) Joel Hamkins (City University of New York) Dilip Raghavan (National University of Singapore) Hidenori Kurokawa (Kobe University) Kengo Okamoto (Tokyo Metropolitan University) Toshio Suzuki (Tokyo Metropolitan University) Tin Lok Wong (Kurt Gödel Research Center) -------------------------------------------- Programme Committee Chi Tat Chong (National University of Singapore, co-chair) Kojiro Higuchi (Chiba University) Makoto Kikuchi (Kobe University) Takako Nemoto (JAIST) Stephen G. Simpson (Pennsylvania State University, co-chair) Toshimichi Usuba (Kobe University) Andreas Weiermann (Ghent University) Takeshi Yamazaki (Tohoku Universigy) Yang Yue (National University of Singapore) Keita Yokoyama (JAIST / UC Berkeley) -------------------------------------------- Organising Committee Ryo Kashima (Tokyo Institute of Technology, local chair) Takayuki Kihara (UC Berkeley) Takako Nemoto (JAIST) Florian Pelupessy (Tohoku University) Takeshi Yamazaki (Tohoku University, co-chair) Keita Yokoyama (JAIST / UC Berkeley, co-chair) -------------------------------------------- どうぞよろしくお願い致します。横山啓太 -- Keita Yokoyama y-keita(a)jaist.ac.jp -- Keita Yokoyama y-keita(a)jaist.ac.jp

1 0

CTFM2015 Call for abstracts
by YOKOYAMA Keita 15 May '15

15 May '15

皆様、北陸先端大の横山です。以下の要領で研究集会 Computability Theory and Foundations of Mathematics 2015 (2015年9月7日(月)～9月11日(金)，東京工業大学大岡山キャンパス) を開催いたします．詳しい情報については、下記のホームページをご覧ください。 http://www.jaist.ac.jp/CTFM/CTFM2015/index.html 講演の募集の締め切りは6月15日となっております。また、講演受理の連絡は6月25日までにお送りする予定です。宜しく参加・講演をご検討ください。 ============================================================ Computability Theory and Foundations of Mathematics (Tokyo Institute of Technology, Tokyo, Japan, September 7-11, 2015) http://www.jaist.ac.jp/CTFM/CTFM2015/index.html ============================================================ Computability Theory and Foundations of Mathematics (CTFM) aims to develop computability theory and logical foundations of Mathematics. The scope involves the topics Computability Theory, Reverse Mathematics, Nonstandard Analysis, Proof Theory, Set Theory, Philosophy of Mathematics, Constructive Mathematics, Theory of Randomness and Computational Complexity Theory. In honor of Professor Kazuyuki Tanaka's 60th birthday, this year's conference will include sessions covering areas in which Professor Tanaka has worked. This conference is held jointly with a workshop of Bilateral Joint Research Project sponsored by the Japan Society for the Promotion of Science and the National University of Singapore. See the previous workshop on this project JSPS-NUS Joint Workshop in Mathematical Logic and Foundations of Mathematics (March 6 - 8, 2015, Kanazawa, Japan). This is the fifth conference of CTFM conference series. See also the last year conference Computability Theory and Foundations of Mathematics 2014 (February 17 - 20, 2014, Tokyo, Japan). -------------------------------------------- Submission deadline for Presentations: June 15, 2015 -------------------------------------------- Invited Speakers Ali Enayat (University of Gothenburg) Sy Friedman (Kurt Gödel Research Center) Alberto Marcone (The University of Udine) Nik Weaver (Washington University) Guohua Wu (Nanyang Technological University) Stephen Binns (King Fahd University of Petroleum and Minerals) Liang Yu (Nanjing University) Sakae Fuchino (Kobe University) Joel Hamkins (City University of New York) Dilip Raghavan (National University of Singapore) Toshio Suzuki (Tokyo Metropolitan University) Tin Lok Wong (Kurt Gödel Research Center) (to be more) -------------------------------------------- Programme Committee Chi Tat Chong (National University of Singapore, co-chair) Kojiro Higuchi (Chiba University) Makoto Kikuchi (Kobe University) Takako Nemoto (JAIST) Stephen G. Simpson (Pennsylvania State University, co-chair) Toshimichi Usuba (Kobe University) Andreas Weiermann (Ghent University) Takeshi Yamazaki (Tohoku Universigy) Yang Yue (National University of Singapore) Keita Yokoyama (JAIST / UC Berkeley) -------------------------------------------- Organising Committee Ryo Kashima (Tokyo Institute of Technology, local chair) Takayuki Kihara (UC Berkeley) Takako Nemoto (JAIST) Florian Pelupessy (Tohoku University) Takeshi Yamazaki (Tohoku University, co-chair) Keita Yokoyama (JAIST / UC Berkeley, co-chair) -------------------------------------------- どうぞよろしくお願い致します。横山啓太 -- Keita Yokoyama y-keita(a)jaist.ac.jp

1 0

早稲田大学高等研究所主催セミナーのお知らせ
by AKIYOSHI Ryota 15 May '15

15 May '15

次のようなセミナーを予定しております．参加自由です． ------------------------------------------------------------------------------ 早稲田大学高等研究所主催セミナー講演者：Florian Pelupessy 日時：5月25日（月）15:00—16:30 場所：早稲田大学早稲田キャンパス9号館5階　第2会議室 (URL: http://www.waseda.jp/wias/) Title: Phase transitions in logic: combinatorics and provability Abstract: Thanks to Gödel's incompleteness theorems we know that there exist statements in the language of Peano Arithmetic which can be neither proven nor disproven using PA. Only recently, from 1977 onwards, natural examples of such statements have emerged. These statements can be parametrised in such a manner that, at certain values, small tweaks to the parameter value result in a sudden change of provability of the resulting statement for this value. A programme has been started by Andreas Weiermann to examine these phase transitions in provability, revealing a connection between finite combinatorics which is very much provable in PA and the transition thresholds. In this talk we examine this relation and some examples. 問い合わせ先：早稲田大学高等研究所　秋吉亮太 (georg.logic(a)aoni.waseda.jp)

1 0

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Logic-ml