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

春の数学会
by KASHIMA Ryo 25 Dec '13

25 Dec '13

日本数学会数学基礎論および歴史分科会会員の皆様、連絡責任評議員の鹿島です。春の学会（2014年3月15日(土)から3月18日(火)学習院大学）の一般講演オンライン申し込み締め切り（12月1日）が迫ってきました。現在のところ申し込み件数が少ない状態ですので、ぜひとも発表をご検討ください。開催情報は以下をご覧下さい： http://mathsoc.jp/meeting/gakushuin14mar/ ＝＝＝＝＝＝＝＝＝＝【発表をされる方へのお願い】今回から新たに、　アブストラクトの最終的な印刷用PDFファイルの確認を講演申し込み者本人が行うということになりました。具体的には12月24日（火）から12月27日（金）の短い期間に申込者本人が確認作業をする必要があるようです。詳細は以下をご覧下さい： http://mathsoc.jp/meeting/gakushuin14mar/outline.html ----- 鹿島亮東京工業大学大学院情報理工学研究科数理・計算科学専攻 kashima(a)is.titech.ac.jp

1 1

CFP: Philosophy, Mathematics, Linguistics: Aspects of Interaction 2014 (Russia)
by BEKKI Daisuke 25 Dec '13

25 Dec '13

------------------------------------------------------------------- The International Interdisciplinary Conference Philosophy, Mathematics, Linguistics: Aspects of Interaction 2014 (PhML-2014) St. Petersburg, Russia, April 21--25, 2014 <http://www.pdmi.ras.ru/EIMI/2014/PhML/index.html> ------------------------------------------------------------------- CONFERENCE DESCRIPTION ====================== The conference PhML-2014 will be held on April 21--25, 2014 at the Euler International Mathematical Institute (EIMI), which is a research unit of the St. Petersburg Department of Steklov Institute of Mathematics of the Russian Academy of Sciences (PDMI RAS). The conference PhML-2014 is endorsed by the American National Committee of the Division of Logic, Methodology and Philosophy of Science (DLMPS) of the International Union of the History and Philosophy of Science (IUHPS), the Japan Association for Philosophy of Science, the Swedish National Committee for Logic, Methodology and Philosophy of Science. The conference PhML-2014 is a sequel in the series of conferences intended to provide a forum for philosophers, mathematicians, linguists, logicians, and computer scientists who share an interest in cross-disciplinary research. Presentations will be given in English. PROGRAM COMMITTEE ================= Toshiyasu Arai, Chiba University Edward Hirsch, PDMI RAS Wilfrid Hodges, Queen Mary University of London Makoto Kanazawa, National Institute of Informatics, Japan Alexander Leitsch, Vienna University of Technology Angus Macintyre, Queen Mary University of London Klaus Mainzer, University of Munich Per Martin-Lo"f, Stockholm University Ivan Mikirtumov, St. Petersburg State University Grigori Mints, University of Stanford -- chair Grigory Olkhovikov, Ural Federal University Vladimir Orevkov, PDMI RAS Rohit Parikh, The City University of New York Barbara Partee, University of Massachusetts, Amherst Dag Prawitz, Stockholm University Oleg Prosorov, PDMI RAS Michael Rathjen, University of Leeds Andrei Rodin, Institute of Philosophy RAS, St. Petersburg State University Vladimir Rybakov, University of Liverpool Vladislav Shaposhnikov, Moscow State University Albert Visser, Utrecht University ORGANIZING COMMITTEE ==================== Vladimir Orevkov, PDMI RAS Oleg Prosorov, PDMI RAS -- chair Andrei Rodin, Institute of Philosophy RAS, St. Petersburg State University Maxim Vsemirnov, PDMI RAS PLENARY SESSIONS ================ At present, the following plenary speakers are confirmed: Dmitry Grigoryev, CNRS, Universite' Lille 1 Klaus Mainzer, University of Munich Yuri Manin, Max-Planck-Institut fu"r Mathematik, Bonn Grigori Mints, University of Stanford Aleksei Parshin, Steklov Institute of Mathematics RAS, Moscow Oleg Prosorov, PDMI RAS Andrei Rodin, Institute of Philosophy RAS, St. Petersburg State University Gabriel Sandu, University of Helsinki Anatol Slissenko, LACL, Universite' Paris-Est Cre'teil Nikolai Vavilov, St. Petersburg State University Anatoly Vershik, PDMI RAS Each presentation of a plenary paper is allotted 55 min, which includes 10 min for questions and discussion. PANEL DISCUSSION ================ The conference will feature a panel discussion entitled "Understanding complexity in cross-disciplinary research" allotted up to 90 min. Discussion will be led by Klaus Mainzer (University of Munich). THEMATIC SESSIONS ================= Apart from plenary sessions, there will also be three parallel thematic sessions to present contributed papers: - Mathematical and logical methods in philosophy and in sciences of language; - Philosophical Insights into Logic and Mathematics; - Complexity in mathematics, philosophy, linguistics. Each presentation of a contributed paper is allotted 25 min, including 5 min for questions. CALL for PAPERS =============== For presentation at thematic sessions, the conference PhML-2014 invites the submission of contributed papers on original and unpublished research relating to the interplay between philosophy, mathematics and linguistics. Papers from any tradition and from a wide variety of perspectives are welcome, including but in no way limited to the following topics: - New trends in the foundations of mathematics; - Complexity in mathematics, logic, linguistics; - Ontology of mathematics and the nature of mathematical truth; - The problem of abstract entities in mathematics, philosophy and linguistics; - Philosophical aspects of informatics, novel computational models and paradigms; - Philosophy of mathematics and philosophy of logic; - Mathematical investigation of natural language structures. PAPER SUBMISSION ================ Papers should be prepared in LaTeX or MS Word using style files of PhML-2014 format and be submitted electronically as pdf and source files via e-mail: <PhML-2014(a)pdmi.ras.ru>. For more details, see: <http://www.pdmi.ras.ru/EIMI/2014/PhML/index_files/submission.html>. IMPORTANT DATES =============== - Submission deadline for contributed papers: March 1st, 2014 - Notification of acceptance: March 15, 2014 - Final date for camera-ready copy: March 31st, 2014 - Conference starts: April 21st, 2014 PROCEEDINGS =========== The Proceedings of PhML-2014, including both invited and contributed papers, will be published before the meeting as a volume in the EIMI's local series and distributed to the participants. It is planned that selected papers will be published at an international publishing house as a special post-conference issue. PARTICIPATION ============= For further practical information, see: <http://www.pdmi.ras.ru/EIMI/2014/PhML/index.html>

1 0

IWC 2014 & CoCo 2014: First Call for Papers and Provers
by Takahito Aoto 24 Dec '13

24 Dec '13

来年，ウィーンで開催されます FLoC の併設ワークショップになります，合流性に関するワークショップ IWC 2014 と，IWC 開催中に行われます，合流性自動証明システムのコンペティション CoCo 2014 のご案内です．関連する話題をお持ちの方がおられましたら，ぜひご投稿を検討頂ければ幸いです．青戸等人東北大学電気通信研究所 This is a joint call for papers and provers for IWC 2014 and CoCo 2014. ===================================================================== First Call for Papers IWC 2014 3rd International Workshop on Confluence 13 July 2014, Vienna, Austria, a FLoC workshop affiliated with RTA-TLCA http://www.nue.riec.tohoku.ac.jp/iwc2014/ ===================================================================== Confluence provides a general notion of determinism and has been conceived as one of the central properties of rewriting. Confluence relates to many topics of rewriting (completion, modularity, termination, commutation, etc.) and had been investigated in many formalisms of rewriting such as first-order rewriting, lambda-calculi, higher-order rewriting, constrained rewriting, conditional rewriting, etc. Recently there is a renewed interest in confluence research, resulting in new techniques, tool supports, certification as well as new applications. The workshop aims at promoting further research in confluence and related properties. The workshop is a FLoC workshop affiliated with RTA-TLCA (FLoC 2014 is collocated with Vienna Summer of Logic 2014). Previous editions of the workshop were held in Nagoya (2012) and Eindhoven (2013). During the workshop the 3rd Confluence Competition (CoCo 2014) takes place. IMPORTANT DATES: * submission April 16, 2014 * notification May 14, 2014 * final version May 28, 2014 * workshop July 13, 2014 TOPICS: Specific topics of interest include: * confluence and related properties (unique normal forms, commutation, ground confluence) * completion * critical pair criteria * decidability issues * complexity issues * system descriptions * certification * applications of confluence INVITED SPEAKERS: * TBA PROGRAM COMMITTEE: * Takahito Aoto Tohoku University (co-chair) * Thibaut Balabonski Gallium - Inria Rocquencourt * Eduardo Bonelli Universidad Nacional de Quilmes * Delia Kesner University Paris - Diderot (co-chair) * Naoki Nishida Nagoya University * Colin Riba LIP - ENS Lyon * Pierre-Yves Strub IMDEA Software * René Thiemann University of Innsbruck * Ashish Tiwari SRI International SUBMISSION: We solicit short papers or extended abstracts of at most five pages. There will be no formal reviewing. In particular, we welcome short versions of recently published articles and papers submitted elsewhere. The program committee checks relevance and may provide additional feedback. The accepted papers will be made available electronically before the workshop. The page limit for papers is 5 pages in EasyChair style. Short papers or extended abstracts must be submitted electronically through the EasyChair system at: https://www.easychair.org/account/signin.cgi?conf=iwc2014 ====================================================================== First Call for Provers CoCo 2014 3rd Confluence Competition 13 July 2014, Vienna, Austria http://coco.nue.riec.tohoku.ac.jp/2014/ ====================================================================== Recently, several new implementations of confluence tools are reported and interest for proving/disproving confluence "automatically" has been grown. The confluence competition aims to foster the development of techniques for proving/disproving confluence automatically by a dedicated competition among such tools. The 3rd Confluence Competition (CoCo 2014) will run ***live*** during the 3rd International Workshop on Confluence (IWC 2014), which is a FLoC workshop affiliated with RTA-TLCA (FLoC 2014 is collocated with Vienna Summer of Logic 2014). The following categories are currently planned: * confluence of first-order term rewrite systems * confluence of (oriented/join/semi-equational) conditional term rewrite systems * certification Besides these categories, new categories will be considered if there are tools and problems dedicated to those categories. Submissions of new confluence problems are also welcome. For more information including examples of new categories to be considered, platforms, competition rules and problems, see the webpage of CoCo 2014 indicated above. IMPORTANT DATES: * requests for new categories March 7, 2014 * tool registration June 27, 2014 * tool submission July 4, 2014 * problem submission July 9, 2014 * competition July 13, 2014 REQUEST FOR NEW CATEGORIES: We welcome requests for new categories. Request for new categories is via the contact email address. Please send us the following information at your earliest convenience: * description of problems and semantics (rewrite steps, confluence, etc.) together with adequate references * a proposal of the input format (if necessary) Requests for new categories may be rejected for technical reasons. SUBMISSION OF NEW PROBLEMS: Submissions of new confluence problems are welcome. Please use the web interface of Cops (Confluence Problems) database linked from the webpage of CoCo 2014. REGISTRATION/SUBMISSION: Tool registration is via the contact email address. Every tool registration should also contain a one page system description. Tool submission will be via StarExec. ORGANISING COMMITTEE: * Takahito Aoto Tohoku University (chair) * Nao Hirokawa JAIST * Harald Zankl University of Innsbruck CONTACT: coco-sc [AT] jaist.ac.jp

1 0

Fwd: [PVS] Fwd: Preliminary CfP: IFIP-TCS 2014
by Ichiro Hasuo 24 Dec '13

24 Dec '13

======================================================= TCS 2014 8th IFIP International Conference on Theoretical Computer Science September 1-3, 2014 Rome, Italy http://www.cyprusconferences.org/tcs2014/ Held in conjunction with the 25th Conference on Concurrency Theory (CONCUR 2014) AIM AND SCOPE OF THE CONFERENCE: Under the patronage of the International Federation of Information Processing (IFIP), since year 2000 the IFIP Technical Committee 1 (Foundations of Computer Science) has organized a series of biannual international conferences in Theoretical Computer Science. After Sendai (2000), Montreal (2002), Toulouse (2004), Santiago (2006), Milano (2008), Brisbane (2010), and Amsterdam (2012), the 8th edition will be held in Rome in September 2014, in cooperation with the IFIP Working Group 2.2 (Formal Description of Programming Concepts) and in conjunction with the 25th Conference on Concurrency Theory. We call for papers in all areas of Theoretical Computer Science: they will be evaluated by two committees: Track A: Algorithms, Complexity and Models of Computation Track B: Logic, Semantics, Specification and Verification TOPICS: Suggested, but not exclusive, topics of interest include: Track A - analysis and design of algorithms; automata and formal languages; cellular automata and systems; combinatorial, graph and optimization algorithms; computational learning theory; computational complexity; computational geometry; cryptography; descriptive complexity; evolutionary and genetic computing; experimental algorithms; mobile computing; molecular computing and algorithmic aspects of bioinformatics; network computing; neural computing; parallel and distributed algorithms; probabilistic and randomized algorithms; quantum computing; structural information and communication complexity. Track B - automata theory; automated deduction; constructive and non-standard logics in computer science; concurrency theory and foundations of distributed and mobile computing; database theory; finite model theory; formal aspects of program analysis, foundations of hybrid and real-time systems; lambda and combinatory calculi; logical aspects of computational complexity; modal and temporal logics; model checking and verification; probabilistic systems; logics and semantics of programs; foundations of security; term rewriting; specifications; type, proof and category theory in computer science. SUBMISSION GUIDELINES: Authors are invited to submit an extended abstract of at most 15 pages (LNCS style with at least 11-point font size) to arrive before April 27, 2014. If more space is needed, a clearly marked appendix, to be read at the discretion of the program committee, may be included if desired. Submission will be handled by EasyChair. Further information and submission details can be found on the Conference web page. Simultaneous submissions to other conferences with published proceedings are not allowed. PROCEEDINGS: The conference proceedings will be published by Springer-Verlag in Lecture Notes in Computer Science (LNCS) series. Selected papers from TCS 2014 will be invited to a special issue of the Journal Theoretical Computer Science. IMPORTANT DATES: Deadline for submission: April 27, 2014. Notification of acceptance: June 25, 2014. Final manuscript due: July 6, 2014. Conference: September 1-3, 2014. STEERING COMMITTEE: - Giorgio Ausiello, Sapienza Univ. di Roma - Jos Baeten, CWI Amsterdam - Jacques Sakarovitch, CNRS/T el ecom ParisTech CONFERENCE CO-CHAIRS: - Daniele Gorla, Sapienza Univ. di Roma - Rossella Petreschi, Sapienza Univ. di Roma PROGRAM COMMITTEES: Track A - Cristian Calude, University of Auckland - Josep Diaz (Chair), UPC Barcelona - Irene Finocchi, Sapienza Univ. di Roma - Paola Flocchini, University of Ottawa - Aristides Gionis, Aalto University Helsinki - Mordecai Golin, Hong Kong University of Tech. - Juhani Karhumaki, Turku University - Massimo Melucci, Univ. di Padova - Elvira Mayordomo, Universidad de Zaragoza - Friedhelm Meyer auf der Heide, Univ. of Paderborn - Pekka Orponen, Aalto University Helsinki - Giuseppe Persiano, Univ. di Salerno - G eraud S enizergues, Universit e Bordeaux 1 - Olivier Serre, CNRS / Universit e Paris 7 - Paul Spirakis, University of Liverpool - Osamu Watanabe, Tokyo Inst. of Technology - Peter Widmayer, ETH Zurich Track B - Jos Baeten, CWI Amsterdam - Lars Birkedal, Aarhus University - Andrei Bulatov, Simon Fraser University - James Cheney, University of Edinburgh - Ugo Dal Lago, Univ. di Bologna - Jos ee Desharnais, Universit e Laval - Jorg Endrullis, Vrije Universiteit Amsterdam - J erome Feret, ENS Paris - Marcelo Fiore, University of Cambridge - Silvio Ghilardi, Univ. di Milano - Benjamin Gr egoire, INRIA Sophia - Ichiro Hasuo, University of Tokyo - Marieke Huisman, University of Twente - Jean Krivine, CNRS / Universit e Paris 7 - Radha Jagadeesan, DePaul University, Chicago - Ivan Lanese, Univ. di Bologna - Grigore Rosu, University of Illinois at U-C - Davide Sangiorgi (Chair), Univ. di Bologna - Vladimiro Sassone, University of Southampton - Igor Walukiewicz, CNRS / Universit e Bordeaux 1

1 0

GaLoP 2014: Call for Abstracts (1 page max)
by Ichiro Hasuo 24 Dec '13

24 Dec '13

9th Workshop on Games for Logic and Programming Languages (GaLoP 2014) Grenoble, France, 12-13 April http://www.gamesemantics.org GaLoP is an annual international workshop on game-semantic models for logics and programming languages and their applications. This is an informal workshop that welcomes work in progress, overviews of more extensive work, programmatic or position papers and tutorials. GaLoP IX will be held in Grenoble, France on 12-13 April 2014 as a satellite workshop of ETAPS (http://www.etaps.org/). Areas of interest include: * Games and other interaction-based denotational models; * Games-based program analysis and verification; * Logics for games and games for logics; * Algorithmic aspects of game semantics; * Categorical aspects of game semantics; * Programming languages and full abstraction; * Higher-order automata and Petri nets; * Geometry of interaction; * Ludics; * Epistemic game theory; * Logics of dependence and independence; * Computational linguistics. There will be no formal proceedings but the possibility of a special issue in a journal will be considered (the 2005, 2008 and 2011 workshops led to special issues in Annals of Pure and Applied Logic). Submission Instructions Please submit an abstract (up to one page) of your proposed talk on the easychair submission page below. Supplementary material may be submitted, and will be considered at the discretion of the PC. https://www.easychair.org/conferences/?conf=galop2014 Important Dates Submission: January 25, 2014 Notification: February 5, 2014 Workshop: April 12-13, 2014 Program Committee • Pierre Clairambault, Lyon • Dan Ghica, Birmingham • Ichiro Hasuo, Tokyo • Jim Laird, Bath (chair) • John Longley, Edinburgh • Gabriel Sandu, Paris • Alexis Saurin, Paris

1 0

Call for papers: LATD2014
by 小野寛晰 18 Dec '13

18 Dec '13

　　　　　Logic, Algebra and Truth Degrees 2014 　　　　　　　http://www.logic.at/latd2014 　　　　　　July 16 - 19, Vienna, Austria Call for papers The conference "Logic, Algebra and Truth Degrees 2014" will be held on 16-19 July 2014 in Vienna, Austria, as part of the Vienna Summer of Logic event http://vsl2014.at . Logic, Algebra and Truth Degrees is the fourth official meeting of the EUSFLAT Working Group on Mathematical Fuzzy Logic. 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. 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 We particularly welcome contributions on many-valued and related logical systems. Invited speakers: Silvio Ghilardi, Italy Melvin Fitting, USA George Metcalfe, Switzerland Dale Miller, France Dana Scott, USA Alasdair Urquhart, Canada Tutorials: Franz Baader, Germany Vincenzo Marra, Italy Programme Committee: Arnon Avron, Israel Matthias Baaz (Chair), Austria Agata Ciabattoni (Co-Chair), Austria Petr Cintula, Czech Republic Nikolaos Galatos, USA Lluis Godo, Spain Rosalie Iemhoff, The Netherlands Nicola Olivetti, France Hiroakira Ono, Japan Kazushige Terui, Japan Richard Zach, Canada Contributed talks: Abstracts of contributed talks, 2-4 pages, are to be prepared using the ASL abstract template and submitted via Easychair. The accepted abstracts will be available on-line and published in the joint volume of abstracts with the Logic Colloquium. The deadline for contributions is 6th April 2013. The notification of acceptance will be sent by 10th May 2013. For more information please visit the official web page of the conference: http://www.logic.at/latd2014. All correspondence should be directed to latd2014(a)logic.at. Please feel free to distribute this call. The Organizing Committee Agata Ciabattoni (Chair), Paolo Baldi, Petr Cintula, Bjorn Lellmann, Revantha Ramanayake, Lara Spendier

1 0

WoLLIC 2014 - 2nd Call for Papers
by 小野寛晰 17 Dec '13

17 Dec '13

[Please circulate. Apologies for any cross-postings.] WoLLIC 2014 21st Workshop on Logic, Language, Information and Computation September 1st to 4th, 2014 Valparaiso, Chile 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 Department of Computer Science, Universidad de Chile, Chile Department of Computer Science, Pontificia Universidad Católica de Chile, Chile Centro de Informática, Universidade Federal de Pernambuco, Brazil HOSTED BY Department of Informatics, Universidad Técnica Federico Santa María, Chile 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 twentieth WoLLIC will be held at the Universidad Técnica Federico Santa María, from September 1st to 4th, 2014. 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. 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 10 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 2014 EasyChair website. (Please go to http://wollic.org/wollic2014/instructions.html for instructions.) A title and single-paragraph abstract should be submitted by Mar 24, 2014, and the full paper by Mar 28, 2014 (firm date). Notifications are expected by May 2, 2014, and final papers for the proceedings will be due by May 15, 2014 (firm date). PROCEEDINGS The proceedings of WoLLIC 2014, 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 2014 issue of a scientific journal (to be confirmed). INVITED SPEAKERS Verónica Becher (U Buenos Aires) Juha Kontinen (U Helsinki) Aarne Ranta (U Gothenburg) Kazushige Terui (U Kyoto) Luca Viganò (King’s College London) Thomas Wilke (U Kiel) STUDENT GRANTS ASL sponsorship of WoLLIC 2014 will permit ASL student members to apply for a modest travel grant (deadline: May 1st, 2014). See http://www.aslonline.org/studenttravelawards.html for details. IMPORTANT DATES Mar 24, 2014: Paper title and abstract deadline Mar 28, 2014: Full paper deadline May 2, 2014: Author notification May 15, 2014: Final version deadline (firm) PROGRAMME COMMITTEE Natasha Alechina (U Nottingham) Eric Allender (Rutgers U) Marcelo Arenas (PUC Chile) Steve Awodey (CMU) Julian Bradfield (U Edinburgh) Xavier Caicedo (U de Los Andes) Olivier Danvy (Aarhus U) Ulrich Kohlenbach (Tech U Darmstadt) (CHAIR) Marcus Kracht (U Bielefeld) Michiel van Lambalgen (U Amsterdam) Klaus Meer (Tech U Cottbus) George Metcalfe (Bern U) Dale Miller (INRIA Saclay / LIX) Russell Miller (CUNY) Sara Negri (U Helsinki) Nicole Schweikardt (U Frankfurt) (more to come) STEERING COMMITTEE Samson Abramksy, Johan van Benthem, Anuj Dawar, Joe Halpern, Wilfrid Hodges, Daniel Leivant, Leonid Libkin, Angus Macintyre, Grigori Mints, Luke Ong, Hiroakira Ono, Ruy de Queiroz. ORGANISING COMMITTEE Pablo Barceló (Universidad de Chile) (Local chair) Anjolina G. de Oliveira (U Fed Pernambuco) Ruy de Queiroz (U Fed Pernambuco) (co-chair) Juan Reutter (Pontificia Universidad Católica de Chile) Cristián Riveros (Pontificia Universidad Católica de Chile) FURTHER INFORMATION Contact one of the Co-Chairs of the Organising Committee. WEB PAGE http://wollic.org/wollic2014/

1 0

[CFP] PPL2014 論文募集のお知らせ: 第16回プログラミングおよびプログラミング言語ワークショップ
by Keisuke Nakano 16 Dec '13

16 Dec '13

＊＊＊重複して受け取られた場合はご容赦ください＊＊＊電気通信大学の中野と申します．来年3月に熊本県阿蘇市阿蘇温泉で開催される第16回プログラミングおよびプログラミング言語ワークショップ (PPL2014) の論文募集の最終案内をさせていただきます．カテゴリ1への発表申込(タイトルと概要のみ)の締切は今週の金曜(12/20)ですが，論文の締切は1/8ですので是非投稿をご検討ください． -------------------------------------------------------------------------- 第16回プログラミングおよびプログラミング言語ワークショップ（PPL2014） http://www.fos.kuis.kyoto-u.ac.jp/ppl2014/ 論文募集主催: 日本ソフトウェア科学会プログラミング論研究会日程: 2014年3月5日(水)～3月7日(金) 会場: 熊本県阿蘇市阿蘇温泉「阿蘇の司ビラパークホテル」 http://asovilla.jp/ PPL2014は，プログラミングおよびプログラミング言語に関する研究者が一堂に会し，最新の研究成果の発表，および新たな研究課題についての討論やアイディア交換等を行うことを目的とした，合宿形式のワークショップです．プログラミングおよびプログラミング言語の理論・設計・実装・処理系などに関する研究発表を，カテゴリ別に幅広く募集します．カテゴリ1: 国内外で未発表の論文の発表カテゴリ2: 国際会議・学術雑誌等で既発表であるが，国内では未発表の研究の紹介カテゴリ3: ポスター・デモ発表（既発表・未発表の別を問いません） ※ショートプレゼンテーションは行いませんカテゴリ1の採択論文の中から，特に独創的なアイディアや顕著な成果を含むものに対して論文賞を授与する予定です．また，ポスター・デモを含む全発表のなかから，聴衆の投票により，最も優秀なプレゼンテーションを披露した学生に発表賞を授与する予定です．カテゴリ1（国内外未発表論文） ------------------------------ 完成した理論やシステムの研究発表のみならず，萌芽的なアイディアや問題点の提示等も歓迎します．発展途上の研究内容も積極的に採録する方針です（ただし，PPLでの発表として相応しくないと判断される場合は，この限りではありません）．また，カテゴリ1で発表された研究については，会場での討議や査読コメントをもとにその完成度を高め，将来の学術雑誌・会議等での業績に結び付けることを奨励しています．そのため，予稿集の配布は参加者のみへの限定的なものとする予定です．採録された論文は，PPL2014参加者に配布される予稿集に掲載され，参加者のみがアクセス可能な形でWEB上で公開されます（論文へのリンク集ページを作成し，閲覧に必要なパスワードを参加者に連絡します）．カテゴリ1で発表された研究のうち，PPL2014プログラム委員会により優れていると認めるものは，PPL2014終了後（2014年4月下旬予定），「コンピュータソフトウェア」誌のPPL2014推薦論文としての投稿が可能です．推薦論文は，PPL プログラム委員が引き続き査読を行うことによる，迅速な査読プロセスを特長としています．カテゴリ2（国外既発表論文） ---------------------------- 査読付の国際会議または学術雑誌等で既発表であるが国内では未発表である研究を紹介する場です．採録決定済みの研究も含みます．PPLへの関連をもとに採否を判定いたしますが，申し込み多数の場合はプログラム委員会での選考により，発表をご遠慮いただく可能性もございますので，その旨をご了承の上ご投稿ください．カテゴリ3（ポスター・デモ発表） ------------------------------------------ 2時間程度のセッション内でのポスター発表またはデモ発表です．既発表・未発表の別を問いません．PPLへの関連をもとに採録を判定いたします．また，申し込み多数の場合はプログラム委員会での選考により採否を決定する可能性があります．招待講演 -------- 中田育男 (筑波大学名誉教授) 幡山五郎 (オムロン) 以上お二方の招待講演を予定しております ====================================================================== 投稿・発表申込要領 3つのカテゴリそれぞれに対する投稿方法は以下の通りです．最新の情報は上記 Web ページでご確認ください．カテゴリ1（国内外未発表論文） ------------------------------ 投稿手続きは2段階です．発表申込を行った上で論文提出を行ってください．発表申込先： https://www.easychair.org/account/signin.cgi?conf=ppl2014 (EasyChairのアカウントが必要です) 発表申込締切：2013年12月20日(金) 17:00 (JST) 著者名，所属，論文タイトル，論文概要（日本語300～400字程度もしくは英語 200 words 程度）を提出してください．論文提出締切：2014年1月8日(水) 17:00 (JST) 10ページ程度（最大15ページ）の論文（日本語もしくは英語，PDF形式）を提出してください．採否通知：2014年2月3日(月) 最終原稿提出締切：2014年2月14日(金) 17:00 (JST) 採録された論文の最終原稿の提出方法は，採否通知にてお知らせいたします． (注) カテゴリ1への投稿論文と類似の論文を，他の会議（予稿集を出版するもの）・論文誌などに同時投稿する場合は，査読の有無に関わらず，その旨を発表申込および論文提出の際に明記してください．PPLでは同時投稿の事実のみをもって論文を不採録とすることはありませんが，採否の決定に利用する場合があります（他の会議との重複を避けるため，発表内容についての条件付採録とすることもあります）．カテゴリ2（国外既発表論文） ---------------------------- 昨年同様，カテゴリ2の申込締切が少し早くなっていますのでご注意ください．発表申込時に採録が決定している国際会議および国際学術雑誌の発表論文が対象です．理論系だけではなく実装系の論文の投稿も歓迎いたします．発表申込方法につきましては PPL2014 の Web ページをご確認ください．発表申込先： ppl2014-submit［ａｔ］fos.kuis.kyoto-u.ac.jp (［ａｔ］を @ に置き換えてください．) 発表申込締切：2014年1月24日(金) 17:00 (JST) 原論文（ページ数不問，PDF形式）とabstract（テキスト形式）を，著者名，所属，論文タイトル，原論文の出典（発表会議名，掲載済／予定の別等）と併せてご提出ください．採否通知：2014年2月5日(水) カテゴリ3（ポスター・デモ発表） ------------------------------------------ ポスター・デモの区別を行わずに募集いたします．デモを行う場合は，発表概要においてその旨をご説明ください．発表申込方法につきましては PPL2014 の Web ページをご確認ください．発表申込先： ppl2014-submit［ａｔ］fos.kuis.kyoto-u.ac.jp (［ａｔ］を @ に置き換えてください．) 発表申込締切：2014年2月7日(金) 17:00 (JST) 希望する発表形態（ポスター・デモの別）を明記して，著者名，所属，発表タイトル，発表概要（200～300字程度）をご提出ください．採否通知：2014年2月14日(金) 問い合わせ先：ppl2014-oc [at] fos.kuis.kyoto-u.ac.jp （[at]を@に置き換えてください） ====================================================================== プログラム委員会 Reynald Affeldt (産総研) 稲葉一浩 (Google) 馬谷誠二 (京大) 海野広志 (筑波大) 大平怜 (日本IBM) 大野和彦 (三重大) 倉光君郎 (横浜国立大) 光来健一 (九工大) 笹田耕一 (Heroku) 篠埜功 (芝浦工大) 鈴木貢 (島根大) 中田秀基 (産総研) [プログラム共同委員長] 中野圭介 (電通大) [プログラム共同委員長] 西田直樹 (名古屋大) 浜名誠 (群馬大) 廣川直 (北陸先端大) 松崎公紀 (高知工大) 南出靖彦 (筑波大) 横山大作 (東大) 横山哲郎 (南山大) 実行委員会末永幸平 (京大) [実行委員長] 上野雄大 (東北大) [実行副委員長] 中田秀基 (産総研) [プログラム共同委員長] 中野圭介 (電通大) [プログラム共同委員長] --------------------------------------------------------------------------

1 0

CFP for MSFP 2014
by Makoto Hamana 16 Dec '13

16 Dec '13

$B3'MM!"(B $B?t3XE*9=B$$K4p$E$/4X?t7?%W%m%0%i%_%s%08&5f$N%o!<%/%7%g%C%W(B MSFP $B$N$40FFb$G$9!#(BETAPS'14$BJ;@_$G!:@Z$,6a$/$J$C$F$*$j$^$9$,!"(B $B$<$REj9F$r$48!F$$/$@$5$$!#(B $B$J$*!">7BT9V1i$N0l?M$O5~ETBg3X$N>!8T$5$s$G$9!#(B -- $BIML>(B $B72GOBg3X(B ======================================================================== Fifth Workshop on MATHEMATICALLY STRUCTURED FUNCTIONAL PROGRAMMING 12 April 2014, in Grenoble, France. A satellite workshop of ETAPS 2014 http://www.cs.bham.ac.uk/~pbl/msfp2014/ The fifth workshop on Mathematically Structured Functional Programming is devoted to the derivation of functionality from structure. It is a celebration of the direct impact of Theoretical Computer Science on programs as we write them today. Modern programming languages, and in particular functional languages, support the direct expression of mathematical structures, equipping programmers with tools of remarkable power and abstraction. Where would Haskell be without monads? Functional reactive programming without temporal logic? Call-by-push-value without adjunctions? The list goes on. This workshop is a forum for researchers who seek to reflect mathematical phenomena in data and control. The first MSFP workshop was held in Kuressaare, Estonia, in July 2006, affiliated with MPC 2006 and AMAST 2006. The second MSFP workshop was held in Reykjavik, Iceland as part of ICALP 2008. The third MSFP workshop was held in Baltimore, USA, as part of ICFP 2010. The fourth workshop was held in Tallinn, Estonia, as part of ETAPS 2012. Important Dates: ================ Abstract 24 December 2013 Submission 31 December 2013 Notification 3 February 2014 Final version 10 February 2014 Workshop 12 April 2014 Invited Speakers: ================= Bob Atkey Shin-ya Katsumata, Kyoto Universty Topics: ======= Submissions are welcomed on, but by no means restricted to, topics such as: * structured effectful computation * structured recursion * structured corecursion * structured tree and graph operations * structured syntax with variable binding * structured datatype-genericity * structured search * structured representations of functions * structured quantum computation * structure directed optimizations * structured types * structure derived from programs and data Program Committee: ================== Andreas Abel, Chalmers and Gothenburg University Neil Ghani, The University of Strathclyde Makoto Hamana, Gunma University Neelakantan R. Krishnaswami (co-chair), University of Birmingham Paul Blain Levy (co-chair), University of Birmingham Rasmus M$Bxg(Belberg, IT University of Copenhagen Russell O'Connor, McMaster University Submission: =========== Papers must report previously unpublished work and not be submitted concurrently to another conference with refereed proceedings. Accepted papers must be presented at the workshop by one of the authors, and will be published under the auspices of EPTCS under a Creative Commons license. There is no specific page limit, but authors should strive for brevity.

1 0

Call for Papers: 2nd AWPL
by 小野寛晰 10 Dec '13

10 Dec '13

The Second Asian Workshop on Philosophical Logic 12-13 April, 2014 Institute for Logic and Cognition Sun Yat-Sen University Guangzhou, China All researchers working on various aspects of philosophical logic are cordially invited to submit their papers by the submission deadline of January 20th, 2014. Authors should submit an (extended) abstract at least two pages but no more than ten pages. Papers must be submitted as PDF files and sent to liuhu2(a)mail.sysu.edu.cn . Each submission will be refereed. DESCRIPTION OF THE CONFERENCE: The Second Asian Workshop on Philosophical Logic will be held at Guangzhou, China, and is organized by the Institute of Logic and Cognition, Sun Yat-sen University from 12th to 13th April, 2014. The aim of the Workshop is to promote mutual understandings among researchers on logic working in Asian countries, and to establish closer collaborations in future. The scope of the Workshop will cover: philosophical logic, non-classical logics, algebraic logic, and their applications in computer science and cognitive science. IMPORTANT DATES: Abstract submission deadline: January 20, 2014 Notification of authors: February 15, 2014 Conference: April 12-13, 2014 POST-CONFERENCE PUBLICATION: All authors of papers presented at the conference will be encouraged to submit a full version to a post-conference volume published by Springer at the book series "Logic in Asia". See http://www.springer.com/series/13080 . All papers submitted to the post-conference proceedings will be refereed to high journal standards, and acceptance as a presentation is no guarantee that the post-conference paper will be published. The details of the post-conference proceedings will be announced later COMMITTEE: Chairs: Shier Ju （Sun Yat-sen University, China） Hiroakira Ono （JAIST, Japan） Program Committee: Wojciech Buszkowski （Adam Mickiewicz University, Poland） Mihir Chakraborty (Jadavpur University, India) Phan Minh Dung (Asian Institute of Technology, Thailand) Fenrong Liu (Tsinghua University, China) Jeremy Seligman (The University of Auckland, New Zealand) Wen-fang Wang (National Yang Ming University, Taiwan, China) Chin-mu Yang (National Taiwan University, Taiwan，China) Xishun Zhao (Sun Yat-sen University, China) Furthur information about the conference can be find here: http://logic.sysu.edu.cn/AWPL2014/

1 0

Nagoya Logic Seminar
by 吉信康夫 06 Dec '13

06 Dec '13

皆様：以下の要領で名古屋数学基礎論セミナーを開催します。奮って御参加下さい。日時：12月13日(金) 15:30- 場所：名古屋大学大学院情報科学研究科棟 1F 第2講義室 (http://www.nagoya-u.ac.jp/2012website/global-info/images/access-map/map2.pdf の地図でA4(3)の建物です。) 講演者：横山啓太 (北陸先端科学技術大学院大学) 題：On the second-order categoricity of the natural number system アブストラクト： It is important in the foundations of mathematics that the natural number system is characterizable as a system of 0 and a successor function by second-order logic. In other words, the following Dedekind's second-order categoricity theorem holds: every Peano system (P,e,F) is isomorphic to the natural number system (N,0,S). In this talk, I will investigate Dedekind's theorem and other similar statements. We will first do reverse mathematics over RCA0, and then weaken the base theory. This is a joint work with Stephen G. Simpson and Leszek Kolodziejczyk.

1 0

【再送】Computability Theory and Foundations of Mathematics 2014
by YOKOYAMA Keita 05 Dec '13

05 Dec '13

皆様、先ほど流しました研究集会の案内のメールで、ホームページのアドレスが間違っておりました。正しいアドレスは http://www.jaist.ac.jp/CTFM/CTFM2014/index.html お詫びして訂正致します。横山 ************以下、再送************** 以下の要領で研究集会 Computability Theory and Foundations of Mathematics 2014 (2014年2月17日(月)〜2月20日(木)，東京工業大学大岡山キャンパス) を開催いたします． invited speakers 等の情報については、近日中に下記のホームページにて公開致します。 http://www.jaist.ac.jp/CTFM/CTFM2014/index.html 12月15日より講演の募集を開始致しますので、宜しく参加・講演をご検討ください。 ============================================================ Computability Theory and Foundations of Mathematics (Tokyo Institute of Technology, Tokyo, Japan, February 17 - 20, 2014) http://www.jaist.ac.jp/CTFM/CTFM2014/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, Constructive Mathematics, Theory of Randomness and Computational Complexity Theory. -------------------------------------------- Submission for Presentations: December 15, 2013 -- January 15, 2014 -------------------------------------------- Organizing Committee: Hajime Ishihara(JAIST) Ryo Kashima(Tokyo Institute of Technology, local chair) Sam Sanders (Ghent) Stephen G. Simpson (Pennsylvania State) Kazuyuki Tanaka (Tohoku, chair) Keita Yokoyama (JAIST) -------------------------------------------- Program Committee: Kojiro Higuchi (Chiba) Takayuki Kihara(JAIST) Kenshi Miyabe(Tokyo) Takako Nemoto(JAIST) Sam Sanders (Ghent) Takeshi Yamazaki (Tohoku) Keita Yokoyama (JAIST, chair) Keisuke Yoshii (Tohoku) -------------------------------------------- どうぞよろしくお願い致します。横山啓太 -- Keita Yokoyama y-keita(a)jaist.ac.jp

1 0

Computability Theory and Foundations of Mathematics 2014
by YOKOYAMA Keita 05 Dec '13

05 Dec '13

皆様、以下の要領で研究集会 Computability Theory and Foundations of Mathematics 2014 (2014年2月17日(月)〜2月20日(木)，東京工業大学大岡山キャンパス) を開催いたします． invited speakers 等の情報については、近日中に下記のホームページにて公開致します。 http://www.jaist.ac.jp/CTFM/temp/CTFM2014/index.html 12月15日より講演の募集を開始致しますので、宜しく参加・講演をご検討ください。 ============================================================ Computability Theory and Foundations of Mathematics (Tokyo Institute of Technology, Tokyo, Japan, February 17 - 20, 2014) http://www.jaist.ac.jp/CTFM/temp/CTFM2014/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, Constructive Mathematics, Theory of Randomness and Computational Complexity Theory. -------------------------------------------- Submission for Presentations: December 15, 2013 -- January 15, 2014 -------------------------------------------- Organizing Committee: Hajime Ishihara(JAIST) Ryo Kashima(Tokyo Institute of Technology, local chair) Sam Sanders (Ghent) Stephen G. Simpson (Pennsylvania State) Kazuyuki Tanaka (Tohoku, chair) Keita Yokoyama (JAIST) -------------------------------------------- Program Committee: Kojiro Higuchi (Chiba) Takayuki Kihara(JAIST) Kenshi Miyabe(Tokyo) Takako Nemoto(JAIST) Sam Sanders (Ghent) Takeshi Yamazaki (Tohoku) Keita Yokoyama (JAIST, chair) Keisuke Yoshii (Tohoku) -------------------------------------------- どうぞよろしくお願い致します。横山啓太 -- Keita Yokoyama y-keita(a)jaist.ac.jp

1 0

Cfp: Joint 25th RTA and 12th TLCA　(in Vienna summer of logic)
by Kazushige TERUI 04 Dec '13

04 Dec '13

$B$_$J$5$^(B $BO@M}3X4X78$G;K>e:GBg$N%$%Y%s%H(B"Vienna summer of logic"$B$N0lIt$G$9!#(B CSL-LICS$B$HF|Dx$,$+$V$C$F$$$^$9$,!"$h$m$7$1$l$P$3$A$i$X$NEj9F$b$48!F$$/$@$5$$!#(B $B>H0f(B Joint 25th International Conference on REWRITING TECHNIQUES AND APPLICATIONS and 12th International Conference on TYPED LAMBDA CALCULI AND APPLICATIONS July 14–17, 2014, Vienna, Austria http://vsl2014.at/rta-tlca ====================================== IMPORTANT DATES Abstract submission: January 28, 2014 Notification: April 9, 2014 Paper submission: February 4, 2014 Final version: April 29, 2014 Rebuttal period: March 19–21, 2014 ====================================== SUBMISSION and PUBLICATION --------------------------- Submissions presenting original work are expected at https://www.easychair.org/conferences/?conf=rtatlca2014. They should be at most 15 pages (10 for system descriptions) and follow http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0. The proceedings will be published in the LNCS Advanced Research in Computing and Software Science series of Springer. One author of each accepted paper is expected to present it at the conference. Topics ------ This joint RTA and TLCA conference is the major forum for the presentation of research on all aspects of rewriting and typed lambda-calculi. Areas of interest include but are not limited to: - Foundations: string rewriting; term rewriting; graph rewriting; lambdacalculi; higher-order rewriting; binding techniques; constrained rewriting and deduction; categorical and infinitary rewriting; stochastic rewriting; net rewriting; Petri nets; higher-dimensional rewriting; process calculi; explicit substitution; tree automata; confluence; termination; complexity; modularity. - Algorithmic aspects and implementation: strategies; matching; unification; anti-unification; narrowing; constraint solving; theorem proving; completion techniques; implementation techniques; parallel execution; certification of rewriting properties; abstract machines; automated (non)termination and confluence provers; automated complexity analysis; SMT solving; system descriptions. - Logic: proof theory; natural deduction; sequent calculi; proof assistants; cut elimination and normalization; propositions as types; linear logic and proof nets; equational logic; rewriting logic; rewriting calculi; proof checking; reasoning about programming languages and logics; homotopy type theory; type-theoretic aspects of complexity; implicit computational complexity. - Types: dependent types; polymorphism; intersection types and related approaches; subtyping; type inference and type checking; types in databases. - Semantics: denotational semantics; operational semantics; game semantics; realisability; domain theory; categorical models; universal algebra. - Programming: foundational aspects of functional programming, object oriented programming, and other programming paradigms; flow analysis of higher-type computation; program equivalence; program transformation; program optimization; program refactoring; rewriting models of programs; rule-based (functional and logic) programming; control operators; symbolic and algebraic computation; system synthesis and verification; XML queries and transformations; types in program analysis and verification; analysis of cryptographic protocols; systems biology; linguistics. Programme Committee -------------------- Andreas Abel (Gothenburg) Beniamino Accattoli (Bologna) Zena Ariola (Oregon) Steffen van Bakel (Imperial College) Pierre Clairambault (CNRS) Ugo Dal Lago (Bologna) Gilles Dowek (Inria) Santiago Escobar (Valencia) Amy Felty (Ottawa) Maribel Fernandez (King$B!G(Bs college) Adria Gascon (SRI International) Jeroen Ketema (Imperial College) Christopher Lynch (Clarkson) Masahito Hasegawa (Kyoto) Olivier Hermant (MINES ParisTech) Paul-Andre Mellies (CNRS) Alexandre Miquel (UdelaR) Cesar Munoz (NASA) Vivek Nigam (Para$(D)E(Bba) Luke Ong (Oxford) Brigitte Pientka (McGill) Femke van Raamsdonk (Amsterdam) Jakob Rehof (Dortmund) David Sabel (Frankfurt) Gernot Salzer (Wien) Sylvain Salvati (Inria) Aleksy Schubert (Warszawa) Peter Selinger (Dalhousie) Paula Severi (Leicester) Christian Sternagel (JAIST) Kazushige Terui (Kyoto) Mateu Villaret (Girona) Fer-Jan de Vries (Leicester) Harald Zankl (Innsbruck) Programme Chair --------------- Gilles Dowek Conference Chair ---------------- Gernot Salzer ------------------------------------------ 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

The 48th MLG Meeting: Program
by Katsuhiko Sano 04 Dec '13

04 Dec '13

第48回 MLG 数理論理学研究集会のご案内（重複してお受け取りの際はご容赦ください。）北陸先端科学技術大学院大学の佐野勝彦です。 2013年度MLG数理論理学研究集会（第48回）を下記の要領で開催します。講演・宿泊の申し込みは締め切りましたが，参加することは可能です。その場合，事前の申し込みは不要ですが，参加費（会場代）2,500円をいただきます。どうぞよろしくお願いいたします。 ========================================= 第48回 MLG 数理論理学研究集会開催要領 ========================================= 期間: 2013 年 12 月 6 日(金) 〜 12 月 8 日(日) 場所: 山中温泉河鹿荘ロイヤルホテル（JR加賀温泉駅から車で約20分，加賀温泉駅から送迎あり）〒922-0126 石川県加賀市山中温泉河鹿町ホ100, URL : http://www.daiwaresort.jp/kajikasou/ ホームページ：https://sites.google.com/site/mlg2013kaga/ 講演プログラム： 12/6 (金) 1440 -- 1450 開会 1450 -- 1530 佐野勝彦(北陸先端科学技術大学院大学) Axiomatizing Facebook Logic Via Tree Sequent Calculus 1540 -- 1620 仲川聡子(東京工業大学情報理工学研究科) 三項関係に従う可能世界意味論を持った様相論理について 1630 -- 1710 佐々木克巳(南山大学) S4におけるS4モデルでないイグザクトモデル 12/7 (土) 0925 -- 0930 事務連絡 0930 -- 1010 関隆宏(新潟大学) A remark on metacomplete relevant modal logics 1020 -- 1100 丸山善宏 (Oxford University) Generalised Topos Semantics for Higher Order Substructural Logic 1110 -- 1150 小野寛晰 Uniform interpolation in substructural logics without contraction rules 1330 -- 1410 Jonni Virtema (University of Tampere and JAIST) Modal team logic 1420 -- 1500 佐藤雅彦(京都大学名誉教授) Simple type theory の weakening rule について 1510 -- 1550 宮崎裕(大阪経済法科大学) Hallden completeness and Craig Interpolation Property in NExt(KTB) 1600 -- 1640 千谷慧子 Global Set Theory 12/8 (日) 0925 -- 0930 事務連絡 0930 -- 1010 山川郁加(千葉大学理学研究科) λρ計算の述語論理への拡張 1020 -- 1100 井澤昇平(東北大学大学院理学研究科) 直積による1ソート化 1110 -- 1150 横山啓太(北陸先端科学技術大学院大学) Fast growing functions and Ramsey's theorem 1150 -- 1200 閉会 --- MLG48 世話人佐野勝彦（北陸先端科学技術大学院大学） E-mail : mlg.logic.japan(a)gmail.com

1 0

Cfp: Fifth Workshop on Developments in Implicit Computational Complexity (DICE2014, a satellite event of ETAPS2014)
by Kazushige TERUI 04 Dec '13

04 Dec '13

$B$_$J$5$^(B $B1"7W;;NLM}O@$N%o!<%/%7%g%C%W$N$40FFb$r$5$;$F$$$?$@$-$^$9!#(B $B1"7W;;NL$H$$$&$H$+$J$j8BDj$5$l$?OCBj$G$9$,(B $BO@M}$d%W%m%0%i%_%s%08@8l$H7W;;NLMm$_$NOC$J$i$"$kDxEY<u$1F~$l$F$/$l$k5$$5$/$J%o!<%/%7%g%C%W$G$9!#(B $B$J$*!":#G/EY$OElBg$N2OB<>4@1@h@8$,>7BT9V1i$r$5$l$^$9!#(B $B$h$m$7$1$l$P$<$REj9F!&;22C$r$48!F$$/$@$5$$!#(B $B>H0f(B DICE 2014 Fifth Workshop on Developments in Implicit Computational Complexity ==================================================================== http://dice14.tcs.ifi.lmu.de Grenoble, France April 5-6, 2014 (a satellite event of ETAPS 2014) Invited Speakers ----------------- * Akitoshi Kawamura (University of Tokyo) * Georg Moser (University of Innsbruck) Important Dates ---------------- * Abstract Submission: January 5, 2014 * Notification: January 20, 2014 * Final version: February 10, 2014 Scope ------ The area of Implicit Computational Complexity (ICC) has grown from several proposals for using logic and formal methods to provide languages for complexity-bounded computation (e.g. PTIME, LOGSPACE computation). Its aim is to study computational complexity without reference to external measuring conditions or particular machine models, but only in terms of language restrictions or logical/computational principles implying complexity properties. This workshop focuses on ICC methods related to programs (rather than descriptive methods). In this approach one relates complexity classes to restrictions on programming paradigms (functional programs, lambda calculi, rewriting systems), such as ramified recurrence, weak polymorphic types, linear logic and linear types, and interpretative measures. The two main objectives of this area are: * to find natural implicit characterizations of various complexity classes of functions, thereby illuminating their nature and importance; * to design methods suitable for static verification of program complexity. Therefore ICC connects both to the study of complexity classes and to static program analysis. The workshop is open to contributions on various aspects of ICC including (but not exclusively): * types for controlling complexity * logical systems for implicit computational complexity * linear logic * semantics of complexity-bounded computation * rewriting and termination orderings * interpretation-based methods for implicit complexity * programming languages for complexity-bounded computation * theoretical foundations of program complexity analysis * application of implicit complexity to security Submission ----------- Authors are invited to submit an extended abstract of up to 5 pages. Accepted abstracts will be presented at the workshop. Submissions will be judged on originality, relevance, interest and clarity. Preference will be given to abstracts describing work (including work in progress) that has not been published elsewhere before the workshop. Any previous publication or submission of submitted work should be clearly indicated in the submission. The workshop will not have formal proceedings and is not intended to preclude later publication at another venue. Abstracts should be written in English and can be submitted in PDF form to the DICE 2014 EasyChair page: https://www.easychair.org/account/signin.cgi?conf=dice2014 Submissions of abstracts by PC members are allowed and encouraged. Program Committee ------------------ * Martin Avanzini (University of Innsbruck) * Amir Ben-Amram (Tel-Aviv Academic College) * Pierre Clairambault (CNRS & ENS Lyon) * Daniel de Carvalho (Datalogisk Institut, K(IC8(Bbenhavns Universitet) * David Nowak (CNRS & Lille 1 University) * Michele Pagani (LIPN $Bc`(B Universit(IC)(B de Paris 13) * Romain P(IC)(Bchoux (Universit(IC)(B de Lorraine) * Brian Redmond (Grande Prairie Regional College, Canada) * Ulrich Sch(IC6(Bpp (LMU Munich) (Chair) * Kazushige Terui (RIMS, Kyoto University) Steering Committee ------------------- * Patrick Baillot (ENS Lyon, CNRS) * Ugo Dal Lago (Universit(IC(B di Bologna) * Martin Hofmann (Ludwig-Maximilians-Universit(IC$(Bt M(IC<(Bnchen) * Jean-Yves Marion (Loria - INPL Nancy) * Simona Ronchi Della Rocca (Universit(IC(B di Torino) ------------------------------------------ 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

CFP: ESSS 2014
by 山形賴之 03 Dec '13

03 Dec '13

山形＠産総研です。皆様、下記のような論文募集が出ております。形式手法などとも関係深いワークショップですので、投稿をご検討いただければ幸いです。(同様のCFPを重複して受け取られた方はご容赦下さい) ================================================== 3rd International Workshop on Engineering Safety and Security Systems May 12, 2014, Singapore Co-located with FM 2014 in Singapore, May 12-26, 2014 More information: http://pat.sce.ntu.edu.sg/esss14/ =================================================== Important dates ----------------- * February 10th, 2014: Submission deadline * March 17th, 2014: Notification of acceptance/rejection * May 12th, 2014: Workshop Introduction of the Workshop ----------------- The International Workshop on Engineering Safety and Security Systems (ESSS) aims at contributing to the challenge of constructing reliable and secure systems. The workshop covers areas such as formal specification, (extended) type checking, model checking, program analysis/transformation, model-based testing and model-driven software construction. The workshop will bring together researchers and industry R&D expertise together to exchange their knowledge, discuss their research findings, and explore potential collaborations. Theme of the Workshop ----------------- The main theme of the workshop is methods and techniques for constructing large reliable and secure systems. The goal of the workshop is to establish a platform for the exchange of ideas, discussion, cross-fertilization, inspiration, co-operation, and dissemination. The topics of the workshop include, but are not limited to: -- methods, techniques and tools for system safety and security -- methods, techniques and tools for analysis, certification, and debugging of complex safety and security systems -- model-based and verification-based testing -- emerging application domains such as cloud computing and cyber-physical systems -- case studies and experience reports on the use of formal methods for analyzing safety and security systems Submissions guidelines ----------------- Paper submissions must be original, unpublished work. Submissions should be in made via the Easychair site: https://www.easychair.org/conferences/?conf=esss2014. We invite two types of submissions: --Regular papers (up to 15 pages) describing original and unpublished work within the scope of the workshop. --Short papers (up to 6 pages) describing work in progress or less mature results. Case studies and tool papers are welcome as well. All submissions must be prepared in LATEX using the EPTCS macro package. The final versions of accepted regular and short papers will be published as a volume of Electronic Proceedings in Theoretical Computer Science (EPTCS). Furthermore, authors of a selection of the accepted papers will be invited to submit an extended version of their articles to a special issue of a high-quality journal, after the workshop. Publication of accepted articles requires the commitment of one of the authors to register for the workshop and present the paper. General chair ----------------- Sjouke Mauw, University of Luxembourg, Luxembourg Program chairs ----------------- Yang Liu, Nanyang Technological University, Singapore Jun Pang, University of Luxembourg, Luxembourg Program committee ----------------- Etienne Andre, Universite Paris 13, France Toalue Chen, Middelsex University, UK Marieke Huisma, University of Twente, The Netherlands Weiqiang Kong, Kyushu University, Japan Keqin Li, SAP Research, France Yang Liu, Nanyang Technological University, Singapore Zhiming Liu, UNU/IIST Macao, China Sjouke Mauw, University of Luxembourg, Luxembourg Jun Pang, University of Luxembourg, Luxembourg Geguang Pu, East China Normal University, China Mohammad Torabi Dashti, ETH Zurich, Switzerland Anton Wijs, Eindhoven University of Technology Yoriyuki Yamagata, AIST, Japan -- 山形頼之独立行政法人産業技術総合研究所主任研究員 E-mail: yoriyuki.yamagata(a)aist.go.jp http://staff.aist.go.jp/yoriyuki.yamagata/

1 0

講演会のお知らせ
by KASHIMA Ryo 26 Nov '13

26 Nov '13

非専門家向けの講演会を開催いたします。以前に一部メーリングリストに流しましたが再度の案内お許しください。重複受け取りの方には申し訳ありません。日時：11月30日（土）15:00--16:30 会場：東京工業大学大岡山キャンパス西８号館Ｅ棟10階　　　情報理工学研究科大会議室講師：田中一之（東北大学）題目：数学パスルに挑む概要：知恵の輪、ソリティア、ルービック・キューブ、帽子パズルなど多種多様なパズルの世界に、天才チューリングが開発した計算可能理論を武器にして乗り込もう。ときには解けないと悟ることも正解である。ベネディクト・カンバーバッチがチューリングを演じる映画『The Imitation Game』の公開も待ち遠しい。案内ページ： http://www.is.titech.ac.jp/~kashima/Events/Lecture2013Tanaka.html 参加される方は下記宛ご一報いただければ幸いです。 ----- 鹿島亮東京工業大学大学院情報理工学研究科数理・計算科学専攻 kashima(a)is.titech.ac.jp

1 0

[CFP] PPL2014 論文募集のお知らせ: 第16回プログラミングおよびプログラミング言語ワークショップ
by Keisuke Nakano 21 Nov '13

21 Nov '13

＊＊＊重複して受け取られた場合はご容赦ください＊＊＊電気通信大学の中野と申します．来年3月に熊本県阿蘇市阿蘇温泉で開催される第16回プログラミングおよびプログラミング言語ワークショップ (PPL2014) のご案内 (2回目) です．発表申込締切まで一ヵ月です．是非投稿をご検討ください． -------------------------------------------------------------------------- 第16回プログラミングおよびプログラミング言語ワークショップ（PPL2014） http://www.fos.kuis.kyoto-u.ac.jp/ppl2014/ 論文募集主催: 日本ソフトウェア科学会プログラミング論研究会日程: 2014年3月5日(水)～3月7日(金) 会場: 熊本県阿蘇市阿蘇温泉「阿蘇の司ビラパークホテル」 http://asovilla.jp/ PPL2014は，プログラミングおよびプログラミング言語に関する研究者が一堂に会し，最新の研究成果の発表，および新たな研究課題についての討論やアイディア交換等を行うことを目的とした，合宿形式のワークショップです．プログラミングおよびプログラミング言語の理論・設計・実装・処理系などに関する研究発表を，カテゴリ別に幅広く募集します．カテゴリ1: 国内外で未発表の論文の発表カテゴリ2: 国際会議・学術雑誌等で既発表であるが，国内では未発表の研究の紹介カテゴリ3: ポスター・デモ発表（既発表・未発表の別を問いません） ※ショートプレゼンテーションは行いませんカテゴリ1の採択論文の中から，特に独創的なアイディアや顕著な成果を含むものに対して論文賞を授与する予定です．また，ポスター・デモを含む全発表のなかから，聴衆の投票により，最も優秀なプレゼンテーションを披露した学生に発表賞を授与する予定です．カテゴリ1（国内外未発表論文） ------------------------------ 完成した理論やシステムの研究発表のみならず，萌芽的なアイディアや問題点の提示等も歓迎します．発展途上の研究内容も積極的に採録する方針です（ただし，PPLでの発表として相応しくないと判断される場合は，この限りではありません）．また，カテゴリ1で発表された研究については，会場での討議や査読コメントをもとにその完成度を高め，将来の学術雑誌・会議等での業績に結び付けることを奨励しています．そのため，予稿集の配布は参加者のみへの限定的なものとする予定です．採録された論文は，PPL2014参加者に配布される予稿集に掲載され，参加者のみがアクセス可能な形でWEB上で公開されます（論文へのリンク集ページを作成し，閲覧に必要なパスワードを参加者に連絡します）．カテゴリ1で発表された研究のうち，PPL2014プログラム委員会により優れていると認めるものは，PPL2014終了後（2014年4月下旬予定），「コンピュータソフトウェア」誌のPPL2014推薦論文としての投稿が可能です．推薦論文は，PPL プログラム委員が引き続き査読を行うことによる，迅速な査読プロセスを特長としています．カテゴリ2（国外既発表論文） ---------------------------- 査読付の国際会議または学術雑誌等で既発表であるが国内では未発表である研究を紹介する場です．採録決定済みの研究も含みます．PPLへの関連をもとに採否を判定いたしますが，申し込み多数の場合はプログラム委員会での選考により，発表をご遠慮いただく可能性もございますので，その旨をご了承の上ご投稿ください．カテゴリ3（ポスター・デモ発表） ------------------------------------------ 2時間程度のセッション内でのポスター発表またはデモ発表です．既発表・未発表の別を問いません．PPLへの関連をもとに採録を判定いたします．また，申し込み多数の場合はプログラム委員会での選考により採否を決定する可能性があります．招待講演 -------- 中田育男 (筑波大学名誉教授) 幡山五郎 (オムロン) 以上お二方の招待講演を予定しております ====================================================================== 投稿・発表申込要領 3つのカテゴリそれぞれに対する投稿方法は以下の通りです．最新の情報は上記 Web ページでご確認ください．カテゴリ1（国内外未発表論文） ------------------------------ 投稿手続きは2段階です．発表申込を行った上で論文提出を行ってください．発表申込先： https://www.easychair.org/account/signin.cgi?conf=ppl2014 (EasyChairのアカウントが必要です) 発表申込締切：2013年12月20日(金) 17:00 (JST) 著者名，所属，論文タイトル，論文概要（日本語300～400字程度もしくは英語 200 words 程度）を提出してください．論文提出締切：2014年1月8日(水) 17:00 (JST) 10ページ程度（最大15ページ）の論文（日本語もしくは英語，PDF形式）を提出してください．採否通知：2014年2月3日(月) 最終原稿提出締切：2014年2月14日(金) 17:00 (JST) 採録された論文の最終原稿の提出方法は，採否通知にてお知らせいたします． (注) カテゴリ1への投稿論文と類似の論文を，他の会議（予稿集を出版するもの）・論文誌などに同時投稿する場合は，査読の有無に関わらず，その旨を発表申込および論文提出の際に明記してください．PPLでは同時投稿の事実のみをもって論文を不採録とすることはありませんが，採否の決定に利用する場合があります（他の会議との重複を避けるため，発表内容についての条件付採録とすることもあります）．カテゴリ2（国外既発表論文） ---------------------------- 昨年同様，カテゴリ2の申込締切が少し早くなっていますのでご注意ください．発表申込時に採録が決定している国際会議および国際学術雑誌の発表論文が対象です．理論系だけではなく実装系の論文の投稿も歓迎いたします．発表申込方法につきましては PPL2014 の Web ページをご確認ください．発表申込先： ppl2014-submit［ａｔ］fos.kuis.kyoto-u.ac.jp (［ａｔ］を @ に置き換えてください．) 発表申込締切：2014年1月24日(金) 17:00 (JST) 原論文（ページ数不問，PDF形式）とabstract（テキスト形式）を，著者名，所属，論文タイトル，原論文の出典（発表会議名，掲載済／予定の別等）と併せてご提出ください．採否通知：2014年2月5日(水) カテゴリ3（ポスター・デモ発表） ------------------------------------------ ポスター・デモの区別を行わずに募集いたします．デモを行う場合は，発表概要においてその旨をご説明ください．発表申込方法につきましては PPL2014 の Web ページをご確認ください．発表申込先： ppl2014-submit［ａｔ］fos.kuis.kyoto-u.ac.jp (［ａｔ］を @ に置き換えてください．) 発表申込締切：2014年2月7日(金) 17:00 (JST) 希望する発表形態（ポスター・デモの別）を明記して，著者名，所属，発表タイトル，発表概要（200～300字程度）をご提出ください．採否通知：2014年2月14日(金) 問い合わせ先：ppl2014-oc [at] fos.kuis.kyoto-u.ac.jp （[at]を@に置き換えてください） ====================================================================== プログラム委員会 Reynald Affeldt (産総研) 稲葉一浩 (Google) 馬谷誠二 (京大) 海野広志 (筑波大) 大平怜 (日本IBM) 大野和彦 (三重大) 倉光君郎 (横浜国立大) 光来健一 (九工大) 笹田耕一 (Heroku) 篠埜功 (芝浦工大) 鈴木貢 (島根大) 中田秀基 (産総研) [プログラム共同委員長] 中野圭介 (電通大) [プログラム共同委員長] 西田直樹 (名古屋大) 浜名誠 (群馬大) 廣川直 (北陸先端大) 松崎公紀 (高知工大) 南出靖彦 (筑波大) 横山大作 (東大) 横山哲郎 (南山大) 実行委員会末永幸平 (京大) [実行委員長] 上野雄大 (東北大) [実行副委員長] 中田秀基 (産総研) [プログラム共同委員長] 中野圭介 (電通大) [プログラム共同委員長] --------------------------------------------------------------------------

1 0

AiML-2014: call for papers
by 小野寛晰 21 Nov '13

21 Nov '13

*** Apologies for cross-postings **** AiML-2014: CALL FOR PAPERS 10th INTERNATIONAL CONFERENCE ON ADVANCES IN MODAL LOGIC, GRONINGEN, 5-8 AUGUST, 2014 http://www.philos.rug.nl/AiML2014/ Advances in Modal Logic is an initiative aimed at presenting the state of the art in modal logic and its various applications. The initiative consists of a conference series together with volumes based on the conferences. Information about the AiML series can be obtained at http://www.aiml.net. AiML-2014 is the tenth conference in the series. TOPICS We invite submission on all aspects of modal logic, including: - history of modal logic - philosophy of modal logic - applications of modal logic - computational aspects of modal logic (complexity and decidability of modal and temporal logics, modal and temporal logic programming, model checking, model generation, theorem proving for modal logics) - theoretical aspects of modal logic (algebraic/categorical perspectives on modal logic, coalgebraic modal logic, completeness and canonicity, correspondence and duality theory, many-dimensional modal logics, modal fixed point logics, model theory of modal logic, proof theory of modal logic) - specific instances and variations of modal logic (description logics, modal logics over non-boolean bases, dynamic logics and other process logics, epistemic and deontic logics, modal logics for agent-based systems, modal logic and game theory, modal logic and grammar formalisms, provability and interpretability logics, spatial and temporal logics, hybrid logic, intuitionistic logic, substructural logics, computationally light fragments of all such logics) Papers on related subjects will also be considered. INVITED SPEAKERS: Franz Baader (TU Dresden, Germany) Stephane Demri (New York University, US & CNRS, France) Joseph Halpern (Cornell University, US) Sara Negri (University of Helsinki, Finland) Frank Wolter (University of Liverpool, UK) PAPER SUBMISSIONS There will be two types of submissions to AiML-2014: (1) Full papers for publication in the proceedings and presentation at the conference. (2) Short presentations intended for presentation at the conference but not for the published proceedings. Both types of papers should be submitted electronically using the EasyChair submission page at https://www.easychair.org/account/signin.cgi?conf=aiml2014 At least one author of each accepted paper or short presentation must register for and attend the conference. (1) FULL PAPERS Authors are invited to submit, for presentation at the conference and publication in the proceedings, full papers reporting on original research and not submitted elsewhere. The proceedings of AiML-2014 will be published by College Publications http://www.collegepublications.co.uk in a volume to be made available at the conference. The submissions should be at most 15 pages, with an optional technical appendix of up to 5 pages, together with a plain-text abstract of 100-200 words. The submissions must be typeset in LaTeX, using the style files and template that are provided on the AiML-2014 website http://www.philos.rug.nl/AiML2014/ We also ask authors of full papers to submit the abstract in plain text via EasyChair by 14 March. (2) SHORT PRESENTATIONS. These should be at most 5 pages. They may describe preliminary results, work in progress etc., and will be subject to light reviewing. The accepted submissions will be made available at the conference, and the authors will have the opportunity to give short presentations (of up to 15 minutes) on them. IMPORTANT DATES Abstracts of full papers submission deadline: 14 March 2014 Full papers submission deadline: 21 March 2014 Full papers acceptance notification: 2 May 2014 Short presentations submission deadline: 12 May 2014 Short presentations acceptance notification: 2 June 2014 Final version of full papers and short presentations due: 9 June 2014 Conference: 5-8 August, 2014. LOCAL ORGANIZING COMMITTEE Dave Gilbert Barteld Kooi Bouke Kuijer Paolo Maffezioli Allard Tamminga PROGRAMME COMMITTEE Carlos Areces (FaMAF, Universitad Nacional de Cordoba, Argentina) Alexandru Baltag (ILLC, University of Amsterdam, The Netherlands) Nick Bezhanishvili (Utrecht University, The Netherlands) Patrick Blackburn (Roskilde University, Denmark) Hans van Ditmarsch (LORIA, France) David Fernández-Duque (ITAM, Mexico) Melvin Fitting (Lehman College, CUNY, USA) Mai Gehrke (LIAFA, Université Paris Diderot, France) Silvio Ghilardi (Università degli Studi di Milano, Italy) Rob Goldblatt (Victoria University of Wellington, New Zealand) Valentin Goranko (Technical University of Denmark) Guido Governatori (NICTA Queensland, Australia) Andreas Herzig (IRIT, Toulouse, France) Rosalie Iemhoff (Utrecht University, The Netherlands) Roman Kontchakov (Birkbeck College London, UK) Barteld Kooi (University of Groningen) Marcus Kracht (Universität Bielefeld, Germany) Alexander Kurz (University of Leicester, UK) Carsten Lutz (Universität Bremen, Germany) Jakub Michaliszyn (Imperial College London, UK) Larry Moss (Indiana University, USA) Hiroakira Ono (Japan Advanced Institute of Science and Technology) Revantha Ramanayake (Technical University of Vienna) Mark Reynolds (University of Western Australia) Vladimir Rybakov (Manchester Metropolitan University, UK) Renate Schmidt (University of Manchester, UK) Jeremy Seligman (University of Auckland, New Zealand) Ilya Shapirovsky (Institute for Information Transmission Problems, Moscow, Russia) Valentin Shehtman (Moscow State University, Russia) Dimiter Vakarelov (Sofia University, Bulgaria) Yde Venema (ILLC, University of Amsterdam, The Netherlands) Heinrich Wansing (Ruhr University Bochum, Germany) Michael Zakharyaschev (Birkbeck College London, UK) PROGRAMME COMMITTEE CO-CHAIRS Rajeev Gore (The Australian National University, Australia) Agi Kurucz (King's College London, UK) FURTHER INFORMATION. Please see http://www.philos.rug.nl/AiML2014 ENQUIRIES. E-mail enquiries should be directed to the PC co-chairs, sent to aiml2014(a)easychair.org

1 0

第48回 MLG 数理論理学研究集会のご案内[再送：講演・宿泊締切11月20日]
by Katsuhiko Sano 14 Nov '13

14 Nov '13

第48回 MLG 数理論理学研究集会のご案内（再送） (重複してお受け取りの際はご容赦ください。) 北陸先端科学技術大学院大学の佐野勝彦です。講演の申し込み締切（11月20日）まで一週間を切りましたので、再度ご案内させていただきます。 2013年度MLG数理論理学研究集会（第48回）を下記の要領で開催いたします。多くの方のご講演・ご参加をお待ちしております。 ========================================= 第48回 MLG 数理論理学研究集会開催要領 ========================================= 期間: 2013 年 12 月 6 日(金) 〜 12 月 8 日(日) 場所: 山中温泉河鹿荘ロイヤルホテル（JR加賀温泉駅から車で約20分，加賀温泉駅から送迎あり）〒922-0126 石川県加賀市山中温泉河鹿町ホ100 URL : http://www.daiwaresort.jp/kajikasou/ 講演・宿泊申込締め切り: 2013 年 11 月 20 日（水）申し込みはこちらから --> https://docs.google.com/forms/d/1W0cfix5awVjPBI71Bn7dK-LT1E_an2dizQMcoK5LST… ホームページ：https://sites.google.com/site/mlg2013kaga/ 連絡先E-mail :mlg.logic.japan [at] gmail.com ============ 参加募集 ============ ・講演時間は原則40分を予定しています。・12月7日（土）の夜に懇親会を行います。・全日程参加の場合，参加費（宿泊代・食事代・会場代）は25000円前後になる予定です。・ご講演をなさらなくても参加いただけます。山中温泉河鹿荘ロイヤルホテルで宿泊および食事をなさらない場合にも参加費（会場代）2500円をいただきます。・講演申し込みは、https://docs.google.com/forms/d/1W0cfix5awVjPBI71Bn7dK-LT1E_an2dizQMcoK5LSTk/viewform の registration form からお願い致します。世話人佐野勝彦〒923-1292 石川県能美市旭台1-1 北陸先端科学技術大学院大学情報科学研究科 MLG2013に関するメールは，mlg.logic.japan [at] gmail.com まで。 -- Katsuhiko Sano School of Information Science Japan Advanced Institute for Science and Technology IS building No.1 7F, 1-1 Asahidai, Nomi, Ishikawa, 923-1292, Japan

1 0

Kowalski先生講演
by Satoshi Tojo 13 Nov '13

13 Nov '13

みなさま， Imperial College London のRobert A. Kowalski 教授の講演を開催いたします。どうぞふるってご参加ください。問い合わせ先：東条　敏北陸先端科学技術大学院大学情報科学研究科 e-mail: tojo(a)jaist.ac.jp ------------------------------ ----------------- * JAIST Logic Seminar Series * Date: Thursday 21 November, 2013, 15:10--16:40 Place: JAIST, Collaboration room 7 (I-56) (Access: http://www.jaist.ac.jp/english/location/access.html) Speaker: Robert A. Kowalski (Imperial College London) Title: Towards a Logic-based Framework for Computing (Joint work with Fariba Sadri) Abstract: In this talk, I present a logic-based, framework for Computing, inspired by artificial intelligence, but scaled down for practical database and programming applications. Computation in the framework is viewed as the task of generating a sequence of state transitions, with the purpose of making an agent’s goals all true. States are represented by sets of atomic sentences (or facts), representing the values of program variables, tuples in a coordination language, facts in relational databases, or Herbrand models. In the model-theoretic semantics of the framework, the entire sequence of states and events is contained in a single model-theoretic structure, by associating time stamps with facts and events. But in the operational semantics, facts are updated destructively, without time stamps. We show that the model generated by destructive updates is identical to the model generated by reasoning with facts containing time stamps. We also extend the model with intentional predicates and composite event predicates defined by logic programs containing conditions in first-order logic, which query the current state. Speaker's bio： Professor Robert A. Kowalski (Emeritus Professor and Distinguished Research Fellow) at Imperial College London. Robert Kowalski studied at the University of Chicago, the University of Bridgeport, Stanford University, the University of Warsaw, and the University of Edinburgh, where he completed his PhD in 1970. Kowalski has been an advisor to the UNDP Knowledge Based Systems Project in India and to DFKI, the German Institute for Artificial Intelligence. He co-ordinated the European Community Basic Research Project, Compulog, and was the founder of the European Compulog Network of Excellence. Since 2009, he has been an advisor to the Department of Immunization, Vaccines and Biologicals, of the World Health Organization in Geneva. Kowalski is a Fellow of the Association for the Advancement of Artificial Intelligence, the European Co-ordinating Committee for Artificial Intelligence, and the Association for Computing Machinery. He received the IJCAI (International Joint Conference of Artificial Intelligence) award for Research Excellence in 2011. -- Professor Hajime Ishihara School of Information Science Japan Advanced Institute of Science and Technology 1-1 Asahidai, Nomi, Ishikawa 923-1292, Japan Tel: +81-761-51-1206 Fax: +81-761-51-1149 ishihara(a)jaist.ac.jp http://www.jaist.ac.jp/~ishihara

1 0

Talks by Ugo Dal Lago and Paul-Andre Mellies, This Friday (Nov 8)
by Ichiro Hasuo 07 Nov '13

07 Nov '13

Dear all, This coming Friday we have Ugo Dal Lago (Bologna) and Paul-Andre Mellies (Paris VII) visiting us in U Tokyo and making talks. Feel free to join us. See you there! Best regards, Ichiro Hasuo http://www-mmm.is.s.u-tokyo.ac.jp/?plain=false&lang=en&pos=seminar ------------------------------ Fri 8 November 2013, 10:00-12:00 Paul-Andre Mellies <http://www.pps.jussieu.fr/~mellies/> (U. Paris VII), What a geometry of reasoning would look like? 理学部7号館地下 007教室 Room 007 (underground floor), School of Science Bldg. No. 7 アクセス： https://www-mmm.is.s.u-tokyo.ac.jp/indexj.html Access: http://www-mmm.is.s.u-tokyo.ac.jp/ If one proceeds by analogy with mathematical physics, it is natural to inquire the geometric (rather than simply symbolic) nature of logical reasoning. In this introductory talk, I will describe how this question may be investigated starting from a series of recent advances at the converging point of proof theory and of programming language semantics. In particular, I will explain how a careful study of linear continuations, the most elementary mechanism common to proofs and to programs, enables one to evacuate the historical divide between classical and constructive logic, and reveals the existence of a logical pulsation which regulates reasoning and whose geometry is related to well-known structures in mathematical physics. Ugo Dal Lago <http://www.cs.unibo.it/~dallago/> (U. Bologna), Applicative Bisimulation for Probabilistic Lambda-Calculus 理学部7号館地下 007教室 Room 007 (underground floor), School of Science Bldg. No. 7 アクセス： https://www-mmm.is.s.u-tokyo.ac.jp/indexj.html Access: http://www-mmm.is.s.u-tokyo.ac.jp/ <http://www-mmm.is.s.u-tokyo.ac.jp/> We study bisimulation and context equivalence in a probabilistic lambda-calculus. Firstly, we show a technique for proving congruence of probabilistic applicative bisimilarity. While the technique follows Howe's method, some of the technicalities are quite different, relying on non-trivial "disentangling" properties for sets of real numbers. We then analyze the impact the employed notion of reduction has on full-abstraction, giving somewhat surprising results in the call-by-value case. We finally give another unexpected result about the discriminating power of probabilistic contexts on pure lambda-terms.

1 0

講演会のお知らせ
by KASHIMA Ryo 06 Nov '13

06 Nov '13

【一般向け講演会のお知らせ】日時：11月30日（土）15:00--16:30 会場：東京工業大学大岡山キャンパス西８号館Ｅ棟10階　　　情報理工学研究科大会議室講師：田中一之（東北大学）題目：数学パスルに挑む概要：知恵の輪、ソリティア、ルービック・キューブ、帽子パズルなど多種多様なパズルの世界に、天才チューリングが開発した計算可能理論を武器にして乗り込もう。ときには解けないと悟ることも正解である。ベネディクト・カンバーバッチがチューリングを演じる映画『The Imitation Game』の公開も待ち遠しい。案内ページ： http://www.is.titech.ac.jp/~kashima/Events/Lecture2013Tanaka.html どなたでもご参加いただけます。参加される方は下記宛にお申し込みください。 ------ 鹿島亮（東京工業大学情報理工学研究科） kashima(a)is.titech.ac.jp

1 0

JAIST Logic Seminar Series
by Hajime Ishihara 01 Nov '13

01 Nov '13

皆様 Imperial College London のRobert A. Kowalski 教授の講演を開催いたします。どうぞふるってご参加ください。問い合わせ先：東条　敏北陸先端科学技術大学院大学情報科学研究科 e-mail: tojo(a)jaist.ac.jp ----------------------------------------------- * JAIST Logic Seminar Series * Date: Thursday 21 November, 2013, 15:10--16:40 Place: JAIST, Collaboration room 7 (I-56) (Access: http://www.jaist.ac.jp/english/location/access.html) Speaker: Robert A. Kowalski (Imperial College London) Title: Towards a Logic-based Framework for Computing (Joint work with Fariba Sadri) Abstract: In this talk, I present a logic-based, framework for Computing, inspired by artificial intelligence, but scaled down for practical database and programming applications. Computation in the framework is viewed as the task of generating a sequence of state transitions, with the purpose of making an agent’s goals all true. States are represented by sets of atomic sentences (or facts), representing the values of program variables, tuples in a coordination language, facts in relational databases, or Herbrand models. In the model-theoretic semantics of the framework, the entire sequence of states and events is contained in a single model-theoretic structure, by associating time stamps with facts and events. But in the operational semantics, facts are updated destructively, without time stamps. We show that the model generated by destructive updates is identical to the model generated by reasoning with facts containing time stamps. We also extend the model with intentional predicates and composite event predicates defined by logic programs containing conditions in first-order logic, which query the current state. Speaker's bio： Professor Robert A. Kowalski (Emeritus Professor and Distinguished Research Fellow) at Imperial College London. Robert Kowalski studied at the University of Chicago, the University of Bridgeport, Stanford University, the University of Warsaw, and the University of Edinburgh, where he completed his PhD in 1970. Kowalski has been an advisor to the UNDP Knowledge Based Systems Project in India and to DFKI, the German Institute for Artificial Intelligence. He co-ordinated the European Community Basic Research Project, Compulog, and was the founder of the European Compulog Network of Excellence. Since 2009, he has been an advisor to the Department of Immunization, Vaccines and Biologicals, of the World Health Organization in Geneva. Kowalski is a Fellow of the Association for the Advancement of Artificial Intelligence, the European Co-ordinating Committee for Artificial Intelligence, and the Association for Computing Machinery. He received the IJCAI (International Joint Conference of Artificial Intelligence) award for Research Excellence in 2011. -- Professor Hajime Ishihara School of Information Science Japan Advanced Institute of Science and Technology 1-1 Asahidai, Nomi, Ishikawa 923-1292, Japan Tel: +81-761-51-1206 Fax: +81-761-51-1149 ishihara(a)jaist.ac.jp http://www.jaist.ac.jp/~ishihara

1 0

数学基礎論若手の会（11月15日-11月17日）のご案内
by Yoshihito Tanaka 01 Nov '13

01 Nov '13

数学基礎論若手の会2013のご案内（プログラムが準備できました）数学基礎論若手の会は，数学基礎論を専攻する学生および若手研究者の研究交流を目的とする合宿形式の研究集会です．講演はオリジナルの成果発表に限らず，研究の途中報告や研究内容の紹介など幅広く募集しています．また，これから数学基礎論を勉強したいと思っている方のご参加も歓迎します．多くの方のご参加・ご講演をお待ちしています．数学基礎論若手の会2013開催要領日時：2013年11月15日（金） - 2013年11月17日（日）講演会場：九州産業大学2号館2E406 宿泊：九州産業大学立花寮1階立花研修所幹事：田中義人（九州産業大学） E-mail：ytanaka(a)ip.kyusan-u.ac.jp 数学基礎論若手の会2013ホームページ： http://www.ip.kyusan-u.ac.jp/J/ms/event/wakate13/notice.html プログラム： http://www.ip.kyusan-u.ac.jp/J/ms/event/wakate13/program.html 講演および宿泊のお申し込みの受け付けは終了いたしました． 11月16日（土）19:30より，懇親会を予定致しております．参加をご希望なさる方は，11月10日（日）までに，幹事までご連絡ください．

1 0

CREST 特任教員の募集（計算言語学、形式意味論、計算論理学）（〆切
by BEKKI Daisuke 01 Nov '13

01 Nov '13

$B!J=EJ#$7$F<u$1<h$i$l$?>l9g$O$4MF<O$/$@$5$$!K(J JST$B!&(JCREST$B8&5fNN0h!V%S%C%0%G!<%?4pHW!W(J http://www.jst.go.jp/kisoken/crest/research_area/ongoing/bunyah25-6.html $B$K$*$$$F!"$3$N$?$S:NBr$5$l$^$7$?8&5f2]Bj!'(J $B!VCN<1$K4p$E$/9=B$E*8@8l=hM}$N3NN)$HCN<1%$%s%U%i$N9=C[!W(J $B!J8&5fBeI=<T!'9u66DwIW!"8&5fJ,C4<T!'4%7rB@O:!"8M<!Bg2p!"5\HxM42p!K(J $B$r?d?J$9$k$?$a$K!"2<5-$N$H$*$j!"FCG$650w$N8xJg$r9T$$$^$9!#$J$*!"K\(J $B8xJg$K4X$7$F$O!"(JJREC-IN$B$N0J2<$N9`L\$b$4;2>H2<$5$$!#(J http://jrecin.jst.go.jp/seek/SeekJorDetail?fn=4&id=D113101576&ln_jor=0 $B5-(J 1. $B?&L>5Z$S?M0w(J $BFCG$=Z65<x$^$?$OFCG$=u65(J $B7W#2L>!JG$4|IU$-!K(J 2. $B=jB0(J $B$*Cc$N?e=w;RBg3X%7%_%e%l!<%7%g%s2J3X650i8&5f%;%s%?!<(J 3. $B6PL3>l=j(J $B$*Cc$N?e=w;RBg3X(J $BEl5~ETJ85~6hBgDM#2CzL\#1HV#19f(J $B:G4s$j1X!'El5~%a%H%m4]%NFb@~h,2YC+1XKt$OM-3ZD.@~(J $B8n9q;{1X$+$iELJb#7J,(J 4. $B@lLgJ,Ln(J $B7W;;8@8l3X!"7A<00UL#O@!"7W;;O@M}3X(J 5. $B?&L3FbMF(J $B!V0UL#$NI=8=!&7W;;%b%G%k$N9=C[!W$N8&5f!"(J $BFC$K0J2<$N%F!<%^(J(1)$B$^$?$O(J(2)$B$K4X$9$k8&5f$r9T$&!#(J (1) $BHOaFJ8K!Ey$N7A<0J8K!M}O@$K4p$E$/9b@:EY$J9=J82r@O(J $B!J9qN)>pJs3X8&5f=j(J $B5\Hx8&5f<<$H$N6&F18&5f!K(J (2) $B%b%@%j%F%#!&A0Ds$J$I$N8@8l8=>]$rBP>]$H$7$?!"9b3,7?M}O@$K4p$E$/(J $B0UL#7W;;$N<BAuEy$K4X$9$k8&5f(J $B!J$*Cc$N?e=w;RBg3X(J $B8M<!8&5f<<$H$N6&F18&5f!K(J 6. $B1~Jg;q3J(J (1) $BGn;N$N3X0L$^$?$O$3$l$HF1Ey$N8&5fG=NO$rM-$9$kJ}!#(J $BJ?@.(J25$BG/EYCf$KGn;N<hF@8+9~$_$NJ}$b4^$`!#(J (2) $B?&L3$N?k9T$KI,MW$H$5$l$kCN<1$d5;=Q$rM-$9$k$3$H!#(J 7. $B8[MQ4|4V(J $BJ?@.(J26$BG/(J4$B7n(J1$BF|0J9_$J$k$Y$/Aa$$;~4|!AJ?@.(J27$BG/(J3$B7n(J31$BF|(J $BG/EYKh$KO+;HAPJ}$N9g0U$K$h$j99?7$9$k$3$H$,$"$jF@$k!#(J $B$J$*!"99?7$O:GD9$GJ?@.(J31$BG/(J3$B7n(J31$BF|!J%W%m%0%i%`$N(J $B=*N;!K$^$G$H$9$k!#(J 8. $B="6H;~4V(J 8$B!'(J30$B!A(J17$B!'(J15$B!J7nMKF|!A6bMKF|!K$r4pK\$H$9$k:[NL(J $BO+F/@)$H$9$k!#(J $B!J>e5-;~4V$O5Y7F;~4V(J60$BJ,$r4^$`!K(J 9. $B5YF|!&5Y2K(J $B5YF|!'EZMKF|!&F|MKF|!"9qL1$N=KF|5Z$SG/KvG/;O(J $B!J(J12$B7n(J29$BF|!A(J1$B7n(J3$BF|!K(J $B5Y2K!'G/<!M-5k5Y2K!"IB5$5Y2K!"FCJL5Y2K(J 10. $B5kM?(J $BK\3X5kM?5,Dx$K4p$E$-;Y5k$9$k!#(J $B4pK\G/Jp!J4pK\G/Jp$r(J12$B7n$G3d$C$?3[$rKh7n;Y5k!K(J $BFCG$=Z65<x(J600$BK|1_!"FCG$=u65(J360$BK|1_(J $B@G6b5Z$SJ!Mx8|@8Hq!J8[MQJ]81NA!"6&:QAH9g3]6b!K$N(J $B<+8JIiC4J,$r95=|$9$k!#(J 11. $B<jEv(J $BK\3X5kM?5,Dx$K4p$E$-DL6P<jEv$r;Y5k$9$k!#(J $B$J$*!"4|Kv!&6PJY<jEv$N;Y5k$O$J$7!#(J $B!J$?$@$7!"DL6P5wN%$,#2-RL$K~$N>l9g$O!"DL6P<jEv$r(J $B;Y5k$7$J$$!#$^$?!":NMQF|$,7n$NCfES$N>l9g!"DL6P<j(J $BEv$OMb7n$+$i;Y5k$9$k!#!K(J 12. $BB`?&<jEv(J $B;Y5k$J$7!#(J 13. $B2CF~J]81(J $BO+:R!"8[MQJ]81!"J8It2J3X>J6&:QAH9g$K2CF~$9$k!#(J 14. $BDs=P=qN`(J (1) $BMzNr=q!J<L??E=IU!"Fh0u!"3XNr!&?&Nr!&<u>^Nr!&=jB0(J $B3X2q!&=;=j!&(JE-mail$B%"%I%l%9Ey$rL@5-$N$3$H!K(J (2) $B8&5f6H@S0lMw!JCx=q!"O@J8!J?3::$NM-L5JL!K!">7BT9V(J $B1i!"3X2qH/I=!"$=$NB>$KJ,N`$9$k$3$H!K(J (3) $B<gMW$JCx=q!"O@J8Ey$NJL:~$jKt$O<L$7!J(J3$BE@0JFb(J $B6H@S(J $B0lMwCf$K!{0u$rIU$9$3$H!K(J (4) $B=w;RBg3X$K650w$H$7$F="?&$9$k$3$H$X$NJzIi(J $B!J(J1,000$B;zDxEY!K(J (5) $BK\3X$G9T$*$&$H$9$k8&5f$K4X$9$kJzIi(J $B!J$3$l$^$G$N8&5f6H@S$rF'$^$($F5-:\$9$k$3$H!K(J $B!J(J2,000$B;zDxEY!K(J (6) $B=$N;!J8+9~$_!K>ZL@=q<c$7$/$O3X0L<xM?>ZL@=q(J (7) $B#2L>$NJ}$+$i$N?dA&>uKt$O1~Jg<T$K$D$$$F=j8+$r5a$a(J $BF@$kJ}#2L>$N;aL>5Z$SO"Mm@h(J (8) $B1~Jg=qN`JVAwMQIuE{!J!ZHw9M![;2>H!K(J $B$J$*!"(J(3)(8)$B0J30$O!"=q<0$r86B'#A#4H=$KE}0l$9$k$3$H!#(J 15. $BA*9MJ}K!(J (1) $BBh#1<!A*9M(J $B=qN`?3::(J $BA*9M7k2L$O!"K\?M08$KM9Aw$K(J $B$FDLCN$7$^$9!#(J (2) $BBh#2<!A*9M(J $BBh#1<!A*9M9g3J<T$KBP$7$F$N$_LL@\?3::(J $BLL@\?3::$G$O!"%W%l%<%s%F!<%7%g%s$r<B;\$N>e!"<A5?(J $B1~Ez$r9T$$$^$9!#(J $B%W%l%<%s%F!<%7%g%s2]Bj!&<B;\F|;~Ey>\:Y$O!"Bh#1<!(J $BA*9M9g3J<T$K!"Bh#1<!A*9M7k2L$HJ;$;$FDLCN$7$^$9!#(J $B$J$*!"LL@\Ey$K78$kN9Hq!"=IGqHqEy$O1~Jg<T$NIiC4$H(J $B$7$^$9!#:G=*E*$JA*9M7k2L$O!"K\?M08$KM9Aw$K$FDLCN(J $B$$$?$7$^$9!#(J 16. $BDs=P4|8B(J $BJ?@.(J25$BG/(J12$B7n(J10$BF|!J2P!K@58aI,Ce(J 17. $BDs=P@h(J $B")(J112-8610 $BEl5~ETJ85~6hBgDM#2CzL\#1HV#19f(J $B9qN)Bg3XK!?M$*Cc$N?e=w;RBg3XD9(J $B1)F~:4OB;R(J $B08(J 18. $BLd9g$;@h(J $B$*Cc$N?e=w;RBg3XBg3X1!(J $B?M4VJ82=AO@.2J3X8&5f2J<+A3!&1~MQ2J3X7O(J $B=Z65<x(J $B8M<!Bg2p(J E-mail$B!'(J bekki.daisuke(a)ocha.ac.jp $B$*Ld$$9g$o$;$O!"86B'EE;R%a!<%k$G$*4j$$$$$?$7$^$9!#(J $B!ZHw9M![(J $B1~Jg=qN`$O!"IuE{I=LL$K!VFCG$650w!J8M<!8&5f<<!K1~Jg=qN`:_Cf!W$H<k(J $B5-$7!"=qN1Kt$O4J0W=qN1$GM9Aw!JBpG[JX$b2D!K$N$3$H!#$J$*!"1~Jg=qN`$O(J $BJV5Q$9$k$N$G!"I,$:JVAwMQIuE{!J@Z<jEyE=IU!"JVAw08@hL@5-!K$rF1Iu$9$k(J $B$3$H!#(J $B$J$*!"K\8&5f%W%m%8%'%/%H$K4XO"$7$F!"5~ETBg3X!&ElKLBg3X$K$*$$$F$b(J $B!VCN<1$K4p$E$/9=B$E*8@8l=hM}!W!V%F%-%9%H2#CGE*$J>pJs!&CN<1$N4X78IU(J $B$1!W$K4X$7$F(J5$BL>$NFCDj650w!&8&5f0w$rJg=8$7$F$$$^$9!#(J http://jrecin.jst.go.jp/seek/SeekJorDetail?fn=3&id=D113100925&ln_jor=0

1 0

Postdoc position on compiling hybrid differential equations
by Kohei SUENAGA 30 Oct '13

30 Oct '13

皆様， # 重複して受け取られた場合はご容赦ください．京都大学の末永と申します．スウェーデンのハルムスタード大学の Walid Taha さんがポスドクを募集しています．Taha さんは最近 Acumen というハイブリッドシステムのモデリング言語を作っておられるのですが，その言語のコンパイラについて研究するポストのようです．興味をお持ちの方は Taha さんに直接コンタクトをお取りください．末永幸平 -- Postdoc position on compiling hybrid differential equations An NSF CPS project on Robot Design is building foundations and tools for the simulation of hybrid (continuous/discrete) systems. The project has an opening a postdoctoral research with Professor Taha at Rice University. The successful candidate will design and evaluate compilation strategies forenclosure-based solvers for hybrid differential equations, and will be part of the team developing the Acumen modeling language. Applicants for this position should have strong skills and interest in functional programming theory and practice; property-based testing; performance analysis; and Scala. Excellent communication and collaboration skills are required for both independent and collaborative team work. Priority will be given to applicants who already hold a doctoral degree in Computer Science, but applicants with suitable skills and interests who hold a doctorate in Mathematics, Physics, Electrical Engineering or Mechanical Engineering are also encouraged to apply. Desirable experience includes experience with writing numerical codes, interval and enclosure methods, domain theory, operational semantics, formal verification, differential equations, hybrid/impulsive differential equations, and mechanical hardware design and control, especially in the context of robotics. Desirable skills also include facility with Haskell, OCaml, ML, Scheme, Mathematica, Maple, OpenGL, Matlab, Simulink, and other modeling and simulation tools. The position is for one year, renewable to two years, and is subject to the availability of funding. The successful applicant will likely spend part of their time in Halmstad, Sweden (50%) as part of the collaboration. Successful applicants may start by the end of December 2013 or early March 2014. The deadline for applications is November 29th, 2013. Application for this position should be sent directly to Professor Taha by email. The title of the email should be (without quotes) "Postdoc Position on Compiling Hybrid Differential Equations". The application should consist of one, self-contained PDF attachment. The application should include 1) a brief cover letter including motivation for the application, 2) a CV, and 3) a list of names of references. It is also suggested that the application include online pointers to previous publications or software produced by the applicant. -- 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

Fwd: [jacap:205] Matthias Schrin氏の講演会のお知らせ(CAPE)
by Shunsuke Yatabe 30 Oct '13

30 Oct '13

皆様、京都大学で開催される数学の哲学の研究会について、ご案内をご転送させて頂きます。矢田部俊介 ---------- Forwarded message ---------- From: 応用哲学会事務局 <jacap-secretary(a)ethics.bun.kyoto-u.ac.jp> Date: 2013/10/29 Subject: [jacap:205] Matthias Schrin氏の講演会のお知らせ(CAPE) To: "jacap(a)googlegroups.com" <jacap(a)googlegroups.com> 皆様来る10月31日（木）に、CAPEレクチャーとして、Matthias Schrin氏の講演会が以下の要領で開催されます。直前のご連絡になってしまい、申し訳ありません。皆様のご参加をお待ちしております。京都大学大学院文学研究科附属応用哲学・倫理学教育研究センター http://www.bun.kyoto-u.ac.jp/cape/cape-top_page/ 事務補佐　　天野恵美理〒606-0085 京都市左京区吉田本町　京都大学文学部内 CAPE(a)bun.kyoto-u.ac.jp 講師：Prof. Dr. Matthias Schrin （ミュンヘン大学）演題：Hilbert and Wittenstein on the Consistency of Mathematical Theory 日時：2013年10月31日（木）18時〜場所：京都大学吉田キャンパス総合研究棟２号館第10演習室 http://www.kyoto-u.ac.jp/ja/access/campus/map6r_y.htm （34番の建物です）要旨：添付書類をご参照ください。 -- --- このメールは Google グループのグループ「応用哲学会」の登録者に送られています。このグループから退会し、メールの受信を停止するには、jacap+unsubscribe(a)googlegroups.com にメールを送信します。その他のオプションについては、https://groups.google.com/groups/opt_out にアクセスしてください。

1 0

CMCS'14: Coalgebraic Methods in Computer Science, Grenoble (France), 5-6 Apr 2014
by Katsuhiko Sano 26 Oct '13

26 Oct '13

皆様、北陸先端科学技術大学院大学の佐野勝彦です。 CMCS'14 のCall for Papersをお送りいたします。今回のCMCS'14では東京大学の蓮尾一郎さんの招待講演があります。皆様、どうぞふるって論文をご投稿ください。締切は2014年1月です。 ---------------------------------- Call for Papers 12th International Workshop on Coalgebraic Methods in Computer Science (CMCS'14) 5 - 6 April 2014, Grenoble, France http://www.coalg.org/cmcs14 Objectives and scope ------------------- Established in 1998, the CMCS workshops aim to bring together researchers with a common interest in the theory of coalgebras, their logics, and their applications. As the workshop series strives to maintain breadth in its scope, areas of interest include neighbouring fields as well. Topics of interest include, but are not limited to, the following: - The theory of coalgebras (including set theoretic and categorical approaches) - Coalgebras as computational and semantical models (for programming languages, dynamical systems, term rewriting, etc.) - Coalgebras in (functional, object-oriented, concurrent, and constraint) programming - Model checking, theorem proving and deductive verification using coalgebraic techniques - Coalgebraic data types, type systems and behavioural typing - Proof principles and (coinductive) definitions for coalgebras (e.g. with bisimulations or invariants) - Coalgebras and algebras - Coalgebraic specification and verification - Coalgebras and (modal) logic - Coalgebra and control theory (notably of discrete event and hybrid systems) - Coalgebra in quantum computing - Coalgebra and game theory - Tools exploiting colgebraic techniques Venue and event --------------- CMCS??14 will be held in Grenoble, France, co-located with ETAPS 2014 on 5 - 6 April 2014. Important dates --------------- Abstract regular papers 6 January 2014 Submission regular papers 10 January 2014 (strict) Notification regular papers 14 February 2014 Camera-ready copy 21 February 2014 Submission short contributions 23 February 2014 (strict) Notification short contributions 9 March 2014 Invited speakers ---------------- Ichiro Hasuo, University of Tokyo, JP Marina Lenisa, University of Udine, IT Programme committee ------------------- Andreas Abel, Ludwig-Maximilians-University Munich, DE Davide Ancona, University of Genova, IT Adriana Balan, University Politehnica of Bucharest, RO Marta Bilkova, Charles University, CZ Filippo Bonchi, LIP ENS-Lyon, FR Marcello Bonsangue (chair), Leiden University, NL Joerg Endrullis, Free University of Amsterdam, NL Remy Haemmerle, University Politecnica de Madrid, SP Bart Jacobs, Radboud University Nijmegen, NL??? Dexter Kozen, Cornell University, US Bartek Klin, University of Warsaw, PL Pierre Lescanne, ENS Lyon, FR Stefan Milius, University of Erlangen-Nurenberg, DE Rob Myers, Technical University of Braunschweig, DE Dirk Pattinson, Australian National University, AU Daniela Petrisan, University of Leicester, UK Grigore Rosu, University of Illinois at Urbana-Champaign, US Katsuhiko Sano, JAIST, Nomi, JP Monika Seisenberger, Swansea University, UK Ana Sokolova, University of Salzburg, AT Publicity chair --------------- Alexandra Silva, Radboud University Nijmegen, NL PC chair -------- Marcello Bonsangue, Leiden University, NL Steering committee ------------------ Jiri Adamek, Technical University of Braunschweig, DE Marcello Bonsangue, Leiden University, NL Corina Cirstea, University of Southampton, UK H. Peter Gumm (chair), University of Marburg, DE Bart Jacobs, Radboud University Nijmegen, NL Alexander Kurz, University of Leicester, UK Marina Lenisa, University of Udine, IT Ugo Montanari, University of Pisa, IT Larry Moss, Indiana University, US Dirk Pattinson, Australian National University, AU John Power, University of Bath, UK Horst Reichel, Technical University of Dresden, DE Jan Rutten, CWI and Radboud University Nijmegen, NL Lutz Schroeder, University of Erlangen-Nurenberg, DE Submission guidelines --------------------- We solicit two types of contributions: regular papers and short contributions. Regular papers must be original, unpublished, and not submitted for publication elsewhere. They should not exceed 20 pages in length in Springer LNCS style. Short contributions may describe work in progress, or summarise work submitted to a conference or workshop elsewhere. They should be no more than two pages. Regular papers and short contributions should be submitted electronically as a PDF file via the Easychair system at http://www.easychair.org/conferences/?conf=cmcs2014. The proceedings of CMCS 2014 will include all accepted regular papers and will be published post-conference as a Springer volume in the IFIP-LNCS series. Accepted short contributions will be bundled in a technical report.

1 0

JAIST Logic Seminar Series
by Hajime Ishihara 26 Oct '13

26 Oct '13

皆様リュブリャナ大学のAndrej Bauer教授の講演のお知らせです。ふるってご参加ください。問合せ先：石原　哉北陸先端科学技術大学院大学情報科学研究科 e-mail: ishihara(a)jaist.ac.jp -------------------------------------------------- * JAIST Logic Seminar Series * * This seminar is held as a part of the EU FP7 Marie Curie Actions IRSES project COMPUTAL (http://computal.uni-trier.de/). Date: Friday 20 September, 2013, 15:00-17:00 Place: JAIST, Collaboration room 6 (I-57g) (Access: http://www.jaist.ac.jp/english/location/access.html) Speaker: Professor Andrej Bauer (University of Ljubljana, Slovenia) Title: A higher inductive construction of the real numbers Abstract: Homotopy type theory [1] is a foundation of mathematics based on Martin-Löf type theory extended with the Univalence axiom and higher inductive types. The latter allow us to present mathematical objects as inductive types generated by point and path constructors. For instance, the circle is represented by a type with a point and a loop satisfying the "circle induction" principle. In the first part I shall review higher inductive types. In the second part of the talk I shall look at a higher inductive construction of real numbers. Ordinary higher inductive types do not seem to suffice -- instead we have to use a higher inductive-inductive definition which simultaneously constructs the reals and a proximity relation on them. We thus obtain a type of real numbers which satisfies a principle of "real induction". We can prove properties of reals by induction! From a logical point of view the construction is interesting because it avoids the axiom of choice, impredicativity (powersets), and excluded middle. Nevertheless, the resulting theory still allows us to develop the basics of real analysis as usual. The work described in the talk is joint work of the members of the Univalent foundations project [2]. References: [1] Univalent Foundations Project: "Homotopy type theory: Univalent foundations of Mathematics", http://homotopytypetheory.org/book/ [2] Univalent Foundations Project, Institute for Advanced Study, Princeton, http://www.math.ias.edu/sp/univalent -- Professor Hajime Ishihara School of Information Science Japan Advanced Institute of Science and Technology 1-1 Asahidai, Nomi, Ishikawa 923-1292, Japan Tel: +81-761-51-1206 Fax: +81-761-51-1149 ishihara(a)jaist.ac.jp http://www.jaist.ac.jp/~ishihara

1 2

Kobe Colloquium on Logic, Statistics and Informatics, October 25 (Bernhard Koenig)
by Joerg Brendle 24 Oct '13

24 Oct '13

Kobe Colloquium on Logic, Statistics and Informatics 以下の要領でコロキウムを開催します。日時：2013年10月25日（金）15:10-16:10 講演者：Bernhard Koenig 場所：神戸大学自然科学総合研究棟3号館4階421室（プレゼンテーション室） ============================================================ 題目： Variations of Laver's indestructibility result and some applications アブストラクト： We show that a supercompact cardinal kappa can be made indestructible under a class of forcings which is slightly larger than Laver's class of kappa-directed closed forcings. We go on to discuss how this slight strengthening over Laver's original result can be used for some interesting new consistency results. ============================================================ 交通：阪急六甲駅またはJR六甲道駅から神戸市バス36系統「鶴甲団地」行きに乗車，「神大本部工学部前」停留所下車，徒歩すぐ． http://www.kobe-u.ac.jp/info/access/rokko/rokkodai-dai2.htm

1 0

NUE seminar (34)
by Yoshihito Toyama 23 Oct '13

23 Oct '13

第 34 回 NUEセミナーのお知らせ東北大学・電気通信研究所・外山研究室ではNUEセミナーを開催しています。テーマはプログラム理論や定理自動証明を中心に、情報科学の理論的なさまざまな話題をとりあげています。興味をおもちの方はどなたでもフラリと気楽におたちより下さい。 ********************************************* 日時：　１０月２９日（火）１３：３０ -- １４：３０場所：東北大学・電気通信研究所・２号館・２階セミナー室 (W214) ********************************************* 講演話題提供者： Vincent van Oostrom (Utrecht University) 題目： Z Syntax-Free Developments 概要： We introduce the Z-property for abstract rewriting systems, and show that it can be used to prove confluence of several well-known term rewrite systems (terminating or not, and overlapping or not), in particular: - the applicative TRS for associativity: (xy)z -> x(yz); - the applicative TRS for self-distributivity: (xy)z -> xz(yz); - lambda-calculus with beta-reduction: (\x.M)N -> M[x:=N]. Turning to meta-theoretical properties, we first show that the Z-propery allows to recover the traditionally syntactically defined notion of (super)development/multistep in a syntax-free way. To that end, we show the equivalence between the Z-property and Takahashi's angle-property. Next, we showing that the Z-property not only entails confluence, but also the existence of a hyper-cofinal strategy. We conclude by presenting further (non-)examples of rewrite systems having the Z-property, and some open questions. (joint work with Patrick Dehornoy) ============================================== NUEセミナーに関する問い合わせは以下にどうぞ。外山芳人〒980-8577 仙台市青葉区片平 2-1-1 東北大学電気通信研究所 TEL 022 217 5449 FAX 022 217 5452 MAIL toyama(a)nue.riec.tohoku.ac.jp

1 0

Talk by Bakhadyr Khoussainov , Wednesday this week (23 Oct)
by Hiroyuki Miyoshi 22 Oct '13

22 Oct '13

sonoteno, logic-ml, jssst-ppl 各メーリングリストの皆様、京都産業大学理学部数理科学科の三好博之です。先ほど、蓮尾さんから東京大学でのBakhadyr Khoussainovさんの講演会のアナウンスが有りましたが、京都産業大学でも明日10/23（水） 14:00-15:00 に京都産業大学万有館（バスプールからエスカレーターを2つ乗り継いだ正面の建物） 3階セミナー室にて談話会が行われます。東大の講演より少し時間が短いですがAbstractを見るとだいたい同じ内容のようです。アナウンスが遅れて申し訳ありませんが皆様の参加をお待ちしています。三好博之 ******************************************* Speaker Bakhadyr Khoussainov 氏（University of Auckland） Title An excursion to computable structures Date 2013年10月23日（水） 14:00--15:00 Place 万有館3階セミナー室 Abstract In this talk we introduce the concept of computable structure. We discuss the history of the subject, present motivation, topics and questions that have developed the subject over many years. We explain the role of computability and logic in the study of various mathematical structures. The talk will be quite informal, non-technical, and will contain a good amount of examples and explanations. ******************************************* 三好博之 2013/10/22 Ichiro Hasuo <ichiro(a)is.s.u-tokyo.ac.jp>: > Dear all, > > Friday next week we have Bakhadyr Khoussainov from > University of Auckland visiting us in U Tokyo and making a talk > on automatic structures (NB. automaton -> automatic). > No registration needed. See you there! > > Best regards, > Ichiro Hasuo > http://www-mmm.is.s.u-tokyo.ac.jp/?plain=false&lang=en&pos=seminar > > ______________________________ > > Fri 1 November 2013, 10:30-12:00 > > Bakhadyr Khoussainov (U. Auckland), > An excursion from computable to automatic structures > > 理学部7号館地下 007教室（いつもの1階の部屋ではありません） > Room 007 (underground floor), School of Science Bldg. No. 7 > > アクセス： https://www-mmm.is.s.u-tokyo.ac.jp/indexj.html > Access: http://www-mmm.is.s.u-tokyo.ac.jp/ > > In this talk we introduce two classes of structures: computable structures and > automatic structures. We present several examples, theorems, research topics > in the areas, and discuss their motivations, proofs and importance. > The goal will > be to make a transition from computable to automatic structures with an eye > towards decidability. We also give some historical perspective. > > -- > このメールは Google グループのグループ「sonoteno」の登録者に送られています。 > このグループから退会し、メールの受信を停止するには、sonoteno+unsubscribe(a)googlegroups.com にメールを送信します。 > このグループに投稿するには、sonoteno(a)googlegroups.com にメールを送信してください。 > http://groups.google.com/group/sonoteno からこのグループにアクセスしてください。

1 0

Talk by Bakhadyr Khoussainov on automatic structures, Friday next week (1 Nov)
by Ichiro Hasuo 22 Oct '13

22 Oct '13

Dear all, Friday next week we have Bakhadyr Khoussainov from University of Auckland visiting us in U Tokyo and making a talk on automatic structures (NB. automaton -> automatic). No registration needed. See you there! Best regards, Ichiro Hasuo http://www-mmm.is.s.u-tokyo.ac.jp/?plain=false&lang=en&pos=seminar ______________________________ Fri 1 November 2013, 10:30-12:00 Bakhadyr Khoussainov (U. Auckland), An excursion from computable to automatic structures 理学部7号館地下 007教室（いつもの1階の部屋ではありません） Room 007 (underground floor), School of Science Bldg. No. 7 アクセス： https://www-mmm.is.s.u-tokyo.ac.jp/indexj.html Access: http://www-mmm.is.s.u-tokyo.ac.jp/ In this talk we introduce two classes of structures: computable structures and automatic structures. We present several examples, theorems, research topics in the areas, and discuss their motivations, proofs and importance. The goal will be to make a transition from computable to automatic structures with an eye towards decidability. We also give some historical perspective.

1 0

JAIST Logic Seminar Series
by Takako Nemoto 22 Oct '13

22 Oct '13

皆様 JAIST Logic Seminar Seriesのお知らせです。ふるってご参加ください。問合せ先：根元多佳子北陸先端科学技術大学院大学情報科学研究科 e-mail: nemototakako(a)gmail.com ------------------------------ * JAIST Logic Seminar Series * Date: Tuesday 29 October, 2013, 15:30- Place: Collaboration room 6 (I-57g) (Access: http://www.jaist.ac.jp/english/location/access.html) Speaker: Prof. Martin Ziegler (Technische Universitaet Darmstadt) Title: Real Parameterized and Second-Order Complexity Theory: from Computability in Analysis to Numerical Practice Abstract: http://www.jaist.ac.jp/~t-nemoto/Ziegler_talk.pdf

1 0

10/25(金) Matthias Schirn 博士講演会 Hilbert and Wittgenstein on the Consistency of Mathematical Theories
by 秋吉亮太 21 Oct '13

21 Oct '13

10/25(金) Matthias Schirn 博士講演会「Hilbert and Wittgenstein on the Consistency of Mathematical Theories」のお知らせ次のような講演会を予定していますので案内させていただきます。講演者： Matthias Schirn (Munich Center for Mathematical Philosophy (LMU, Munich)) 講演題目： HILBERT AND WITTGENSTEIN ON THE CONSISTENCY OF MATHEMATICAL THEORIES (＊発表言語は英語) ディスカッションコーディネータ：岡田光弘（慶應義塾大学哲学専攻）開催日時：2013年10月25日（金）17:00-18:30 Date: October 25, 2013 (Fri) 17:00-18:30 開催場所：慶應義塾大学三田キャンパス東館4階セミナー室 Place: Seminar Room, 4F of East Research Building, Mita campus of Keio University. http://www.keio.ac.jp/en/maps/mita.html 参加方法：事前登録不要・参加費無料共催：慶應義塾大学「論理と感性」のグローバルリサーチセンター慶應義塾大学「思考と行動判断」の研究拠点 ――――――――――――――――――――――――――――――――――――――――――― お問い合わせ先：慶應義塾大学「思考と行動判断」の研究拠点事務局（担当：中村・小室） think-judge(a)abelard.flet.keio.ac.jp

1 0

Talk by Masahiko Sato, 14 Nov. Thu 11:00-
by Shinya Katsumata 18 Oct '13

18 Oct '13

京都大学数理解析研究所の勝股です。 11月14日11:00から、佐藤雅彦京都大学名誉教授に以下の講演をしていただくことになりましたので、ご連絡いたします。どうぞお気軽にお越しください。 ========== Time: 11:00-12:00, 14 Nov, 2013 Place: Rm 478, Research Building 2, Main Campus, Kyoto University http://www.kyoto-u.ac.jp/en/access/campus/main.htm (See 34) 京都大学本部構内総合研究2号館 4階478号室 http://www.kyoto-u.ac.jp/ja/access/campus/map6r_y.htm (34番の建物) Speaker: Professor Emeritus Masahiko Sato Title: Viewing lambda terms through maps (Joint work with Randy Pollack, Helmut Schwichtenberg and Takafumi Sakurai) Abstract: In this talk we introduce the notion of map, which is a notation for the set of occurrences of a symbol in a syntactic expression such as a formula or a lambda-term. We use binary trees over 0 and 1 as maps, but some well-formedness conditions are required. We develop a representation of lambda terms using maps. The representation is concrete (inductively definable) and canonical (one representative per lambda-term). We define substitution for our map representation, and prove the representation is in substitution preserving isomorphism with both nominal logic lambda-terms and de~Bruijn nameless terms. These proofs are mechanically checked in Isabelle/HOL and Minlog respectively. The map representation has good properties. Substitution does not require adjustment of binding information: neither alpha-conversion of the body being substituted into, nor de Bruijn lifting of the term being implanted. We have a natural proof of the substitution lemma of lambda calculus that requires no fresh names, or index manipulation. Using the notion of map we study conventional raw lambda$syntax. E.g. we give, and prove correct, a decision procedure for alpha-equivalence of raw lambda terms that does not require fresh names.

1 0

チュートリアル "Vagueness and Fuzzy Logic" のお知らせ
by Shunsuke Yatabe 16 Oct '13

16 Oct '13

みなさま（重複して受け取られた場合はご容赦ください）今年の１0月に東京で開催される LENLS 10 (Logic and Engineering of Natural Language Semantics 10) 国際ワークショップのチュートリアル・コースとして、以下を開催することとなりました。このチュートリアルは、LENLS参加登録者に限らず、興味をお持ちの方はどなたでもご参加いただけます。皆様のご参加をお待ちしております。矢田部俊介（西日本旅客鉄道／京都大学） Tutorial Lecture: ================= On October 26th (Sat), there will be a tutorial lecture at Ochanomizu University. Lecturer: Nicholas J.J. Smith (The University of Sydney) Venue: Ochanomizu UniversityFaculty of Science, Building 3, Room 207-209 (2nd Floor) (http://www.ocha.ac.jp/en/access/index.html) Time Table: 10:00-12:00 Session 1 12:00-14:00 Lunch 14:00-16:00 Session 2 Title: Vagueness and Fuzzy Logic Abstract -------- The aim of this tutorial is to give a positive appraisal of the prospects for a fuzzy logic based solution to the problems of vagueness. The tutorial will be divided into the following sections (time permitting). I. An overview of the major existing theories of vagueness (epistemicism, additional truth values, truth gaps, supervaluationism, plurivaluationism). II. The problem of defining vagueness. Shortcomings of previous definitions (e.g. borderline cases, semantic indeterminacy, tolerance). Proposal: vagueness as closeness. If this proposal is correct then the correct theory of vagueness must involve degrees of truth. III. Fuzzy logic and the problem of artificial precision. Problems with existing solutions (fuzzy epistemicism, fuzzy metalanguage, blurry sets). Proposed solution: fuzzy plurivaluationism -- a theory that combines degrees of truth with semantic indeterminacy of the sort found in 'supervaluationist' (more correctly: plurivaluationist) approaches. IV. Fuzzy logic and the problem of truth-functionality. It has been argued that fuzzy logic based theories of vagueness are incompatible with data about the assertability of compound propositions in the presence of borderline cases. A negative assessment of these arguments will be given. V. Integrating the fuzzy theory of vagueness into the wider theoretical landscape. Case study: degrees of belief. In particular, the relationship between degrees of belief arising from uncertainty (ignorance) and degrees of belief arising from vagueness.

1 0

WoLLIC 2014 - 1st Call for Papers
by 小野寛晰 13 Oct '13

13 Oct '13

[Please circulate. Apologies for any cross-postings.] WoLLIC 2014 21st Workshop on Logic, Language, Information and Computation September 1st to 4th, 2014 Valparaiso, Chile 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 Department of Computer Science, Universidad de Chile, Chile Department of Computer Science, Pontificia Universidad Católica de Chile, Chile Centro de Informática, Universidade Federal de Pernambuco, Brazil HOSTED BY Department of Informatics, Universidad Técnica Federico Santa María, Chile 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 twentieth WoLLIC will be held at the Universidad Técnica Federico Santa María, from September 1st to 4th, 2014. 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. 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 10 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 2014 EasyChair website. (Please go to http://wollic.org/wollic2014/instructions.html for instructions.) A title and single-paragraph abstract should be submitted by Mar 24, 2014, and the full paper by Mar 28, 2014 (firm date). Notifications are expected by May 2, 2014, and final papers for the proceedings will be due by May 15, 2014 (firm date). PROCEEDINGS The proceedings of WoLLIC 2014, 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 2014 issue of a scientific journal (to be confirmed). INVITED SPEAKERS (TBA) STUDENT GRANTS ASL sponsorship of WoLLIC 2014 will permit ASL student members to apply for a modest travel grant (deadline: May 1st, 2014). See http://www.aslonline.org/studenttravelawards.html for details. IMPORTANT DATES Mar 24, 2014: Paper title and abstract deadline Mar 28, 2014: Full paper deadline May 2, 2014: Author notification May 15, 2014: Final version deadline (firm) PROGRAMME COMMITTEE Natasha Alechina (U Nottingham) Eric Allender (Rutgers U) Marcelo Arenas (PUC Chile) Steve Awodey (CMU) Julian Bradfield (U Edinburgh) Xavier Caicedo (U de Los Andes) Olivier Danvy (Aarhus U) Ulrich Kohlenbach (Tech U Darmstadt) (CHAIR) Marcus Kracht (U Bielefeld) Michiel van Lambalgen (U Amsterdam) Klaus Meer (Tech U Cottbus) George Metcalfe (Bern U) Dale Miller (INRIA Saclay / LIX) Russell Miller (CUNY) Sara Negri (U Helsinki) Nicole Schweikardt (U Frankfurt) (more to come) STEERING COMMITTEE Samson Abramksy, Johan van Benthem, Anuj Dawar, Joe Halpern, Wilfrid Hodges, Daniel Leivant, Leonid Libkin, Angus Macintyre, Grigori Mints, Luke Ong, Hiroakira Ono, Ruy de Queiroz. ORGANISING COMMITTEE Pablo Barceló (Universidad de Chile) (Local chair) Anjolina G. de Oliveira (U Fed Pernambuco) Ruy de Queiroz (U Fed Pernambuco) (co-chair) Juan Reutter (Pontificia Universidad Católica de Chile) Cristián Riveros (Pontificia Universidad Católica de Chile) FURTHER INFORMATION Contact one of the Co-Chairs of the Organising Committee. WEB PAGE http://wollic.org/wollic2014/

1 0

[お知らせ] キャンパス停電のためのML休止
by Atsushi Igarashi 12 Oct '13

12 Oct '13

logic-ml, kisoron-ml, jssst-ppl 購読のみなさま，管理人の五十嵐です． 10/14(月)に予定されている京大キャンパス内の停電のため， MLを運用しているサーバを 10/12(金) 夕方〜 10/15(火) 午前まで落とします．やや長期間の休止でご不便をおかけいたしますが，よろしくお願いいたします． -- 五十嵐淳 (IGARASHI Atsushi) E-mail: igarashi(a)kuis.kyoto-u.ac.jp url: http://www.fos.kuis.kyoto-u.ac.jp/~igarashi/

1 0

Talk by Venanzio Capretta, Thursday next week (Oct 17)
by Ichiro Hasuo 10 Oct '13

10 Oct '13

Dear all, Thursday next week we have Venanzio Capretta from University of Nottingham visiting us in U Tokyo and making a talk on infinite datastructures (related: (co)algebra and (co)induction). No registration needed. See you there! Best regards, Ichiro Hasuo http://www-mmm.is.s.u-tokyo.ac.jp/ ________________________________ Thu 17 October 2013, 17:00-18:00 Venanzio Capretta (U. Nottingham), THE CONSTRUCTION OF INFINITY *理学部7号館2階 214教室* （いつもの1階の部屋ではありません） Room 214, School of Science Bldg. No. 7 (Not the usual one on the ground floor) アクセス： https://www-mmm.is.s.u-tokyo.ac.jp/indexj.html Access: http://www-mmm.is.s.u-tokyo.ac.jp/ This talk is about the implementation and use of infinite data structures in computer science, specifically in constructive type theory. In the first part, I give some history and philosophy of the mathematical theories of infinity, illustrated with some puzzles. The second part is about solving equations on infinite streams: under what conditions does a recursive definition produce a unique function on streams? The third part is about a new kind data type, which I call "Wander Types". It allows the definition of non-well-founded structures with fine control on branching behaviour.

1 0

チュートリアルのお知らせ (Martin Ziegler氏、2013年10月１５日)
by Hideki Tsuiki 10 Oct '13

10 Oct '13

皆様 Darmstadt 工科大学の Martin Ziegler 教授が、１０月１４日から２週間京都に滞在されます。その間、何回かにわたって、計算可能性解析学に関するチュートリアル・レクチャーをして頂きます。初回は、１５日火曜日です。それ以降の予定は、その時にお伝えします。皆様のご参加をお待ちしております。日時： 10月14日（火曜）1:00 より場所：京都大学総合人間学部棟 1401 教室 (吉田南キャンパスに入って左側の建物の４Fです）講演者： Martin Ziegler 題目： Tutorial on Computability and Complexity in Analysis, Part I 立木

1 0

AiML 2014: 1st Call for Papers
by 小野寛晰 08 Oct '13

08 Oct '13

AiML-2014: 1ST CALL FOR PAPERS 10th INTERNATIONAL CONFERENCE ON ADVANCES IN MODAL LOGIC, GRONINGEN, 5-8 AUGUST, 2012 http://www.philos.rug.nl/AiML2014/ Advances in Modal Logic is an initiative aimed at presenting the state of the art in modal logic and its various applications. The initiative consists of a conference series together with volumes based on the conferences. Information about the AiML series can be obtained at http://www.aiml.net. AiML-2014 is the tenth conference in the series. TOPICS We invite submission on all aspects of modal logic, including: - history of modal logic - philosophy of modal logic - applications of modal logic - computational aspects of modal logic (complexity and decidability of modal and temporal logics, modal and temporal logic programming, model checking, model generation, theorem proving for modal logics) - theoretical aspects of modal logic (algebraic/categorical perspectives on modal logic, coalgebraic modal logic, completeness and canonicity, correspondence and duality theory, many-dimensional modal logics, modal fixed point logics, model theory of modal logic, proof theory of modal logic) - specific instances and variations of modal logic (description logics, modal logics over non-boolean bases, dynamic logics and other process logics, epistemic and deontic logics, modal logics for agent-based systems, modal logic and game theory, modal logic and grammar formalisms, provability and interpretability logics, spatial and temporal logics, hybrid logic, intuitionistic logic, substructural logics, computationally light fragments of all such logics) Papers on related subjects will also be considered. PAPER SUBMISSIONS There will be two types of submissions to AiML-2014: (1) Full papers for publication in the proceedings and presentation at the conference. (2) Short presentations intended for presentation at the conference but not for the published proceedings. Both types of papers should be submitted electronically using the EasyChair submission page at https://www.easychair.org/account/signin.cgi?conf=aiml2014 At least one author of each accepted paper or short presentation must register for and attend the conference. (1) FULL PAPERS Authors are invited to submit, for presentation at the conference and publication in the proceedings, full papers reporting on original research and not submitted elsewhere. The proceedings of AiML-2014 will be published by College Publications http://www.collegepublications.co.uk in a volume to be made available at the conference. The submissions should be at most 15 pages, with an optional technical appendix of up to 5 pages, together with a plain-text abstract of 100-200 words. The submissions must be typeset in LaTeX, using the style files and template that will be provided on the AiML-2014 website http://www.philos.rug.nl/AiML2014/ in due time. We also ask authors of full papers to submit the abstract in plain text via EasyChair by 14 March. (2) SHORT PRESENTATIONS. These should be at most 5 pages. They may describe preliminary results, work in progress etc., and will be subject to light reviewing. The accepted submissions will be made available at the conference, and the authors will have the opportunity to give short presentations (of up to 15 minutes) on them. INVITED SPEAKERS: TO BE ANNOUNCED LOCAL ORGANIZING COMMITTEE Dave Gilbert Barteld Kooi Bouke Kuijer Paolo Maffezioli Allard Tamminga PROGRAMME COMMITTEE Carlos Areces (FaMAF, Universitad Nacional de Cordoba, Argentina) Alexandru Baltag (ILLC, University of Amsterdam, The Netherlands) Nick Bezhanishvili (Utrecht University, The Netherlands) Patrick Blackburn (Roskilde University, Denmark) Hans van Ditmarsch (LORIA, France) David Fernández-Duque (ITAM, Mexico) Melvin Fitting (Lehman College, CUNY, USA) Silvio Ghilardi (Università degli Studi di Milano, Italy) Rob Goldblatt (Victoria University of Wellington, New Zealand) Valentin Goranko (Technical University of Denmark) Guido Governatori (NICTA Queensland, Australia) Andreas Herzig (IRIT, Toulouse, France) Rosalie Iemhoff (Utrecht University, The Netherlands) Roman Kontchakov (Birkbeck College London, UK) Barteld Kooi (University of Groningen) Marcus Kracht (Universität Bielefeld, Germany) Alexander Kurz (University of Leicester, UK) Carsten Lutz (Universität Bremen, Germany) Jakub Michaliszyn (Imperial College London, UK) Larry Moss (Indiana University, USA) Hiroakira Ono (Japan Advanced Institute of Science and Technology) Revantha Ramanayake (Technical University of Vienna) Mark Reynolds (University of Western Australia) Vladimir Rybakov (Manchester Metropolitan University, UK) Renate Schmidt (University of Manchester, UK) Jeremy Seligman (University of Auckland, New Zealand) Ilya Shapirovsky (Institute for Information Transmission Problems, Moscow, Russia) Valentin Shehtman (Moscow State University, Russia) Dimiter Vakarelov (Sofia University, Bulgaria) Yde Venema (ILLC, University of Amsterdam, The Netherlands) Heinrich Wansing (Ruhr University Bochum, Germany) Michael Zakharyaschev (Birkbeck College London, UK) PROGRAMME COMMITTEE CO-CHAIRS Rajeev Gore (The Australian National University, Australia) Agi Kurucz (King's College London, UK) IMPORTANT DATES Abstracts of full papers submission deadline: 14 March 2014 Full papers submission deadline: 21 March 2014 Full papers acceptance notification: 2 May 2014 Short presentations submission deadline: 12 May 2014 Short presentations acceptance notification: 2 June 2014 Final version of full papers and short presentations due: 9 June 2014 Conference: 5-8 August, 2014. FURTHER INFORMATION. Please see http://www.philos.rug.nl/AiML2014 ENQUIRIES. E-mail enquiries should be directed to the PC co-chairs, sent to aiml2014(a)easychair.org

1 0

Call for participation: LENLS10 (Logic and Engineering of Natural Language Semantics 10)
by BEKKI Daisuke 07 Oct '13

07 Oct '13

（重複して受け取られた場合はご容赦ください） 10/26-28に東京で開催される LENLS 10 国際ワークショップのご案内をお送り致します。皆様のご参加をお待ちしております。 ※online registrationの〆切（10/10）が迫っておりますので、ご注意下さい。戸次大介（お茶の水女子大学／国立情報学研究所） [Apologies for multiple copies] ================================================================= CALL FOR PARTICIPATION Logic and Engineering of Natural Language Semantics 10 (LENLS 10) Workshop Site : "Raiousha Building, Keio University" Kanagawa, Japan. http://www.keio.ac.jp/en/maps/hiyoshi.html Dates : October 26-28, 2013 Contact Person: Shunsuke Yatabe (West Japan Railway Company) Contact Email : lenls10[[at]]easychair.org Website : http://www.is.ocha.ac.jp/‾bekki/lenls/ ================================================================= Chair: Shunsuke Yatabe (West Japan Railway Company) Co-chair: Daisuke Bekki (Ochanomizu University/ National Institute of Informatics) Eric McCready (Aoyama Gakuin University) Invited Speaker(s): - Nicholas J.J. Smith (the University of Sydney) - Richard Dietz (the University of Tokyo) LENLS is an annual international workshop on formal syntax, semantics and pragmatics. It will be held as one of the workshops of the fifth JSAI International Symposia on AI (isAI2013) (http://www.ai-gakkai.or.jp/jsai-isai/2013/) sponsored by the Japan Society for Artificial Intelligence (JSAI) (http://www.ai-gakkai.or.jp/jsai/english.html). Aims and Topics: ================ We invite submissions to this year's workshop on topics in formal semantics and pragmatics, and related fields, including but in no way limited to the following: - Dynamic syntax/semantics/pragmatics of natural language - Categorical/topological/coalgebraic approaches for natural language syntax/semantics/pragmatics - Logic and its relation to natural language and linguistic reasoning (especially dynamic logics) - Type-theoretic approaches to natural language - Formal Philosophy of language - Formal pragmatics (especially game-theoretic and utility-theoretic approaches) - Substructural expansion of Lambek Lambda Calculi - Many-valued/Fuzzy and other non-classical logics and natural language Important dates: ================ Deadline for onsite registration: October 10, 2013 Tutorial Lecture: October 26, 2013 LENLS10: October 27-28, 2013 Registration: ============= The proceedings of the workshop will be available at the conference site for registered persons. Please follow the link below and register yourself until **10th October 2013**. http://www.ai-gakkai.or.jp/jsai-isai/2013/#registration Program: ======== October 27th (Sun), 2013 ------------------------- 9:00-9:20:Reception and Coffee Break 9:20-9:30:Opening Remarks 9:30-11:30:Session 1 * Takeshi Yamada "On Dummett's Critique of Davidsonian Theory of Meaning" * Chi-Yen Liu and Linton Wang "From 3-valued semantics, Adams' thesis rises" * Hidenori Kurokawa "Hypersequent calculi for modal logics extending S4" * Yoshihiro Maruyama "Quantum Linguistics: From Philosophy of Language to Logic of Quantum Vagueness" 11:30-13:00:Lunch 13:00-14:30:Session 2 * Laurence Danlos, Philippe De Groote and Sylvain Pogodalla "A Type-Theoretic Account of Neg-Raising Predicates in Tree Adjoining Grammars" * Daisuke Bekki "A Type-theoretic Approach to Double Negation Elimination in Anaphora" * Ribeka Tanaka, Yuki Nakano and Daisuke Bekki "Constructive Generalized Quantifiers Revisited" 14:30-14:45:Coffee break 14:45-16:15:Session 3 * David Etlin "Conditionals, Modals and Iteration" * Hanako Yamamoto and Daisuke Bekki "First-order conditional logic and neighborhood-sheaf semantics for analysis of conditional sentences" * Elia Zardini "If and Is" 16:15-16:45:Coffee break 16:45-17:45:Invited Talk 1 * Nicholas J.J. Smith "Vagueness, Counting and Cardinality" 17:45-18:15:Questions and Comments 19:00-:Banquet October 28th (Mon), 2013 ------------------------- 9:00-9:30:Reception 9:30-11:30:Session 1 * Ai Kawazoe, Yusuke Miyao, Takuya Matsuzaki, Hikaru Yokono and Noriko Arai "World history ontology for reasoning truth/falsehood of sentences: Event classification to fill in the gaps be-tween knowledge resources and natural language texts" * Marc Vincent and Gre'goire Winterstein "Argumentative insights from an opinion classification task on a French corpus" * Bruno Mery, Richard Moot and Christian Retore "Plurals: individuals and sets in a richly typed semantics" * Yasuo Nakayama "Analyzing Speech Acts based on Dynamic Normative Logic" 11:30-13:00:Lunch 13:00-15:00:Session 2 * Yoshiki Mori and Hitomi Hirayama "Bare plurals in the left periphery in German and Italian" * Christopher Davis "Building Rhetorical Questions in Japanese" * Wataru Uegaki "Predicting the distribution of exhaustive inference in a QUD model" * Matthijs Westera "Exhaustivity through the maxim of relation" 15:00-15:15:Coffee break 15:15-16:45:Session 3 * Daniel Gutzmann "Compositional multidimensionality and the lexicon-semantics interface" * Nicholas Asher, Cedric Degremont and Antoine Venant "Semantic Similarity -- Extended Abstract" * Eric Mccready and Nicholas Asher "Discourse-level Politeness and Implicature" 16:45-17:00:Coffee break 17:00-18:00:Invited Talk 2 * Richard Dietz "The Possibility of Vagueness" 18:00-18:30:Questions and Comments Alternates ---------- * Jiri Marsik and Maxime Amblard "Integration of Multiple Constraints in ACG" * Mihaela Popa "Embedded irony, speech-acts, and the semantics/pragmatics distinction" * Satoru Suzuki "Averages, Comparisons, Contextual Definitions and Meaningfulness" Tutorial Lecture: ================= On October 26th (Sat), there will be a tutorial lecture at Ochanomizu University. Lecturer: Nicholas J.J. Smith (The University of Sydney) Venue: Ochanomizu UniversityFaculty of Science, Building 3, Room 207-209 (2nd Floor) (http://www.ocha.ac.jp/en/access/index.html) Time Table: 10:00-12:00 Session 1 12:00-14:00 Lunch 14:00-16:00 Session 2 Title: Vagueness and Fuzzy Logic Abstract -------- The aim of this tutorial is to give a positive appraisal of the prospects for a fuzzy logic based solution to the problems of vagueness. The tutorial will be divided into the following sections (time permitting). I. An overview of the major existing theories of vagueness (epistemicism, additional truth values, truth gaps, supervaluationism, plurivaluationism). II. The problem of defining vagueness. Shortcomings of previous definitions (e.g. borderline cases, semantic indeterminacy, tolerance). Proposal: vagueness as closeness. If this proposal is correct then the correct theory of vagueness must involve degrees of truth. III. Fuzzy logic and the problem of artificial precision. Problems with existing solutions (fuzzy epistemicism, fuzzy metalanguage, blurry sets). Proposed solution: fuzzy plurivaluationism -- a theory that combines degrees of truth with semantic indeterminacy of the sort found in 'supervaluationist' (more correctly: plurivaluationist) approaches. IV. Fuzzy logic and the problem of truth-functionality. It has been argued that fuzzy logic based theories of vagueness are incompatible with data about the assertability of compound propositions in the presence of borderline cases. A negative assessment of these arguments will be given. V. Integrating the fuzzy theory of vagueness into the wider theoretical landscape. Case study: degrees of belief. In particular, the relationship between degrees of belief arising from uncertainty (ignorance) and degrees of belief arising from vagueness. Workshop Organizers/Program Committee: ====================================== - Shunsuke Yatabe (West Japan Railway Company) - Daisuke Bekki (Ochanomizu University/National Institute of Informatics) - Alastair Butler (PRESTO JST/Tohoku University) - Eric McCready (Aoyama Gakuin University) - Koji Mineshima (Keio University) - 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) - Kei Yoshimoto (Tohoku University)

1 0

第48回 MLG 数理論理学研究集会のご案内
by Katsuhiko Sano 07 Oct '13

07 Oct '13

第48回 MLG 数理論理学研究集会のご案内 (重複してお受け取りの際はご容赦ください。) 北陸先端科学技術大学院大学の佐野勝彦です。2013年度MLG数理論理学研究集会（第48回）を下記の要領で開催いたします。多くの方のご講演・ご参加をお待ちしております。 ========================================= 第48回 MLG 数理論理学研究集会開催要領 ========================================= 期間: 2013 年 12 月 6 日(金) 〜 12 月 8 日(日) 場所: 山中温泉河鹿荘ロイヤルホテル（JR加賀温泉駅から車で約20分，加賀温泉駅から送迎あり）〒922-0126 石川県加賀市山中温泉河鹿町ホ100 URL : http://www.daiwaresort.jp/kajikasou/ 講演・宿泊申込締め切り: 2013 年 11 月 20 日（水）申し込みはこちらから --> https://docs.google.com/forms/d/1W0cfix5awVjPBI71Bn7dK-LT1E_an2dizQMcoK5LST… ホームページ：https://sites.google.com/site/mlg2013kaga/ 連絡先E-mail :mlg.logic.japan [at] gmail.com ============ 参加募集 ============ ・講演時間は原則40分を予定しています。・12月7日（土）の夜に懇親会を行います。・全日程参加の場合，参加費（宿泊代・食事代・会場代）は25000円前後になる予定です。・ご講演をなさらなくても参加いただけます。山中温泉河鹿荘ロイヤルホテルで宿泊および食事をなさらない場合にも参加費（会場代）2500円をいただきます。・講演申し込みは、https://docs.google.com/forms/d/1W0cfix5awVjPBI71Bn7dK-LT1E_an2dizQMcoK5LSTk/viewform の registration form からお願い致します。世話人佐野勝彦〒923-1292 石川県能美市旭台1-1 北陸先端科学技術大学院大学情報科学研究科 MLG2013に関するメールは，mlg.logic.japan [at] gmail.com まで。 -- Katsuhiko Sano School of Information Science Japan Advanced Institute for Science and Technology IS building No.1 7F, 1-1 Asahidai, Nomi, Ishikawa, 923-1292, Japan

1 0

Dick de Jongh オープンセミナー@理科大10/25
by Sumiyo Nishiguchi 04 Oct '13

04 Oct '13

メーリングリストの皆様東京理科大学では下記の要領でオープンセミナーを開催致しますので、奮ってご参加ください。講演者: Professor Dick de Jongh (ILLC, University of Amsterdam) 題: Logic and Learning 日時: 2013年10月25日(金) 4:30pm- Date: Oct 25, 2013, 4:30pm- 場所: 東京理科大学神楽坂キャンパス森戸記念館第2フォーラム <http://www.tus.ac.jp/facility/morito/> （アクセス <http://www.tus.ac.jp/info/access/kagcamp.html>) Location: 2nd Forum, Morito Memorial Hall, Kagurazaka Campus, Tokyo University of Science (directions<http://www.tus.ac.jp/en/campus/kagurazaka.html> ) 参加無料事前申し込み不要 Abstract: Learning and learnability have been long standing topics of interests within the linguistic, computational, and epistemological accounts of inductive inference. This proximity relation between logic and learning is examined with respect to learning and belief revision, knowledge updating and efficiency, concentrating on knowledge updating. See Nina Gierasimczuk, Vincent Hendricks and Dick de Jongh, Logic and Learning, to appear in: Outstanding Contributions: Johan van Benthem. Trends in Logic Book Series, Springer 2013, and Nina Gierasimczuk and Dick de Jongh, On the complexity of Conclusive Update, The Computer Journal (2013) 56(3): 365-377. 問合わせ先: 西口純代東京理科大学経営学部 email: nishiguchi(a)rs.tus.ac.jp -- Sumiyo Nishiguchi, PhD Junior Associate Professor of Linguistics School of Management Tokyo University of Science nishiguchi(a)rs.tus.ac.jp http://www.rs.tus.ac.jp/nishiguchi/

1 0

Dr. Andreas Abel at NII Logic Seminar
by Makoto Tatsuta 04 Oct '13

04 Oct '13

Dr. Andreas Abel at NII Logic Seminar Date: October 11, 2013, 14:00--16:00 Place: National Institute of Informatics, Room 1210 (12th floor) 場所: 国立情報学研究所 12階 1210室 (半蔵門線,都営地下鉄三田線・新宿線神保町駅または東西線竹橋駅より徒歩5分) (地図 http://www.nii.ac.jp/about/access/) Speaker: Dr. Andreas Abel (Chalmers and Gothenburg University) Title: Copatterns: Programming Infinite Structures by Observations Abstract: Inductive datatypes provide mechanisms to define finite data such as finite lists and trees via constructors and allow programmers to analyze and manipulate finite data via pattern matching. In this paper, we develop a dual approach for working with infinite data structures such as streams. Infinite data inhabits coinductive datatypes which denote greatest fixpoints. Unlike finite data which is defined by constructors we define infinite data by observations. Dual to pattern matching, a tool for analyzing finite data, we develop the concept of copattern matching, which allows us to synthesize infinite data. This leads to a symmetric language design where pattern matching on finite and infinite data can be mixed. We present a core language for programming with infinite structures by observations together with its operational semantics based on (co)pattern matching and describe coverage of copatterns. Our language naturally supports both call-by-name and call-by-value interpretations and can be seamlessly integrated into existing languages like Haskell and ML. We prove type soundness for our language and sketch how copatterns open new directions for solving problems in the interaction of coinductive and dependent types. This is joint work with Brigitte Pientka, McGill University, Montreal. 問合せ先: 龍田真 (国立情報学研究所) e-mail: tatsuta(a)nii.ac.jp http://research.nii.ac.jp/~tatsuta

1 0

配送回復のおしらせ
by Atsushi Igarashi 02 Oct '13

02 Oct '13

logic-ml, kisoron-ml, jssst-ppl を購読されているみなさま，管理人の五十嵐です．メイリングリストを管理しているソフトウェアが落ちていたことに気付かず， 9月の半ばから二週間程度配送が滞っていたことがわかりました．現在は通常の状態に戻っているのではないかと思います．この間に投稿をされた方におきましては大変ご迷惑をおかけいたしました．どのメイリングリストも毎日必ず投稿があるほどはアクティブではありませんので単に投稿がないのか，不具合が発生しているのか俄かにはわからないことがあります (^^; あれ，投稿が配送されていないかも？と思った場合はお気軽にお問い合わせください．今後ともどうぞよろしくお願いいたします． -- 五十嵐淳 (IGARASHI Atsushi) E-mail: igarashi(a)kuis.kyoto-u.ac.jp url: http://www.fos.kuis.kyoto-u.ac.jp/~igarashi/

1 0

Talk by Tarmo Uustalu, Friday this week
by Ichiro Hasuo 02 Oct '13

02 Oct '13

Dear all, Friday this week we have Tarmo Uustalu from Institute of Cybernetics, Tallinn, Estonia visiting us in U Tokyo and making a talk. No registration needed. See you there! Best regards, Ichiro Hasuo http://www-mmm.is.s.u-tokyo.ac.jp/ ________________________________ Fri 4 October 2013, 17:00-18:00 Tarmo Uustalu (Institute of Cybernetics, Tallinn), Update Monads: Cointerpreting Directed Containers 理学部7号館1階 102教室 Room 102, School of Science Bldg. No. 7 アクセス： https://www-mmm.is.s.u-tokyo.ac.jp/indexj.html Access: http://www-mmm.is.s.u-tokyo.ac.jp/ We introduce update monads as a generalization of state monads. Update monads are compatible compositions of reader and writer monads given by a set and a monoid. Distributive laws between such monads are given by monoid actions. We also discuss a dependently typed generalization of update monads. Unlike simple update monads, those cannot be factored into a reader and writer monad. Dependently typed update monads arise from cointerpreting directed containers, by which we mean interpreting the opposite of the category directed containers into the category of set functors. (Joint work with Danel Ahman, University of Edinburgh.)

1 0

再送：数学基礎論若手の会（11月15日-11月17日）のご案内
by Yoshihito Tanaka 01 Oct '13

01 Oct '13

（重複して受け取られた場合はご容赦ください）再送：数学基礎論若手の会2013のご案内数学基礎論若手の会は，数学基礎論を専攻する学生および若手研究者の研究交流を目的とする合宿形式の研究集会です．講演はオリジナルの成果発表に限らず，研究の途中報告や研究内容の紹介など幅広く募集しています．また，これから数学基礎論を勉強したいと思っている方のご参加も歓迎します．多くの方のご参加・ご講演をお待ちしています．数学基礎論若手の会2013開催要領日時：2013年11月15日（金） - 2013年11月17日（日）講演会場：九州産業大学2号館2E406 宿泊：九州産業大学立花寮1階立花研修所幹事：田中義人（九州産業大学） E-mail：ytanaka(a)ip.kyusan-u.ac.jp 数学基礎論若手の会2013ホームページ： http://www.ip.kyusan-u.ac.jp/J/ms/event/wakate13/notice.html 九州産業大学立花研修所：宿泊料金：1人1泊2415円，1人2泊4725円食事料金：朝食1食250円，夕食1食400円宿泊設備（4人部屋×10室）：2人掛け机2台，椅子4脚，2段ベッド2組　　　　（1人部屋× 3室）：机1台，椅子1脚，ベッド，バス，トイレ共有スペース：シャワー室，トイレ，洗面所，コインランドリー門限 22:30，消灯 23:00 研修所内での飲酒・喫煙はご遠慮願います．退所の際は，宿泊室，シャワー室，トイレ，談話室等の清掃をお願いします． ※ 宿泊や食事を伴わない参加も歓迎します． ※ 親睦会等の会費は別途いただく予定です． ※ 部屋割りに関しては，幹事にご一任ください．参加申し込み：参加をご希望の方は，下記に必要事項をご記載の上，幹事宛に電子メールでお申し込みください．締切：2013年10月27日 ---------------------------------------------------------------- 数学基礎論若手の会参加申し込みフォーム氏名：所属機関：職名/学年：講演について：講演：する / しない講演題目：立花研修所の宿泊・食事について宿泊：要 / 不要宿泊を希望する場合： 15日 / 16日食事：要 / 不要食事を希望する場合： 15日（夕） / 16日（朝・夕） / 17日（朝） ---------------------------------------------------------------- ************************************* Yoshihito Tanaka Faculty of Economics, Kyushu Sangyo University (KSU) 2-3-1 Matsukadai, Higashi-ku, Fukuoka 813-8503, Japan e-mail ytanaka(a)ip.kyusan-u.ac.jp. tel +81-92-673-5216 *************************************

1 0

再送：数学基礎論若手の会（11月15日-11月17日）のご案内
by Yoshihito Tanaka 01 Oct '13

01 Oct '13

（重複して受け取られた場合はご容赦ください）再送：数学基礎論若手の会2013のご案内数学基礎論若手の会は，数学基礎論を専攻する学生および若手研究者の研究交流を目的とする合宿形式の研究集会です．講演はオリジナルの成果発表に限らず，研究の途中報告や研究内容の紹介など幅広く募集しています．また，これから数学基礎論を勉強したいと思っている方のご参加も歓迎します．多くの方のご参加・ご講演をお待ちしています．数学基礎論若手の会2013開催要領日時：2013年11月15日（金） - 2013年11月17日（日）講演会場：九州産業大学2号館2E406 宿泊：九州産業大学立花寮1階立花研修所幹事：田中義人（九州産業大学） E-mail：ytanaka(a)ip.kyusan-u.ac.jp 数学基礎論若手の会2013ホームページ： http://www.ip.kyusan-u.ac.jp/J/ms/event/wakate13/notice.html 九州産業大学立花研修所：宿泊料金：1人1泊2415円，1人2泊4725円食事料金：朝食1食250円，夕食1食400円宿泊設備（4人部屋×10室）：2人掛け机2台，椅子4脚，2段ベッド2組　　　　（1人部屋× 3室）：机1台，椅子1脚，ベッド，バス，トイレ共有スペース：シャワー室，トイレ，洗面所，コインランドリー門限 22:30，消灯 23:00 研修所内での飲酒・喫煙はご遠慮願います．退所の際は，宿泊室，シャワー室，トイレ，談話室等の清掃をお願いします． ※ 宿泊や食事を伴わない参加も歓迎します． ※ 親睦会等の会費は別途いただく予定です． ※ 部屋割りに関しては，幹事にご一任ください．参加申し込み：参加をご希望の方は，下記に必要事項をご記載の上，幹事宛に電子メールでお申し込みください．締切：2013年10月27日 ---------------------------------------------------------------- 数学基礎論若手の会参加申し込みフォーム氏名：所属機関：職名/学年：講演について：講演：する / しない講演題目：立花研修所の宿泊・食事について宿泊：要 / 不要宿泊を希望する場合： 15日 / 16日食事：要 / 不要食事を希望する場合： 15日（夕） / 16日（朝・夕） / 17日（朝） ----------------------------------------------------------------

1 0

セミナー案内
by KASHIMA Ryo 30 Sep '13

30 Sep '13

数理論理学セミナーのお知らせ日時：10月4日(金)15:00から場所：東京工業大学大岡山西８号館部屋未定（参加者希望者はメールをください．部屋確定後に個別にお知らせします）（１）話者：Daniel Günzel （ダルムシュタット工科大）題目：Logical Metatheorem: Background and practice 概要： A logical Metatheorem, due to Gerhardy-Kohlenbach, is introduced by presenting the main logical tools involved and showing some key aspects of the theory involved. After having done all the formal work, an application to a real world fixed point theorem (due to Fora) is given in several steps going to the formalization and modification process to finally obtain new constructive results. （２）話者：横山啓太（北陸先端科学技術大学院大）題目：Ramsey's theorem, its iteration and their strength 概要： In this talk, I will introduce several versions of iterated Ramsey's theorem, and study the strength of them. I will also consider finite versions of iterated Ramsey's theorem, which are independent from Peano arithmetic. In fact, some of them are strictly stronger than the famous independent statement by Paris/Harrington. ------ 問い合わせ先：鹿島亮（東京工業大学） kashima(a)is.titech.ac.jp

1 0

Fwd: Postdoc position in Operational Semantics in Warsaw
by Ichiro Hasuo 29 Sep '13

29 Sep '13

みなさま，ワルシャワ大学の Bartek Klin さんによるポスドク募集を転送します．蓮尾一郎 www-mmm.is.s.u-tokyo.ac.jp/~ichiro/ --------------------------------------------------------------------------- A three-year postdoctoral position is available under the direction of Bartek Klin in the Institute of Informatics, University of Warsaw. The position is in the field of semantics of programming languages and process algebras, within the project "Modular operational semantics: a bialgebraic approach", funded by the Polish National Science Center. The applicants should have (or be close to completion of) a PhD degree in Mathematics or Computer Science, and be interested in topics such as semantics of programming languages, process algebra, formal methods, and/or category theory. The position is available from November 2013, but the starting date may be postponed on request of a suitable candidate. In addition, interested candidates are invited to apply for a postdoctoral fellowship at the Warsaw Center of Mathematics and Computer Science (http://www.wcmcs.edu.pl/node/41), with the rather short deadline of *** October 15th, 2013 ***. These are one-year positions (with a possible extension to two years), with an excellent salary which may be used as an additional source of funding for the first years of stay in Warsaw. For further information please contact Bartek Klin (klin(a)mimuw.edu.pl). ---------------------------------------------------------------------------

1 0

Philosophy of Logic and Speach Act Theory 集会のご案内（１０月５日慶応大三田キャンパス）
by Mitsu Okada 25 Sep '13

25 Sep '13

次の集会のご案内をさせていただきます。　岡田光弘（慶応大学哲学専攻） ――――――――――――――――――――――――――――――――――――― 国際ワークショップ (International Workshop) Philosophy of Logic and Speach Act Theory 論理と言語行為論の哲学 ――――――――――――――――――――――――――――――――――――― 開催日時：2013年10月5日(土) 13:30PM-17:00PM (17:30からレセプション有り。出席者無料) Date: October 5, 2013 (Sat) 13:30PM-17:30 PM 開催場所：慶應義塾大学三田キャンパス南館（法科大学院棟) 地下4階ディスタンスラーニング室 Place: Distance Learning Room, B4F (Basemant) of South building (Law school building),　 Mita campus of Keio University. http://www.keio.ac.jp/en/maps/mita.html ――――――――――――――――――――――――――――――――――――― 論理と言語行為論の哲学についての国際集会を開催します。特に今回はフランスＣＮＲＳ人文社会部門及びパリ大学ソルボンヌ＝パンテオン校(パリ大学第1校）哲学科との共同企画で講演および討論集会を行います。 - 提題講演者： Sandra Laugier (Universite Paris I, 哲学科教授) Pierre Wagner (Universite Paris I, 哲学科教授) - ディスカッションコーディネータ　岡田光弘（慶應義塾大学哲学専攻）＊発表言語は英語 - 参加方法：事前登録不要・参加費無料 (※セッション終了後の立食形式レセプションも参加自由です) Ｌａｕｈｉｅｒ教授は言語行為論、ウィトゲンシュタインの哲学などを専門とされ多くの著編著を出版されています。Ｗａｇｎｅｒ教授は論理の哲学、数学の哲学を専門とされ、クセジュ文庫の Logiqueなど多くの著作で知られています。 .Program (13:30PM,-!7:30PM) 1. Pierre Wagner (Professor, Department of Philosophy, Universite Paris I (Sorbonne) Pluralism and Universalism in Logic Discussion Pause 2.Sandra Laugier (Professor, Department of Philosophy, Universite Paris I (Sorbonne) The normality of the Ordinary, Performative Utterances and Social Reality: Reconsideration of Speach Act Theory of Austin Discussion -- 17:30PM- Reception (free of charge for all participants) 簡単な要旨を下に付けています。 ――――――――――――――――――――――――――――――――――――― 主催・企画：慶應義塾大学「思考と行動判断」の研究拠点共同企画：　ＣＮＲＳ人文社会学部門お問い合わせ先： E-mail: think-judge(a)abelard.flet.keio.ac.jp --------------------------------------- 1. Pluralism and Universalism in Logic Pierre Wagner 論理のPluralismとＵｎｉｖｅｒｓａｌｉｓｍの考え方とその問題点などを検討します。また、近年の論理学におけるこれに関係する動きについても議論します。例えば様々な部分構造論理や様相論理、動的論理系論理について論理的多元論の立場でとらえる考え方とそうでない立場でとらえる考え方について検討します。最近ののＵｎｉｖｅｒｓａｌ logicの運動についても批判的観点も含めて議論します。 2. The normativity of the Ordinary -Performative Utterrances and Social Reality The question of performative utterances seems inseparable from a reflection on social normativity, especially on the transgression of norms implied in Austin’s thorough study of the failures (abuses and misfires) of the performative, in /How to do things with words/. Austin’s discovery of speech acts rests ultimately on thought about law and normativity. It is a well known fact that H. L. A. Hart was a member of the seminar, held just after the war, in which Austin presented the theory of speech acts. Moreover, Reinach’s theory of social acts, an early form of the theory of speech acts, was developed in a legal context. Reinach’s work anticipates Austin’s so closely that some historians of speech act theory have proposed that Austin was aware, /via/ Ryle, of Reinach’s work. The connection between law and speech acts has engendered all sorts of difficulties and misunderstandings, especially with respect to the normativity of these acts and with respect to the existence of norms or rules grounding them (cf. Hart and Searle). My aim here is, first of all, to clarify the connection between speech acts, normativity, and law. This large question has often been taken up in order to make normative use of Austin’s theories, for example by Searle. It is therefore important to see what use can really be made of Austin’s work in the theory of norms. I will first approach this issue by examining the specific nature of the speech act in Austin. Reflection on law makes clear the variety of speech acts beyond the paradigmatic example of promising. It also shows what is truly at stake in Austin’s theory. Furthermore it alerts us to the full radicalism of Austin’s philosophy of language. In making performatives “social” acts determined by rules, Austin’s mainstream interpreters and inheritors neglect the properly linguistic dimension of Austin’s discovery. They also miss his critique of representationalism and of the very idea of states of affairs. Yet this critique is inseparable from his discovery of performatives. What is at stake, therefore, is the very idea of performance, that is to say, the very idea of agency, independently of all prior normativity and of any creation of a state of affairs or a social reality. -------------------------------------end of the announcement---------------------------

1 0

[CFP] PPL2014 論文募集のお知らせ: 第16回プログラミングおよびプログラミング言語ワークショップ
by Keisuke Nakano 19 Sep '13

19 Sep '13

＊＊＊重複して受け取られた場合はご容赦ください＊＊＊電気通信大学の中野と申します．来年3月に熊本県阿蘇市阿蘇温泉で開催される第16回プログラミングおよびプログラミング言語ワークショップ (PPL2014) のご案内です．詳細な投稿方法などは決定次第，下記ワークショップWebページにてお知らせしますので，ご投稿，ご参加をご検討ください． -------------------------------------------------------------------------- 第16回プログラミングおよびプログラミング言語ワークショップ（PPL2014） http://www.fos.kuis.kyoto-u.ac.jp/ppl2014/ 論文募集主催: 日本ソフトウェア科学会プログラミング論研究会日程: 2014年3月5日(水)～3月7日(金) 会場: 熊本県阿蘇市阿蘇温泉「阿蘇の司ビラパークホテル」 http://asovilla.jp/ PPL2014は，プログラミングおよびプログラミング言語に関する研究者が一堂に会し，最新の研究成果の発表，および新たな研究課題についての討論やアイディア交換等を行うことを目的とした，合宿形式のワークショップです．プログラミングおよびプログラミング言語の理論・設計・実装・処理系などに関する研究発表を，カテゴリ別に幅広く募集します．カテゴリ1: 国内外で未発表の論文の発表カテゴリ2: 国際会議・学術雑誌等で既発表であるが，国内では未発表の研究の紹介カテゴリ3: ポスター・デモ発表（既発表・未発表の別を問いません） ※ショートプレゼンテーションは行いませんカテゴリ1の採択論文の中から，特に独創的なアイディアや顕著な成果を含むものに対して論文賞を授与する予定です．また，ポスター・デモを含む全発表のなかから，聴衆の投票により，最も優秀なプレゼンテーションを披露した学生に発表賞を授与する予定です．カテゴリ1（国内外未発表論文） ------------------------------ 完成した理論やシステムの研究発表のみならず，萌芽的なアイディアや問題点の提示等も歓迎します．発展途上の研究内容も積極的に採録する方針です（ただし，PPLでの発表として相応しくないと判断される場合は，この限りではありません）．また，カテゴリ1で発表された研究については，会場での討議や査読コメントをもとにその完成度を高め，将来の学術雑誌・会議等での業績に結び付けることを奨励しています．そのため，予稿集の配布は参加者のみへの限定的なものとする予定です．採録された論文は，PPL2014参加者に配布される予稿集に掲載され，参加者のみがアクセス可能な形でWEB上で公開されます（論文へのリンク集ページを作成し，閲覧に必要なパスワードを参加者に連絡します）．カテゴリ1で発表された研究のうち，PPL2014プログラム委員会により優れていると認めるものは，PPL2014終了後（2014年4月下旬予定），「コンピュータソフトウェア」誌のPPL2014推薦論文としての投稿が可能です．推薦論文は，PPL プログラム委員が引き続き査読を行うことによる，迅速な査読プロセスを特長としています．カテゴリ2（国外既発表論文） ---------------------------- 査読付の国際会議または学術雑誌等で既発表であるが国内では未発表である研究を紹介する場です．採録決定済みの研究も含みます．PPLへの関連をもとに採否を判定いたしますが，申し込み多数の場合はプログラム委員会での選考により，発表をご遠慮いただく可能性もございますので，その旨をご了承の上ご投稿ください．カテゴリ3（ポスター・デモ発表） ------------------------------------------ 2時間程度のセッション内でのポスター発表またはデモ発表です．既発表・未発表の別を問いません．PPLへの関連をもとに採録を判定いたします．また，申し込み多数の場合はプログラム委員会での選考により採否を決定する可能性があります． ====================================================================== 投稿・発表申込要領 3つのカテゴリそれぞれに対する投稿方法は以下の通りです．最新の情報は上記 Web ページでご確認ください．カテゴリ1（国内外未発表論文） ------------------------------ 投稿手続きは2段階です．発表申込を行った上で論文提出を行ってください．発表申込先： EasyChair による申込み受付を予定しています．発表申込締切：2013年12月20日(金) 17:00 (JST) 著者名，所属，論文タイトル，論文概要（日本語300〜400字程度もしくは英語 200 words 程度）を提出してください．論文提出締切：2014年1月8日(水) 17:00 (JST) 10ページ程度（最大15ページ）の論文（日本語もしくは英語，PDF形式）を提出してください．採否通知：2014年2月3日(月) 最終原稿提出締切：2014年2月14日(金) 17:00 (JST) 採録された論文の最終原稿の提出方法は，採否通知にてお知らせいたします． (注) カテゴリ1への投稿論文と類似の論文を，他の会議（予稿集を出版するもの）・論文誌などに同時投稿する場合は，査読の有無に関わらず，その旨を発表申込および論文提出の際に明記してください．PPLでは同時投稿の事実のみをもって論文を不採録とすることはありませんが，採否の決定に利用する場合があります（他の会議との重複を避けるため，発表内容についての条件付採録とすることもあります）．カテゴリ2（国外既発表論文） ---------------------------- 昨年同様，カテゴリ2の申込締切が少し早くなっていますのでご注意ください．発表申込時に採録が決定している国際会議および国際学術雑誌の発表論文が対象です．理論系だけではなく実装系の論文の投稿も歓迎いたします．発表申込方法につきましては PPL2014 の Web ページをご確認ください．発表申込締切：2014年1月24日(金) 17:00 (JST) 原論文（ページ数不問，PDF形式）とabstract（テキスト形式）を，著者名，所属，論文タイトル，原論文の出典（発表会議名，掲載済／予定の別等）と併せてご提出ください．採否通知：2014年2月5日(水) カテゴリ3（ポスター・デモ発表） ------------------------------------------ ポスター・デモの区別を行わずに募集いたします．デモを行う場合は，発表概要においてその旨をご説明ください．発表申込方法につきましては PPL2014 の Web ページをご確認ください．発表申込締切：2014年2月7日(金) 17:00 (JST) 希望する発表形態（ポスター・デモの別）を明記して，著者名，所属，発表タイトル，発表概要（200〜300字程度）をご提出ください．採否通知：2014年2月14日(金) 問い合わせ先：ppl2014-oc [at] fos.kuis.kyoto-u.ac.jp （[at]を@に置き換えてください） ====================================================================== プログラム委員会 Reynald Affeldt (産総研) 稲葉一浩 (Google) 馬谷誠二 (京大) 海野広志 (筑波大) 大平怜 (日本IBM) 大野和彦 (三重大) 倉光君郎 (横浜国立大) 光来健一 (九工大) 笹田耕一 (Heroku) 篠埜功 (芝浦工大) 鈴木貢 (島根大) 中田秀基 (産総研) [プログラム共同委員長] 中野圭介 (電通大) [プログラム共同委員長] 西田直樹 (名古屋大) 浜名誠 (群馬大) 廣川直 (北陸先端大) 松崎公紀 (高知工大) 南出靖彦 (筑波大) 横山大作 (東大) 横山哲郎 (南山大) 実行委員会末永幸平 (京大) [実行委員長] 上野雄大 (東北大) [実行副委員長] 中田秀基 (産総研) [プログラム共同委員長] 中野圭介 (電通大) [プログラム共同委員長] --------------------------------------------------------------------------

1 0

「NII湘南会議」の企画募集のご案内(9/15, 12/15, 6/15締切)
by Soichiro Hidaka 11 Sep '13

11 Sep '13

logic-mlの皆様、国立情報学研究所の日高と申します。本メーリングリストをお借りして、国立情報学研究所の主催で、アジアにおける最初のダグスツールスタイル・セミナーとなる「NII湘南会議」の企画募集をご案内させて頂きたいと思います。 NII湘南会議は、情報学の分野で世界的にトップレベルの研究者が一堂に会し、叡智を分け合う場を提供します。会議は、毎月開催し、成田国際空港からもアクセスのよい湘南国際村センターにて行われます。富士山をバックに、湘南海岸を眼下に見下ろす景観が楽しめます。詳しくは、リーフレット http://www.nii.ac.jp/shonan/wp-content/uploads/2010/07/NII-Shonan-Meeting-B… もしくは本メールの後半の英文企画募集のほか、下記webサイトをご参照下さい。 http://www.nii.ac.jp/shonan/ (英文) http://www.nii.ac.jp/about/international/shonanmtg/ (和文概要) 企画は随時受付けておりますが、年に3回締切りがあり、直近の締切りは 9月15日で、その後12月15日、6月15日と続きます。是非ご検討いただければ幸いです。 ---- NII SHONAN MEETINGS: CALL FOR PROPOSAL (1) Objective NII Shonan Meetings, following the well-known Dagstuhl Seminars, aim to promote informatics and informatics research at an international level, by providing yet another world's premier venue for world-class scientists, promising young researchers, and practitioners to come together in Asia to exchange their knowledge, discuss their research findings, and explore a cutting-edge informatics topics. The meetings are held in Shonan Village Center (near Tokyo), which offers a combination of facilities for conferences, trainings, lodging in a resort-like setting. The friendly and open atmosphere is to promote a culture of communication and exchange among the meeting participants. The NII Shonan Meetings are managed by National Institute of Informatics (NII) in Japan. (2) Scope and Style NII Shonan Meetings follow the style of the Dagstuhl Seminars. A meeting usually lasts for four days (Monday to Thursday) or shorter. It is initiated by at most three organizers (one from Asia), established leaders in their field, representing different communities invited to the Seminar, preferably from different institutions. NII invites on their behalf about 25 to 35 researchers of international standing from academia and industry. Like Dagstuhl Seminars, an NII Shonan Meeting typically does not come with a fixed program. Instead, the pace and the program are guided by topics and presentations that evolve through discussions. In particular, NII does not require participants to submit a paper for presentation, or to give a presentation at all. On the contrary, NII encourages participants to present new ideas and work in progress. All administrative works of meetings are supported by the NII team in the preparation phase and during the seminars themselves, so that the organizers can focus on choosing research topics and selecting active researchers for the meeting. (3) Proposal Submissions NII invites international standing scientists to submit proposals for international meetings (with about 25-35 participants) on any topics of informatics. The proposal should clearly motivate the topic of your seminar and include the following items: - Meeting Title - Organizers (at most three, 1-page CV for each) - Proposed Dates for the Meeting - Description of the Meeting (1-2 pages, in English) - Invitation list (Position/First Name/Middle Name/Last Name/Affiliation/Email/Gender/URL/research list) The proposal should be submitted via the following EasyChair page: http://www.easychair.org/conferences/?conf=nim1 The proposal will be reviewed by the Academic Committee. Once the proposal is approved, our staff will help to organize the seminar. We welcome proposal submission anytime through a whole year, although submission is closed in June 15th, September 15th and December 15th. Notification of acceptance is only made after two or three months of each closing day. More information about submitting proposals: http://www.nii.ac.jp/shonan/proposal-submissions/ (4) Locations and Expenses The meetings are held in Shonan Village Center (near Tokyo), whose nearest train station can be accessed by a direct train from Narita International Airport, and offers a combination of facilities for conferences, trainings, lodging in a resort-like setting. http://www.shonan-village.co.jp/svc/ The following rates cover overnight accommodation (single room) and full board (breakfast, lunch, and dinner) per day: - Meeting organizers: free - Participants from academia: 8,000 Yen/day - Participants from industry: 15,000 Yen/day - Partner accompanying participant: 7,500 Yen/day (Meal charges are not included.) (5) Organization Organization Committee: Yoh'ichi Tohkura (NII): Chair Isao Echizen (NII) Cheung Gene (NII) Soichiro Hidaka (NII) Zhenjiang Hu (NII) Junichi Yamagishi (NII) Toyomi Takekawa (NII) Academic Committee: Zhenjiang Hu (NII): Chair Akiko Aizawa (NII) Katsumi Inoue (NII) Noriko Kando (NII) Ken'ichi Kawarabayashi (NII) Jeff Kramer (Imperial College London) Kae Nemoto (NII) Bashar Nuesibeh (Lero/Open Univ.) Yoichi Sato (Univ. of Tokyo) Ken Satoh (NII) Shin'ichi Satoh (NII) Satoshi Sekine (New York Univ./Rakuten Inst. of Tech.) Akihiko Takano (NII) (6) Inquiry Should you have any questions, please feel free to contact us by sending an email to shonan(a)nii.ac.jp More information about NII Shonan Meetings is available at the following website: http://www.nii.ac.jp/shonan/ 国立情報学研究所アーキテクチャ科学研究系助教日高宗一郎総合研究大学院大学複合科学研究科情報学専攻併任博士(工学) hidaka(a)nii.ac.jp http://research.nii.ac.jp/~hidaka 〒101-8430 東京都千代田区一ツ橋2-1-2 学術総合センタービル内 TEL:03-4212-2586(直)/03-4212-2000(代) 内線2586 FAX:03-4212-2120

1 0

超準解析シンポジウム（第3報）
by Hiroshi Akiyama 10 Sep '13

10 Sep '13

関係各位： 2013年度超準解析シンポジウムを下記の要領で開催いたしますのでご案内申し上げます．　静岡大学　明山　浩　　　　　　　　　　　　　　　　記 2013年度超準解析シンポジウム期間： 2013年9月18日(水)12：30 から 9月19日(木)12：30 まで　会場：静岡県浜松市中区城北3-5-1　静岡大学（浜松キャンパス）　　　工学部6号館 12教室　　　（北門のすぐそばの5階建ての建物の1階です）会場への交通：遠鉄（遠州鉄道）バスをご利用の場合，JR浜松駅北口バスターミナル15番または16番のりばで乗車，「静岡大学」で下車（所要時間は約20分，運賃180円）．会場アクセスHP： http://www.eng.shizuoka.ac.jp/outlines/p07/ 本シンポジウムは科研費挑戦的萌芽研究(24654021) (研究代表者：小澤正直) の助成を受けております．プログラム９月１８日（水） 12：30--13：00 受付 13：00--13：40 明山　浩　（静岡大学）　多様体上の熱核に対する超準的方法 13：50--14：35 横山啓太　（北陸先端科学技術大学院大学）　弱い組合わせ命題と超準的手法 14：50--15：35 山下秀康　（愛知学院大学）　コヒーレント状態経路積分と de Broglie 場 15：45--16：30 知沢清之　（管理工学研究所）　On the two methods to prove the existence of 4-dimensional canard 16：40--17:10 ショートコミュニケーション懇親会９月１９日（木） 9：30--10：15 柳川　信　（筑波大学）　A non-standard construction of p-adically closed fields 10：25--11：10 村上雅彦　（東京医科大学）　Yet another quantum set theory 11：25--12：10 松永　隆　（大阪府立成人病センター）　A key lemma to a nonstandard proof of the Doob-Meyer theorem 12：30 連絡事項等，　閉会　　 ************** 静岡大学大学院工学研究科数理システム工学専攻，工学部共通講座（数学）　明山　浩 e-mail：　tshakiy(a)ipc.shizuoka.ac.jp

1 0

$B9V1i$N$*CN$i$;!J(BJamie Vicary$B;a(B, 2013$BG/(B9$B7n(B12$BF|!K(B
by Hasegawa Masahito 03 Sep '13

03 Sep '13

$B3'MM!"(B $B0J2<$NFbMF$G!"(BOxford$BBg3X$N(BJamie Vicary$B$5$s$N9V1i$rM=Dj$7$F$*$j$^$9!#(B $B7wO@$rMQ$$$?NL;R7W;;!&NL;R>pJs$N8&5f$K4X$9$kOCBj$G$9$,!"Hs@lLg2H$N(B $BJ}$bG0F,$KCV$$$F$*OC$7D:$-$^$9!#3'MM$N$4;22C$r$*BT$A$7$F$*$j$^$9!#(B $BD9C+@n???M(B $B5~ETBg3X?tM}2r@O8&5f=j(B ---------------------------------------------------------------------- $B9V1i<T(B Jamie Vicary $B;a(B (Dept. Computer Science, Univ. Oxford / Centre for Quantum Technologies, Univ. Singapore) $BBjL\(B THE GEOMETRY OF QUANTUM AND CLASSICAL INFORMATION $BF|;~(B 2013$BG/(B9$B7n(B12$BF|!JLZ!K(B11:00-12:00 $B>l=j(B $B5~ETBg3XAm9g8&5f#29f4[(B 4$B3,(B478$B9f<<(B http://www.kurims.kyoto-u.ac.jp/~hassei/map-2.jpg $B!J?tM}2r@O8&5f=jK\4[$G$O$"$j$^$;$s!"$4Cm0U2<$5$$!K(B $B35MW(B Recent work has shown a beautiful connection between geometry and information flow, in both quantum and classical computer science. Diagrams involving points, lines and regions encode basic phenomena such as quantum measurement, entanglement creation, secret key preparation and encryption. Procedures such as quantum teleportation, quantum dense coding and encrypted communication can then be defined as equations between these diagrams, such that solutions to these equations in the correct 2-category correspond precisely to implementations of these algorithms in the ordinary sense. This work has many connections to other areas of mathematics and physics, such as topological quantum field theory, representation theory, and higher category theory, which I will briefly describe. All mathematical aspects will be introduced from scratch, so this talk should make sense to non-specialists. $BLd9g$;(B $BD9C+@n???M!J5~ETBg3X?tM}2r@O8&5f=j!K(B<hassei at kurims.kyoto-u.ac.jp> ----------------------------------------------------------------------

1 0

第２９回量子情報技術研究会（QIT29）のご案内
by NISHIMURA Harumichi 03 Sep '13

03 Sep '13

logic-mlの皆様，第２９回量子情報技術研究会のご案内を代理投稿させていただきます．よろしくお願いいたします．名古屋大学大学院情報科学研究科西村治道 ------------------------------------------------------------------------ 第29回量子情報技術研究会 (QIT29) のご案内研究会の内容情報科学と量子力学を融合させた新しい分野，量子情報科学に関する研究会です．情報を担う物理系の量子力学的側面を積極的に活かした新しい情報処理原理の研究とそこから開かれる新しい学問体系の構築および新しい情報技術パラダイムの創生を目指して，情報科学，物理学，光エレクトロニクスを含む理学，工学，数理科学に携わる研究者間に自由な討論の場を提供し，この研究分野の発展を図ることを目的としています．第29回研究会を下記のように開催致します．現在この分野で活躍する研究者は勿論，自分の研究資産が何らかの形で使えそうだと予感している研究者・技術者など，広く関連する分野の研究者・技術者からの発表を募集致します．聴講のみの参加も歓迎致しますので，奮ってお申し込みください．日時: 2013年11月18日(月)〜19日(火) 会場: 早稲田大学西早稲田キャンパス 63号館2階04-05会議室 (〒169-8555 東京都新宿区大久保 3-4-1) 発表募集分野 (申し込み状況によっては査読の可能性あり) 量子情報，量子計算，量子暗号など広く量子情報技術に関わる理論的研究，実験的研究，計算機科学的研究，数学的研究，および，その関連分野定員: 150名参加費: 事前振込み一般6,000円，学生1,000円 (当日会場払いは一般7,000円，学生2,000円) (懇親会は別途) 研究会参加申込要領参加申込は下記 Web より受付けます： http://staff.aist.go.jp/s-kawabata/qit/ 講演 (口頭，ポスター) の申込，予稿集原稿 PDF の提出は，電子情報通信学会の Web システムを使用します．【口頭講演申込締切】 2013年10月 4日(金) 【ポスター講演申込締切】2013年10月18日(金) 【予稿原稿提出締切】 2013年10月18日(金) 【参加申込締切】 2013年10月25日(金) 【問合先】中里弘道 (早稲田大学先進理工学部) 湯浅一哉 (早稲田大学先進理工学部) 青木隆朗 (早稲田大学先進理工学部) 和久井健太郎 (情報通信研究機構) Email: qit29(a)list.waseda.jp 主催: 量子情報技術時限研究専門委員会 (委員長: 枝松圭一 (東北大学)) 共催: 応用物理学会量子エレクトロニクス研究会 ------------------------------------------------------------------------

1 0

再送：数学基礎論若手の会（11月15日-11月17日）のご案内
by Yoshihito Tanaka 01 Sep '13

01 Sep '13

（重複して受け取られた場合はご容赦ください）再送：数学基礎論若手の会2013のご案内数学基礎論若手の会は，数学基礎論を専攻する学生および若手研究者の研究交流を目的とする合宿形式の研究集会です．講演はオリジナルの成果発表に限らず，研究の途中報告や研究内容の紹介など幅広く募集しています．また，これから数学基礎論を勉強したいと思っている方のご参加も歓迎します．多くの方のご参加・ご講演をお待ちしています．数学基礎論若手の会2013開催要領日時：2013年11月15日（金） - 2013年11月17日（日）講演会場：九州産業大学2号館2E406 宿泊：九州産業大学立花寮1階立花研修所幹事：田中義人（九州産業大学） E-mail：ytanaka(a)ip.kyusan-u.ac.jp 数学基礎論若手の会2013ホームページ： http://www.ip.kyusan-u.ac.jp/J/ms/event/wakate13/notice.html 九州産業大学立花研修所：宿泊料金：1人1泊2415円，1人2泊4725円食事料金：朝食1食250円，夕食1食400円宿泊設備（4人部屋×10室）：2人掛け机2台，椅子4脚，2段ベッド2組　　　　（1人部屋× 3室）：机1台，椅子1脚，ベッド，バス，トイレ共有スペース：シャワー室，トイレ，洗面所，コインランドリー門限 22:30，消灯 23:00 研修所内での飲酒・喫煙はご遠慮願います．退所の際は，宿泊室，シャワー室，トイレ，談話室等の清掃をお願いします． ※ 宿泊や食事を伴わない参加も歓迎します． ※ 親睦会等の会費は別途いただく予定です． ※ 部屋割りに関しては，幹事にご一任ください．参加申し込み：参加をご希望の方は，下記に必要事項をご記載の上，幹事宛に電子メールでお申し込みください．締切：2013年10月27日 ---------------------------------------------------------------- 数学基礎論若手の会参加申し込みフォーム氏名：所属機関：職名/学年：講演について：講演：する / しない講演題目：立花研修所の宿泊・食事について宿泊：要 / 不要宿泊を希望する場合： 15日 / 16日食事：要 / 不要食事を希望する場合： 15日（夕） / 16日（朝・夕） / 17日（朝） ----------------------------------------------------------------

1 0

Book Series: Logic in Asia について
by 小野寛晰 30 Aug '13

30 Aug '13

皆様北京の清華大学の Fenrong Liu さんとともに、新たな book series "Logic in Asia" を企画してきました。最近 Springer と契約を終え、Studia Logica Library の Trends in Logic と並ぶ一シリーズとして今後モノグラフやプロシーディングスを出版していくことになります。proposal 等の形式は近く Springer のサイトに記載される予定ですが、Trends in Logic とほぼ同様になる予定です。添付したファイルにこのシリーズの概要がありますので、ご検討ください。またご質問等ありましたら私宛にご連絡ください。小野寛晰

1 0

超準解析シンポジウム（第2報）
by Hiroshi Akiyama 28 Aug '13

28 Aug '13

皆様： 2013年度超準解析シンポジウム世話人の明山（静岡大学）です．プログラム（暫定版）を作成いたしました．日程は最初の予定から短縮しました．懇親会を9月18日（水）夕方からと考えております．場所等は未定です．シンポジウムに参加されるかたは，お手数ですが懇親会へのご出欠を9月9日（月）までに私までお知らせいただければ幸いです．　　　　　　　　　　　　　　　　記 2013年度超準解析シンポジウム期間： 2013年9月18日(水)12：30 から 9月19日(木)12：30 まで　会場：静岡県浜松市中区城北3-5-1　静岡大学（浜松キャンパス）　　　工学部6号館（旧・共通棟）12教室　　　（北門のすぐそばの5階建ての建物の1階です）会場への交通：遠鉄（遠州鉄道）バスをご利用の場合，JR浜松駅北口バスターミナル15番または16番のりばで乗車，「静岡大学」で下車（所要時間は約20分，運賃180円）．プログラム（暫定版）９月１８日（水） 12：30--13：00 受付 13：00--13：40 明山　浩　（静岡大学）　多様体上の熱核に対する超準的方法 13：50--14：35 横山啓太　（北陸先端科学技術大学院大学）　弱い組合わせ命題と超準的手法 14：50--15：35 山下秀康　（愛知学院大学）　コヒーレント状態経路積分と de Broglie 場 15：45--16：30 知沢清之　（管理工学研究所）　On the two methods to prove the existence of 4-dimensional canard 16：40--17:20 （予備：追加講演またはショートコミュニケーション）懇親会（予定）９月１９日（木） 9：30--10：15 柳川　信　（筑波大学）　A non-standard construction of p-adically closed fields 10：25--11：10 村上雅彦　（東京医大）　Yet another quantum set theory 11：25--12：10 松永　隆　（大阪府立成人病センター）　A key lemma to a nonstandard proof of the Doob-Meyer theorem 12：30 連絡事項等，　閉会　　 ************** 世話人：静岡大学工学部共通講座　　明山　浩　　　　　 e-mail：　tshakiy(a)ipc.shizuoka.ac.jp

1 0

[CFP] *Deadline Extended* 2nd International Workshop on Formal Techniques for Safety-Critical Systems (FTSCS2013)
by Takashi KITAMURA 28 Aug '13

28 Aug '13

みなさま、こんにちは、産総研の北村崇師です。今年10月にニュージーランドで開催の FTSCS2013 の論文投稿締め切りが9月6日に延長されましたのでお知らせいたします。 http://www.ftscs.org/ > FTSCS2013 は形式手法をテーマにしたワークショップです。 > 研究論文だけでなく、経験論文や調査論文、ツール論文、ポジションペーパも募集しています。 > Proceedings は Springer の CCIS より出版され、FTSCS2013 を基にElsevier の Science of Computer Programming で特集号が企画される予定です。是非論文投稿をご検討ください。よろしくお願い致します。 --------------------------------------------------------------------- *** Deadline extended to September 6th *** --------------------------------------------------------------------- Call for Papers FTSCS 2013 2nd International Workshop on Formal Techniques for Safety-Critical Systems Queenstown, New Zealand, October 29, 2013 (satellite workshop of ICFEM 2013) http://www.ftscs.org --------------------------------------------------------------------- *** Science of Computer Programming special issue *** *** Springer CCIS proceedings *** Aims and Scope: There is an increasing demand in industry to use formal methods to achieve software-independent verification and validation of safety-critical systems, e.g., in fields such as avionics, automotive, medical, and other cyber-physical systems. Newer standards, such as DO-178C (avionics) and ISO 26262 (automotive), emphasize the need for formal methods and model-based development, 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. In particular, FTSCS strives 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, 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. Invited speaker: TBA 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 format); 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 will be done electronically via EasyChair at http://www.easychair.org/conferences/?conf=ftscs2013. 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 2013. 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 6, 2013 Notification of acceptance: September 28, 2013 Workshop: October 29, 2013 Venue: Queenstown, New Zealand Program chairs: Cyrille Artho AIST, Japan Peter Olveczky University of Oslo, Norway Program committee: Erika Abraham RWTH Aachen University, Germany Musab AlTurki King Fahd University of Petroleum and Minerals, Saudi Arabia Toshiaki Aoki JAIST, Japan Farhad Arbab Leiden University and CWI, The Netherlands Cyrille Artho AIST, Japan Saddek Bensalem Verimag, France Armin Biere Johannes Kepler University, Austria Santiago Escobar Universidad Politecnica de Valencia, Spain Ansgar Fehnker University of the South Pacific, Fiji Mamoun Filali IRIT, France Bernd Fischer Stellenbosch University, South Africa and University of Southampton, UK Kokichi Futatsugi JAIST, Japan Klaus Havelund NASA JPL, USA Marieke Huisman University of Twente, The Netherlands Ralf Huuck NICTA/UNSW, Sydney, Australia Fuyuki Ishikawa National Institute of Informatics, Tokyo, Japan Takashi Kitamura AIST, Japan Alexander Knapp Augsburg University, Germany Paddy Krishnan Oracle Labs Brisbane, Australia Yang Liu Nanyang Technological University, Singapore Robi Malik University of Waikato, New Zealand Cesar Munoz NASA Langley, USA Tang Nguyen UST Hanoi, Vietnam Thomas Noll RWTH Aachen University, Germany Peter Olveczky University of Oslo, Norway Paul Pettersson Malardalen University, Sweden Camilo Rocha Escuela Colombiana de Ingenieria, Colombia Grigore Rosu University of Illinois at Urbana-Champaign, USA Neha Rungta NASA Ames, USA Ralf Sasse ETH Zurich, Switzerland Oleg Sokolsky University of Pennsylvania, USA Sofiene Tahar Concordia University, Canada Carolyn Talcott SRI International, USA Tatsuhiro Tsuchiya Osaka University, Japan Michael Whalen University of Minnesota, USA Peng Wu Chinese Academy of Sciences, China Contact: (web) http://www.ftscs.org (email) peterol(a)ifi.uio.no and c.artho(a)aist.go.jp -- Takashi KITAMURA Ph.D. t.kitamura(a)aist.go.jp http://staff.aist.go.jp/t.kitamura/ Research Institute for Secure Systems (RISEC) National Institute of Advanced Industrial Science and Technology (AIST) Nakoji 3-11-46, Amagasaki, Hyogo 661-0974, Japan Tel: +81-6-6494-8054 Fax: +81-6-6494-8073 Internal Tel: *33-274-71902

1 0

JAIST Logic Seminar Series
by Takako Nemoto 26 Aug '13

26 Aug '13

皆様直前のお知らせになって申し訳ありません。ジーゲン大学（ドイツ）の Hannes Diener 博士の講演のお知らせです。ふるってご参加ください。問い合わせ先：根元多佳子北陸先端科学技術大学院大学情報科学研究科 e-mail: t-nemoto(a)jaist.ac.jp ----------------------------------------------- * JAIST Logic Seminar Series * * This seminar is held as a part of the EU FP7 Marie Curie Actions IRSES project COMPUTAL (http://computal.uni-trier.de/). Date: Wednesday 28 August, 2013, 15:30- Place: JAIST, Collaboration room 6 (I-57g) (Access: http://www.jaist.ac.jp/english/location/access.html) Title: The recursive part of constructive reverse mathematics Abstract: http://www.jaist.ac.jp/~t-nemoto/Diener_talk.pdf

1 0

Workshop on Relevant Logics
by KASHIMA Ryo 24 Aug '13

24 Aug '13

皆様、 Relevant logic に関係する研究者の交流，情報交換を目的としたワークショップを開催します。どなたでもご参加いただけますが，参加の場合は事前に御一報ください。日時：9月10日(火) 13:00から場所：東京工業大学大岡山キャンパス西８号館W棟10階1008号室プログラム： 13:00 鹿島亮（東工大） Relevant logic の定式化について 14:00 吉満昭宏（琉球大）関連論理Bの情報的意味論 15:15 佐野勝彦（JAIST） Alternative Semantics for Visser’s Basic Propositional Logic 16:15 大森仁（学振海外特別研究員，ニューヨーク市立大学・ボーフム大学）否定と関連(連関)論理 17:15 古森雄一 Relevant logic との出会い詳細はこちら： http://www.is.titech.ac.jp/~kashima/Events/RelevantLogic2013.html 問い合わせ先：鹿島亮 kashima(a)is.titech.ac.jp

1 0

SLACS & ALGI 共催イベントのお知らせ（9/24-26)
by Ichiro Hasuo 20 Aug '13

20 Aug '13

みなさま，下のお知らせ，再送させてください．アップデートですが： - ウェブページを更新しました．参加者・講演者，スケジュール（仮）が見えます．https://sites.google.com/site/slagics2013/ - 参加申込，まだまだ受付中です（9/13 まで）．講演スロットもまだまだありますので，講演希望の方もぜひどうぞ！暫定プログラムが https://docs.google.com/spreadsheet/ccc?key=0AnyEiro37woZdEo3MkY1c1pUYjFlek… ですが，3日間朝から夕方までやるき満々です． - 旅費補助・数研宿舎の申込は締切りました．どうかよろしくお願いいたします！ SLAGICS organizers: 星野直彦，蓮尾一郎 2013/6/3 Ichiro Hasuo <ichiro(a)is.s.u-tokyo.ac.jp>: > (English below) > > みなさま，（何人かの方々には bcc で失礼します） > > こんにちは！東京大学の蓮尾です． > > 京都大学数理解析研究所で行うワークショップ > > SLAGICS 2013: ALGI and SLACS join forces > 京都大学数理解析研究所 RIMS研究集会 > 2013/9/24（火） -- 2013/9/26（木） > https://sites.google.com/site/slagics2013/ > > へのお誘いです． > > === 背景 ============================== == > 毎年行われている研究集会 > > ALGI (Algebra, Logic and Geometry in Informatics) > 代数, 論理, 幾何と情報科学研究集会 > http://sakura.math.kyushu-u.ac.jp/algi/ > > と > > SLACS (Symbolic Logic and Computer Science) > 記号論理と情報科学研究集会 > http://www.math.s.chiba-u.ac.jp/SLACS/ > > は両方共スコープが広く，共通部分も大きいと考え，ALGI 幹事の星野直 > 彦さんと SLACS 幹事の蓮尾が相談し，今年は京都大学数理解析研究所の > 研究集会として共催をすることにしました． > （応募に際してご協力いただいた皆さま，どうもありがとうございました． > 無事採択されました） > > 3日間の日程をなんとなく ALGI day と SLACS day に色分けします．が， > 特に2日目は相互乗り入れデーとして，東京大学の塚田武志さんによる共 > 同チュートリアルなどを通して，2つのコミュニティの協働関係を築く場 > にできればと考えております． > > === プログラム ================================ > > 9/24 は SLACS day > 9/25 は相互乗り入れ day > 9/26 は ALGI day > > とします（なんとなく）．9/25 には，東京大学の塚田武志さん > http://www.kb.is.s.u-tokyo.ac.jp/~tsukada/ > によるゲーム意味論のチュートリアルを予定しています． > 懇親会は 9/24 です． > > 9/24 の午前から 9/26 の午後まで3日間フルの日程を考えていますが，講 > 演の数によっては短縮の可能性があります． > > === 旅費の補助・宿泊 ================================ > > 京都大学数理解析研究所から旅費の補助があります．また，数理解析研究所附属の > 宿泊施設（北白川学舎）が使えます（部屋数僅少）．くわしくは > https://sites.google.com/site/slagics2013/practical > をごらんください． > > === 参加登録 ================================ > https://sites.google.com/site/slagics2013/registration > からお願いします． > > 参加登録の締切は， > > - 旅費希望または北白川学舎宿泊希望のかたは， > *** 2013/8/16 （金）*** > （ただし基本的に早い者勝ちなので，早めがおすすめです） > - それ以外の方は *** 2013/9/13 （金）*** > > とさせてください． > > > ぜひ参加をご検討ください．ご不明な点は遠慮無くお問い合せくださいね． > それでは！ > > SLAGICS 2013 オーガナイザー > > 星野直彦 > 京都大学数理解析研究所 > http://www.kurims.kyoto-u.ac.jp/~naophiko/ > > 蓮尾一郎 > 東京大学コンピュータ科学専攻 > http://www-mmm.is.s.u-tokyo.ac.jp/~ichiro/ > > > > ======================================================== > > SLAGICS 2013: ALGI and SLACS join forces > RIMS, Kyoto University > 2013/9/24 (Tue) -- 2013/9/26 (Thu) > https://sites.google.com/site/slagics2013/ > > > ALGI and SLACS are two series of workshops in Japan whose > interests range widely from formal logic and semantics to > algebraic geometric, and categorical methods, with emphases on > computer science. This year the two series join forces and > hold a joint workshop in Kyoto. > > Though many talks will be in Japanese, your contributed talks > in English are most welcome and appreciated. See > > https://sites.google.com/site/slagics2013/practical-in-english > > for some practical information. (There will be travel support by > courtesy of RIMS, Kyoto University). The registration deadlines are: > > - *** Fri 16 Aug *** if you'd like travel support or a room > at the RIMS accommodation (but do it ASAP since these are > first come, first served); > - *** Fri 13 Sep *** otherwise. > > Looking forward to seeing you in Kyoto! > > Best regards, > > SLAGICS 2013 Organizers: > Naohiko Hoshino > RIMS, Kyoto U. > http://www.kurims.kyoto-u.ac.jp/~naophiko/ > > Ichiro Hasuo > Dept. CS, U. Tokyo > http://www-mmm.is.s.u-tokyo.ac.jp/~ichiro/

1 0

Extended Deadline: AAA 2013 - 1st International Workshop on Argument for Agreement and Assurance
by Hiroyuki Kido 14 Aug '13

14 Aug '13

Apologies for cross-postings. =============================================================== 1st International Workshop on Argument for Agreement and Assurance (AAA 2013) Kanagawa, Japan October 27-28, 2013 http://www.panda.sys.t.u-tokyo.ac.jp/kido/AAA2013/ *** Extended deadline: August 24 *** =============================================================== OVERVIEW: ---------------- Submissions are invited for the 1st International Workshop on Argument for Agreement and Assurance (AAA 2013). The workshop will be held in Keio University Hiyoshi Campus, Kanagawa, Japan, on October 27-28, 2013, as part of the Japanese Society for Artificial Intelligence international symposia on AI (JSAI-isAI) 2013. Argumentation has now become an interdisciplinary challenging research area in AI aiming at formalizing various aspects of human or/and computer software argument in terms of computation, and applying those knowledge to various fields. Scope of argumentation in AI includes human arguments appeared in television, newspapers, WWW, etc. and also artificial arguments constructed from structured knowledge with logical language and inference rules. Results of argumentation in AI are widely applicable to various fields such as consensus building, agreement formation, multiagent systems, semantic web, recommendation systems, argument mining, learning, belief revisions, chance discovery, safety engineering, etc. In particular, safety engineering is a research area that is interested in the use of an evidence-based argument often called a safety case, assurance case or dependability case. Nowadays, it is becoming necessary for certification bodies to issue a license to developing and operating bodies, for system stakeholders to make agreement, for system administrators to achieve accountability, etc. AAA 2013 contributes to deepen mutual understanding between researchers working on argumentation theory in AI and researchers working on agreement and assurance technologies through arguments. AAA 2013 solicits contributions from broad range of researchers related to argumentation in AI and especially welcomes contributions across argumentation and systems assurance. AAA 2013 seeks high-quality original submission of full papers limited to 14 pages including figures, references, etc. All submissions will be rigorously peer reviewed with double blind. Selected papers will be included in JSAI-isAI 2013 post-proceedings as a volume of LNAI published by Springer Verlag. AIMS AND SCOPE: -------------------------- AAA 2013 aims to deepen mutual understanding between researchers working on argumentation theory in AI and researchers working on agreement and assurance technologies through arguments, and to share current limitations and problems of argumentation in AI in terms of both theory and practice. Topics of interest include but are not limited to the following: - Abstract and structured argumentation systems including studies of frameworks, proof-theories, semantics, complexity, etc. - Dialogue systems for persuasion, negotiation, deliberation, eristic, information-seeking dialogues, etc. - Applications of argumentation and dialogue systems to various fields such as agreement technologies, systems assurance, safety engineering, multi-agent systems, practical reasoning, belief revision, learning, semantic web, etc. - Agreement and assurance technologies through arguments including safety cases, assurance cases and dependability cases, etc. - Tools for argumentation systems, dialogue systems, argument-based stakeholders' agreement, argument-based accountability achievement, argument-based open systems dependability, argument-based verification and validation, etc. IMPORTANT DATES: ---------------------------- - Workshop Submission Deadline: August 24, 2013 (Extended!) - Workshop Author Notification: September 15, 2013 - Workshop Camera-ready: September 30, 2013 - Workshop Date: October 27-28, 2013 SUBMISSION INSTRUCTIONS: ------------------------------------------ We welcome and encourage the submission of high quality, original papers, which are not simultaneously submitted for publication elsewhere. Papers should be written in English, formatted according to the Springer Verlag LNCS style in a pdf form, which can be obtained from Springer Online, 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. Here is the submission page. https://www.easychair.org/account/signin.cgi?conf=aaa2013 If a paper is accepted, at least one author of the paper must register the workshop and present it. PROCEEDINGS: ---------------------- A printed volume of the proceedings will be available at the workshop. Springer Verlag has agreed to publish selected papers of the workshop in the JSAI-isAI 2013 post-proceedings as a volume of LNAI. Thus, the authors of papers presented at the workshop will be asked to extend their contributions, possibly incorporating the results of the workshop discussion, to be included in the workshop post-proceedings, after another round of refereeing. VENUE: ---------- The workshop will be held at Raiosha Building, Keio University, Kanagawa, JAPAN. ORGANIZING COMMITTEE: -------------------------------------- - Kenji Taguchi (AIST, Japan) - Yoshiki Kinoshita (Kanagawa Univ., Japan) - Kazuko Takahashi (Kwansei Gakuin Univ., Japan) - Hiroyuki Kido (Univ. of Tokyo, Japan) PROGRAMME COMMITTEE: -------------------------------------- - Takashi Kitamura (AIST, Japan) - Sarah Alice Gaggl (Technische Universität Dresden, Germany) - Guillermo Ricardo Simari (Universidad Nacional del Sur, Argentina) - Paolo Torroni (Univ. of Bologna, Italy) - Gabriele KernIsberner (Technische Universitaet Dortmund, Germany) - Ken Satoh (National Institute of Informatics, Japan) - Chiaki Sakama (Wakayama Univ., Japan) - Toshinori Takai (Nara Institute of Science and Technology, Japan) - Antonis Kakas (Univ. of Cyprus, Cyprus) - Iyad Rahwan (Masdar Institute of Science & Technology, UAE) - Pavlos Moraitis (Paris Descartes Univ., France) - Stefan Woltran (Vienna Univ. of Technology, Austria) - Phan Minh Dung (Asian Institute of Technology, Thailand) - Juergen Dix (Clausthal Univ. of Technology, Germany) - Martin Caminada (Univ. of Aberdeen, UK) - Makoto Takeyama (Kanagawa Univ., Japan) - Kenji Taguchi (AIST, Japan) - Yoshiki Kinoshita (Kanagawa Univ., Japan) - Kazuko Takahashi (Kwansei Univ., Japan) - Hiroyuki Kido (Univ. of Tokyo, Japan) - Shuichiro Yamamoto (Nagoya Univ., Japan) - Yutaka Matsuno (Univ. of Electro-Communications, Japan) - Tim Kelly (Univ. of York, UK) - John Rushby (SRI, USA) - John Knight (Univ. of Virginia, USA) - Ewen Denney (NASA/Ames, USA) - Charles Weinstock (SEI, USA) - Robin Bloomfield (City Univ. of London, UK)

1 0

Kobe Colloquium on Logic, Statistics and Informatics, August 19 (Sheila Miller)
by Joerg Brendle 13 Aug '13

13 Aug '13

Kobe Colloquium on Logic, Statistics and Informatics 以下の要領でコロキウムを開催します。日時：2013年8月19日（月）15:00-16:30 講演者：Sheila Miller (CUNY ニュー・ヨーク) 場所：神戸大学自然科学総合研究棟3号館4階421室（プレゼンテーション室） ============================================================ 題目： How not to construct the free two-generated left distributive algebra アブストラクト： We begin with an extended introduction to free left distributive algebras (LDs) including a normal form theorem for the one-generated free LD, which itself arises naturally from the assumption of a very large cardinal axiom. After discussing some applications and open problems, we make remarks on the impossibility of using forcing to construct a two-generated free LD by lifting the rank-to-rank elementary embedding used to create the one-generated free LD. ============================================================ 交通：阪急六甲駅またはJR六甲道駅から神戸市バス36系統「鶴甲団地」行きに乗車，「神大本部工学部前」停留所下車，徒歩すぐ． http://www.kobe-u.ac.jp/info/access/rokko/rokkodai-dai2.htm

1 0

**講演希望の方もお早めに** SLACS & ALGI 共催イベントのお知らせ（9/24-26)
by Ichiro Hasuo 13 Aug '13

13 Aug '13

みなさま，蓮尾です．ALGI + SLACS = SLAGICS 2013 のお知らせを再送します．すみません，日程を確定させる必要上，講演希望の方も早め（できれば今週中，8/16 金曜日まで）に参加申し込みをお願いいたします． https://sites.google.com/site/slagics2013/registration それでは，京都でお会いしましょう！蓮尾一郎 ============================== (English below) みなさま，（何人かの方々には bcc で失礼します）こんにちは！東京大学の蓮尾です．京都大学数理解析研究所で行うワークショップ SLAGICS 2013: ALGI and SLACS join forces 京都大学数理解析研究所 RIMS研究集会 2013/9/24（火） -- 2013/9/26（木） https://sites.google.com/site/slagics2013/ へのお誘いです． === 背景 ================================ 毎年行われている研究集会 ALGI (Algebra, Logic and Geometry in Informatics) 代数, 論理, 幾何と情報科学研究集会 http://sakura.math.kyushu-u.ac.jp/algi/ と SLACS (Symbolic Logic and Computer Science) 記号論理と情報科学研究集会 http://www.math.s.chiba-u.ac.jp/SLACS/ は両方共スコープが広く，共通部分も大きいと考え，ALGI 幹事の星野直彦さんと SLACS 幹事の蓮尾が相談し，今年は京都大学数理解析研究所の研究集会として共催をすることにしました． 3日間の日程をなんとなく ALGI day と SLACS day に色分けします．が，特に2日目は相互乗り入れデーとして，東京大学の塚田武志さんによる共同チュートリアルなどを通して，2つのコミュニティの協働関係を築く場にできればと考えております． === プログラム ================================ 9/24 は SLACS day 9/25 は相互乗り入れ day 9/26 は ALGI day とします（なんとなく）．9/25 には，東京大学の塚田武志さん http://www.kb.is.s.u-tokyo.ac.jp/~tsukada/ によるゲーム意味論のチュートリアルを予定しています．懇親会は 9/24 です． 9/24 の午前から 9/26 の午後まで3日間フルの日程を考えていますが，講演の数によっては短縮の可能性があります． === 旅費の補助・宿泊 ================================ 京都大学数理解析研究所から旅費の補助があります．また，数理解析研究所附属の宿泊施設（北白川学舎）が使えます（部屋数僅少）．くわしくは https://sites.google.com/site/slagics2013/practical をごらんください． === 参加登録・講演の申し込み ============================== https://sites.google.com/site/slagics2013/registration からお願いします．参加登録の締切は， - 講演希望，旅費希望または北白川学舎宿泊希望のかたは， *** 2013/8/16 （金）*** （ただし基本的に早い者勝ちなので，早めがおすすめです） - それ以外の方は *** 2013/9/13 （金）*** とさせてください．ぜひ参加をご検討ください．ご不明な点は遠慮無くお問い合せくださいね．それでは！ SLAGICS 2013 オーガナイザー星野直彦京都大学数理解析研究所 http://www.kurims.kyoto-u.ac.jp/~naophiko/ 蓮尾一郎東京大学コンピュータ科学専攻 http://www-mmm.is.s.u-tokyo.ac.jp/~ichiro/ ======================================================== SLAGICS 2013: ALGI and SLACS join forces RIMS, Kyoto University 2013/9/24 (Tue) -- 2013/9/26 (Thu) https://sites.google.com/site/slagics2013/ ALGI and SLACS are two series of workshops in Japan whose interests range widely from formal logic and semantics to algebraic geometric, and categorical methods, with emphases on computer science. This year the two series join forces and hold a joint workshop in Kyoto. Though many talks will be in Japanese, your contributed talks in English are most welcome and appreciated. See https://sites.google.com/site/slagics2013/practical-in-english for some practical information. (There will be travel support by courtesy of RIMS, Kyoto University). The registration deadlines are: - *** Fri 16 Aug *** if you'd like travel support, a room at the RIMS accommodation, and/or a talk slot (but do it ASAP since these are first come, first served); - *** Fri 13 Sep *** otherwise. Looking forward to seeing you in Kyoto! Best regards, SLAGICS 2013 Organizers: Naohiko Hoshino RIMS, Kyoto U. http://www.kurims.kyoto-u.ac.jp/~naophiko/ Ichiro Hasuo Dept. CS, U. Tokyo http://www-mmm.is.s.u-tokyo.ac.jp/~ichiro/

1 0

Kobe Colloquium on Logic, Statistics and Informatics, August 13 (Luz Garcia)
by Joerg Brendle 11 Aug '13

11 Aug '13

Kobe Colloquium on Logic, Statistics and Informatics 以下の要領でコロキウムを開催します。日時：2013年8月13日（火）13:20-14:50 講演者：Luz García (バルセロナ大学と神戸大学) 場所：神戸大学自然科学総合研究棟3号館4階421室（プレゼンテーション室） ============================================================ 題目： Forcing Arguments in Infinite Ramsey Theory アブストラクト： Neil Hindman proved a Ramsey-like result that was conjectured by Graham and Rotschild. Hindman's Theorem asserts that if the set of all natural numbers is divided into two classes, one of the classes contains an infinite set such that all finite sums of distinct members of the set remain in the same class. Hindman's original proof was greatly simplified by James Baumgartner. We will present a proof of this theorem which relies on forcing arguments. The analysis of the partial order arising in the proof of Hindman's Theorem, which we denote by P_{FIN}, is our main interest. The partial order P_{FIN} is similar both to the one due to Matet and to Mathias forcing. This prompts the question whether it is equivalent to one of them or not. ============================================================ 交通：阪急六甲駅またはJR六甲道駅から神戸市バス36系統「鶴甲団地」行きに乗車，「神大本部工学部前」停留所下車，徒歩すぐ． http://www.kobe-u.ac.jp/info/access/rokko/rokkodai-dai2.htm

1 0

The 2nd International Workshop on Game Theory, Epistemic Logic, & Related Topics
by Suzuki, Nobu-Yuki 10 Aug '13

10 Aug '13

皆様金子守さんの依頼で代理投稿いたします。よろしくお願いします。鈴木信行（静岡大学） ------------------------------- 皆様筑波大学の石川です。先日ご案内申し上げた八月のコンファレンス The 2nd International Workshop on Game Theory, Epistemic Logic, & Related Topics: http://infoshako.sk.tsukuba.ac.jp/~ishikawa/gamelogic13/ のプログラムが添付ファイルのように決定しました。興味のある方のご参加を歓迎致しますので，奮ってご参加ください。また，初日の夜はconference dinnerを計画しております。こちらにご参加ご希望の方は，石川(ishikawa(a)sk.tsukuba.ac.jp) までご連絡いただければと思います。石川竜一郎 --------------------------------------------------------------- Ryuichiro ISHIKAWA (Associate Professor). Faculty of Engineering, Information and Systems, University of Tsukuba, 1-1-1 Ten-nodai, Tsukuba 305-8573, Japan Tel: +81-(0)29-853-5072 Fax: +81-(0)29-853-5070 URL: http://infoshako.sk.tsukuba.ac.jp/~ishikawa/index.html e-mail: ishikawa(a)sk.tsukuba.ac.jp

1 0

2013LLS
by Toshihiko Kurata 06 Aug '13

06 Aug '13

皆様， 09月15日〜19日に「ラムダ計算と論理の晩夏セミナー」が予定されていますので，御案内させて頂きます．詳細はHPが http://komoriyuichi.web.fc2.com/symposium/KusatsuSeminar2008/2013/index2.ht… にありますので御確認下さい．今回の宿泊・参加に関する連絡は倉田（法政大学）まで頂けたらと思います．お気軽に参加を検討頂けますと幸いです．よろしくお願いいたします． -- Toshihiko Kurata, Hosei University e-mail: kurata(a)hosei.ac.jp

1 0

SLACS & ALGI 共催イベントのお知らせ（9/24-26)
by Ichiro Hasuo 04 Aug '13

04 Aug '13

(English below) みなさま，（何人かの方々には bcc で失礼します）こんにちは！東京大学の蓮尾です．京都大学数理解析研究所で行うワークショップ SLAGICS 2013: ALGI and SLACS join forces 京都大学数理解析研究所 RIMS研究集会 2013/9/24（火） -- 2013/9/26（木） https://sites.google.com/site/slagics2013/ へのお誘いです． === 背景 ================================ 毎年行われている研究集会 ALGI (Algebra, Logic and Geometry in Informatics) 代数, 論理, 幾何と情報科学研究集会 http://sakura.math.kyushu-u.ac.jp/algi/ と SLACS (Symbolic Logic and Computer Science) 記号論理と情報科学研究集会 http://www.math.s.chiba-u.ac.jp/SLACS/ は両方共スコープが広く，共通部分も大きいと考え，ALGI 幹事の星野直彦さんと SLACS 幹事の蓮尾が相談し，今年は京都大学数理解析研究所の研究集会として共催をすることにしました．（応募に際してご協力いただいた皆さま，どうもありがとうございました．無事採択されました） 3日間の日程をなんとなく ALGI day と SLACS day に色分けします．が，特に2日目は相互乗り入れデーとして，東京大学の塚田武志さんによる共同チュートリアルなどを通して，2つのコミュニティの協働関係を築く場にできればと考えております． === プログラム ================================ 9/24 は SLACS day 9/25 は相互乗り入れ day 9/26 は ALGI day とします（なんとなく）．9/25 には，東京大学の塚田武志さん http://www.kb.is.s.u-tokyo.ac.jp/~tsukada/ によるゲーム意味論のチュートリアルを予定しています．懇親会は 9/24 です． 9/24 の午前から 9/26 の午後まで3日間フルの日程を考えていますが，講演の数によっては短縮の可能性があります． === 旅費の補助・宿泊 ================================ 京都大学数理解析研究所から旅費の補助があります．また，数理解析研究所附属の宿泊施設（北白川学舎）が使えます（部屋数僅少）．くわしくは https://sites.google.com/site/slagics2013/practical をごらんください． === 参加登録 ================================ https://sites.google.com/site/slagics2013/registration からお願いします．参加登録の締切は， - 旅費希望または北白川学舎宿泊希望のかたは， *** 2013/8/16 （金）*** （ただし基本的に早い者勝ちなので，早めがおすすめです） - それ以外の方は *** 2013/9/13 （金）*** とさせてください．ぜひ参加をご検討ください．ご不明な点は遠慮無くお問い合せくださいね．それでは！ SLAGICS 2013 オーガナイザー星野直彦京都大学数理解析研究所 http://www.kurims.kyoto-u.ac.jp/~naophiko/ 蓮尾一郎東京大学コンピュータ科学専攻 http://www-mmm.is.s.u-tokyo.ac.jp/~ichiro/ ======================================================== SLAGICS 2013: ALGI and SLACS join forces RIMS, Kyoto University 2013/9/24 (Tue) -- 2013/9/26 (Thu) https://sites.google.com/site/slagics2013/ ALGI and SLACS are two series of workshops in Japan whose interests range widely from formal logic and semantics to algebraic geometric, and categorical methods, with emphases on computer science. This year the two series join forces and hold a joint workshop in Kyoto. Though many talks will be in Japanese, your contributed talks in English are most welcome and appreciated. See https://sites.google.com/site/slagics2013/practical-in-english for some practical information. (There will be travel support by courtesy of RIMS, Kyoto University). The registration deadlines are: - *** Fri 16 Aug *** if you'd like travel support or a room at the RIMS accommodation (but do it ASAP since these are first come, first served); - *** Fri 13 Sep *** otherwise. Looking forward to seeing you in Kyoto! Best regards, SLAGICS 2013 Organizers: Naohiko Hoshino RIMS, Kyoto U. http://www.kurims.kyoto-u.ac.jp/~naophiko/ Ichiro Hasuo Dept. CS, U. Tokyo http://www-mmm.is.s.u-tokyo.ac.jp/~ichiro/

1 2

教員公募
by S.Yamane 01 Aug '13

01 Aug '13

関係者各位金沢大学理工研究域では、以下の教員公募を行っております。適任者がありましたら，どうぞお知らせ下さいますようお願い申し上げます。クロスポストをご容赦ください。金沢大学山根　智 ------------------------------------------------------------- 関係各位　　　　　　　　　　　　　　　　　　　　　　　　　平成２５年８月１日　　　　　　　　　　　　　　　　　　　　　　金沢大学理工研究域電子情報学系長　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　山　根　智　　　　　　　　　　　　　　　教員の公募について　この度，当研究域電子情報学系では，下記の要領により教員を公募いたします。つきましては，関係各位への周知方及び適任者の推薦について，よろしくお取り計らい下さいますようお願い申し上げます。　　　　　　　　　　　　　　　　　　　記１．職種　　　教授１名２．所属　　　金沢大学理工研究域電子情報学系（情報システムコース）３．専門分野　数学（解析系が望ましい）４．担当科目　　　　学士課程共通教育科目（微分積分学，線形代数学），　　　　　　　　工学系数学科目（微分方程式，ベクトル解析，複素解析，　　　　　　　　フーリエ解析など），　　　　　　　　情報システムコースの数学関連科目及び学士課程学生の研究指導　　　　大学院　自然科学研究科電子情報科学専攻の数学関連科目，　　　　　　　　大学院生の研究指導５．応募資格　　 (1)博士の学位を有すること　　(2)十分な研究業績を有し，大学院博士後期課程において研究指導ができること　　(3)大学における数学教育に十分な実績を持ち，特に熱意をもって工学系学士課程　　　学生に対する数学教育を行えること　　(4)大学内における諸業務を学内教職員と協調して行えること６．着任時期平成２６年４月１日７．応募書類　　 (1) 履歴書（写真貼付，学歴は高卒以降，学位，職歴，賞罰）　　 (2) 研究業績リスト（研究論文，著書，国際学会発表，報告等；印刷中，投稿中の　　　ものはその旨明記のこと）　　 (3) 主要論文の別刷（５編以内，各１部，コピー可）　　 (4) これまで行ってきた研究の概要と今後の研究計画（A４用紙２枚程度）　　 (5) 教育経験と着任後の教育（学士課程学生，大学院生への研究指導を含む）に関する抱負（A４用紙１〜２枚程度）　　 (6) 外部資金（科研費など）の獲得状況　　 (7) 応募者の業績を評価できる方２名の氏名と連絡先　　 (8) 直接連絡のとれる住所，電話番号，電子メールアドレスを記載した連絡表８．応募締め切り　平成２５年１０月３１日（木）必着９．書類提出先　　　　〒920-1192 金沢市角間町金沢大学理工研究域電子情報学系長山根智１０．問い合わせ先　　　金沢大学理工研究域電子情報学系畑上到　　　　（Tel: 076-234-4911;E-mail:hataue@is.t.kanazawa-u.ac.jp）１１．その他　　 (1) 書類選考の上，候補者に対し面接（プレゼンテーション）を行います。　　　　面接の旅費等は自己負担となります。選考及び面接結果については本人に　　　　直接通知します。応募書類は返却致しません。　　 (2) 応募書類は封筒に「電子情報学系教員応募書類在中」と朱書の上，郵送の場合　　　　は簡易書留にしてください。　 ○ 就業規則等については,下記の URL をご覧ください。　　 http://www.kanazawa-u.ac.jp/internal/staff/regulations/index.html 　○ 金沢大学では男女共同参画を積極的に推進しています。詳しくは下記の URL を　　ご覧ください。　　 http://cdl.w3.kanazawa-u.ac.jp/index.html -------------------------------------------------------------

1 0

再送：数学基礎論若手の会（11月15日-11月17日）のご案内
by Yoshihito Tanaka 01 Aug '13

01 Aug '13

（重複して受け取られた場合はご容赦ください）再送：数学基礎論若手の会2013のご案内数学基礎論若手の会は，数学基礎論を専攻する学生および若手研究者の研究交流を目的とする合宿形式の研究集会です．講演はオリジナルの成果発表に限らず，研究の途中報告や研究内容の紹介など幅広く募集しています．また，これから数学基礎論を勉強したいと思っている方のご参加も歓迎します．多くの方のご参加・ご講演をお待ちしています．数学基礎論若手の会2013開催要領日時：2013年11月15日（金） - 2013年11月17日（日）講演会場：九州産業大学2号館2E406 宿泊：九州産業大学立花寮1階立花研修所幹事：田中義人（九州産業大学） E-mail：ytanaka(a)ip.kyusan-u.ac.jp 数学基礎論若手の会2013ホームページ： http://www.ip.kyusan-u.ac.jp/J/ms/event/wakate13/notice.html 九州産業大学立花研修所宿泊料金：1人1泊2415円，1人2泊4725円食事料金：朝食1食250円，夕食1食400円宿泊設備（4人部屋×10室）：2人掛け机2台，椅子4脚，2段ベッド2組　　　　（1人部屋× 3室）：机1台，椅子1脚，ベッド，バス，トイレ共有スペース：シャワー室，トイレ，洗面所，コインランドリー門限 22:30，消灯 23:00 研修所内での飲酒・喫煙はご遠慮願います．退所の際は，宿泊室，シャワー室，トイレ，談話室等の清掃をお願いします． ※ 宿泊や食事を伴わない参加も歓迎します． ※ 親睦会等の会費は別途いただく予定です． ※ 部屋割りに関しては，幹事にご一任ください．参加申し込み：参加をご希望の方は，下記に必要事項をご記載の上，幹事宛に電子メールでお申し込みください．締切：2013年10月27日 ---------------------------------------------------------------- 数学基礎論若手の会参加申し込みフォーム氏名：所属機関：職名/学年：講演について：講演：する / しない講演題目：立花研修所の宿泊・食事について宿泊：要 / 不要宿泊を希望する場合： 15日 / 16日食事：要 / 不要食事を希望する場合： 15日（夕） / 16日（朝・夕） / 17日（朝） ---------------------------------------------------------------- ********************************* 田中義人九州産業大学経済学部 813-8503 福岡市東区松香台2-3-1 092-673-5216 (直通) e-mail: ytanaka(a)ip.kyusan-u.ac.jp *********************************

1 0

2nd CfP: 2nd International Workshop on Formal Techniques for Safety-Critical Systems (FTSCS2013)
by Takashi KITAMURA 01 Aug '13

01 Aug '13

みなさま、産業技術総合研究所の北村崇師です。今年10月にニュージーランドで開催される FTSCS2013 の論文募集の案内をお送りいたします。 FTSCS2013 は形式手法をテーマにしたワークショップで、研究論文だけでなく、経験論文や調査論文、ツール論文、ポジションペーパも募集しています。 FTSCS2013 のProceedings は Springer の CCIS より出版され、またFTSCS2013 を基に Elsevier の Science of Computer Programming で特集号が企画されます。是非論文投稿をご検討下さい。 ----------------------------------------------------------------------------------------------------------------------- --------------------------------------------------------------------- Call for Papers FTSCS 2013 2nd International Workshop on Formal Techniques for Safety-Critical Systems Queenstown, New Zealand, October 29, 2013 (satellite workshop of ICFEM 2013) http://www.ftscs.org --------------------------------------------------------------------- *** Science of Computer Programming special issue *** *** Springer CCIS proceedings *** Aims and Scope: There is an increasing demand in industry to use formal methods to achieve software-independent verification and validation of safety-critical systems, e.g., in fields such as avionics, automotive, medical, and other cyber-physical systems. Newer standards, such as DO-178C (avionics) and ISO 26262 (automotive), emphasize the need for formal methods and model-based development, 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. In particular, FTSCS strives 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, 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. Invited speaker: TBA 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 format); 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 will be done electronically via EasyChair at http://www.easychair.org/conferences/?conf=ftscs2013. 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 2013. 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 1, 2013 Notification of acceptance: September 28, 2013 Workshop: October 29, 2013 Venue: Queenstown, New Zealand Program chairs: Cyrille Artho AIST, Japan Peter Olveczky University of Oslo, Norway Program committee: Erika Abraham RWTH Aachen University, Germany Musab AlTurki King Fahd University of Petroleum and Minerals, Saudi Arabia Toshiaki Aoki JAIST, Japan Farhad Arbab Leiden University and CWI, The Netherlands Cyrille Artho AIST, Japan Saddek Bensalem Verimag, France Armin Biere Johannes Kepler University, Austria Santiago Escobar Universidad Politecnica de Valencia, Spain Ansgar Fehnker University of the South Pacific, Fiji Mamoun Filali IRIT, France Bernd Fischer Stellenbosch University, South Africa and University of Southampton, UK Kokichi Futatsugi JAIST, Japan Klaus Havelund NASA JPL, USA Marieke Huisman University of Twente, The Netherlands Ralf Huuck NICTA/UNSW, Sydney, Australia Fuyuki Ishikawa National Institute of Informatics, Tokyo, Japan Takashi Kitamura AIST, Japan Alexander Knapp Augsburg University, Germany Paddy Krishnan Oracle Labs Brisbane, Australia Yang Liu Nanyang Technological University, Singapore Robi Malik University of Waikato, New Zealand Cesar Munoz NASA Langley, USA Tang Nguyen UST Hanoi, Vietnam Thomas Noll RWTH Aachen University, Germany Peter Olveczky University of Oslo, Norway Paul Pettersson Malardalen University, Sweden Camilo Rocha Escuela Colombiana de Ingenieria, Colombia Grigore Rosu University of Illinois at Urbana-Champaign, USA Neha Rungta NASA Ames, USA Ralf Sasse ETH Zurich, Switzerland Oleg Sokolsky University of Pennsylvania, USA Sofiene Tahar Concordia University, Canada Carolyn Talcott SRI International, USA Tatsuhiro Tsuchiya Osaka University, Japan Michael Whalen University of Minnesota, USA Peng Wu Chinese Academy of Sciences, China Contact: (web) http://www.ftscs.org (email) peterol(a)ifi.uio.no and c.artho(a)aist.go.jp -- Takashi KITAMURA Ph.D. t.kitamura(a)aist.go.jp http://staff.aist.go.jp/t.kitamura/ Research Institute for Secure Systems (RISEC) National Institute of Advanced Industrial Science and Technology (AIST) Nakoji 3-11-46, Amagasaki, Hyogo 661-0974, Japan Tel: +81-6-6494-8054 Fax: +81-6-6494-8073 Internal Tel: *33-274-71902

1 0

CFP: LENLS10 (Logic and Engineering of Natural Language Semantics 10)
by BEKKI Daisuke 31 Jul '13

31 Jul '13

（重複して受け取られた場合はご容赦ください）今年の１０月に東京で開催される LENLS 10 国際ワークショップのご案内をお送り致します（締切を8/4まで延長しました）。皆様のご参加をお待ちしております。戸次大介（お茶の水女子大学） [Apologies for multiple copies] ================================================================= FINAL CALL FOR PAPERS || Deadline Extended !! Logic and Engineering of Natural Language Semantics 10 (LENLS 10) Workshop Site : "Raiousha Building, Keio University" Kanagawa, Japan. http://www.keio.ac.jp/en/maps/hiyoshi.html Dates : October 27-28, 2013 Contact Person: Shunsuke Yatabe (West Japan Railway Company) Contact Email : lenls10[[at]]easychair.org Website : http://www.is.ocha.ac.jp/‾bekki/lenls/ ================================================================= Chair: Shunsuke Yatabe (West Japan Railway Company) Co-chair: Daisuke Bekki (Ochanomizu University/ National Institute of Informatics) Eric McCready (Aoyama Gakuin University) Invited Speaker(s): - Nicholas J.J. Smith (the University of Sydney) - Richard Dietz (the University of Tokyo) LENLS is an annual international workshop on formal syntax, semantics and pragmatics. It will be held as one of the workshops of the fifth JSAI International Symposia on AI (isAI2013) (http://www.ai-gakkai.or.jp/jsai-isai/2013/) sponsored by the Japan Society for Artificial Intelligence (JSAI) (http://www.ai-gakkai.or.jp/jsai/english.html). Aims and Topics: ================ We invite submissions to this year's workshop on topics in formal semantics and pragmatics, and related fields, including but in no way limited to the following: - Dynamic syntax/semantics/pragmatics of natural language - Categorical/topological/coalgebraic approaches for natural language syntax/semantics/pragmatics - Logic and its relation to natural language and linguistic reasoning (especially dynamic logics) - Type-theoretic approaches to natural language - Formal Philosophy of language - Formal pragmatics (especially game-theoretic and utility-theoretic approaches) - Substructural expansion of Lambek Lambda Calculi - Many-valued/Fuzzy and other non-classical logics and natural language Submissions: ============ Abstracts (up to 4 pages, including figures and references) must be submitted electronically in PDF format at: https://www.easychair.org/conferences/?conf=lenls10 When his/her 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. Selected Papers: ================ We also plan to publish a selection of the accepted/invited papers as a portion of a volume "JSAI-isAI selected papers", which will be published from `Lecture Notes in Artificial Intelligence' series (Springer Verlag). Important dates: ================ Abstract submission deadline: August 4, 2013 (EXTENDED) Notification of acceptance: August 26, 2013 Deadline for camera-ready copy: September 22, 2013 LENLS10: October 27-28, 2013 Tutorial Lecture: October 29, 2013 Workshop Organizers/Program Committee: ====================================== - Shunsuke Yatabe (West Japan Railway Company) - Daisuke Bekki (Ochanomizu University/National Institute of Informatics) - Alastair Butler (PRESTO JST/Tohoku University) - Eric McCready (Aoyama Gakuin University) - Koji Mineshima (Keio University) - 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) - Kei Yoshimoto (Tohoku University)

1 0

再送：愛媛大学理学部・教員公募（ 6 日締切）
by FUJITA Hiroshi 29 Jul '13

29 Jul '13

応募締め切りが迫ってきたので再度告知させていただきます。同一文面で logic-ml と数学会基礎論分科会の kisoron-ml にポストしております。ご了承ください。愛媛大学の藤田です。この場をお借りして理学部数学科の教員人事の告知をさせてください。位相空間論や集合論的トポロジーあるいは集合論の研究者の応募を広く呼びかけたいと思っております。どうぞご検討くださいませ。下記引用文と同一の文面のPDFファイルを http://www.ehime-u.ac.jp/information/employment/teacher_details.html?new_re… からダウンロードできます。 -- 藤田博司 <fujita.hiroshi.mh(a)ehime-u.ac.jp> =========================================================== 　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　平成２５年６月６日　各　　位　　　　　　　　　　　　　　　　愛媛大学大学院理工学研究科（理学系）　　　　　　　　　　　　　　　　　　　人事委員会委員長　　　宇　野　英　満　　　　　　　　　　　　教員の公募について（依頼）　謹啓　時下ますますご清祥のこととお慶び申し上げます。　さて，このたび当研究科では下記の要領により教員を公募いたします。つきましては，関係各位への周知方並びに適任者の推薦又は応募につきまして，ご高配賜りますようお願い申し上げます。　　　　　　　　　　　　記１．募集人員　　教授または准教授　１名２．所属部門　　大学院理工学研究科数理物質科学専攻数理科学講座３．専門分野　　位相数学及びその周辺の分野４．応募資格　（１）優れた研究業績をあげている方　　　　　　　（２）教育や研究活動並びに大学の運営に熱意をもって取り組める方　　　　　　　（３）博士の学位を有している方５．着任時期　　平成２６年４月１日（予定）６．任　　期　　なし７．提出書類　（１）履歴書（写真貼付、賞罰、所属学会を含むこと）　　　　　　　（２）研究業績リスト（原著論文、総説、著書、研究費取得状況、その他）　　　　　　　（３）主要論文５編程度の別刷（コピー可）　　　　　　　（４）これまでの研究概要とこれからの研究計画（それぞれＡ４紙１枚程度）　　　　　　　（５）これまでの教育経験と今後の教育に関する抱負（Ａ４紙１枚程度）　　　　　　　（６）応募者について照会可能な方２名の氏名と連絡先８．公募締切　　平成２５年８月６日（火）必着９．提出先　　　〒790-8577　松山市文京町２−５愛媛大学大学院理工学研究科（理学系）人事委員会委員長　　宇野　英満 10．問合せ先　愛媛大学大学院理工学研究科数理物質科学専攻数理科学コース　　　　　　　　コース長　　内藤　雄基　　　　　　　　電話：089-927-9564　　Fax：089-927-9560（数学事務室）　　　　　　　　E-mail：ynaito(a)ehime-u.ac.jp 11．その他　　封筒に「数学教員応募書類在中」と朱書し，簡易書留で郵送して下さい。選考の過程で，講演をお願いし，面接を行うことがあります。ただし，旅費は応募者の負担とします。また，応募書類に記載された個人情報は，本人事のみに使用し，応募書類は原則として返却いたしません。なお，採用予定者の氏名は，本学ホームページで公表させていただきます。　　　　　　　愛媛大学では，男女共同参画を積極的に推進しています。数理科学コースホームページ：http://www.math.sci.ehime-u.ac.jp/index.html

1 0

AAA 2013 CFP: 1st International Workshop on Argument for Agreement and Assurance
by Hiroyuki Kido 24 Jul '13

24 Jul '13

Apologies for cross-postings. ================================================================= 1st International Workshop on Argument for Agreement and Assurance (AAA 2013) Kanagawa, Japan October 27-28, 2013 http://www.panda.sys.t.u-tokyo.ac.jp/kido/AAA2013/ ================================================================= OVERVIEW: ---------------- Submissions are invited for the 1st International Workshop on Argument for Agreement and Assurance (AAA 2013). The workshop will be held in Keio University Hiyoshi Campus, Kanagawa, Japan, on October 27-28, 2013, as part of the Japanese Society for Artificial Intelligence international symposia on AI (JSAI-isAI) 2013. Argumentation has now become an interdisciplinary challenging research area in AI aiming at formalizing various aspects of human or/and computer software argument in terms of computation, and applying those knowledge to various fields. Scope of argumentation in AI includes human arguments appeared in television, newspapers, WWW, etc. and also artificial arguments constructed from structured knowledge with logical language and inference rules. Results of argumentation in AI are widely applicable to various fields such as consensus building, agreement formation, multiagent systems, semantic web, recommendation systems, argument mining, learning, belief revisions, chance discovery, safety engineering, etc. In particular, safety engineering is a research area that is interested in the use of an evidence-based argument often called a safety case, assurance case or dependability case. Nowadays, it is becoming necessary for certification bodies to issue a license to developing and operating bodies, for system stakeholders to make agreement, for system administrators to achieve accountability, etc. AAA 2013 contributes to deepen mutual understanding between researchers working on argumentation theory in AI and researchers working on agreement and assurance technologies through arguments. AAA 2013 solicits contributions from broad range of researchers related to argumentation in AI and especially welcomes contributions across argumentation and systems assurance. AAA 2013 seeks high-quality original submission of full papers limited to 14 pages including figures, references, etc. All submissions will be rigorously peer reviewed with double blind. Selected papers will be included in JSAI-isAI 2013 post-proceedings as a volume of LNAI published by Springer Verlag. AIMS AND SCOPE: -------------------------- AAA 2013 aims to deepen mutual understanding between researchers working on argumentation theory in AI and researchers working on agreement and assurance technologies through arguments, and to share current limitations and problems of argumentation in AI in terms of both theory and practice. Topics of interest include but are not limited to the following: - Abstract and structured argumentation systems including studies of frameworks, proof-theories, semantics, complexity, etc. - Dialogue systems for persuasion, negotiation, deliberation, eristic, information-seeking dialogues, etc. - Applications of argumentation and dialogue systems to various fields such as agreement technologies, systems assurance, safety engineering, multi-agent systems, practical reasoning, belief revision, learning, semantic web, etc. - Agreement and assurance technologies through arguments including safety cases, assurance cases and dependability cases, etc. - Tools for argumentation systems, dialogue systems, argument-based stakeholders' agreement, argument-based accountability achievement, argument-based open systems dependability, argument-based verification and validation, etc. IMPORTANT DATES: ---------------------------- - Workshop Submission Deadline: August 10, 2013 - Workshop Author Notification: September 15, 2013 - Workshop Camera-ready: September 30, 2013 - Workshop Date: October 27-28, 2013 SUBMISSION INSTRUCTIONS: ------------------------------------------ We welcome and encourage the submission of high quality, original papers, which are not simultaneously submitted for publication elsewhere. Papers should be written in English, formatted according to the Springer Verlag LNCS style in a pdf form, which can be obtained from Springer Online, 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. Here is the submission page. https://www.easychair.org/account/signin.cgi?conf=aaa2013 If a paper is accepted, at least one author of the paper must register the workshop and present it. PROCEEDINGS: ---------------------- A printed volume of the proceedings will be available at the workshop. Springer Verlag has agreed to publish selected papers of the workshop in the JSAI-isAI 2013 post-proceedings as a volume of LNAI. Thus, the authors of papers presented at the workshop will be asked to extend their contributions, possibly incorporating the results of the workshop discussion, to be included in the workshop post-proceedings, after another round of refereeing. VENUE: ---------- The workshop will be held at Raiosha Building, Keio University, Kanagawa, JAPAN. ORGANIZING COMMITTEE: -------------------------------------- - Kenji Taguchi (AIST, Japan) - Yoshiki Kinoshita (Kanagawa Univ., Japan) - Kazuko Takahashi (Kwansei Gakuin Univ., Japan) - Hiroyuki Kido (Univ. of Tokyo, Japan) PROGRAMME COMMITTEE: -------------------------------------- - Takashi Kitamura (AIST, Japan) - Sarah Alice Gaggl (Technische Universität Dresden, Germany) - Guillermo Ricardo Simari (Universidad Nacional del Sur, Argentina) - Paolo Torroni (Univ. of Bologna, Italy) - Gabriele KernIsberner (Technische Universitaet Dortmund, Germany) - Ken Satoh (National Institute of Informatics, Japan) - Chiaki Sakama (Wakayama Univ., Japan) - Toshinori Takai (Nara Institute of Science and Technology, Japan) - Antonis Kakas (Univ. of Cyprus, Cyprus) - Iyad Rahwan (Masdar Institute of Science & Technology, UAE) - Pavlos Moraitis (Paris Descartes Univ., France) - Stefan Woltran (Vienna Univ. of Technology, Austria) - Phan Minh Dung (Asian Institute of Technology, Thailand) - Juergen Dix (Clausthal Univ. of Technology, Germany) - Martin Caminada (Univ. of Aberdeen, UK) - Makoto Takeyama (Kanagawa Univ., Japan) - Kenji Taguchi (AIST, Japan) - Yoshiki Kinoshita (Kanagawa Univ., Japan) - Kazuko Takahashi (Kwansei Univ., Japan) - Hiroyuki Kido (Univ. of Tokyo, Japan) - Shuichiro Yamamoto (Nagoya Univ., Japan) - Yutaka Matsuno (Univ. of Electro-Communications, Japan) - Tim Kelly (Univ. of York, UK) - John Rushby (SRI, USA) - John Knight (Univ. of Virginia, USA) - Ewen Denney (NASA/Ames, USA) - Charles Weinstock (SEI, USA) - Robin Bloomfield (City Univ. of London, UK) Best regards, Hiroyuki Kido, Ph.D., Assistant Professor Department of Systems Innovation School of Engineering, The University of Tokyo 113-8656 Tokyo, Japan Tel/Fax: +81-3-5841-1895 E-mail: kido(a)sys.t.u-tokyo.ac.jp

1 0

証明論研究集会2013（教室変更、プログラム、講演追加募集）
by Kazushige TERUI 23 Jul '13

23 Jul '13

みなさま 8月8日−9日に慶応大学三田キャンパスで予定されている証明論研究集会について再度ご案内させて頂きます。・教室が変更になりましたのでご注意ください。　（慶応大学三田キャンパス南校舎475号室）　　http://www.keio.ac.jp/ja/access/mita.html ・プログラム（仮）をウェブページに掲載しました。・まだスロットに余裕がありますので、追加で講演希望を受け付けたいと思います。　（証明論に限らず、計算機科学や基礎論他分野等の周辺分野を含む）　講演の希望がありましたら、世話人までご相談ください。・詳細は　http://www.kurims.kyoto-u.ac.jp/~terui/proof2013.html 　をご覧ください。照井 ------------------------------------------ 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

数学基礎論サマースクール2013（※教室変更）
by Kazushige TERUI 23 Jul '13

23 Jul '13

みなさま 8月5日−7日に慶応大学三田キャンパスで予定されている数学基礎論サマースクールについて再度ご案内させて頂きます。・教室が変更になりましたのでご注意ください。　（慶応大学三田キャンパス南校舎475号室）　　http://www.keio.ac.jp/ja/access/mita.html ・会場の都合で定員を85名（先着順）とさせていただきます。　すでに40名ほどの方から参加希望を承っております。　参加予定の方は、早めにお申込みください。・時間割をウェブページに掲載しました。・詳細は　http://www.kurims.kyoto-u.ac.jp/~terui/school2013.html 　をご覧ください。照井 ------------------------------------------ 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

講演会``A Frontier of Non-Classical Logic'' （7月19日，@京大文学部）のご案内
by 久木田水生 17 Jul '13

17 Jul '13

皆様京都大学哲学研究室ODの久木田です．下記の通り，京都大学文学部応用哲学倫理センター（CAPE）主催による ``A Frontier of Non-Classical Logic''と題されたセミナーが行われます．哲学的なバックグラウンドを持ち，論理学の分野で世界的な業績をあげている研究者の方々による講演です．講演は日本語で行われます．どうぞふるってご参加下さい．久木田記日時：7月19日（金），10:30-14:30 場所：京都大学文学部地下小会議室テーマ：A Frontier of Non-Classical Logic プログラム： 10:30-12:00 Katsuhiko Sano (JAIST), “Alternative Semantics for Visser’s Basic Propositional Logic” Lunch Break 13:00-14:30 Hidenori Kurokawa (Kobe University )and Hirohiko Kushida (CUNY), “Substructural logic of proofs and self-referentiality” 詳細はCAPEのWebページをご覧下さい． http://www.bun.kyoto-u.ac.jp/news/%E7%AC%AC20%E5%9B%9Ecape%E3%83%AC%E3%82%A… 以上

1 0

JAIST Logic Seminar Series
by Hajime Ishihara 16 Jul '13

16 Jul '13

皆様 JAIST Logic Seminar Seriesのお知らせです。ふるってご参加ください。問合せ先：石原　哉北陸先端科学技術大学院大学情報科学研究科 e-mail: ishihara(a)jaist.ac.jp -------------------------------------------------- * JAIST Logic Seminar Series * * This seminar is held as a part of the EU FP7 Marie Curie Actions IRSES project COMPUTAL (http://computal.uni-trier.de/). Date: Monday 29 July, 2013, 15:00-17:00 Place: JAIST, Collaboration room 7 (I-56) (Access: http://www.jaist.ac.jp/english/location/access.html) Speaker: Professor Martin Ziegler (Technische Universitaet Darmstadt) Title: HENKIN CONTINUITY OF MULTIVALUED FUNCTIONS (joint work with Arno Pauly) Abstract: A type-2 computable real function is necessarily continuous; and this remains true for relative, i.e. oracle-based, computations. Conversely, by the Weierstrass Approximation Theorem, every continuous $f:[0;1]\to\mathbb{R}$ is computable relative to some oracle. In their search for a similar topological characterization of relatively computable \emph{multi-}valued functions $f:[0;1]\rightrightarrows\mathbb{R}$ (aka multi-functions or relations), Brattka and Hertling (1994) have considered two notions: weak continuity (which is weaker than relative computability) and strong continuity (which is stronger than relative computability). Observing that \emph{uniform} continuity plays a crucial role in the Weierstrass Theorem, we propose and compare several notions of uniform continuity for relations. Here, due to the additional quantification over values $y\in f(x)$, new ways arise of (linearly) ordering quantifiers---yet none turns out as satisfactory. We are thus led to a concept of uniform continuity based on the \textsf{Henkin quantifier}; and prove it necessary for relative computability of compact real relations. In fact iterating this condition yields a strict hierarchy of notions each necessary --- and the $\omega$-th level also sufficient --- for relative computability. A refined, quantitative analysis exhibits a similar topological characterization of relative polynomial-time computability. -- Professor Hajime Ishihara School of Information Science Japan Advanced Institute of Science and Technology 1-1 Asahidai, Nomi, Ishikawa 923-1292, Japan Tel: +81-761-51-1206 Fax: +81-761-51-1149 ishihara(a)jaist.ac.jp http://www.jaist.ac.jp/~ishihara

1 0

39th TRS Meeting - Call for Participation
by Nao Hirokawa 12 Jul '13

12 Jul '13

皆様 9月18日〜20日に行われます書換えに関する研究集会「第39回TRSミーティング」の参加者募集の案内をお送り致します。 http://www.jaist.ac.jp/~c-sterna/39th-trs-meeting/ 今回の会場は秋田市さとみ温泉でして、すでに名古屋大学から大山口教授、また海外からはインスブルック大学の Middeldorp 教授、Zankl 研究員の参加が決まっております。皆様、ぜひ参加をご検討下さい！廣川 (JAIST) ---------------------------------------------------------------------- 39th TRS Meeting Akita http://www.jaist.ac.jp/~c-sterna/39th-trs-meeting/ About the TRS Meeting The Term Rewriting Meeting (TRS Meeting) is a biannual informal workshop that aims at promoting the research on rewriting and related areas. Participants are requested to give a talk of approximately 15 to 60 minutes in English on their research activities. The subject of the talk is not required to be one's original result; for example, explaining an interesting paper is perfectly OK. (See Rewriting Researchers Forum for further information: http://www.jaist.ac.jp/~hirokawa/trs-meeting/) Information Date: September 18 (Wed) -- 20 (Fri), 2013 Venue: Akita Onsen Satomi, http://www.satomi-e.com Keidaikawara Soegawa, Akita, 010-0822 Program September 18 (Wed) 14:00-18:00 meeting September 19 (Thu) 9:00-18:00: meeting September 20 (Fri) 9:00-12:00: meeting Fee ~ 26,000 yen (including lodging, breakfast, and dinner for 2 nights) Registration Please indicate whether you would like to join by sending the registration form below to Christian Sternagel (c-sterna(a)jaist.ac.jp) no later than August 15, 2013. ---------------------------------------------------------------------- Registration Form of the 39th TRS Meeting name: affiliation: title of talk*: approximate duration of talk (in minutes)*: preference on your room: [A single room is preferred / A shared room is acceptable](choose one) (In case of partial participation, please contact me) ---------------------------------------------------------------------- The items marked with * can be sent later. Contact Christian Sternagel (c-sterna(a)jaist.ac.jp)

1 0

締切延長：証明論研究集会（８月８日−９日）
by Kazushige TERUI 12 Jul '13

12 Jul '13

みなさま証明論（および関連分野の）研究集会についてですが、講演数不足のため締め切りを７月２２日（月）まで延長させていただきます。証明論および周辺研究分野のみなさま、どうかぜひ講演をご検討ください。照井 --- 例年行われている証明論を中心とした研究集会についてご案内させていただきます。昨年度の様子については http://www.ac.auone-net.jp/~bellp/meeting/proof2012.html をご覧ください。今年度は下記の要領で開催します。日時：2013年8月8日（木）午前 − 9日（金）午後　　　　なお5日（月）−7日（水）には数学基礎論サマースクールが開催されます。会場：慶応義塾大学三田キャンパス東館6階G-Sec Lab 　　　http://www1.gsec.keio.ac.jp/text/about_access.php 世話人：照井一成（京都大学）ホームページ：http://www.kurims.kyoto-u.ac.jp/~terui/proof2013.html 講演をご希望の方は7月22日までに下記を記入の上、terui(a)kurims.kyoto-u.ac.xn--jp-g73aubyah0f2d4208a8fyh. 氏名所属身分（学年）メールアドレス講演タイトル（未定でも可）講演希望時間：長め（50分〜）・短め（30分）（※必ずしもご希望に沿えない場合があることをご了承ください。）講演日時：不都合な日時がありましたらお知らせください。 ------------------------------------------ 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

Fwd: categories: PhD positions in Leicester
by Ichiro Hasuo 07 Jul '13

07 Jul '13

転送します．蓮尾 ---------- Forwarded message ---------- From: Alexander Kurz <ak155(a)mcs.le.ac.uk> Date: Fri, Jul 5, 2013 at 8:10 PM Subject: categories: PhD positions in Leicester To: categories <categories(a)mta.ca> Hi All, we have 3 PhD positions in Computer Science, deadline 29th July. http://www2.le.ac.uk/study/research/funding/computerscience-gta Applications by students interested in a PhD on Category Theory in Computer Science are particularly welcome, despite the fact that category theory is not listed under "topics of particular interest" in the advert, which was an oversight. I would be very grateful if you could pass this on to potential candidates. Ideally, interested students would get in touch with me directly before applying formally. Best wishes, Alexander [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

$B=8Cf9V5A$N$*CN$i$;(B
by Hasegawa Masahito 04 Jul '13

04 Jul '13

$B3'MM!"(B $B5~ETBg3XBg3X1!M}3X8&5f2J$G$O!"0J2<$NFbMF$G=8Cf9V5A!JA4#42s!K(B $B$rM=Dj$7$F$*$j$^$9!#9V;U$O!"El5~Bg3X$N2OB<>4@1@h@8$G$9!#(B $B7W;;2DG=2r@O3X$N4pAC$+$i:G6a$NOCBj$^$G$r2r@b$7$FD:$-$^$9!#(B $BM}3X8&5f2J$NBg3X1!@8$rBP>]$H$7$?3+9V2JL\$G$9$,!"4X?4$r$*;}$A$N(B $BJ}$O$I$J$?$G$b$*5$7Z$K$4MhD02<$5$$!#ITL@$JE@$,$"$j$^$7$?$i!"(B $BD9C+@n$^$G$*Ld$$9g$o$;2<$5$$!#(B $BD9C+@n???M(B <hassei at kurims.kyoto-u.ac.jp> $B5~ETBg3X?tM}2r@O8&5f=j(B ====================================================================== $B5~ETBg3XBg3X1!M}3X8&5f2J?t3X!&?tM}2r@O@l96?tM}2r@O7O(B $B?tM}2r@OFCJL9V5A#1(B $B7W;;5!2J3X!J=8Cf9V5A!K(B $B!V<B?t$N7W;;M}O@!W(B $B9V(B $B;U!'2OB<(B $B>4@1(B $B;a(B $B!JEl5~Bg3XBg3X1!>pJsM}9)3X7O8&5f2J!K(B $BF|(B $B;~!'#2#0#1#3G/#77n#2#2F|!&#2#3F|!&#87n#1F|!&#2F|(B $B$$$:$l$b#1#4;~3+;O(B $B>l(B $B=j!'Am9g8&5f#29f4[#43,(B $B#4#7#89f<<(B $B!JCm!'KLIt$N?tM}2r@O8&5f=jK\4[$G$O$"$j$^$;$s!#I4K|JW$NFnElB&$G$9!#(B $BCO?^$O(B http://www.kurims.kyoto-u.ac.jp/~hassei/map-2.jpg $B!K(B $B7W;;2DG=@-$d7W;;NL$ON%;6E*!&M-8BE*$JA`:n$K$h$k=hM}$NG=NO$H8B3&$r8l$k35(B $BG0$G$"$k$,!"E,@Z$JDj<02=$K$h$j<B?t!"<B?tCMH!?t!"<B?t$N=89g$H$$$C$?O"B3(B $BE*$JBP>]$K$b1~MQ$9$k$3$H$,$G$-$k!#K\9V5A$G$O7W;;2DG=2r@O3X$H8F$P$l$k$3(B $B$NJ,Ln$N4pAC$+$i:G6a$NOCBj$^$G2r@b$9$k!#(B $BFC$KM=HwCN<1$O2>Dj$;$:0lHLE*$J7W;;NLM}O@$N35@b$+$i;O$a$k!#$3$l$r<B?t$J(B $B$I$N2r@O3XE*BP>]$KEv$F$O$a$kOHAH$G$"$kFs7?7W;;$HI=8=$NM}O@$r2r@b$7!"$=(B $B$N1~MQ$H$7$F<BH!?t$d<B?t=89g$KBP$9$kMM!9$J6qBNE*A`:n$N7W;;NL$r07$&!#(B 1. $B7W;;NLM}O@$N4pAC(B $B!&LdBj$H;;K!(B $B!&;~4V!&6u4V$N@)8B(B $B!&Hs7hDj@-!&MpBr!&7W?t(B $B!&5"Ce$HAjBP2=(B 2. $B<B?t$N7W;;M}O@(B $B!&Fs7?7W;;$HI=8=$NM}O@(B $B!&<B?t$H<BH!?t$NI=8=(B $B!&=89g$NI=8=$H7W;;(B $B!&MM!9$J1i;;$N7W;;NL(B $B9V5A%&%'%VJG!'(B http://www-imai.is.s.u-tokyo.ac.jp/~kawamura/teaching/rims_H25/ $B0u:~MQ0FFb!'(B http://www.kurims.kyoto-u.ac.jp/~hassei/kawamura2013.pdf ======================================================================

1 0

超準解析シンポジウム（第1報）
by Hiroshi Akiyama 04 Jul '13

04 Jul '13

皆様：静岡大学の明山です。 2013年度超準解析シンポジウムを下記のように開催いたしたいと存じます。よろしくお願いいたします。　　　　　　　　　　　　　　　　記 2013年度超準解析シンポジウム期間： 2013年9月17日(火)午後〜9月19日(木)午前　（予定）会場：静岡県浜松市中区城北3-5-1　静岡大学（浜松キャンハ゜ス）　　　工学部6号館（旧・共通棟）12教室　　　（北門のすぐそばの５階建ての建物の1階です）ご参加いただけるかたは　講演の有無　講演題目（仮題でも結構です）　講演できない日時(無・有) を下記期日までに下記世話人までお知らせください。　参加・講演申込締切：2013年8月23日(金) （おおよその人数把握のため，参加だけの方もお知らせいただければ幸いに存じます。）世話人：静岡大学工学部共通講座　　明山　浩　　　　　 e-mail：　tshakiy(a)ipc.shizuoka.ac.jp

1 0

Nagoya Logic Seminar
by 吉信康夫 02 Jul '13

02 Jul '13

皆様：以下の要領で名古屋数学基礎論セミナーを開催します。奮って御参加下さい。日時：7月5日(金) 15:30- 場所：名古屋大学全学教育棟3階 SIS5 教室 (http://www.nagoya-u.ac.jp/2012website/global-info/images/access-map/map2.pdf の地図でB4(1)の建物です。建物内配置図は http://www.ilas.nagoya-u.ac.jp/student/lectureroom/ でご覧になれます。 SIS5 教室は3階の中央より少し北, C36の北隣にあります。) 講演者：John Pardo (ペンシルバニア州立大学, JSPSサマープログラム研究員(北陸先端大)) 題： Forcing and Basis Theorems in Computability Theory アブストラクト：The technique of forcing, primarily known for its applications in set theory, has proven to be quite useful in computability theory as well. I will discuss how forcing is made effective in the computable sense, as well as use this technique to prove the Low Basis Theorem, the Hyper-immune free Basis Theorem, and the Cone-Avoidance Basis Theorem, all of which are due to Jockusch and Soare. (7/2 に神戸大学で予定されている講演と概ね同内容ですのでご注意下さい。)

1 0

RIMS set theory workshop 2013
by fuchino＠diamond.kobe-u.ac.jp 01 Jul '13

01 Jul '13

今年の RIMS set theory workshop の世話人の渕野昌＠神戸大学システム情報学研究科です．今年 (平成25年度) の workshop は，9月9日(月) から，9月12日(木) の開催予定です．この集会の webpage は http://kurt.scitec.kobe-u.ac.jp/~fuchino/rims2013/RIMS_Set_Theory_Workshop_… にあります．参加申し込みの必要はありませんが，参加者人数の把握をしておきたいので，参加をご予定の方は，講演を予定されていない方でも私にあらかじめ御一報くださると助かります． RIMS からの補助もありますので，学生の方などで補助を御希望の方は御連絡ください．上のページからたどれる日本語のページにも書きましたが，RIMS では，原則として，集会で講演をしなかった人のペーパーは講究録には載せない，というポリシーを昨年からとりはじめたようです．これに対応するために，プログラムでは Short Reports のセクションの設定を計画しています．講演は考慮中だが後で講究録にはペーパーを載せたいと考えていらっしゃる方はこれをご利用ください．今回は，松江のトポロジーの学会がワークショップの直前にあるため，海外からの参加者が多く参加予定です．海外からの参加者の多くは，スーパーホテル四条河原町に泊ってもらうことになる予定です．このホテルに宿泊を御希望の方は，酒井拓史 ( h-sakai(a)mvj.biglobe.ne.jp ) さんが部屋の予約をキープしていますので，彼に連絡をしてください． -- best regards Saka\'e Fuchino (渕野昌) ------------------------------------------------------------------------- Kobe University Graduate School of System Informatics Rokko-dai 1-1, Nada, Kobe 657-8501 Japan e-mail: fuchino(a)diamond.kobe-u.ac.jp web page: http://kurt.scitec.kobe-u.ac.jp/~fuchino/ -------------------------------------------------------------------------

1 0

Logic Seminar at Kobe
by Makoto Kikuchi 28 Jun '13

28 Jun '13

皆様，直前の連絡となり申し訳ございませんが，以下の要領でセミナーを開きます．日時: 2013年7月28日 (金), 10:40-12:10 場所: 神戸大学自然科学総合研究棟3号館4階421室（プレゼンテーション室）講演者: Paul Larson (Miami University, Oxford, Ohio) 題目: Vaught's Conjecture and the Scott Analysis このセミナーは世界的に著名な集合論の専門家によるものですが，内容は数理論理学全般の大学院生を主な対象とした比較的入門的なものです．神戸大学大学院システム情報学研究科情報数理グループでは，こうした数理論理学の入門的なセミナーを半定期的に開催しています．ご興味をお持ちの方があれば下記までご連絡下さい．連絡先：神戸大学大学院システム情報学研究科菊池誠 mkikuchi(a)kobe-u.ac.jp

1 0

Kobe Colloquium on Logic, Statistics and Informatics, July 2 (John Pardo)
by Joerg Brendle 27 Jun '13

27 Jun '13

Kobe Colloquium on Logic, Statistics and Informatics 以下の要領でコロキウムを開催します。日時：2013年7月2日（火）13:20-14:50 講演者：John Pardo (Pennsylvania State University and JAIST) 場所：神戸大学自然科学総合研究棟3号館4階421室（プレゼンテーション室） ============================================================ 題目： Forcing and Basis Theorems in Computability Theory アブストラクト： The technique of forcing, primarily known for its applications in set theory, has proven to be quite useful in computability theory as well. I will discuss how forcing is made effective in the computable sense, as well as use this technique to prove the Low Basis Theorem, the Hyper-immune free Basis Theorem, and the Cone-Avoidance Basis Theorem, all of which are due to Jockusch and Soare. ============================================================ 交通：阪急六甲駅またはJR六甲道駅から神戸市バス36系統「鶴甲団地」行きに乗車，「神大本部工学部前」停留所下車，徒歩すぐ． http://www.kobe-u.ac.jp/info/access/rokko/rokkodai-dai2.htm

1 0

CFP: LENLS10 (Logic and Engineering of Natural Language Semantics 10)
by BEKKI Daisuke 17 Jun '13

17 Jun '13

（重複して受け取られた場合はご容赦ください）今年の１０月に東京で開催される LENLS 10 国際ワークショップのご案内をお送り致します。皆様のご参加をお待ちしております。戸次大介（お茶の水女子大学／国立情報学研究所） [Apologies for multiple copies] ================================================================= SECOND CALL FOR PAPERS Logic and Engineering of Natural Language Semantics 10 (LENLS 10) Workshop Site : "Raiousha Building, Keio University" Kanagawa, Japan. http://www.keio.ac.jp/en/maps/hiyoshi.html Dates : October 27-28, 2013 Contact Person: Shunsuke Yatabe (West Japan Railway Company) Contact Email : lenls10[[at]]easychair.org Website : http://www.is.ocha.ac.jp/‾bekki/lenls/ ================================================================= Chair: Shunsuke Yatabe (West Japan Railway Company) Co-chair: Daisuke Bekki (Ochanomizu University/ National Institute of Informatics) Eric McCready (Aoyama Gakuin University) Invited Speaker(s): - Nicholas J.J. Smith (the University of Sydney) - Richard Dietz (the University of Tokyo) LENLS is an annual international workshop on formal syntax, semantics and pragmatics. It will be held as one of the workshops of the fifth JSAI International Symposia on AI (isAI2013) (http://www.ai-gakkai.or.jp/jsai-isai/2013/) sponsored by the Japan Society for Artificial Intelligence (JSAI) (http://www.ai-gakkai.or.jp/jsai/english.html). Aims and Topics: ================ We invite submissions to this year's workshop on topics in formal semantics and pragmatics, and related fields, including but in no way limited to the following: - Dynamic syntax/semantics/pragmatics of natural language - Categorical/topological/coalgebraic approaches for natural language syntax/semantics/pragmatics - Logic and its relation to natural language and linguistic reasoning (especially dynamic logics) - Type-theoretic approaches to natural language - Formal Philosophy of language - Formal pragmatics (especially game-theoretic and utility-theoretic approaches) - Substructural expansion of Lambek Lambda Calculi - Many-valued/Fuzzy and other non-classical logics and natural language Submissions: ============ Abstracts (up to 4 pages, including figures and references) must be submitted electronically in PDF format at: https://www.easychair.org/conferences/?conf=lenls10 When his/her 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. Selected Papers: ================ We also plan to publish a selection of the accepted/invited papers as a portion of a volume "JSAI-isAI selected papers", which will be published from `Lecture Notes in Artificial Intelligence' series (Springer Verlag). Important dates: ================ Abstract submission deadline: July 31, 2013 Notification of acceptance: August 26, 2013 Deadline for camera-ready copy: September, 2013 LENLS10: October 27-28, 2013 Tutorial Lecture: October 29, 2013 Workshop Organizers/Program Committee: ====================================== - Shunsuke Yatabe (West Japan Railway Company) - Daisuke Bekki (Ochanomizu University/National Institute of Informatics) - Alastair Butler (PRESTO JST/Tohoku University) - Eric McCready (Aoyama Gakuin University) - Koji Mineshima (Keio University) - 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) - Kei Yoshimoto (Tohoku University)

1 0

証明論研究集会（８月８日−９日）
by Kazushige TERUI 16 Jun '13

16 Jun '13

みなさま例年行われている証明論を中心とした研究集会についてご案内させていただきます。昨年度の様子については http://www.ac.auone-net.jp/~bellp/meeting/proof2012.html をご覧ください。今年度は下記の要領で開催します。日時：2013年8月8日（木）午前 − 9日（金）午後　　　　※ただし発表件数によっては10日まで延長の可能性があります。　　　　延長の場合はなるべく早く通知します。　　　　なお5日（月）−7日（水）には数学基礎論サマースクールが開催されます。会場：慶応義塾大学三田キャンパス東館6階G-Sec Lab 　　　http://www1.gsec.keio.ac.jp/text/about_access.php 世話人：照井一成（京都大学）ホームページ：http://www.kurims.kyoto-u.ac.jp/~terui/proof2013.html 講演をご希望の方は7月11日までに下記を記入の上、terui(a)kurims.kyoto-u.ac.xn--jp-g73aubyah0f2d4208a8fyh. 氏名所属身分（学年）メールアドレス講演タイトル（未定でも可）講演希望時間：長め（４５分〜）・短め（２５分）（※必ずしもご希望に沿えない場合があることをご了承ください。）講演日時：不都合な日時がありましたらお知らせください。 ------------------------------------------ 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

Kobe Colloquium on Logic, Statistics and Informatics, June 25 (Paul Larson)
by Joerg Brendle 11 Jun '13

11 Jun '13

Kobe Colloquium on Logic, Statistics and Informatics 以下の要領でコロキウムを開催します。日時：2013年6月25日（火）13:20-14:50 講演者：Paul Larson (Miami University, Oxford, Ohio) 場所：神戸大学自然科学総合研究棟3号館4階421室（プレゼンテーション室） ============================================================ 題目： Fragments of MM(c^+) in Pmax extensions アブストラクト： Hugh Woodin invented the forcing construction Pmax in the early 1990's, and proved that MM(c), the restriction of Martin's Maximum to partial orders of cardinality the continuum, holds in the Pmax extension of a model of AD_R + ``Theta is regular". We will survey some recent work (with Caicedo, Sargsyan, Schindler, Steel and Zeman) on getting fragments of MM(c^+) to hold in Pmax extensions of models of stronger forms of determinacy. Of particular interest are various principles asserting the nonexistence of square sequences of length omega_3. ============================================================ 交通：阪急六甲駅またはJR六甲道駅から神戸市バス36系統「鶴甲団地」行きに乗車，「神大本部工学部前」停留所下車，徒歩すぐ． http://www.kobe-u.ac.jp/info/access/rokko/rokkodai-dai2.htm

1 0

愛媛大学理学部・教員公募（ 6 日締切）
by FUJITA Hiroshi 09 Jun '13

09 Jun '13

（同一文面で logic-ml と数学会基礎論分科会の kisoron-ml にポストしております。ご了承ください。）愛媛大学の藤田です。この場をお借りして理学部数学科の教員人事の告知をさせてください。位相空間論や集合論的トポロジーあるいは集合論の研究者の応募を広く呼びかけたいと思っております。どうぞご検討くださいませ。下記引用文と同一の文面のPDFファイルを http://www.ehime-u.ac.jp/information/employment/teacher_details.html?new_re… からダウンロードできます。 -- 藤田博司 <fujita.hiroshi.mh(a)ehime-u.ac.jp> =========================================================== 　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　平成２５年６月６日　各　　位　　　　　　　　　　　　　　　　愛媛大学大学院理工学研究科（理学系）　　　　　　　　　　　　　　　　　　　人事委員会委員長　　　宇　野　英　満　　　　　　　　　　　　教員の公募について（依頼）　謹啓　時下ますますご清祥のこととお慶び申し上げます。　さて，このたび当研究科では下記の要領により教員を公募いたします。つきましては，関係各位への周知方並びに適任者の推薦又は応募につきまして，ご高配賜りますようお願い申し上げます。　　　　　　　　　　　　記１．募集人員　　教授または准教授　１名２．所属部門　　大学院理工学研究科数理物質科学専攻数理科学講座３．専門分野　　位相数学及びその周辺の分野４．応募資格　（１）優れた研究業績をあげている方　　　　　　　（２）教育や研究活動並びに大学の運営に熱意をもって取り組める方　　　　　　　（３）博士の学位を有している方５．着任時期　　平成２６年４月１日（予定）６．任　　期　　なし７．提出書類　（１）履歴書（写真貼付、賞罰、所属学会を含むこと）　　　　　　　（２）研究業績リスト（原著論文、総説、著書、研究費取得状況、その他）　　　　　　　（３）主要論文５編程度の別刷（コピー可）　　　　　　　（４）これまでの研究概要とこれからの研究計画（それぞれＡ４紙１枚程度）　　　　　　　（５）これまでの教育経験と今後の教育に関する抱負（Ａ４紙１枚程度）　　　　　　　（６）応募者について照会可能な方２名の氏名と連絡先８．公募締切　　平成２５年８月６日（火）必着９．提出先　　　〒790-8577　松山市文京町２−５愛媛大学大学院理工学研究科（理学系）人事委員会委員長　　宇野　英満 10．問合せ先　愛媛大学大学院理工学研究科数理物質科学専攻数理科学コース　　　　　　　　コース長　　内藤　雄基　　　　　　　　電話：089-927-9564　　Fax：089-927-9560（数学事務室）　　　　　　　　E-mail：ynaito(a)ehime-u.ac.jp 11．その他　　封筒に「数学教員応募書類在中」と朱書し，簡易書留で郵送して下さい。選考の過程で，講演をお願いし，面接を行うことがあります。ただし，旅費は応募者の負担とします。また，応募書類に記載された個人情報は，本人事のみに使用し，応募書類は原則として返却いたしません。なお，採用予定者の氏名は，本学ホームページで公表させていただきます。　　　　　　　愛媛大学では，男女共同参画を積極的に推進しています。数理科学コースホームページ：http://www.math.sci.ehime-u.ac.jp/index.html

1 0

数学基礎論若手の会（11月15日-11月17日）のご案内
by Yoshihito Tanaka 06 Jun '13

06 Jun '13

（重複して受け取られた場合はご容赦ください）数学基礎論若手の会2013のご案内数学基礎論若手の会は，数学基礎論を専攻する学生および若手研究者の研究交流を目的とする合宿形式の研究集会です．講演はオリジナルの成果発表に限らず，研究の途中報告や研究内容の紹介など幅広く募集しています．また，これから数学基礎論を勉強したいと思っている方のご参加も歓迎します．多くの方のご参加・ご講演をお待ちしています．数学基礎論若手の会2013開催要領日時：2013年11月15日（金） - 2013年11月17日（日）講演会場：九州産業大学2号館2E406 宿泊：九州産業大学立花寮1階立花研修所幹事：田中義人（九州産業大学） E-mail：ytanaka(a)ip.kyusan-u.ac.jp 数学基礎論若手の会2013ホームページ： http://www.ip.kyusan-u.ac.jp/J/ms/event/wakate13/notice.html 九州産業大学立花研修所宿泊料金：1人1泊2415円，1人2泊4725円食事料金：朝食1食250円，夕食1食400円宿泊設備（4人部屋×10室）：2人掛け机2台，椅子4脚，2段ベッド2組宿泊設備（1人部屋×3室）：机1台，椅子1脚，ベッド，バス，トイレ共有スペース：シャワー室，トイレ，洗面所，コインランドリー門限 22:30，消灯 23:00 研修所内での飲酒・喫煙はご遠慮願います．退所の際は，宿泊室，シャワー室，トイレ，談話室等の清掃をお願いします． ※ 宿泊や食事を伴わない参加も歓迎します． ※ 親睦会等の会費は別途いただく予定です． ※ 部屋割りに関しては，幹事にご一任ください．参加申し込み：参加をご希望の方は，下記の形式に必要事項をご記載の上，幹事宛に電子メールでお申し込みください．締切：2013年10月27日 ---------------------------------------------------------------- 数学基礎論若手の会参加申し込みフォーム氏名：所属機関：職名/学年：講演について：講演：する / しない講演題目：立花研修所の宿泊・食事について宿泊：要 / 不要宿泊を希望する場合： 15日 / 16日食事：要 / 不要食事を希望する場合： 15日（夕） / 16日（朝・夕） / 17日（朝） ---------------------------------------------------------------- ********************************* 田中義人九州産業大学経済学部 813-8503 福岡市東区松香台2-3-1 092-673-5216 (直通) e-mail: ytanaka(a)ip.kyusan-u.ac.jp *********************************

1 0

APLAS 2013 second call for papers
by Jacques Garrigue 05 Jun '13

05 Jun '13

APLASの締め切りが6月14日に迫って来ました。重複をご容赦下さい。 =============================================================== APLAS 2013 11th Asian Symposium on Programming Languages and Systems 9-11 December 2013 Melbourne, Australia (colocated with CPP 2013) CALL FOR PAPERS =============================================================== ========== BACKGROUND ========== APLAS aims to stimulate programming language research by providing a forum for the presentation of latest results and the exchange of ideas in programming languages and systems. APLAS is based in Asia, but is an international forum that serves the worldwide programming language community. APLAS is sponsored by the Asian Association for Foundation of Software (AAFS) founded by Asian researchers in cooperation with many researchers from Europe and the USA. Past APLAS symposiums were successfully held in 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: *Regular research papers* describing original scientific research results, including tool development and case studies. Regular research papers should not exceed 16 pages in the Springer LNCS format, including bibliography and figures. They should clearly identify what has been accomplished and why it is significant. Submissions will be judged on the basis of significance, relevance, correctness, originality, and clarity. In case of lack of space, proofs, experimental results, or any information supporting the technical results of the paper could be provided as an appendix or a link to a web page, but reviewers are not obliged to read them. *System and Tool presentations* describing systems or tools that support theory, program construction, reasoning, or program execution in the scope of APLAS. System and Tool presentations are expected to be centered around a demonstration. The paper and the demonstration should identify the novelties of the tools and use motivating examples. System and Tool papers should not exceed 8 pages in the Springer LNCS format, including bibliography and figures. Submissions will be judged based on both the papers and the described systems or tools. It is highly desirable that the tools are available on the web. Papers should be submitted electronically via the submission web page: https://www.easychair.org/conferences/?conf=aplas2013 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. (While the general chair and the program chair cannot submit papers, other members of the program committee can.) ===== DATES ===== Abstract due: 10 June 2013 (Monday), 23:59 UTC Submission due: 14 June 2013 (Friday), 23:59 UTC Notification: 26 August 2013 (Monday) Final paper due: 19 September 2013 (Thursday) Conference: 9-11 December 2013 (Monday-Wednesday) ========== ORGANIZERS ========== General chair: Peter Schachte (University of Melbourne) Program chair: Chung-chieh Shan (Indiana University) Program committee: Filippo Bonchi (CNRS, ENS-Lyon, France) Yu-Fang Chen (Academia Sinica, Taiwan) Shigeru Chiba (The University of Tokyo, Japan) Jacques Garrigue (Nagoya University, Japan) Robert Glück (University of Copenhagen, Denmark) R. Govindarajan (Indian Institute of Science, India) Kazuhiro Inaba (Google, Inc., Japan) Jie-Hong Roland Jiang (National Taiwan University, Taiwan) Shin-ya Katsumata (Kyoto University, Japan) Gabriele Keller (University of New South Wales, Australia) Ana Milanova (Rensselaer Polytechnic Institute, USA) Keisuke Nakano (The University of Electro-Communications, Japan) Hakjoo Oh (Seoul National University, Korea) Bruno C. d. S. Oliveira (National University of Singapore, Singapore) Kaushik Rajan (Microsoft Research, India) Max Schäfer (Nanyang Technological University, Singapore) Ulrich Schöpp (Ludwig-Maximilians-Universität München, Germany) Paula Severi (University of Leicester, UK) Gang Tan (Lehigh University, USA) Hiroshi Unno (University of Tsukuba, Japan) Meng Wang (Chalmers University of Technology, Sweden) Jingling Xue (University of New South Wales, Australia) Mingsheng Ying (University of Technology, Sydney, Australia) Kenny Q. Zhu (Shanghai Jiao Tong University, China) ======= CONTACT ======= http://aplas2013.soic.indiana.edu/ aplas2013(a)easychair.org

1 0

CfP: 13th Intl. Workshop on Termination, Bertinoro (Italy), August 29-31
by Nao Hirokawa 04 Jun '13

04 Jun '13

皆様８月末にイタリアのベルティノーロで行われます、停止性や計算量に関するワークショップ WST 2013 の論文募集案内をお知らせ致します。今年はリソース解析のワークショップ FOPARA 2013 との合同開催です。投稿をご検討頂ければ幸いです。廣川直（JAIST） ========= 13th International Workshop on Termination (WST) =========== http://www.imn.htwk-leipzig.de/WST2013/ The Workshop on Termination traditionally brings together, in an informal setting, researchers interested in all aspects of termination, whether this interest be practical or theoretical, primary or derived. The workshop also provides a ground for cross-fertilisation of ideas from term rewriting and from the different programming language communities. The friendly atmosphere enables fruitful exchanges leading to joint research and subsequent publications. The 13th Workshop on Termination will be held from August 29 to 31, 2013, at the Centro Residenziale Universitario di Bertinoro (Italy). It will be a joint workshop, together with the 3rd International Workshop on Foundational and Practical Aspects of Resource Analysis. The sessions of WST and FOPARA will be interleaved, this way facilitating the interaction between the two communities. ========= Important Dates ============================================ submission: July 15, 2013 notification: July 25, 2013 final version: August 10, 2013 workshop: August 29 - 31, 2013 ========= Topics ===================================================== The 13th International Workshop on Termination welcomes contributions on all aspects of termination and complexity analysis. Contributions from the imperative, constraint, functional, and logic programming communities, and papers investigating applications of complexity or termination (for example in program transformation or theorem proving) are particularly welcome. Areas of interest include, but are not limited to, the following: Termination of programs Termination of rewriting Termination analysis of transition systems Complexity of programs Complexity of rewriting Implicit computational complexity Implementation of termination and complexity analysis methods Certification of termination and complexity proofs Termination orders, well-founded orders, and reduction orders Termination methods for theorem provers Strong and weak normalization of lambda calculi Termination analysis for different language paradigms Invariants for termination proving Challenging termination problems Applications to program transformation and compilation Comparison and classification of termination methods Non-termination and loop detection Termination in distributed systems Proof methods for liveness and fairness Well-quasi-order theory Ordinal notations and subrecursive hierarchies ========= Program Committee ========================================== Evelyne Contejean (Univ. Paris-Sud) Carsten Fuhs (Univ. College London) Alfons Geser (HTWK Leipzig) Jürgen Giesl (RWTH Aachen) Sergio Greco (Univ. of Calabria) Nao Hirokawa (JAIST) Dieter Hofbauer (ASW BA Saarland) Georg Moser (Univ. Innsbruck) Albert Rubio (Univ. Politecnica de Catalunya) Peter Schneider-Kamp (Syddansk Univ.) Johannes Waldmann (HTWK Leipzig) (chair) Florian Zuleger (TU Wien) ========= Submission ================================================= Submissions are short papers/extended abstract which should not exceed 5 pages. There will be no formal reviewing. Accepted papers will be made available electronically at the workshop. Papers should be submitted electronically via the submission page http://www.easychair.org/conferences/?conf=wst2013 Final versions should be created using LaTeX and the LIPIcs style file.

1 0

International Conference on Topology and Geometry 2013 （９月２日〜６日）
by Joerg Brendle 04 Jun '13

04 Jun '13

みなさま、神戸大学のブレンドレです。９月２日〜６日まで島根大学で国際会議 International Conference on Topology and Geometry 2013 が開催されます。７つのスペシャル・セッションの一つとして集合論のスペシャル・セッションを開くこととなっています。詳細については下記のホームページをご覧下さい。 http://www.math.shimane-u.ac.jp/~topgeo2013/ レジストレーションやアブストラクトの投稿の締切は *６月１６日* です。トポロジーや幾何学などと関係のある基礎論の分野のみなさまの参加をお待ちしています。よろしくお願いします。 joerg brendle

1 0

CfP: 2nd International Workshop on Formal Techniques for Safety-Critical Systems (FTSCS2013)
by Takashi KITAMURA 04 Jun '13

04 Jun '13

皆様、産業技術総合研究所の北村です。今年10月にニュージーランドで開催される FTSCS2013 の論文募集の案内をお送りいたします。是非論文投稿をご検討下さい。 --------------------------------------------------------------------- Call for Papers FTSCS 2013 2nd International Workshop on Formal Techniques for Safety-Critical Systems Queenstown, New Zealand, October 29, 2013 (satellite workshop of ICFEM 2013) http://www.ftscs.org --------------------------------------------------------------------- *** Science of Computer Programming special issue *** *** Springer CCIS proceedings *** Aims and Scope: There is an increasing demand in industry to use formal methods to achieve software-independent verification and validation of safety-critical systems, e.g., in fields such as avionics, automotive, medical, and other cyber-physical systems. Newer standards, such as DO-178C (avionics) and ISO 26262 (automotive), emphasize the need for formal methods and model-based development, 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. In particular, FTSCS strives 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, 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. Invited speaker: TBA 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 format); 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 will be done electronically via EasyChair at http://www.easychair.org/conferences/?conf=ftscs2013. 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 2013. 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 1, 2013 Notification of acceptance: September 28, 2013 Workshop: October 29, 2013 Venue: Queenstown, New Zealand Program chairs: Cyrille Artho AIST, Japan Peter Olveczky University of Oslo, Norway Program committee: Erika Abraham RWTH Aachen University, Germany Musab AlTurki King Fahd University of Petroleum and Minerals, Saudi Arabia Farhad Arbab Leiden University and CWI, The Netherlands Cyrille Artho AIST, Japan Saddek Bensalem Verimag, France Armin Biere Johannes Kepler University, Austria Santiago Escobar Universidad Politecnica de Valencia, Spain Ansgar Fehnker University of the South Pacific, Fiji Mamoun Filali IRIT, France Bernd Fischer Stellenbosch University, South Africa and University of Southampton, UK Kokichi Futatsugi JAIST, Japan Klaus Havelund NASA JPL, USA Marieke Huisman University of Twente, The Netherlands Ralf Huuck NICTA/UNSW, Sydney, Australia Fuyuki Ishikawa National Institute of Informatics, Tokyo, Japan Takashi Kitamura AIST, Japan Alexander Knapp Augsburg University, Germany Paddy Krishnan Oracle Labs Brisbane, Australia Yang Liu Nanyang Technological University, Singapore Robi Malik University of Waikato, New Zealand Cesar Munoz NASA Langley, USA Tang Nguyen UST Hanoi, Vietnam Thomas Noll RWTH Aachen University, Germany Peter Olveczky University of Oslo, Norway Paul Pettersson Malardalen University, Sweden Camilo Rocha Escuela Colombiana de Ingenieria, Colombia Grigore Rosu University of Illinois at Urbana-Champaign, USA Neha Rungta NASA Ames, USA Ralf Sasse ETH Zurich, Switzerland Oleg Sokolsky University of Pennsylvania, USA Sofiene Tahar Concordia University, Canada Carolyn Talcott SRI International, USA Tatsuhiro Tsuchiya Osaka University, Japan Michael Whalen University of Minnesota, USA Peng Wu Chinese Academy of Sciences, China Contact: (web) http://www.ftscs.org (email) peterol(a)ifi.uio.no and c.artho(a)aist.go.jp -- Takashi KITAMURA Ph.D. t.kitamura(a)aist.go.jp http://staff.aist.go.jp/t.kitamura/ Research Institute for Secure Systems (RISEC) National Institute of Advanced Industrial Science and Technology (AIST) Nakoji 3-11-46, Amagasaki, Hyogo 661-0974, Japan Tel: +81-6-6494-8054 Fax: +81-6-6494-8073 Internal Tel: *33-274-71902

1 0

数学基礎論サマースクール（８月５日−７日）
by Kazushige TERUI 04 Jun '13

04 Jun '13

みなさま今年度の数学基礎論サマースクールのご案内をさせていただきます。今年のテーマは「証明と構成」です。基礎論のみならず、計算機科学や数学の哲学など幅広い分野のみなさまの参加をお待ちしております。詳細については下記ホームページをご参照ください。なお、サマースクールに引き続き8月8日−9日には証明論研究集会を開催する予定です。こちらについては追ってご案内させていただきます。身近に学生さんや興味を持たれそうな方がいらっしゃいましたらご転送いただければ幸いです。どうぞよろしくお願いします。照井一成 -------------------------------------------------- 数学基礎論サマースクール 2013 ホームページ： http://www.kurims.kyoto-u.ac.jp/~terui/school2013.html ・テーマ：証明と構成・日時： 2013年8月5日（月）午後 -- 8月7日（水）午後・会場：慶応義塾大学　三田キャンパス・参加費：無料・申し込み：懇親会（8月6日）の参加・不参加のみお知らせください。・講師　新井敏康（千葉大学）　勝股審也（京都大学）　照井一成（京都大学）　根元多佳子（JAIST） ------------------------------------------ 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

APLAS 2013 second call for papers
by Chung-chieh Shan 03 Jun '13

03 Jun '13

APLASの締め切りが6月14日に迫って来ました。重複をご容赦下さい。 =============================================================== APLAS 2013 11th Asian Symposium on Programming Languages and Systems 9-11 December 2013 Melbourne, Australia (colocated with CPP 2013) CALL FOR PAPERS =============================================================== ========== BACKGROUND ========== APLAS aims to stimulate programming language research by providing a forum for the presentation of latest results and the exchange of ideas in programming languages and systems. APLAS is based in Asia, but is an international forum that serves the worldwide programming language community. APLAS is sponsored by the Asian Association for Foundation of Software (AAFS) founded by Asian researchers in cooperation with many researchers from Europe and the USA. Past APLAS symposiums were successfully held in 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: *Regular research papers* describing original scientific research results, including tool development and case studies. Regular research papers should not exceed 16 pages in the Springer LNCS format, including bibliography and figures. They should clearly identify what has been accomplished and why it is significant. Submissions will be judged on the basis of significance, relevance, correctness, originality, and clarity. In case of lack of space, proofs, experimental results, or any information supporting the technical results of the paper could be provided as an appendix or a link to a web page, but reviewers are not obliged to read them. *System and Tool presentations* describing systems or tools that support theory, program construction, reasoning, or program execution in the scope of APLAS. System and Tool presentations are expected to be centered around a demonstration. The paper and the demonstration should identify the novelties of the tools and use motivating examples. System and Tool papers should not exceed 8 pages in the Springer LNCS format, including bibliography and figures. Submissions will be judged based on both the papers and the described systems or tools. It is highly desirable that the tools are available on the web. Papers should be submitted electronically via the submission web page: https://www.easychair.org/conferences/?conf=aplas2013 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. (While the general chair and the program chair cannot submit papers, other members of the program committee can.) ===== DATES ===== Abstract due: 10 June 2013 (Monday), 23:59 UTC Submission due: 14 June 2013 (Friday), 23:59 UTC Notification: 26 August 2013 (Monday) Final paper due: 19 September 2013 (Thursday) Conference: 9-11 December 2013 (Monday-Wednesday) ========== ORGANIZERS ========== General chair: Peter Schachte (University of Melbourne) Program chair: Chung-chieh Shan (Indiana University) Program committee: Filippo Bonchi (CNRS, ENS-Lyon, France) Yu-Fang Chen (Academia Sinica, Taiwan) Shigeru Chiba (The University of Tokyo, Japan) Jacques Garrigue (Nagoya University, Japan) Robert Glück (University of Copenhagen, Denmark) R. Govindarajan (Indian Institute of Science, India) Kazuhiro Inaba (Google, Inc., Japan) Jie-Hong Roland Jiang (National Taiwan University, Taiwan) Shin-ya Katsumata (Kyoto University, Japan) Gabriele Keller (University of New South Wales, Australia) Ana Milanova (Rensselaer Polytechnic Institute, USA) Keisuke Nakano (The University of Electro-Communications, Japan) Hakjoo Oh (Seoul National University, Korea) Bruno C. d. S. Oliveira (National University of Singapore, Singapore) Kaushik Rajan (Microsoft Research, India) Max Schäfer (Nanyang Technological University, Singapore) Ulrich Schöpp (Ludwig-Maximilians-Universität München, Germany) Paula Severi (University of Leicester, UK) Gang Tan (Lehigh University, USA) Hiroshi Unno (University of Tsukuba, Japan) Meng Wang (Chalmers University of Technology, Sweden) Jingling Xue (University of New South Wales, Australia) Mingsheng Ying (University of Technology, Sydney, Australia) Kenny Q. Zhu (Shanghai Jiao Tong University, China) ======= CONTACT ======= http://aplas2013.soic.indiana.edu/ aplas2013(a)easychair.org

1 0

KEOD special session
by 小野寛晰 31 May '13

31 May '13

皆様以下のメールを代理投稿します。　小野寛晰 ---------------------------------------- Dear Madam/Sir, I would like to announce the KEOD’s Special Session (this year in Vilamoura, Portugal) devoted to formal and non-formal aspects of nonmonotonicity. Strict applying of the definition of nonmonotonic inference shows that many examples for nonmonotonicity of human thinking as well as constructions, traditionally understood as nonmonotonic have nothing common with the negation of well known Tarski’s condition for monotonic operation. A rejection from nonmonotonic interpretation of those examples and constructions opens new perspectives in researches on human thinking. http://www.keod.ic3k.org/non-nonmonotonicity.aspx With kind regards, Piotr Lukowski - Chair of KEOD’s Special Session: “Non-nonmonotonicity” Department of Cognitive Science Institute of Psychology University of Lodz, Poland

1 0

Fwd: GALOP 2013 - 2nd Call for Papers
by Ichiro Hasuo 28 May '13

28 May '13

みなさま，こんにちは！東京大学の蓮尾です． SCメンバーとして，ゲーム意味論についてのワークショップ GaLoP のご案内を再度お送りします．投稿締切は 5/31 ですが，アブストラクトのみの投稿で，論文投稿は optional です．ぜひご検討ください．どうかよろしくお願いいたします．それでは！蓮尾一郎 http://www-mmm.is.s.u-tokyo.ac.jp/~ichiro/ ---------- Forwarded message ---------- 8th Workshop on Games for Logic and Programming Languages (GaLoP 2013) // Queen Mary, University of London // London, UK // 18-19 July // [http://www.gamesemantics.org] ----------------------------------------------------------------------- Please note the deadline of *** MAY 31 *** for submission of abstracts. ----------------------------------------------------------------------- GaLoP is an annual international workshop on game-semantic models for logics and programming languages and their applications. This is an informal workshop that welcomes work in progress, overviews of more extensive work, programmatic or position papers and tutorials as well as contributed papers and invited talks. GaLoP VIII will be held in London, UK, on 18-19 July 2013. It will be a stand-alone workshop hosted at the Mile End campus of Queen Mary, University of London. Contributions are invited on all pertinent subjects, with particular interest in game-semantic and interaction models for logics and programming languages, and applications to program analysis. Typical but not exclusive areas of interest are: * Game theory and interaction models in semantics; * Games-based program analysis and verification; * Logics for games and games for logics; * Algorithmic aspects of games; * Categorical aspects; * Programming languages and full abstraction; * Higher-order automata and Petri nets; * Geometry of interaction; * Ludics; * Epistemic game theory; * Logics of dependence and independence; * Computational linguistics. There will be no formal proceedings but the possibility of a special issue in a journal will be considered (the 2005, 2008 and 2011 workshops led to special issues in Annals of Pure and Applied Logic). // Submission Instructions // Please submit an abstract of your proposed talk on the easychair submission page below. You may also submit an accompanying paper for the talk. https://www.easychair.org/conferences/?conf=galop2013 // Important Dates // Submission: May 31 Notification: June 7 Workshop: July 18-19 // Invited speakers // * Ichiro Hasuo, Tokyo * Colin Stirling, Edinburgh * Viktor Winschel, Mannheim * Nobuko Yoshida, Imperial // Program Committee // * Ugo Dal Lago, Bologna * Dan Ghica, Birmingham * Juha Kontinen, Helsinki * Guy McCusker, Bath (co-chair) * Andrzej Murawski, Warwick * Nikos Tzevelekos, QMUL (co-chair) * Glynn Winskel, Cambridge

1 0

Kobe Colloquium on Logic, Statistics and Informatics, May 28 (Daisuke Ikegami)
by Joerg Brendle 23 May '13

23 May '13

Kobe Colloquium on Logic, Statistics and Informatics 以下の要領でコロキウムを開催します。日時：2013年5月28日（火）13:20-14:50 講演者：Daisuke Ikegami (University of California, Berkeley) 場所：神戸大学自然科学総合研究棟3号館4階421室（プレゼンテーション室） ============================================================ 題目： Inner models from logics アブストラクト： The goal of this research is to construct a model of set theory which is "close to" HOD but easier to analyze. The motivation comes from Woodin's HOD Conjecture, which states that HOD is very "close to" V under the presence of a very strong large cardinal (extendible cardinal). HOD Conjecture is closely related to the problem of constructing a canonical extender model with a supercompact cardinal and it has striking applications to the theory of large cardinals without the Axiom of Choice. To solve HOD Conjecture, one would expect a fine analysis of HOD. The difficulty of the analysis of HOD lies in the fact that HOD is very "non-absolute", e.g., one could force V = HOD with a proper class partial order. Given that HOD is obtained using full second order logic in the same way as Gödel's constructible universe L via first order logic, in this talk, we use Boolean valued higher order logics to construct inner models of set theory which are more "absolute" than HOD and investigate the properties of the models. ============================================================ 交通：阪急六甲駅またはJR六甲道駅から神戸市バス36系統「鶴甲団地」行きに乗車，「神大本部工学部前」停留所下車，徒歩すぐ． http://www.kobe-u.ac.jp/info/access/rokko/rokkodai-dai2.htm 連絡先：ブレンドレヨーグ brendle(a)kurt.scitec.kobe-u.ac.jp

1 0

Talk by Irek Ulidowski (U. Leicester), Tue 21 May
by Ichiro Hasuo 21 May '13

21 May '13

みなさま，東京大学の蓮尾です．来週火曜日の研究室セミナーでは， Leicester 大学の Irek Ulidowski さんをお迎えしてプロセス計算と event structure に関するご研究をお話いただきます．ぜひご参加ください．蓮尾一郎 http://www-mmm.is.s.u-tokyo.ac.jp/ ________________________________ Tue 21 May 2013, 15:30-17:30 Irek Ulidowski (University of Leicester) Modelling of bonding with processes ad events 理学部7号館1階 102教室 Room 102, School of Science Bldg. No. 7 アクセス： https://www-mmm.is.s.u-tokyo.ac.jp/indexj.html （一番下） Access: http://www-mmm.is.s.u-tokyo.ac.jp/ (see bottom) We introduce two forms of modelling of systems that consist of objects that are combined together by the means of bonds. In reaction systems for bonding we define how bonds are created and dissolved via reduction-style semantics. The usefulness of reaction systems is illustrated with examples taken from software engineering and biochemistry. We also introduce reversible event structures and define the notion of configuration. We then discuss how to give semantics of reaction systems for bonding in terms of reversible event structures.

1 1

Seminar (Bakhadyr Khoussainov), Mon May 20, Tamachi
by Akitoshi Kawamura 18 May '13

18 May '13

皆様東大の河村ですお世話になっております直前の御連絡ですみませんが 20日（月）の講演会の御案内ですどうぞお越し下さい -- 河村彰星東京大学大学院情報理工学系研究科コンピュータ科学専攻助教（今井研究室） 03-5841-4097 http://www-imai.is.s.u-tokyo.ac.jp/~kawamura/index_j.html ELC Seminar http://www.al.ics.saitama-u.ac.jp/elc/event/list.cgi?regid=20130520-0000-20… Monday 1 pm, May 20, 2013 Seminar room, ELC Centre, 5th floor of Tokyo Institute of Technology Tamachi office (東京工業大学キャンパスイノベーションセンター) http://www.al.ics.saitama-u.ac.jp/elc/en/?celc Algorithmically random infinite structures Bakhadyr Khoussainov (University of Auckland) The last two decades have witnessed significant advances in the investigation of algorithmic randomness of infinite strings. Monographs by Downey and Hirschfeldt, and by Nies account for the recent research activities in the area. In spite of much work, research on randomness of infinite strings has excluded the investigation of algorithmic randomness for infinite algebraic structures such graphs, trees, groups or more generally universal algebras. In this talk, we provide a framework for reasoning about algorithmic randomness for various classes of infinite structures.

1 0

Nagoya Set Theory Seminar
by 吉信康夫 17 May '13

17 May '13

皆様：以下の要領で名古屋集合論セミナーを開催します。奮って御参加下さい。日時：5月24日(金) 15:30- 場所：名古屋大学全学教育棟3階 SIS5 教室 (http://www.nagoya-u.ac.jp/2012website/global-info/images/access-map/map2.pdf の地図でB4(1)の建物です。建物内配置図は http://www.ilas.nagoya-u.ac.jp/student/lectureroom/ でご覧になれます。 SIS5 教室は3階の中央より少し北, C36の北隣にあります。) 講演者：池上大祐 (学振海外特別研究員, カリフォルニア大学バークレー校) 題： Inner models from logics アブストラクト： The goal of this research is to construct a model of set theory which is "close to" HOD but easier to analyze. The motivation comes from Woodin's HOD Conjecture, which states that HOD is very "close to" V under the presence of a very strong large cardinal (extendible cardinal). HOD Conjecture is closely related to the problem of constructing a canonical extender model with a supercompact cardinal and it has striking applications to the theory of large cardinals without the Axiom of Choice. To solve HOD Conjecture, one would expect a fine analysis of HOD. The difficulty of the analysis of HOD lies in the fact that HOD is very "non-absolute", e.g., one could force V = HOD with a proper class partial order. Given that HOD is obtained using full second order logic in the same way as Gödel's constructible universe L via first order logic, in this talk, we use Boolean valued higher order logics to construct inner models of set theory which are more "absolute" than HOD and investigate the properties of the models.

1 0

NUE seminar (33)
by Yoshihito Toyama 16 May '13

16 May '13

第 33 回 NUEセミナーのお知らせ東北大学・電気通信研究所・外山研究室ではNUEセミナーを開催しています。テーマはプログラム理論や定理自動証明を中心に、情報科学の理論的なさまざまな話題をとりあげています。興味をおもちの方はどなたでもフラリと気楽におたちより下さい。 ********************************************* 日時：　５月２３日（木）１４：００ -- １５：３０場所：東北大学・電気通信研究所・２号館・４階中会議室 (W401) ********************************************* 講演話題提供者： Irek Ulidowski (University of Leicester) 題目： Modelling of bonding with processes ad events 概要： We introduce two forms of modelling of systems that consist of objects that are combined together by the means of bonds. In reaction systems for bonding we define how bonds are created and dissolved via reduction-style semantics. The usefulness of reaction systems is illustrated with examples taken from software engineering and biochemistry. We also introduce reversible event structures and define the notion of configuration. We then discuss how to give semantics of reaction systems for bonding in terms of reversible event structures. ============================================== NUEセミナーに関する問い合わせは以下にどうぞ。外山芳人〒980-8577 仙台市青葉区片平 2-1-1 東北大学電気通信研究所 TEL 022 217 5449 FAX 022 217 5452 MAIL toyama(a)nue.riec.tohoku.ac.jp

1 0

教員公募 (東北大学)
by Yoshihito Toyama 15 May '13

15 May '13

LOGIC MLの皆様メーリングリストをお借りして、の教員公募教授１名の案内を送付いたします。(重複して受信された場合はご容赦ください) 応募締切は 7月26日（金）必着です。外山芳人@東北大学 ----------------------------------------------------------------------- 教員公募情報東北大学大学院情報科学研究科情報基礎科学専攻では、教授職の教員を下記により公募いたします。募集人員：教授１名所　　属：情報基礎科学専攻ソフトウェア基礎科学分野専門分野：　本分野では、ソフトウェアが実現すべき機能の複雑化と高機能化に対する要請に応えるために、ソフトウェアの厳密な論理構造の追究と、それに基づく信頼性や生産性を支える新たな学術的基盤の確立を目的としています。具体的には、プログラムや仕様記述などの形式化に基づいた開発手法や検証手法の構築を通して高信頼性・高生産性を有するソフトウェア開発に貢献するための研究と教育を行います。着任時期：平成26年4月頃、またはそれ以降のなるべく早い時期応募資格：博士号取得者。年齢については特に制限はありません。応募期限：平成25年7月26日（金）必着なお、提出書類や書類送付先などの詳細につきましては以下をご覧ください。 http://www.is.tohoku.ac.jp/publicadv/kobo130425.html -----------------------------------------------------------------------

1 0

Fwd: PhD positions in operational semantics at Univ. of Warsaw
by Ichiro Hasuo 14 May '13

14 May '13

みなさま，東京大学の蓮尾です．ワルシャワ大学の Bartek Klin さんからの博士課程学生募集のメッセージを転送します．プロジェクトの内容は bialgebra と operational semantics で，給料はとても良くはありませんが，ワルシャワの物価を考えると十分な額だと思います．ごはんもおいしくて楽しい街です．また，同じプロジェクトでポスドクの募集もそのうちにあるそうです．蓮尾一郎 www-mmm.is.s.u-tokyo.ac.jp/~ichiro/ ----------------------------------------------------------------------------------------------------------- Two PhD student positions will soon be available to work under the direction of Bartek Klin in the Institute of Informatics, University of Warsaw. The positions are in the field of semantics of programming languages and process algebras, in connection to the project "Modular operational semantics: a bialgebraic approach", funded by the Polish National Science Center. The applicants should have solid background in Mathematics and Computer Science, and be interested in topics such as semantics of programming languages, process algebra, formal methods, and/or category theory. The positions will be available from October 2013. Interested candidates should apply for a PhD fellowship at the Warsaw Center of Mathematics and Computer Science (http://www.wcmcs.edu.pl/node/38), with the deadline of *** June 7th, 2013 ***. A successful candidate will earn 5000PLN(~1200EUR)/month (3500PLN tax-free from the WCMCS fellowship + 1500PLN pre-tax funded by the research project), subject to yearly evaluation of progress. The positions are associated with teaching duties of up to 60 hours/year. Any queries about the positions should be addressed to Bartek Klin, klin(a)mimuw.edu.pl . -----------------------------------------------------------------------------------------------------------

1 0

DCM 2013 - Call for Papers
by Nao Hirokawa 10 May '13

10 May '13

皆様 CONCUR 2013 に併設されます、計算モデルに関するワークショップ DCM 2013 の論文募集の案内をお送り致します。ご投稿・ご参加を検討して頂ければ幸いです。廣川　直（JAIST） ====================================================================== Call for Papers DCM 2013 Developments in Computational Models http://www.dcm-workshop.org.uk/2013 Buenos Aires, Argentina Monday August 26 2013 A satellite event of CONCUR 2013 ====================================================================== Several new models of computation have emerged in the last years, and many developments of traditional computational models have been proposed with the aim of taking into account the new demands of computer systems users and the new capabilities of computation engines. A new computational model, or a new feature in a traditional one, usually is reflected in a new family of programming languages, and new paradigms of software development. The aim of this workshop is to bring together researchers who are currently developing new computational models or new features for traditional computational models, in order to foster their interaction, to provide a forum for presenting new ideas and work in progress, and to enable newcomers to learn about current activities in this area. DCM 2013 will be a one-day satellite event of CONCUR 2013. Topics of interest include all abstract models of computation and their applications to the development of programming languages and systems: - quantum computation, including implementations and formal methods in quantum protocols; - probabilistic computation and verification in modelling situations; - chemical, biological and bio-inspired computation, including spatial models, self-assembly, growth models; - general concurrent models including the treatment of mobility; - infinitary models of computation; - trust, and security; information-theoretic ideas in computing. SUBMISSION ---------- Submit your paper in PDF format via the conference EasyChair submission page: http://www.easychair.org/conferences/?conf=dcm2013 Submissions should be an abstract of at most 5 pages, written in English. Simultaneous submission to journals, conferences or other workshops is not permitted. Please use the EPTCS macro package and follow the instructions of EPTCS: http://eptcs.org/ http://style.eptcs.org/ A submission may contain an appendix, but reading the appendix should not be necessary to assess its merits. PUBLICATION ----------- Accepted contributions will appear in EPTCS (Electronic Proceedings in Theoretical Computer Science). After the workshop, full versions of selected papers will be invited for a special issue in an internationally leading journal. IMPORTANT DATES --------------- - Submission Deadline for Abstracts: 1 June 2013 - Notification: 1 July 2013 - Pre-proceedings version due: 1 August 2013 - Workshop: 26 August 2013 INVITED SPEAKER: Veronica Becher (Universidad de Buenos Aires, Argentina) PROGRAMME COMMITTEE: Pablo Arrighi (France) Mauricio Ayala Rincon (Brazil) co-chair Pablo Barcelo (Chile) Mario Benevides (Brazil) Eduardo Bonelli (Argentina) co-chair Paola Bonizzoni (Italy) Nachum Dershowitz (Israel) Ruben Gamboa (USA) Rajeev Gore (Australia) Holger Hermanns (Germany) Nao Hirokawa (Japan) Jean Krivine (France) Luis Lamb (Brazil) Ian Mackie (France) co-chair Cesar Munoz (USA) Carlos Olarte (Colombia) Femke van Raamsdonk (Netherlands) Camilo Rocha (Colombia) Nora Szasz (Uruguay) Rene Thiemann (Austria)

1 0

Kobe Colloquium on Logic, Statistics and Informatics, May 10 (Andre Nies)
by Joerg Brendle 26 Apr '13

26 Apr '13

Kobe Colloquium on Logic, Statistics and Informatics 以下の要領でコロキウムを開催します。日時：2013年5月10日（金）10:40-12:10 講演者：Andre Nies (University of Auckland, New Zealand) 場所：神戸大学自然科学総合研究棟3号館4階421室（プレゼンテーション室） ======================================================================== 題目：The complexity of similarity relations among Polish metric spaces アブストラクト：We calibrate the complexity of similarity relations between Polish metric spaces. First we discuss the classical case, based on concepts of Gromov. Thereafter we consider computable Polish metric spaces. For instance, Melnikov and I give the exact complexity of isometry between compact computable spaces, and show that isometric spaces of this kind have a Delta 3 isometry. ======================================================================== 交通：阪急六甲駅またはJR六甲道駅から神戸市バス36系統「鶴甲団地」行きに乗車，「神大本部工学部前」停留所下車，徒歩すぐ． http://www.kobe-u.ac.jp/info/access/rokko/rokkodai-dai2.htm 連絡先：ブレンドレヨーグ brendle(a)kurt.scitec.kobe-u.ac.jp

1 0

浦本武雄さん（京大数学）によるご講演（来週火曜，4/30）
by Ichiro Hasuo 26 Apr '13

26 Apr '13

みなさま，東京大学の蓮尾です．来週は研究室のセミナーに浦本武雄さん（京都大学数学教室D3）をお招きして，形式言語理論と圏論的双対性の関連についての結果をお話いただきます．どうかご自由にご参加ください．どうかよろしくお願いいたします．それでは！蓮尾一郎研究室ウェブページ： https://www-mmm.is.s.u-tokyo.ac.jp/indexj.html ============ Tue 30 April 2013, 15:30-17:30 Takeo Uramoto (Dept. Mathematics, Kyoto University) Tannaka-style reconstruction theorem for profinite monoids with an application to Eilenberg-Reiterman's variety theory 理学部7号館1階 102教室 Room 102, School of Science Bldg. No. 7 アクセス： https://www-mmm.is.s.u-tokyo.ac.jp/indexj.html （一番下） Access: http://www-mmm.is.s.u-tokyo.ac.jp/ (see bottom) Eilenberg-Reiterman's variety theory is one of the central theories in algebraic studies of finite automata and regular languages. In its recent development, Rhodes and Steinberg pointed out that the Boolean algebra of regular languages admits a bialgebra structure and revealed its important role in the duality-theoretic formulation of the variety theory. In this talk, we study the structure of the bialgebra of regular languages using a traditional idea from the linear representation theory of groups. In particular, we aim at clarifying a close connection between algebraic structures on the bialgebra of regular languages and geometric structures of finite automata. Our main result claims that there exists a bijective correspondence between bilinear multiplications of regular languages that are compatible with respect to word decompositions and binary products on finite automata that are stable with respect to simulations. This is proved as a corollary of the Tannaka-style reconstruction theorem for profinite monoids, which is an analogue of the classical Tannaka duality theorem for compact groups and indicates a categorical universality of the Boolean algebra of regular languages with respect to finite automata and simulations.

1 0

ランダムネスの研究集会のご案内と参加募集
by Kenshi Miyabe 26 Apr '13

26 Apr '13

4月から東大に移りました宮部です．お世話になっております．ランダムネスに関する研究集会を次のように開催します．集会名：ELC Workshop on Randomness and Probability Through Computability (RPTC2013) 日時：2013年5月14日(火)15日(水) 場所: 東京大学本郷工学部6号館セミナー室A,D http://kenshi.miyabe.name/rptc2013/ 直前の2013年5月13日(月)14日(火)には，近い場所でランダムネスのセミナーも行う予定です． ELC Seminar on Algorithmic Randomness http://kenshi.miyabe.name/rptc2013/seminar.html 招待講演者: Rod Downey André Nies Bakhadyr Khoussainov Shuji Kijima Prof. Downeyにはランダムネスの導入的な話もお願いしてあります．プログラムおよびアブストラクトを以下で見ることができます． http://kenshi.miyabe.name/rptc2013/programme.html セミナーの方のプログラムも近々詳細をアップロード予定です． http://kenshi.miyabe.name/rptc2013/seminar.html 皆様のご参加お待ちしております。なお，本集会は文部科学省科学研究費補助金新学術領域研究「多面的アプローチの統合による計算限界の解明」 http://www.al.ics.saitama-u.ac.jp/elc/ および FIRST 合原最先端数理モデルプロジェクト http://www.sat.t.u-tokyo.ac.jp/first/ の支援を受けております．東京大学情報理工学系研究科河村彰星 kawamura(a)is.s.u-tokyo.ac.jp 東京大学情報理工学系研究科宮部賢志 kmiyabe(a)kurims.kyoto-u.ac.jp -- Kenshi Miyabe email: research(a)kenshi.miyabe.name JSPS Research Fellow Graduate school of Information Science and Technology, The University of Tokyo Tel: +81-3-5841-6943

1 0

APLAS 2013 call for papers
by Jacques Garrigue 24 Apr '13

24 Apr '13

Logic-MLの皆様、 12月にオーストラリアのメルボルンで開催されるAPLASの論文募集案内をお送りします。投稿締め切りは6月14日ですので、ご検討をよろしくお願いいたします。 Jacques Garrigue =============================================================== APLAS 2013 11th Asian Symposium on Programming Languages and Systems 9-11 December 2013 Melbourne, Australia (colocated with CPP 2013) CALL FOR PAPERS =============================================================== ========== BACKGROUND ========== APLAS aims to stimulate programming language research by providing a forum for the presentation of latest results and the exchange of ideas in programming languages and systems. APLAS is based in Asia, but is an international forum that serves the worldwide programming language community. APLAS is sponsored by the Asian Association for Foundation of Software (AAFS) founded by Asian researchers in cooperation with many researchers from Europe and the USA. Past APLAS symposiums were successfully held in 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: *Regular research papers* describing original scientific research results, including tool development and case studies. Regular research papers should not exceed 16 pages in the Springer LNCS format, including bibliography and figures. They should clearly identify what has been accomplished and why it is significant. Submissions will be judged on the basis of significance, relevance, correctness, originality, and clarity. In case of lack of space, proofs, experimental results, or any information supporting the technical results of the paper could be provided as an appendix or a link to a web page, but reviewers are not obliged to read them. *System and Tool presentations* describing systems or tools that support theory, program construction, reasoning, or program execution in the scope of APLAS. System and Tool presentations are expected to be centered around a demonstration. The paper and the demonstration should identify the novelties of the tools and use motivating examples. System and Tool papers should not exceed 8 pages in the Springer LNCS format, including bibliography and figures. Submissions will be judged based on both the papers and the described systems or tools. It is highly desirable that the tools are available on the web. Papers should be submitted electronically via the submission web page: https://www.easychair.org/conferences/?conf=aplas2013 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. (While the general chair and the program chair cannot submit papers, other members of the program committee can.) ===== DATES ===== Abstract due: 10 June 2013 (Monday), 23:59 UTC Submission due: 14 June 2013 (Friday), 23:59 UTC Notification: 26 August 2013 (Monday) Final paper due: 19 September 2013 (Thursday) Conference: 9-11 December 2013 (Monday-Wednesday) ========== ORGANIZERS ========== General chair: Peter Schachte (University of Melbourne) Program chair: Chung-chieh Shan (Indiana University) Program committee: Filippo Bonchi (CNRS, ENS-Lyon, France) Yu-Fang Chen (Academia Sinica, Taiwan) Shigeru Chiba (The University of Tokyo, Japan) Jacques Garrigue (Nagoya University, Japan) Robert Glück (University of Copenhagen, Denmark) R. Govindarajan (Indian Institute of Science, India) Kazuhiro Inaba (Google, Inc., Japan) Jie-Hong Roland Jiang (National Taiwan University, Taiwan) Shin-ya Katsumata (Kyoto University, Japan) Gabriele Keller (University of New South Wales, Australia) Ana Milanova (Rensselaer Polytechnic Institute, USA) Keisuke Nakano (The University of Electro-Communications, Japan) Hakjoo Oh (Seoul National University, Korea) Bruno C. d. S. Oliveira (National University of Singapore, Singapore) Kaushik Rajan (Microsoft Research, India) Max Schäfer (Nanyang Technological University, Singapore) Ulrich Schöpp (Ludwig-Maximilians-Universität München, Germany) Paula Severi (University of Leicester, UK) Gang Tan (Lehigh University, USA) Hiroshi Unno (University of Tsukuba, Japan) Meng Wang (Chalmers University of Technology, Sweden) Jingling Xue (University of New South Wales, Australia) Mingsheng Ying (University of Technology, Sydney, Australia) Kenny Q. Zhu (Shanghai Jiao Tong University, China) ======= CONTACT ======= http://aplas2013.soic.indiana.edu/ aplas2013(a)easychair.org

1 0

Kobe Colloquium on Logic, Statistics and Informatics, May 1 (Rod Downey)
by Joerg Brendle 23 Apr '13

23 Apr '13

Kobe Colloquium on Logic, Statistics and Informatics 以下の要領でコロキウムを開催します。日時：2013年5月1日（水）15:00-16:30 場所：神戸大学自然科学総合研究棟3号館4階421室（プレゼンテーション室）講演者：Rod Downey (Victoria University of Wellington, New Zealand) ======================================================================== 題目：Effectively in Abelian Group Theory アブストラクト：The effectiveness of the theory of abelian groups has been long studied beginning with the work of Mal'cev in the 60's. Nevertheless many problems remain. In this lecture I will discuss ongoing work on questions of effectiveness of categoricity and presentability for computable torsion-free abelian groups and for p-groups. For example, for categoricity, general problem is impossible; for example Downey and Montalban showed that the isomorphism problem for torsion-free abelian groups is Sigma_1^1-complete. The principle difficulty lies in the lack of invariants. However, where there are some invariants there we can salvage some effectiveness. The groups we look at are the completely decomposable ones, which have decompositions of the form oplus_{i in omega} G_i with G_i a subgroup of the additive group of the rationals. Such groups are called homogeneous if G_i=H for all i. Alexander Melnikov and the author have shown that homogeneous computable completely decomposable groups are always Delta_3^0 categorical, this bound is sharp, and have classified when the groups are Delta_2^0 categorical in terms of what are called semilow sets. In more recent work, we have shown that every computable completely decomposable group is Delta_5^0 categorical and that this bound is sharp. Additionally we can show that the index set of such groups is Sigma_7^0. I will also describe ongoing work on Ulm's Theorem. ======================================================================== 交通：阪急六甲駅またはJR六甲道駅から神戸市バス36系統「鶴甲団地」行きに乗車，「神大本部工学部前」停留所下車，徒歩すぐ． http://www.kobe-u.ac.jp/info/access/rokko/rokkodai-dai2.htm 連絡先：ブレンドレヨーグ brendle(a)kurt.scitec.kobe-u.ac.jp

1 0

Fwd: GALOP 2013 - Call for Papers
by Ichiro Hasuo 23 Apr '13

23 Apr '13

みなさま，こんにちは！東京大学の蓮尾です． SCメンバーとして，ゲーム意味論についてのワークショップ GaLoP のご案内を転送します．トピック限定＆コミュニティ指向型の，深い議論のできるワークショップです．どうか投稿・参加をご検討ください．どうかよろしくお願いいたします．それでは！蓮尾一郎\ http://www-mmm.is.s.u-tokyo.ac.jp/~ichiro/ ---------- Forwarded message ---------- 8th Workshop on Games for Logic and Programming Languages (GaLoP 2013) // Queen Mary, University of London // London, UK // 18-19 July // http://www.gamesemantics.org [apologies for possible cross-postings] GaLoP is an annual international workshop on game-semantic models for logics and programming languages and their applications. This is an informal workshop that welcomes work in progress, overviews of more extensive work, programmatic or position papers and tutorials as well as contributed papers and invited talks. GaLoP VIII will be held in London, UK, on 18-19 July 2013. It will be a stand-alone workshop hosted at the Mile End campus of Queen Mary, University of London. Contributions are invited on all pertinent subjects, with particular interest in game-semantic and interaction models for logics and programming languages, and applications to program analysis. Typical but not exclusive areas of interest are: * Game theory and interaction models in semantics; * Games-based program analysis and verification; * Logics for games and games for logics; * Algorithmic aspects of games; * Categorical aspects; * Programming languages and full abstraction; * Higher-order automata and Petri nets; * Geometry of interaction; * Ludics; * Epistemic game theory; * Logics of dependence and independence; * Computational linguistics. There will be no formal proceedings but the possibility of a special issue in a journal will be considered (the 2005, 2008 and 2011 workshops led to special issues in Annals of Pure and Applied Logic). // Submission Instructions // Please submit an abstract of your proposed talk on the easychair submission page below. You may also submit an accompanying paper for the talk. https://www.easychair.org/conferences/?conf=galop2013 // Important Dates // Submission: May 31 Notification: June 7 Workshop: July 18-19 // Invited speakers // * Ichiro Hasuo, Tokyo * Colin Stirling, Edinburgh * Viktor Winschel, Mannheim * Nobuko Yoshida, Imperial // Program Committee // * Ugo Dal Lago, Bologna * Dan Ghica, Birmingham * Juha Kontinen, Helsinki * Guy McCusker, Bath (co-chair) * Andrzej Murawski, Warwick * Nikos Tzevelekos, QMUL (co-chair) * Glynn Winskel, Cambridge

1 0

Set Theory Seminar Kobe
by Joerg Brendle 18 Apr '13

18 Apr '13

Kobe Set Theory Seminar This semester the Kobe Set Theory Seminar will take place Tuesdays 1:20 to 2:50 pm in room 421 of Science and Technology Research Building 3, Kobe University. http://www.kobe-u.ac.jp/en/access/rokko/campus.htm Members and guests of the set theory groups will present their research. All talks are given in English. There is no program. For information about speakers and topics please contact Jörg Brendle. brendle(a)kurt.scitec.kobe-u.ac.jp See also the following webpage for current activities. http://kurt.scitec.kobe-u.ac.jp/~brendle/events.html ============================================================ 集合論のセミナー時限：前期・火曜日・３時限（１：２０〜２：５０）場所：神戸大学自然科学総合研究棟3号館4階421室（プレゼンテーション室）交通：阪急六甲駅またはJR六甲道駅から神戸市バス36系統「鶴甲団地」行きに乗車，「神大本部工学部前」停留所下車，徒歩すぐ． http://www.kobe-u.ac.jp/info/access/rokko/rokkodai-dai2.htm 連絡先：ブレンドレヨーグ brendle(a)kurt.scitec.kobe-u.ac.jp http://kurt.scitec.kobe-u.ac.jp/~brendle/events.html

1 0

CFP: LENLS10 (Logic and Engineering of Natural Language Semantics 10)
by BEKKI Daisuke 17 Apr '13

17 Apr '13

（重複して受け取られた場合はご容赦ください）今年の１０月に東京で開催される LENLS 10 国際ワークショップのプログラムをお送り致します。皆様のご参加をお待ちしております。戸次大介（お茶の水女子大学／国立情報学研究所） [Apologies for multiple copies] ================================================================= FIRST CALL FOR PAPERS Logic and Engineering of Natural Language Semantics 10 (LENLS 10) Workshop Site : "Raiousha Building, Keio University" Kanagawa, Japan. http://www.keio.ac.jp/en/maps/hiyoshi.html Dates : October 27-28, 2013 Contact Person: Shunsuke Yatabe (West Japan Railway Company) Contact Email : lenls10[[at]]easychair.org Website : http://www.is.ocha.ac.jp/‾bekki/lenls/ ================================================================= Chair: Shunsuke Yatabe (West Japan Railway Company) Co-chair: Daisuke Bekki (Ochanomizu University /National Institute of Informatics) Eric McCready (Aoyama Gakuin University) LENLS is an annual international workshop on formal syntax, semantics and pragmatics. It will be held as one of the workshops of the fifth JSAI International Symposia on AI (isAI2013) (http://www.ai-gakkai.or.jp/jsai-isai/2013/) sponsored by the Japan Society for Artificial Intelligence (JSAI) (http://www.ai-gakkai.or.jp/jsai/english.html). Aims and Topics: ================ We invite submissions to this year's workshop on topics in formal semantics and pragmatics, and related fields, including but in no way limited to the following: - Dynamic syntax/semantics/pragmatics of natural language - Categorical/topological/coalgebraic approaches for natural language syntax/semantics/pragmatics - Logic and its relation to natural language and linguistic reasoning (especially dynamic logics) - Type-theoretic approaches to natural language - Formal Philosophy of language - Formal pragmatics (especially game-theoretic and utility-theoretic approaches) - Substructural expansion of Lambek Lambda Calculi - Many-valued/Fuzzy and other non-classical logics and natural language Submissions: ============ Abstracts (up to 4 pages, including figures and references) must be submitted electronically in PDF format at: https://www.easychair.org/conferences/?conf=lenls10 When his/her 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: July 31, 2013 Notification of acceptance: August 26, 2013 Deadline for camera-ready copy: September, 2013 LENLS10: October 27-28, 2013 Tutorial Lecture: October 29, 2013 Workshop Organizers/Program Committee: ====================================== - Shunsuke Yatabe (West Japan Railway Company) - Daisuke Bekki (Ochanomizu University/National Institute of Informatics) - Alastair Butler (PRESTO JST/Tohoku University) - Eric McCready (Aoyama Gakuin University) - Koji Mineshima (Keio University) - 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) - Kei Yoshimoto (Tohoku University)

1 0

4/16, Talk by Keisuke Nakano (Univ. Electro-Communications)
by Tetsuri Moriya 16 Apr '13

16 Apr '13

みなさま、東京大学の蓮尾研究室M2の森谷です。蓮尾研究室では4月16日に電気通信大学の中野圭介さんをお迎えしてご講演いただきます。詳細は以下で、事前の登録等は一切不要です。ご興味のある方はぜひお越しください！ ============================================================= Tue 16 April 2013, 15:30-17:30 Keisuke Nakano (Univ. Electro-Communications), 2 Talks 理学部7号館1階 102教室 Room 102, School of Science Bldg. No. 7 Talk 1: Juggling meets coinduction In this talk, I will present an application of coinduction, juggling. Buhler et al. presented a mathematical theory of toss juggling by regarding a toss pattern as an arithmetic function, where the function must satisfy a condition for the pattern to be valid. In this talk, I will formalize their theory in terms of coinduction, reflecting the fact that the validity of toss juggling is related to a property of infinite phenomena. A tactic is implemented for proving the validity of toss patterns in Coq. Additionally, the completeness and soundness of a well-known algorithm for checking the validity is certified. The result exposes a practical aspect of coinductive proofs. Most part of this talk has been presented in CPP 2012. Some open problems also will be introduced. Talk 2: Metamorphism in jigsaw In this talk, I will present a new computation model for metamorphism. A metamorphism is an unfold after a fold, consuming an input by the fold then generating an output by the unfold. It is typically useful for converting data representations, e.g., radix conversion of numbers. Bird and Gibbons have shown that metamorphisms can be incrementally processed in streaming style when a certain condition holds because part of the output can be determined before the whole input is given. However, whereas radix conversion of fractions is amenable to streaming, radix conversion of natural numbers cannot satisfy the condition because it is impossible to determine part of the output before the whole input is completed. In this talk, I present a jigsaw model in which metamorphisms can be partially processed for outputs even when the streaming condition does not hold. The jigsaw model allows us to process metamorphisms in a flexible way that includes parallel computation. We also apply our model to other examples of metamorphisms. Most part of this talk is recently published in Journal of Functional Programming. Additionally, I will present some further work on this work.

2 1

JAIST Logic Seminar Series
by Takayuki Kihara 15 Apr '13

15 Apr '13

皆様北陸先端科学技術大学院大学の木原貴行です． JAIST Logic Seminar Seriesのお知らせです．問合せ先：木原貴行北陸先端科学技術大学院大学情報科学研究科 e-mail: kihara(a)jaist.ac.jp -------------------------------------------------- * JAIST Logic Seminar Series * Date: Friday 26 April, 2013, 15:00-17:00 Place: JAIST, Collaboration room 7 (I-56) (Access: http://www.jaist.ac.jp/english/location/access.html) Speaker: Dr. Arno Pauly (University of Cambridge) Title: Synthetic Descriptive Set Theory Abstract: Typically, (effective) descriptive set theory is viewed as a study of classes of discontinuous / uncomputable functions. Inside the theory of represented spaces though, we can consider the same concepts as special cases of continuity/computability. Using category-theoretic language, an abstract and unifying framework is achieved that allows very simple formulations and proofs corresponding closely to various fundamental results in descriptive set theory. * The seminar is held as a part of the EU FP7 Marie Curie Actions IRSES project COMPUTAL (http://computal.uni-trier.de/).

1 0

Computability and Complexity in Analysis 2013
by Akitoshi Kawamura 12 Apr '13

12 Apr '13

皆様東京大の河村と申しますお世話になっておりますメーリングリストをお借りして七月に仏ナンシーにて開催されます解析学に於る計算可能性と計算量に関する国際会議（CCA 2013）の御案内をさせて頂きます（投稿締切4月1日）御投稿・参加を検討頂ければ幸いです -- 河村彰星東京大学大学院情報理工学系研究科コンピュータ科学専攻助教（今井研究室） 03-5841-4097 http://www-imai.is.s.u-tokyo.ac.jp/~kawamura/index_j.html First Call for Papers http://cca-net.de/cca2013/ The Tenth International Conference on Computability and Complexity in Analysis (CCA 2013) will take place in Nancy, France, July 8-11, 2013. The CCA 2013 Program Committee cordially invites researchers in the area of computability and complexity theory to submit papers for presentation at the conference. Topics: * Computable analysis * Complexity on real numbers * Constructive analysis * Domain theory and analysis * Theory of representations * Computable numbers, subsets and functions * Randomness and computable measure theory * Models of computability on real numbers * Realizability theory and analysis * Reverse analysis * Real number algorithms * Implementation of exact real number arithmetic Submissions: Authors are invited to submit a PDF version of an extended abstract (typically 10 pages) on the following web page: https://www.easychair.org/conferences/?conf=cca2013 Dates: Submission deadline: April 1, 2013 Notification of authors: May 6, 2013 Registration deadline: May 20, 2013 Final version: May 27, 2013 Invited Speakers: * Ulrich Berger (Swansea, UK) * Takayuki Kihara (JAIST, Japan) * Cristobal Rojas (Toronto, Canada) * Daniel Roy (Cambridge, UK) * Martin Ziegler (Darmstadt, Germany) Program Committee: * Andrej Bauer (Ljubljana, Slovenia) * Arno Pauly (Cambridge, UK) * Hannes Diener (Siegen, Germany) * Cameron Freer (MIT, USA) * Laurent Bienvenu (Paris, France) * Akitoshi Kawamura (Tokyo, Japan) * Ker-I Ko (Stony Brook, USA) * Matthias Schröder (Vienna, Austria) * Robert Rettinger (Hagen, Germany) * Ning Zhong (Cincinnati, USA), chair Local Organizers * Anne-Lise Charbonnier * Hugo Férée * Emmanuel Hainry * Mathieu Hoyrup (chair) * Emmanuel Jeandel * Romain Péchoux

1 1

CALCO Early Ideas
by Ichiro Hasuo 11 Apr '13

11 Apr '13

みなさま，東京大学の蓮尾です．国際会議 CALCO 併設のワークショップ CALCO Early Ideas のご案内です．もともとは CALCO-jnr と呼ばれたもので，成果発表の場というよりは，（とくに学生や若手研究者が）進行中の仕事について話して， PC や CALCO の参加者から有益なフィードバックをもらうことが主眼です．ワークショップの後 long version を査読してもらえる（publication は別のところで），という特典付きです．ぼくの見た限り，CALCO のコミュニティの特質ともあいまってとてもうまく機能しているようです．もしよかったら，投稿（2ページのアブストラクト）をご検討ください．学生の旅費援助もあるようです．どうかよろしくお願いいたします．蓮尾一郎 http://www-mmm.is.s.u-tokyo.ac.jp/~ichiro/ ********************************************************** CALL FOR CONTRIBUTIONS: CALCO Early Ideas 2013 *********************************************************** 5th International Conference on Algebra and Coalgebra in Computer Science CALCO Early Ideas Workshop September 2, 2013 Warsaw, Poland http://coalg.org/calco13/workshops.html#ei Submission deadline for short contributions: 27 May 2013 ************************************************************ CALCO 2013 will be preceded by the CALCO Early Ideas Workshop, dedicated to presentation of work in progress and original research proposals. PhD students and young researchers are particularly encouraged to contribute. Attendance at the workshop is open to all - it is anticipated that many CALCO conference participants will want to attend the CALCO Early Ideas workshop (and vice versa). The CALCO Early Ideas Workshop invites submissions on the same topics as the CALCO conference: reporting results of theoretical work on the mathematics of algebras and coalgebras, the way these results can support methods and techniques for software development, as well as experience with the transfer of the resulting technologies into industrial practice. The list of topics of particular interest is shown on the main CALCO 2013 page: http://coalg.org/calco13/. CALCO Early Ideas presentations will be selected according to originality, significance, and general interest, on the basis of submitted 2-page short contributions. It can be work in progress, a summary of work submitted to a conference or workshop elsewhere, or work that in some other way might be interesting to the CALCO audience. A booklet with the accepted short contributions will be available at the workshop. Submissions will be handled via EasyChair https://www.easychair.org/conferences/?conf=calcoearlyideas2013 The use of LNCS style is strongly encouraged. After the workshop, authors will have the opportunity to submit a full 10-15 page paper on the same topic. The reviewing will be carried out by the CALCO Early Ideas PC, with the support of the CALCO PC. The volume of selected papers will be made available in the arXiv and on the CALCO pages. Authors will retain copyright, and are also encouraged to disseminate the results by subsequent publication elsewhere. http://coalg.org/calco13/workshops.html#ei There will be a number of student grants available for the CALCO conference - details shortly to be announced on the webpage. -- CALCO Early Ideas Dates -- May 27, 2013: 2-page short contribution submission June 24, 2013: Notification for short contribution July 15, 2013: Final short contribution due September 2, 2013: CALCO Early Ideas Workshop October 15, 2013: 10-15 page paper submission December 15, 2013: Notification for paper January 15, 2014: Final paper version due -- CALCO Early Ideas Programme Committee -- Bartek Klin, University of Warsaw, Poland John Power, University of Bath, UK Narciso Marti-Oliet, UCM, Spain Till Mossakowski, DFKI, Germany Monika Seisenberger, Swansea University, UK

1 0

IWC 2013 & CoCo 2013: Call for Participation and Provers
by Nao Hirokawa 08 Apr '13

08 Apr '13

皆様 RTA・TLCA 2013 に併設されます、合流性に関するワークショップ IWC 2013 と合流性ツールの国際競技会 CoCo 2013の案内をお送り致します。ご投稿・ご参加を検討して頂ければ幸いです。廣川　直（北陸先端科学技術大学院大学） ====================================================================== Third Call for Papers IWC 2013 2nd International Workshop on Confluence 28 June 2013, Eindhoven, The Netherlands collocated with RDP 2013 http://www.jaist.ac.jp/~hirokawa/iwc2013/ ====================================================================== Recently there is a renewed interest in confluence research, resulting in new techniques, tool support as well as new applications. The workshop aims at promoting further research in confluence and related properties. The workshop is collocated with the 7th International Conference on Rewriting, Deduction, and Programming (RDP 2013). During the workshop the 2nd Confluence Competition (CoCo 2013) takes place. IMPORTANT DATES: * submission April 15, 2013 * notification May 10, 2013 * final version June 3, 2013 * workshop June 28, 2013 TOPICS: The workshop solicits short papers/extended abstracts on the following topics: * confluence and related properties (unique normal forms, commutation, ground confluence) * completion * critical pair criteria * decidability issues * complexity issues * system descriptions * certification * applications of confluence INVITED SPEAKERS: * Patrick Dehornoy University of Caen * Jan Willem Klop Vrije Universiteit (joint invited speaker for IWC 2013 and WIR 2013) PROGRAM COMMITTEE: * Guillem Godoy Technical University of Catalonia * Nao Hirokawa JAIST (co-chair) * Barbara Koenig Universitaet Duisburg-Essen * Vincent van Oostrom Utrecht University (co-chair) * Michio Oyamaguchi Nagoya University * Harald Zankl University of Innsbruck * Hans Zantema Eindhoven University of Technology SUBMISSION: We solicit short papers or extended abstracts of at most five pages. There will be no formal reviewing. In particular, we welcome short versions of recently published articles and papers submitted elsewhere. The program committee checks relevance and may provide additional feedback. The accepted papers will be made available electronically before the workshop. The page limit for papers is 5 pages in EasyChair style. Submission will be via EasyChair at https://www.easychair.org/account/signin.cgi?conf=iwc2013 ====================================================================== Second Call for Provers CoCo 2013 2nd Confluence Competition http://coco.nue.riec.tohoku.ac.jp/2013/ ====================================================================== Recently, several new implementations of confluence tools are reported and interest for proving/disproving confluence "automatically" has been grown. The confluence competition aims to foster the development of techniques for proving/disproving confluence automatically by a dedicated competition among such tools. The 2nd Confluence Competition (CoCo 2013) will run ***live*** during the 2nd International Workshop on Confluence (IWC 2013), which is collocated with the 7th International Conference on Rewriting, Deduction, and Programming (RDP 2013) in Eindhoven, The Netherlands. In this competition categories for * first-order term rewrite systems * certification will be run. The problems considered for CoCo 2013 are selected from Cops, a collection of confluence problems. Problems submitted after the problem selection deadline will not be considered for the competition. IMPORTANT DATES: * requests for new categories March 1, 2013 (passed) * announcement of execution platform April 1, 2013 (passed) * tool registration June 10, 2013 * tool submission June 20, 2013 * problem selection June 25, 2013 * competition June 28, 2013 EXECUTION PLATFORM: CoCo 2013 will run on StarExec (http://starexec.org) a high-end cross-community competition platform. Tool submission is via this platform. REGISTRATION: Registration will be via the email address: coco-sc [AT] jaist.ac.jp Every tool registration should also contain a one page system description highlighting the distinctive features of the prover. For more information including competition rules and confluence problems, see http://coco.nue.riec.tohoku.ac.jp/ ORGANISING COMMITTEE: * Takahito Aoto Tohoku University * Nao Hirokawa JAIST * Harald Zankl University of Innsbruck (chair)

1 0

Prof. Elio Giovannetti at NII Logic Seminar
by Makoto Tatsuta 05 Apr '13

05 Apr '13

Prof. Elio Giovannetti at NII Logic Seminar Date: April 10, 2013, 13:30--15:30 Place: National Institute of Informatics, Room 1904 (19th floor) 場所: 国立情報学研究所 19階 1904室 (半蔵門線,都営地下鉄三田線・新宿線神保町駅または東西線竹橋駅より徒歩5分) (地図 http://www.nii.ac.jp/about/access/) Speaker: Prof. Elio Giovannetti (Torino University) Title: Lambda-calculus in context Abstract: The talk, kept at an informal level, will start fom Bohm's Theorem to give an overview of the development of observational equivalences between lambda-terms, and of the relationships between such equivalences. There will be a particular (though not exclusive) reference to the results obtained by M. Dezani and Torino's lambda-group, placed in a sketchy historical context, with a final mention of intersection types, which were a major achievement of the early history of Torino's group, in the persons of M. Coppo and M. Dezani. 問合せ先: 龍田真 (国立情報学研究所) e-mail: tatsuta(a)nii.ac.jp http://research.nii.ac.jp/~tatsuta

1 0

Topology, Algebra and Categories in Logic (TACL 2013)
by Kirby, Jo Carla 04 Apr '13

04 Apr '13

====================================================== TOPOLOGY, ALGEBRA AND CATEGORIES IN LOGIC (TACL 2013) Conference and Summer School Abstract Submission Deadline (EXTENDED): April 8, 2013 Support Request Deadline: April 21, 2013 ====================================================== The Sixth International Conference (and Summer School) on Topology, Algebra and Categories in conjunction with the 28th Annual Shanks Lecture Series Conference and Shanks Lectures: July 28 - August 1, 2013 Summer School: July 24 - 27, 2013 Department of Mathematics, Vanderbilt University Nashville, Tennessee USA http://www.math.vanderbilt.edu/~tacl2013/ ============================================= Sponsors ------------- National Science Foundation Association for Symbolic Logic Shanks Endowment Vanderbilt University Consortium for Order in Algebra and Logic Invited Speakers (Conference) ------------------------------------------------------- Vladimir Voevodsky, Institute for Advanced Studies (Shanks Lecturer) Bernhard Banaschewski, McMaster University Nick Bezhanishvili, Utrecht University Leo Cabrer, University of Oxford Silvio Ghilardi, University of Milan Rostislav Horcik, Academy of Sciences of the Czech Republic George Metcalfe, University of Bern Alex Simpson, University of Edinburgh Summer School Invited Speakers and Courses ------------------------------------------------------------------------- Grigori Mints, Stanford University (on Proof Theory) Lawrence Moss, Indiana University (on Recursion and Circularity) Francesco Paoli, University of Cagliari (on Algebraic Logic) Peter Selinger, Dalhousie University (on Categorical Logic) Scope of the Conference --------------------------------- Studying logics via semantics is a well-established and very active branch of mathematical logic, with many applications, in computer science and elsewhere. The area is characterized by results, tools and techniques stemming from various fields, including universal algebra, topology, category theory, order, and model theory. The program of the conference TACL 2013 will focus on three interconnecting mathematical themes central to the semantical study of logics and their applications: algebraic, categorical, and topological methods. This is the sixth conference in the series Topology, Algebra and Categories in Logic (TACL, formerly TANCL). Earlier installments of this conference have been organized in Tbilisi (2003), Barcelona (2005), Oxford (2007), Amsterdam (2009), Marseilles (2011). Featured topics --------------------- Contributed talks can deal with any topic dealing with the use of algebraic, categorical or topological methods in either logic or computer science. This includes, but is not limited to, the following areas: * Algebraic structures in CS * Algebraic logic * Coalgebra * Categorical methods in logic * Domain theory * Lattice theory * Lattices with operators * Many-valued and fuzzy logics * Modal logics * Non-classical logics * Ordered topological spaces * Ordered algebraic structures * Point-free topology * Proofs and Types * Residuated structures * Semantics * Stone-type dualities * Substructural logics * Topological semantics of modal logic The Summer School ---------------------------- TACL brings together different disciplines with the goal of exploring problems in logic. Partly due to the success of the TACL conference series, researchers have started employing tools used outside their immediate areas, either individually or in collaboration with specialists in research fields featured in the series. Such interactions have also naturally lead to new directions that combine ideas from two or more research fields. This has been a gradual and arduous process and TACL can boast of having participants that are at least somewhat familiar with most of the featured areas. However, young researchers and students who attend the conference and work in TACL fields have a more restricted and specialized repertoire of tools and knowledge. The goal of the Summer School is to fill the gap and expose such researchers to a variety of methods that can be used to study logic. It will primarily target graduate students and postdocs, but also more senior researchers who are not familiar with aspects of neighboring areas. Prospective Summer School participants should express their interest on the 'Express Interest' page of the TACL 2013 web site by selecting the events that plan to attend (summer school and/or conference). Limited funds for supporting summer school participants are available (mainly through NSF). Those who plan to request financial support should submit a copy of their CV and a letter of support from their PhD advisor or post-doc supervisor (if applicable) to tacl2013(a)gmail.com<mailto:tacl2013@gmail.com> with 'Summer School support request' in the subject line by April 21, 2013. In addition, they need to fill out the financial support form on the 'Support Requests' page by the same date. Registration should also be completed by June 1, 2013. We would appreciate your assistance in advertising the Summer School to interested students. Additional information can be found on the 'Summer School' page of the TACL 2013 web site. Submissions to the Conference ------------------------------------------- Contributed presentations will be of two types: o 20 minutes long presentations in parallel sessions and o featured, 30 minutes long, plenary presentations. The submission of an abstract will be required to be selected for a contributed presentation of either kind. While preference will be given to new work, results that have already been published or presented elsewhere will also be considered. More information on the submission procedure, as well as a link to the EasyChair system, can be found at the conference web site. Important Dates ---------------------- April 8, 2013: Abstract submission deadline April 21, 2013: Conference support request deadline April 21, 2013: Summer School support request deadline May 1, 2013: Notification to authors and summer school applicants June 1, 2013 - Deadline for early online registration and payment July 24 - 27: Summer School July 28-August 1, 2013: Conference Program Committee --------------------------- Steve Awodey, Carnegie Mellon University Guram Bezhanishvili, New Mexico State University David Gabelaia, Razmadze Mathematical Institute, Tbilisi Nick Galatos (co-chair), University of Denver Mai Gehrke, LIAFA, University of Paris Diderot Rob Goldblatt, Victoria University, Wellington John Harding, New Mexico State University Ramon Jansana, University of Barcelona Peter Jipsen, Chapman University Achim Jung, University of Birmingham Alexander Kurz (co-chair), University of Leicester Vincenzo Marra, University of Milan Hiroakira Ono, Japan Advanced Institute of Science and Technology Alessandra Palmigiano, University of Amsterdam Hilary Priestley, St Anne's College, Oxford James Raftery, University of KwaZulu-Natal, Durban Thomas Streicher, Technical University of Darmstadt Kazushige Terui, Kyoto University Constantine Tsinakis, Vanderbilt University Yde Venema, University of Amsterdam Michael Zakharyaschev, Birkbeck College, University of London Organizing Committee ------------------------------- Chris Conidis, Vanderbilt University Lianzhen Liu, Jiangnan University, China Warren McGovern, Florida Atlantic University Francesco Paoli, University of Cagliari Rebecca Steiner, Vanderbilt University Constantine Tsinakis (chair), Vanderbilt University William Young, Vanderbilt University Expression of interest ------------------------------ We would greatly appreciate your taking two minutes to express your level of interest in the conference by filling out a simple form on the conference web site under "Express Interest". This will help the Organizing Committee with their planning. You can also opt-out from receiving future announcements by clicking the link at the bottom of this email. More Information ----------------------- TACL 2013 web site: http://www.math.vanderbilt.edu/~tacl2013/ Use this site for local information, including hotel accommodations, for travel information and registration, and for submitting a request for financial support. Any queries for the Program Committee (such as usage of the EasyChair conference system, abstract submission guidelines, conference program, etc.) should be sent to tacl2013(a)gmail.com<mailto:tacl2013@gmail.com>. Queries for the local Organizing Committee (registration, hotel accommodations, financial support and reimbursements, technology infrastructure, etc.) should be sent to tacl2013oc(a)vanderbilt.edu<mailto:tacl2013oc@vanderbilt.edu>.

1 0

Control Operators and their Semantics (COS'13) - change of dates
by Fujita Kenetsu 30 Mar '13

30 Mar '13

[Please circulate. My apologies for cross posting.] 皆様， TLCA(Typed Lambda Calculi and Applications) と RTA(Rewriting Techniques and Applications) の Satellite workshop(COS'13) がEindhovenで開催されます．皆様のご参加・投稿をお待ちしております．群馬大学　藤田憲悦 ------------------------------------------------------------------------------------------------------------------------------------ This is the COS'13 cfp with some changes of dates. While keeping *the deadline of submissions on April the 6th*, we do not require previous abstract submission, and postpone to April the 15th the deadline for contributed talks only (called EXTENDED ABSTRACTS below): Submission: April, 6 2013 (*no previous abstract submission required*) Extended abstract: April, 15 2013 (*new*) Notification: April, 29 2013 (changed) Final version: May, 15 2013 (changed) Workshop: June, 24-25 2013 ============================================================================ Control Operators and their Semantics (COS'13) - Call for Papers Satellite event of RDP'13 June 24 - 25, 2013, Eindhoven, The Nederlands http://cos2013.di.unito.it/ (modified on April, 25th) ============================================================================ Modern programming languages provide sophisticated control mechanisms, commonly referred to as control operators which are widely used to realize a variety of applications. Since we cannot escape control features, it becomes a challenge to provide them with sound reasoning principles. There is a very active research on understanding, manipulating, representing, and reasoning about elaborated non-local control structures, in particular in declarative programming languages such as functional and logic languages. Ideas and results originating from this research area have impact in many other areas of computer science, like distributed and concurrent systems, proof theory, proof mining, web programming and linguistics. For instance, the study of the logical foundations of control operators renewed the study of the connections between proofs and programs via the so-called Curry-Howard correspondence, providing new methods to extract the computational content of classical proofs. The focus of the workshop is on the interplay between syntax and semantics, namely the central question of what a program means and how it does define the intended procedure. This is a crucial issue especially in the case of control operators, since they are as powerful as potentially obscure, and programs that use them are usually more error prone than purely declarative ones. The issue of a better understanding of control is also relevant for communicating across different research areas and communities. More abstract views can be achieved via several means, that include operational semantics of formal calculi, abstract machines, algebraic specifications and rewriting, type assignment systems, denotational semantics and game semantics, category theory and logic, to say the least. Relevant topics include, but are not limited to: - continuations and delimited continuations - categorical models of continuations - compositionality and modularity of control operators - denotational semantics of control, event structures and causality - operational semantics and abstract machines - type systems for control operators - game semantics of programming languages and of logical proofs - usage of control operators in proof search and proof mining - semantics of control operators in logic programming Invited speakers: - Mattew Flatt (Univeristy of Utah) - Thomas Streicher (Universitaet Darmstadt) Program Committee: Zena Ariola University of Oregon Stefano Berardi Turin University Hugo Herbelin INRIA and Laboratoire PPS (Paris 7) Ugo de'Liguoro (chair) Turin Univerisity Ken-etsu Fujita Gunma University Koji Nakazawa Kyoto University Alexis Saurin (co-chair) INRIA and Laboratoire PPS (Paris 7) Submission: authors of original works on the topic of the workshop are invited to submit either a FULL PAPER of up to 20 pages, which has to be unpublished nor submitted elsewhere, or an EXTENDED ABSTRACT of up to 5 pages (to which previous restrictions do not apply) for short presentation at the workshop. Only accepted full papers will appear in the proceedings; the PC might decide, on the ground of referees reports, that a full paper submission is accepted as extended abstract instead. Submission consists of a LaTex generated pdf file, prepared using EPTCS macro package, available from: http://info.eptcs.org/ Authors of extended abstracts must add: "Extended Abstract" to the title. The PC Submissions are via EasyChair COS2013 site: https://www.easychair.org/conferences/?conf=cos2013 Important Dates: Submission: April, 6 2013 (no previous abstract submission required) Extended abstract: April, 15 2013 (new) Notification: April, 29 2013 (changed) Final version: May, 15 2013 (changed) Workshop: June, 24-25 2013 Contact: Ugo de'Liguoro Dipartimento di Informatica, Universita' di Torino, Corso Svizzera 185, 10149 Torino, Italy email: deliguoro(a)di.unito.it <mailto:deliguoro@di.unito.it> Web sites: COS'13: http://cos2013.di.unito.it <http://cos2013.di.unito.it/> RTD'13: http://www.win.tue.nl/rdp2013/ ------------------------------------------------------------------------------------------------

1 0

Computability in Europe 2013
by Akitoshi Kawamura 28 Mar '13

28 Mar '13

皆様東京大の河村と申しますお世話になっておりますメーリングリストをお借りして七月に伊ミラノで開催されます欧洲計算可能性会議CiE 2013の御案内をさせていただきます投稿締切が二週間後に迫っておりますが御投稿・御参加を検討頂ければ幸いです -- 河村彰星東京大学大学院情報理工学系研究科コンピュータ科学専攻助教（今井研究室） 03-5841-4097 http://www-imai.is.s.u-tokyo.ac.jp/~kawamura/index_j.html ************************************************************************ CiE13 CALL FOR PAPERS AND SPECIAL AWARDS: CiE 2013: The Nature of Computation: Logic, Algorithms, Applications Milan, Italy July 1 - 5, 2013 http://cie2013.disco.unimib.it IMPORTANT DATES: Submission Deadline for LNCS: 20 January 2013 Notification of authors: 4 March 2013 Deadline for final revisions: 1 April 2013 CiE 2013 is the ninth conference organised by CiE (Computability in Europe), a European association of mathematicians, logicians, computer scientists, philosophers, physicists and others interested in new developments in computability and their underlying significance for the real world. Previous meetings have taken place in Amsterdam (2005), Swansea (2006), Siena (2007), Athens (2008), Heidelberg (2009), Ponte Dalgada (2010), Sofia (2011) and Cambridge (2012). The Nature of Computation is meant to emphasize the special focus of CIE13 on the unexpected and strong changes that studies on Nature have brought in several areas of mathematics, biology, physics, and computer science. Starting from Alan Turing, research on Nature with a computational perspective has produced novel contributions, giving rise even to new disciplines. AWARDS: Springer-Verlag has graciously funded two awards that will be given during the CiE 2013 Conference. Best student paper: This prize will be awarded for the best student paper presented at CiE 2013, as judged by the Program Committee. A prize of 500 euros will be given to the author(s) of the best student-authored paper (or split between more than one paper if there is a tie). In order to be considered, a paper has to be submitted in the category 'Regular paper (eligible for best student paper award)' on EasyChair. Papers are eligible if all of its authors are full-time students at the time of submission. Best paper on Natural Computing: The prize consists of the four volumes of the Handbook of Natural Computing (see http://cie2013.disco.unimib.it/awards/). This prize will be awarded to the best paper on Natural Computing presented at CiE 2013, as judged by the Program Committee. A paper is eligible if its main topic falls within the scope of Natural Computing, roughly defined as the set of fields studied in the above handbook. The Program Committee is the only judge of the relevance of a paper within the Natural Computing scope. The authors of a paper eligible for the award must indicate this in the submission notes. INVITED SPEAKERS Ulle Endriss (University of Amsterdam) Lance Fortnow (Georgia Institute of Technology) Anna Karlin (University of Washington) Bernard Moret (Ecole Polytechnique Federale de Lausanne) Mariya Soskova (Sofia University) Endre Szemeredi (Hungarian Academy of Sciences, Rutgers University) TUTORIAL SPEAKERS Gilles Brassard (Universite de Montreal) Grzegorz Rozenberg (Leiden Institute of Advanced Computer Science and University of Colorado at Boulder) SPECIAL SESSIONS on Algorithmic Randomness organizers: Mathieu Hoyrup, Andre Nies Data Streams and Compression organizers: Paolo Ferragina, Andrew McGregor Computational Complexity in the Continuous World organizers: Akitoshi Kawamura, Robert Rettinger Computational Molecular Biology organizers: Alessandra Carbone, Jens Stoye Computation in Nature organizers: Mark Delay, Natasha Jonoska History of Computation organizers: Gerard Alberts, Liesbeth De Mol PROGRAM COMMITTEE: * Gerard Alberts (Amsterdam) * Luis Antunes (Porto) * Arnold Beckmann (Swansea) * Laurent Bienvenu (Paris) * Paola Bonizzoni (Milan, co-chair) * Vasco Brattka (Munich and Cape Town, co-chair) * Cameron Buckner (Houston TX) * Bruno Codenotti (Pisa) * Stephen Cook (Toronto ON) * S Barry Cooper (Leeds) * Ann Copestake (Cambridge) * Erzsebet Csuhaj-Varju (Budapest) * Anuj Dawar (Cambridge) * Gianluca Della Vedova (Milan) * Liesbeth De Mol (Gent) * Jerome Durand-Lose (Orleans) * Viv Kendon (Leeds) * Bjoern Kjos-Hanssen (Honolulu, HI) * Antonina Kolokolova (St. John's NF) * Benedikt Loewe (Amsterdam) * Giancarlo Mauri (Milan) * Rolf Niedermeier (Berlin) * Geoffrey Pullum (Edinburgh) * Nicole Schweikardt (Frankfurt) * Sonja Smets (Amsterdam) * Susan Stepney (York) * S. P. Suresh (Chennai) * Peter van Emde Boas (Amsterdam) The PROGRAMME COMMITTEE cordially invites all researchers (European and non-European) in computability related areas to submit their papers (in PDF format, max 10 pages using the LNCS style) for presentation at CiE 2013. The submission site https://www.easychair.org/conferences/?conf=cie2013 is open. We particularly invite papers that build bridges between different parts of the research community. The CONFERENCE PROCEEDINGS will be published by LNCS, Springer Verlag. Contact: Paola Bonizzoni - bonizzoni at disco.unimib.it Website: http://cie2013.disco.unimib.it

1 2

講演会/セミナーのお知らせ
by Makoto Kikuchi 24 Mar '13

24 Mar '13

各位先日ご案内しました Segei Artemov 教授， Elena Nogina 教授の講演会の場所が間違えていたので訂正します．日本大学文理学部1号館1階122教室とあったのは誤りで，正しくは日本大学文理学部1号館2階122教室です．よろしくお願いします．菊池誠 -- 各位先日ご案内いたしました Segei Artemov 教授 (City University of New York)，Elena Nogina 教授 (City University of New York) の講演会とセミナーのアブストラクトをお送りします．（一部，講演題目が変更されています．）講演会，セミナーにご出席希望の方は事前にそれぞれの問い合わせ先までご連絡下さい．【１】論理学講演会日時：2013年3月24日（日）14:30-18:00 場所：日本大学文理学部1号館1階122教室プログラム: 14:30-16:00 Sergei Artemov (CUNY) Formalizing Brouwer-Heyting-Kolmogorov semantics 16:30-18:00 Elena Nogina (CUNY) Joining Two Goedel's Models of Provability アブストラクト： Speaker: Sergei Artemov, The City University of New York Title: Formalizing Brouwer-Heyting-Kolmogorov semantics Abstract: According to Brouwer, intuitionistic truth is provability; this led to the informal Brouwer-Heyting-Kolmogorov (BHK) semantics of proofs for intuitionistic logic (1934). There are two well-known problems with BHK exposed by Kreisel in 1962. First, in the original BHK, any proof vacuously “proves” the negation of any unprovable sentence; this dubious feature ruins constructive connection between a sentence and its proof. Second, original BHK’s treating of universal quantifiers admits unacceptable bogus “proofs” for any true Π1-sentence, e.g., for Fermat’s Last Theorem or the consistency statement. Kreisel offered plausible corrections to BHK which we suggest calling BHK*. The problem of an exact provability interpretation of BHK* turned out to be elusive. For example, BHK- inspired semantics based on computational programs (Realizability, Curry-Howard isomorphism, Intuitionistic Type Theory) though have constituted a major development in logic and computer science, do not satisfy BHK*. In the 1930s, Gödel suggested to define intuitionistic logic via classical provability represented by modal logic S4 and interpret the latter via explicit proofs rather then provability. Later developments of the Logic of Proofs LP in the 1990s opened the door to realizing Gödel’s approach. In this talk, we survey provability semantics obtained by Gödel’s embedding of intuitionistic logic into S4, followed by a realization in the Logic of Proofs. We show that it satisfies BHK* requirements and provides a desired provability foundation for intuitionistic logic. Speaker: Dr. Elena Nogina, The City University of New York Title: Joining Two Gödel's approaches to provability Abstract: In 1933, Gödel suggested S4 as a modal logic of provability but pointed out that S4 was not compatible with a straightforward interpretation of modality as formal provability. This left "a provability semantics without a calculus" and "a provability calculus without a semantics." In 1976, Solovay found that modal logic GL was the logic of formal provability; in 1995, Artemov found a precise provability semantics for S4 via Logic of Proofs LP. In this talk, we introduce logic GLA representing both aforementioned Gödel's approaches to provability, as well as new provability principles which appear as a result of interactions between these models. GLA is supplied with a Kripke-style semantics and the corresponding completeness theorem. Soundness and completeness of GLA with respect to the arithmetical provability semantics is established. 問い合わせ先：日本大学文理学部哲学科飯田隆 iida.takashi19(a)nihon-u.ac.jp 【２】Seminar in Logic and Philosophy of Mathematics 日時：2013年3月26日（火）〜27日（水）場所：神戸大学自然科学総合研究棟3号館4階421室（プレゼンテーション室）プログラム： 3月26日 10:30-12:00 Sergei Artemov (CUNY) Logic of Proofs and Justification (1/2) 13:00-14:30 Elena Nogina (CUNY) On Provability and Explicit Proofs 15:00-16:30 Taishi Kurahashi (Kobe) Syntax and semantics of predicate modal logic of provability 3月27日 10:30-12:00 Sergei Artemov (CUNY) Logic of Proofs and Justification (2/2) 13:00-14:30 Ryota Akiyoshi (Kyoto) Proper Explanation of Brouwer's Fundamental Assumption 15:00-16:30 Hidenori Kurokawa Kreisel's second clause and the theory of constructions Speaker: Sergei Artemov, The City University of New York Title: Logic of Proofs and Justification Abstract: We describe a general logical framework, Justification Logic, for reasoning about epistemic justification. Justification Logic is based on classical propositional logic augmented by justification assertions t:F that read `t is a justification for F.' In this talk, we show how Justification Logic originated from the mathematical proof-theoretical semantics as the Logic of Proofs and then extended to the mainstream epistemology. In the foundations of constructive reasoning, the Logic of Proofs has completed Gödel's effort of the 1930s to find a classical provability interpretation of intuitionistic logic. In epistemology, Justification Logic offered the missing justification component to formal analysis of Knowledge as Justified True Belief approach commonly attributed to Plato. As a case study, we offer a resolution of the Goldman–Kripke ‘Red Barn’ paradox and analyze Russell’s ‘prime minister example’ in Justification Logic. We state a general Correspondence Theorem showing that behind each epistemic modal logic, there is a robust system of justifications. This renders a new, evidence-based foundation for epistemic logic. Speaker: Dr. Elena Nogina, The City University of New York. Title: On Provability and Explicit Proofs Abstract: Gödel's Incompleteness Theorem drew a sharp distinction between explicit proofs and formal provability. In particular, reflection principle "if A is formally provable then A holds" is true but not internally provable, whereas explicit reflection principle "if p is a proof of A, then A holds" is both true and provable. According to Solovay, all valid principles of formal provability are described by Gödel-Löb modal logic GL. Artemov's Logic of Proofs LP describes all valid principles of explicit proofs with a basic set of operations. Some meaningful provability principles require both provability and explicit proofs. E.g., the negative introspection fails in GL as well as in LP, but admits an adequate formulation in mixed language of GL and LP. We introduce logic GLA, that describes, along with GL and LP, all valid principles in the language of proofs and provability. GLA has been supplied with Kripke-style semantics and shown to be complete with respect to the intended arithmetical provability interpretation. 問い合わせ先：神戸大学大学院システム情報学研究科菊池誠 mkikuchi(a)kobe-u.ac.jp

1 0

ランダムネスの研究集会講演募集
by Kenshi Miyabe 23 Mar '13

23 Mar '13

皆様宮部です．ランダムネスの研究集会のお知らせです． ---- ランダムネスに関する研究集会を次のように開催します．集会名：ELC Workshop on Randomness and Probability Through Computability (RPTC2013) 日時：2013年5月14日(火)15日(水) 場所：東京大学本郷キャンパス内 http://kenshi.miyabe.name/rptc2013/ 直前の2013年5月13日(月)14日(火)には，同じ場所でランダムネスのセミナーも行う予定です． ELC Seminar on Algorithmic Randomness http://kenshi.miyabe.name/rptc2013/seminar.html 本研究集会には，ランダムネスの理論を主導している二人である Prof. DowneyとProf. Niesに参加・講演して頂きます．また他の招待講演者として Prof. Bakhadyr Khoussainovと九州大学の来嶋秀治准教授 http://tcslab.csce.kyushu-u.ac.jp/~kijima/index_j.html を招待いたしました．つきましては，国内より講演を募集します．ランダムネスもしくはランダムネスに関連する分野の研究や紹介，提案などで，招待講演者らに聞いてもらいたいという内容を歓迎します．名前，所属，講演タイトル，１パラグラフ程度の要旨，旅費を希望するかどうかを添えて，宮部 kmiyabe(a)kurims.kyoto-u.ac.jp までメールでお申し込み下さい．採択・不採択の通知後，アブストラクトをTeXで投稿していだきます．アブストラクトの長さは自由ですが，A4で1ページ以下を想定しています．投稿期限：4月19日(金) 採択・不採択の通知：4月23日(火) アブストラクトの投稿期限：4月30日(火) なお，本集会は文部科学省科学研究費補助金新学術領域研究「多面的アプローチの統合による計算限界の解明」 http://www.al.ics.saitama-u.ac.jp/elc/ の支援を受けております．東京大学情報理工学系研究科河村彰星 kawamura(a)is.s.u-tokyo.ac.jp 京都大学数理解析研究所宮部賢志 kmiyabe(a)kurims.kyoto-u.ac.jp -- Kenshi Miyabe email: kmiyabe(a)kurims.kyoto-u.ac.jp Researcher Research Institute for Mathematical Sciences, Kyoto University Kyoto 606-8502 Japan Tel: +81-75-753-7202 / Fax: +81-75-753-7272

1 0

講演会/セミナーのお知らせ
by Makoto Kikuchi 23 Mar '13

23 Mar '13

各位先日ご案内いたしました Segei Artemov 教授 (City University of New York)，Elena Nogina 教授 (City University of New York) の講演会とセミナーのアブストラクトをお送りします．（一部，講演題目が変更されています．）講演会，セミナーにご出席希望の方は事前にそれぞれの問い合わせ先までご連絡下さい．【１】論理学講演会日時：2013年3月24日（日）14:30-18:00 場所：日本大学文理学部1号館1階122教室プログラム: 14:30-16:00 Sergei Artemov (CUNY) Formalizing Brouwer-Heyting-Kolmogorov semantics 16:30-18:00 Elena Nogina (CUNY) Joining Two Goedel's Models of Provability アブストラクト： Speaker: Sergei Artemov, The City University of New York Title: Formalizing Brouwer-Heyting-Kolmogorov semantics Abstract: According to Brouwer, intuitionistic truth is provability; this led to the informal Brouwer-Heyting-Kolmogorov (BHK) semantics of proofs for intuitionistic logic (1934). There are two well-known problems with BHK exposed by Kreisel in 1962. First, in the original BHK, any proof vacuously “proves” the negation of any unprovable sentence; this dubious feature ruins constructive connection between a sentence and its proof. Second, original BHK’s treating of universal quantifiers admits unacceptable bogus “proofs” for any true Π1-sentence, e.g., for Fermat’s Last Theorem or the consistency statement. Kreisel offered plausible corrections to BHK which we suggest calling BHK*. The problem of an exact provability interpretation of BHK* turned out to be elusive. For example, BHK- inspired semantics based on computational programs (Realizability, Curry-Howard isomorphism, Intuitionistic Type Theory) though have constituted a major development in logic and computer science, do not satisfy BHK*. In the 1930s, Gödel suggested to define intuitionistic logic via classical provability represented by modal logic S4 and interpret the latter via explicit proofs rather then provability. Later developments of the Logic of Proofs LP in the 1990s opened the door to realizing Gödel’s approach. In this talk, we survey provability semantics obtained by Gödel’s embedding of intuitionistic logic into S4, followed by a realization in the Logic of Proofs. We show that it satisfies BHK* requirements and provides a desired provability foundation for intuitionistic logic. Speaker: Dr. Elena Nogina, The City University of New York Title: Joining Two Gödel's approaches to provability Abstract: In 1933, Gödel suggested S4 as a modal logic of provability but pointed out that S4 was not compatible with a straightforward interpretation of modality as formal provability. This left "a provability semantics without a calculus" and "a provability calculus without a semantics." In 1976, Solovay found that modal logic GL was the logic of formal provability; in 1995, Artemov found a precise provability semantics for S4 via Logic of Proofs LP. In this talk, we introduce logic GLA representing both aforementioned Gödel's approaches to provability, as well as new provability principles which appear as a result of interactions between these models. GLA is supplied with a Kripke-style semantics and the corresponding completeness theorem. Soundness and completeness of GLA with respect to the arithmetical provability semantics is established. 問い合わせ先：日本大学文理学部哲学科飯田隆 iida.takashi19(a)nihon-u.ac.jp 【２】Seminar in Logic and Philosophy of Mathematics 日時：2013年3月26日（火）〜27日（水）場所：神戸大学自然科学総合研究棟3号館4階421室（プレゼンテーション室）プログラム： 3月26日 10:30-12:00 Sergei Artemov (CUNY) Logic of Proofs and Justification (1/2) 13:00-14:30 Elena Nogina (CUNY) On Provability and Explicit Proofs 15:00-16:30 Taishi Kurahashi (Kobe) Syntax and semantics of predicate modal logic of provability 3月27日 10:30-12:00 Sergei Artemov (CUNY) Logic of Proofs and Justification (2/2) 13:00-14:30 Ryota Akiyoshi (Kyoto) Proper Explanation of Brouwer's Fundamental Assumption 15:00-16:30 Hidenori Kurokawa Kreisel's second clause and the theory of constructions Speaker: Sergei Artemov, The City University of New York Title: Logic of Proofs and Justification Abstract: We describe a general logical framework, Justification Logic, for reasoning about epistemic justification. Justification Logic is based on classical propositional logic augmented by justification assertions t:F that read `t is a justification for F.' In this talk, we show how Justification Logic originated from the mathematical proof-theoretical semantics as the Logic of Proofs and then extended to the mainstream epistemology. In the foundations of constructive reasoning, the Logic of Proofs has completed Gödel's effort of the 1930s to find a classical provability interpretation of intuitionistic logic. In epistemology, Justification Logic offered the missing justification component to formal analysis of Knowledge as Justified True Belief approach commonly attributed to Plato. As a case study, we offer a resolution of the Goldman–Kripke ‘Red Barn’ paradox and analyze Russell’s ‘prime minister example’ in Justification Logic. We state a general Correspondence Theorem showing that behind each epistemic modal logic, there is a robust system of justifications. This renders a new, evidence-based foundation for epistemic logic. Speaker: Dr. Elena Nogina, The City University of New York. Title: On Provability and Explicit Proofs Abstract: Gödel's Incompleteness Theorem drew a sharp distinction between explicit proofs and formal provability. In particular, reflection principle "if A is formally provable then A holds" is true but not internally provable, whereas explicit reflection principle "if p is a proof of A, then A holds" is both true and provable. According to Solovay, all valid principles of formal provability are described by Gödel-Löb modal logic GL. Artemov's Logic of Proofs LP describes all valid principles of explicit proofs with a basic set of operations. Some meaningful provability principles require both provability and explicit proofs. E.g., the negative introspection fails in GL as well as in LP, but admits an adequate formulation in mixed language of GL and LP. We introduce logic GLA, that describes, along with GL and LP, all valid principles in the language of proofs and provability. GLA has been supplied with Kripke-style semantics and shown to be complete with respect to the intended arithmetical provability interpretation. 問い合わせ先：神戸大学大学院システム情報学研究科菊池誠 mkikuchi(a)kobe-u.ac.jp

1 1

ICE 2013: Deadline extended until Sunday 24th March
by Ichiro Hasuo 21 Mar '13

21 Mar '13

みなさま，以前お知らせしたワークショップ ICE のご案内です． - 〆切が 3/24 まで延びました． - Short paper や既発表論文の紹介も大歓迎です．みなさま，ぜひご投稿・ご参加を検討ください！蓮尾一郎 http://www-mmm.is.s.u-tokyo.ac.jp/~ichiro/ ====== [- Apologies for multiple copies -] ICE 2013 6th Interaction and Concurrency Experience June 6, 2013, Florence, Italy http://www.discotec.org/workshops/ice2013/ Satellite workshop of DisCoTec 2013 http://www.discotec.org === Highlights === - Innovative selection procedure - ICE welcomes submissions of full papers, short papers, and brief announcements - Invited talks: Davide Sangiorgi & Damien Pous - Special issue of Science of Computer Programming (http://www.journals.elsevier.com/science-of-computer-programming/) === Important Dates === 24 March 2013...................Full paper submission 25 March - 21 April 2013....Reviews, rebuttal, and PC discussion 24 April 2013......................Notification to authors 6 June 2013.......................ICE in Florence 15 Sept 2013.....................Camera-ready for post-proceedings === Scope === Interaction and Concurrency Experiences (ICEs) is a series of international scientific meetings oriented to theoretical computer science researchers with special interest in models, verification, tools and programming primitives for complex interactions. The general scope of the venue includes theoretical and applied aspects of interactions and the synchronization mechanisms used among components of concurrent/distributed systems, related to several areas of computer science in the broad spectrum ranging from formal specification and analysis to studies inspired by emerging computational models. Topics of interest include, but are not limited to: - Process algebra and coordination: transformation, analysis and implementation - Models for distributed coordination and semantics - Techniques and tools for specification, analysis, verification of resilient interactions - Coinductive techniques for reactive systems - Languages, protocols and mechanisms for sound distributed coordination - Logics and types for interactions - Comparison among different coordination and/or execution models - Expressive power of coordination languages and execution models - Formal semantics of coordination languages - Formal verification of distributed coordinated architectures - Relations between different semantic models for coordination languages === Selection Procedure === Since its 1st edition in 2008, the distinguishing feature of ICE has been an innovative paper selection mechanism based on an interactive discussion amongst authors and PC members. During the review phase, each submitted paper is published on a Wiki and associated with a discussion forum. The discussion forum can be accessed by the authors of the paper and by all the PC members not in conflict with the paper. The forum is used by reviewers to ask questions and clarifications to the authors, allowing them to better explain all the aspects of their paper. The evaluation of the paper will keep into account not only the reviews, but also the outcome of the discussion. As witnessed by the past five editions of ICE, this procedure considerably improves the accuracy of the feedback from reviews, the fairness of the selection, the quality of camera-ready papers, and the discussion during the workshop. === The Public Wiki === After the notification, the accepted papers are published on a public forum, in order to initiate public discussions that will trigger and stimulate the scientific debate at the workshop. We believe that this will drive the workshop discussions and let prospective participants interact with each other much earlier than in more traditional events. === Submission Guidelines === We invite for three types of submissions: (1) Full Papers, (2) Short Papers, and (3) Brief Announcements of already Published Papers. Full and short papers to appear in the post-proceedings must report previously unpublished work and not be simultaneously submitted to other conferences/workshops with refereed proceedings. The ICE 2013 post-proceedings will be published in Electronic Proceedings in Theoretical Computer Science (http://eptcs.org/). In addition, we invite for brief announcements of already published results, should the authors be interested in discussing their published research with the ICE community and giving a talk. Brief announcements will not be part of the post-proceedings. Submissions must be made electronically in PDF format via EasyChair (http://www.easychair.org/conferences/?conf=ice2013). Full papers should not exceed 15 pages while short papers and brief announcements should not exceed 5 pages with the EPTCS style (http://style.eptcs.org/). Accepted (full and short) papers and brief announcements must be presented at the workshop by one of the authors. === Special Issue === Extended versions of the best full papers selected by the PC will be invited to appear in a special issue of the journal of Science of Computer Programming (http://www.journals.elsevier.com/science-of-computer-programming/ ). Such contributions will be regularly peer-reviewed according to the standard journal policy, but they will be handled in a shorter time than regular submissions. === Program Committee === Luca Aceto (Reykjavik University, Iceland) Simon Bliudze (EPFL, Switzerland) Laura Bocchi (University of Leicester, UK) Filippo Bonchi (CNRS, France) Roberto Bruni (University of Pisa, Italy) Marcello Bonsangue (Leiden University, The Netherlands) Ornela Dardha (University of Bologna/INRIA, Italy) Ichiro Hasuo (University of Tokyo, Japan) Tobias Heindel (CEA Saclay, France) Ludovic Henrio (CNRS, France) Clemens Kupke (University of Strathclyde, Scotland, UK) Julien Lange (University of Leicester, UK) Antonia Lopes (University of Lisbon, Portugal) Giuliano Losa (EPFL, Switzerland) Claudio A. Mezzina (FBK Trento, Italy) Matteo Mio (École Polytechnique, France) Valentina Monreale (University of Pisa, Italy) Luca Mottola (Politecnico di Milano, Italy) Daniela Petrisan (University of Leicester, UK) Paola Spoletini (University of Insubria, Italy) Emilio Tuosto (University of Leicester, UK) Valerio Senni (IMT Lucca, Italy) Alexandra Silva (Radboud University Nijmegen, The Netherlands) Josef Widder (TU Vienna, Austria) Roberto Zunino (Università degli Studi di Trento and COSBI, Italy) === ICEcreamers === - Marco Carbone (IT University of Copenhagen, Denmark; co-chair) - Ivan Lanese (University of Bologna/INRIA, Italy) - Alberto Lluch Lafuente (IMT Lucca, Italy) - Ana Sokolova (University of Salzburg, Austria; co-chair) === Contact === ice2013(a)easychair.org === Previous editions === The previous five editions of ICE have been held on * July 6th, 2008 in Reykjavik, Iceland, co-located with ICALP'08. The post-proceedings were published in ENTCS (vol.229-3). * August 31st, 2009 in Bologna, Italy, co-located with CONCUR'09. The post-proceedings were published in EPTCS (vol.12) and selected papers appeared in a joint special issue of MSCS (with EXPRESS’09 and SOS’09, Vol. 22, Number 2). * June 10th, 2010 in Amsterdam, The Netherlands, co-located with DisCoTec'10. The post-proceedings were published in EPTCS (vol.38) and selected papers appeared in a joint special issue of SACS (with CAMPUS'10 and CS2BIO'10, Vol. XXI). * June 9th, 2011 in Reykjavik, Iceland, co-located with DisCoTec'11. The post-proceedings were published in EPTCS (vol.59) and selected papers appeared in a special issue of SACS (Vol. XXII). * June 16th, 2012 in Stockholm, Sweden, co-located with DisCoTec'12. The post-proceedings were published in EPTCS (vol.104) and a special issue of SCP is now in preparation.

1 0

PROBABILITY AND VAGUENESS, University of Tokyo, March 20-22, 2013
by Richard Dietz 17 Mar '13

17 Mar '13

PROBABILITY AND VAGUENESS, University of Tokyo, March 20-22, 2013 It is my pleasure to announce the upcoming Probability and Vagueness conference, which will be hosted by the Department of Philosophy at the University of Tokyo, and take place on March 20-22, 2013. For further details, please see: http://probvag-tokyo.com *Invited speakers* Eleonora Cresto (University of Buenos Aires) Igor Douven (University of Groningen) Alan Hajek (ANU) Rosanna Keefe (University of Sheffield) Dan Lassiter (University of Stanford) Aidan Lyon (University of Maryland) Peter Pagin (Stockholm University) Wlodek Rabinowicz (Lund University) Nick J.J. Smith (University of Sydney) The conference will be registration free. Please feel free to join in if you happen to be in Tokyo in the next week! Richard Dietz and Masaki Ichinose (the organisers)

1 0

Call for Workshop Proposals:JSAI-IsAI 2013
by Ken Satoh 14 Mar '13

14 Mar '13

Call for Workshop Proposals JSAI International Symposia on AI (JSAI-isAI 2013) Sponsored by: The Japanese Society for Artificial Intelligence (JSAI) Date: October 27 - 28, 2013 Venue: Raiousha Building, Keio University, Kanagawa Submission deadline: March 23, 2013 Submit a proposal to "JSAI-isAI [at] ai-gakkai.or.jp" by e-mail The fifth JSAI International Symposia on AI (JSAI-isAI) will take place at Keio University, Kanagawa on October 27th and 28th, 2013. JSAI-isAI is an event that hosts several international workshops at the same location. This is in succession to the international workshops co-located with JSAI annual conferences since 2001. JSAI invites proposals for the fifth JSAI-isAI. JSAI-isAI brings together a set of workshops at a common site, providing a unique and intimate forum for colleagues in a given discipline. JSAI-isAI also provides an important opportunity for AI researchers to get together and share their knowledge. Selected papers of JSAI-isAI workshops has been published in LNAI series as LNAI6284(isAI2009), LNAI6797(IsAI2010), LNAI7258(IsAI2011), respectively, and a volume for IsAI2012 is under editing. We expect the same treatment this year as well (under negotiation with Springer Verlag). Prospective workshop organizers should send a proposal (maximum three pages) with the following sections to the JSAI-isAI 2013 Committee. - Title of the workshop - Objectives, and scope - Names and contacts of key organizers and a tentative list of the program committee members. - Expected number of papers, attendees, and preliminary workshop format. Proposals will be reviewed by the JSAI-isAI 2013 Committee. The form for workshop proposals is shown below. ------------------------------------------------------------ <Workshop Proposal Form> Workshop title: Abstract (within 400 words): #Describe objective, scope Expected number of papers: Expected number of attendees: Preliminary workshop format: #Describe whether the workshop will include panels, posters, and etc. Past experiences in JSAI-isAI (if any): #Describe whether you have organized workshops in JSAI-isAI and how #many participants you have got in the past Information of Workshop leader (1) Name: Affiliation: Postal address: Telephone: Fax e-mail: Experiences with conference/workshop (if any): Information of Workshop co-leader (2) (if any) Name: Affiliation: Postal address: Telephone: Fax e-mail: Experiences with conference/workshop (if any): The tentative list of members in the program committee (3): ------------------------------------------------------------ Important Dates Workshop Proposal Due: 23 March 2013 Workshop Notification: 9 April 2013 Release of Workshop Call for Paper: April 2013 Workshop Submission Deadline: August 2013 Workshop Author Notification: September 2013 Workshop Camera-ready: September 2013 Workshop Date: 27-28, October 2013 (Sunday, Monday) Notes The organizers and chairs of the workshop shall have full control on the call for papers, forming of program committees, review and selection of papers as well as planning the workshop program. Furthermore, the organizers and chairs of the workshop should specify in the web page that the workshop is `with a support of The Japanese Society for Artificial Intelligence' and `in association with forth JSAI International Symposia on AI (JSAI-isAI 2013).' The organizers and chairs of the workshop are also responsible for preparing a short review of the workshop, to be printed in the journal of JSAI.

1 0

TACL2013
by 小野寛晰 13 Mar '13

13 Mar '13

TOPOLOGY, ALGEBRA AND CATEGORIES IN LOGIC (TACL 2013) Conference and Summer School (Abstract Submission Deadline: April 1, 2013) (Support Request Deadline: April 21, 2013) ====================================================== The Sixth International Conference (and Summer School) on Topology, Algebra and Categories in conjunction with the 28th Annual Shanks Lecture Series Conference and Shanks Lectures: July 28 - August 1, 2013 Summer School: July 24 - 27, 2013 Department of Mathematics, Vanderbilt University Nashville, Tennessee USA http://www.math.vanderbilt.edu/~tacl2013/

1 0

Topology, Algebra and Categories in Logic (TACL 2013)
by 小野寛晰 13 Mar '13

13 Mar '13

====================================================== TOPOLOGY, ALGEBRA AND CATEGORIES IN LOGIC (TACL 2013) Conference and Summer School (Abstract Submission Deadline: April 1, 2013) (Support Request Deadline: April 21, 2013) ====================================================== The Sixth International Conference (and Summer School) on Topology, Algebra and Categories in conjunction with the 28th Annual Shanks Lecture Series Conference and Shanks Lectures: July 28 - August 1, 2013 Summer School: July 24 - 27, 2013 Department of Mathematics, Vanderbilt University Nashville, Tennessee USA http://www.math.vanderbilt.edu/~tacl2013/ ============================================= Sponsors ------------- National Science Foundation Association for Symbolic Logic Shanks Endowment Vanderbilt University Consortium for Order in Algebra and Logic Invited Speakers (Conference) ------------------------------------------------------- Vladimir Voevodsky, Institute for Advanced Studies (Shanks Lecturer) Nick Bezhanishvili, Utrecht University Leo Cabrer, University of Oxford Silvio Ghilardi, University of Milan Rostislav Horcik, Academy of Sciences of the Czech Republic George Metcalfe, University of Bern Alex Simpson, University of Edinburgh Summer School Invited Speakers and Courses ------------------------------------------------------------------------- Grigori Mints, Stanford University (on Proof Theory) Lawrence Moss, Indiana University (on Recursion and Circularity) Francesco Paoli, University of Cagliari (on Algebraic Logic) Peter Selinger, Dalhousie University (on Categorical Logic) Scope of the Conference --------------------------------- Studying logics via semantics is a well-established and very active branch of mathematical logic, with many applications, in computer science and elsewhere. The area is characterized by results, tools and techniques stemming from various fields, including universal algebra, topology, category theory, order, and model theory. The program of the conference TACL 2013 will focus on three interconnecting mathematical themes central to the semantical study of logics and their applications: algebraic, categorical, and topological methods. This is the sixth conference in the series Topology, Algebra and Categories in Logic (TACL, formerly TANCL). Earlier installments of this conference have been organized in Tbilisi (2003), Barcelona (2005), Oxford (2007), Amsterdam (2009), Marseilles (2011). Featured topics --------------------- Contributed talks can deal with any topic dealing with the use of algebraic, categorical or topological methods in either logic or computer science. This includes, but is not limited to, the following areas: * Algebraic structures in CS * Algebraic logic * Coalgebra * Categorical methods in logic * Domain theory * Lattice theory * Lattices with operators * Many-valued and fuzzy logics * Modal logics * Non-classical logics * Ordered topological spaces * Ordered algebraic structures * Point-free topology * Proofs and Types * Residuated structures * Semantics * Stone-type dualities * Substructural logics * Topological semantics of modal logic The Summer School ---------------------------- TACL brings together different disciplines with the goal of exploring problems in logic. Partly due to the success of the TACL conference series, researchers have started employing tools used outside their immediate areas, either individually or in collaboration with specialists in research fields featured in the series. Such interactions have also naturally lead to new directions that combine ideas from two or more research fields. This has been a gradual and arduous process and TACL can boast of having participants that are at least somewhat familiar with most of the featured areas. However, young researchers and students who attend the conference and work in TACL fields have a more restricted and specialized repertoire of tools and knowledge. The goal of the Summer School is to fill the gap and expose such researchers to a variety of methods that can be used to study logic. It will primarily target graduate students and postdocs, but also more senior researchers who are not familiar with aspects of neighboring areas. Prospective Summer School participants should express their interest on the 'Express Interest' page of the TACL 2013 web site by selecting the events that plan to attend (summer school and/or conference). Limited funds for supporting summer school participants are available (mainly through NSF). Those who plan to request financial support should submit a copy of their CV and a letter of support from their PhD advisor or post-doc supervisor (if applicable) to tacl2013(a)gmail.com with 'Summer School support request' in the subject line by April 21, 2013. In addition, they need to fill out the financial support form on the 'Support Requests' page by the same date. Registration should also be completed by June 1, 2013. We would appreciate your assistance in advertising the Summer School to interested students. Additional information can be found on the 'Summer School' page of the TACL 2013 web site. Submissions to the Conference ------------------------------------------- Contributed presentations will be of two types: o 20 minutes long presentations in parallel sessions and o featured, 30 minutes long, plenary presentations. The submission of an abstract will be required to be selected for a contributed presentation of either kind. While preference will be given to new work, results that have already been published or presented elsewhere will also be considered. More information on the submission procedure, as well as a link to the EasyChair system, can be found at the conference web site. Important Dates ---------------------- April 1, 2013: Abstract submission deadline April 21, 2013: Conference support request deadline April 21, 2013: Summer School support request deadline May 1, 2013: Notification to authors and summer school applicants June 1, 2013 - Deadline for early online registration and payment July 24 - 27: Summer School July 28-August 1, 2013: Conference Program Committee --------------------------- Steve Awodey, Carnegie Mellon University Guram Bezhanishvili, New Mexico State University David Gabelaia, Razmadze Mathematical Institute, Tbilisi Nick Galatos (co-chair), University of Denver Mai Gehrke, LIAFA, University of Paris Diderot Rob Goldblatt, Victoria University, Wellington John Harding, New Mexico State University Ramon Jansana, University of Barcelona Peter Jipsen, Chapman University Achim Jung, University of Birmingham Alexander Kurz (co-chair), University of Leicester Vincenzo Marra, University of Milan Hiroakira Ono, Japan Advanced Institute of Science and Technology Alessandra Palmigiano, University of Amsterdam Hilary Priestley, St Anne's College, Oxford James Raftery, University of KwaZulu-Natal, Durban Thomas Streicher, Technical University of Darmstadt Kazushige Terui, Kyoto University Constantine Tsinakis, Vanderbilt University Yde Venema, University of Amsterdam Michael Zakharyaschev, Birkbeck College, University of London Organizing Committee ------------------------------- Chris Conidis, Vanderbilt University Lianzhen Liu, Jiangnan University, China Warren McGovern, Florida Atlantic University Francesco Paoli, University of Cagliari Rebecca Steiner, Vanderbilt University Constantine Tsinakis (chair), Vanderbilt University William Young, Vanderbilt University Expression of interest ------------------------------ We would greatly appreciate your taking two minutes to express your level of interest in the conference by filling out a simple form on the conference web site under "Express Interest". This will help the Organizing Committee with their planning. You can also opt-out from receiving future announcements by clicking the link at the bottom of this email. More Information ----------------------- TACL 2013 web site: http://www.math.vanderbilt.edu/~tacl2013/ Use this site for local information, including hotel accommodations, for travel information and registration, and for submitting a request for financial support. Any queries for the Program Committee (such as usage of the EasyChair conference system, abstract submission guidelines, conference program, etc.) should be sent to tacl2013(a)gmail.com. Queries for the local Organizing Committee (registration, hotel accommodations, financial support and reimbursements, technology infrastructure, etc.) should be sent to tacl2013oc(a)vanderbilt.edu.

1 0

WoLLIC 2013 - CFP - DEADLINE APPROACHING
by 小野寛晰 13 Mar '13

13 Mar '13

[Please circulate. Apologies for any cross-postings.] WoLLIC 2013 20th Workshop on Logic, Language, Information and Computation August 20th to 23rd, 2013 Technische Universität Darmstadt Darmstadt, Germany 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 Fachbereich Mathematik, Technische Universität Darmstadt, Germany Centro de Informática, Universidade Federal de Pernambuco, Brazil Financial Support Deutsche Vereinigung für Mathematische Logik und für Grundlagenforschung der Exakten Wissenschaften (DVMLG) 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 twentieth WoLLIC will be held at the Technische Universität Darmstadt, Germany, from August 20th to 23rd, 2013. 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), theEuropean 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; 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. 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 10 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 2012 EasyChair website. (Please go to http://wollic.org/wollic2013/instructions.html for instructions.) A title and single-paragraph abstract should be submitted by March 25th, and the full paper by March 29th (firm date). Notifications are expected by May 3rd, and final papers for the proceedings will be due by May 15th (firm date). Proceedings The proceedings of WoLLIC 2013, 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 2013 issue of a scientific journal (to be confirmed). Invited Speakers Natasha Alechina (University of Nottingham) Steve Awodey (Carnegie Mellon University) Mikolaj Bojanczyk (Warsaw University) Wim Martens (Universität Bayreuth) Catuscia Palamidessi (INRIA Saclay and LIX) Thomas Schwentick (TU Dortmund) Student Grants ASL sponsorship of WoLLIC 2013 will permit ASL student members to apply for a modest travel grant (deadline: May 1st, 2013). See http://www.aslonline.org/studenttravelawards.html for details. Important Dates March 25th, 2013: Paper title and abstract deadline March 29th, 2013: Full paper deadline May 3rd, 2013: Author notification May 15th, 2013: Final version deadline (firm) Programme Committee Albert Atserias (UPC Barcelona) Alexandru Baltag (Univ Amsterdam) Stephanie Delaune (ENS, CNRS) Amy Felty (Univ Ottawa) Santiago Figueira (Univ Buenos Aires) Amelie Gheerbrant (Univ Edinburgh) Radha Jagadeesan (DePaul Univ) Delia Kesner (Univ Paris-Diderot) Benoit Larose (Concordia Univ) Leonid Libkin (Univ Edinburgh - CHAIR) Fenrong Liu (Tsinghua Univ) Jerzy Marcinkowski (Wroclaw Univ) Peter O'Hearn (UCL) Joël Ouaknine (Oxford Univ) Gerald Penn (Univ Toronto) Gabriele Puppis (CNRS/LaBRI - Univ Bordeaux) R. Ramanujam (The Institute of Mathematical Sciences) Peter Selinger (Dalhousie Univ) Szymon Torunczyk (Warsaw Univ) Anna Zamansky (TU Wien) Steering Committee Samson Abramksy, Johan van Benthem, Anuj Dawar, Joe Halpern, Wilfrid Hodges, Daniel Leivant, Angus Macintyre, Grigori Mints, Luke Ong, Hiroakira Ono, Ruy de Queiroz. Organising Committee Ulrich Kohlenbach (Tech U Darmstadt) (Local chair) Anjolina G. de Oliveira (U Fed Pernambuco) Martin Otto (Tech U Darmstadt) Ruy de Queiroz (U Fed Pernambuco) (co-chair) Thomas Streicher (Tech U Darmstadt) Martin Ziegler (Tech U Darmstadt) Further information Contact one of the Co-Chairs of the Organising Committee. Web page http://wollic.org/wollic2013/

1 0

講演会/セミナーのお知らせ
by Makoto Kikuchi 11 Mar '13

11 Mar '13

各位 Segei Artemov 教授 (City University of New York)，Elena Nogina 教授 (City University of New York) をお招きして，以下の要領で講演会とセミナーを開催します．ご出席希望の方は事前にそれぞれの問い合わせ先までご連絡下さい．【１】論理学講演会日時：2013年3月24日（日）14:30-18:00 場所：日本大学文理学部1号館1階122教室プログラム: 14:30-16:00 Sergei Artemov (CUNY) Logic of Proofs and Justification 16:30-18:00 Elena Nogina (CUNY) Joining Two Goedel's Models of Provability 問い合わせ先：日本大学文理学部哲学科飯田隆 iida.takashi19(a)nihon-u.ac.jp 【２】Seminar in Logic and Philosophy of Mathematics 日時：2013年3月26日（火）〜27日（水）場所：神戸大学自然科学総合研究棟3号館4階421室（プレゼンテーション室）プログラム： 3月26日 10:30-12:00 Sergei Artemov (CUNY) Provability Brouwer-Heyting-Kolmogorov semantics (1/2) 13:00-14:30 Elena Nogina (CUNY) Provability and Explicit Proofs 15:00-16:30 Taishi Kurahashi (Kobe) Syntax and semantics of predicate modal logic of provability 3月27日 10:30-12:00 Sergei Artemov (CUNY) Provability Brouwer-Heyting-Kolmogorov semantics (2/2) 13:00-14:30 Ryota Akiyoshi (Kyoto) Proper Explanation of Brouwer's Fundamental Assumption 15:00-16:30 Hidenori Kurokawa Kreisel's second clause and the theory of constructions 問い合わせ先：神戸大学大学院システム情報学研究科菊池誠 mkikuchi(a)kobe-u.ac.jp

1 0

3/12講演Alexandre Costa-Leite
by Yoichi Hirai 10 Mar '13

10 Mar '13

logic-mlの皆様萩谷研の平井洋一です。きたる火曜日、Alexandre Costa-Leiteさんが東京大学本郷で講演されます。多様相論理の話と、自然言語の意味論への応用だそうです。急な話でございますが、ご参加お待ちしております。登録不要です。・3月12日 14:00〜・東京大学本郷キャンパス　理学部7号館　2階214室 --------------------------------------------------------------- Alexandre Costa-Leite (University of Brasilia, Brazil) /Fusions of modal logics, interactive laws and natural languages/ I will present two very general theorems on fusions of modal logics extended with interactive laws. Then I also show how these fusions can be applied to formalize non-interdefinable concepts in natural languages. ---------------------------------------------------------------

1 0

3月8日―9日：認識論理とゲーム理論研究会
by Suzuki, Nobu-Yuki 04 Mar '13

04 Mar '13

皆様金子守さん（筑波大社会工学系）の依頼で代理投稿します。よろしくお願いします。 ---------------------------------------------------------- 　　　　　　　　　　　認識論理とゲーム理論研究会日時：　2013年3月8日（金）―　9日（土）場所：筑波大　第3エリア　F棟12階1222室 TXつくば駅から筑波大循環（左回り・右回り、可）に乗り、第3エリア下車。前の12階建の建物12階 (連絡先：筑波大社会工学系　金子守　kaneko(a)sk.tsukuba.ac.jp) 発表・議論の方針：小さな（開かれた）研究会で議論のための場です。一人の持ち時間は1時間ですが、発表そのものは45分程度で終えると考え、必要なこと・重要なことに絞って準備してください。発表のレジュメを10部ほど用意してください。 3月8日（金）午後1：２0−2：２0：矢田部俊介：構成的素朴集合論と無限 2：３０−3：３０佐野勝彦：Dynamic Epistemic Logic for Channel-Based Agent Communication 　 4：00−5：00 金子守：Small Infinitary Epistemic Logics and Some Fixed-Point Logicｓ（with T.-W. Hu ＆N.-Y. Suzuki）懇親会：６：３０−８：３０　（居酒屋大将） 3月9日（土）午前９：1０−１０：1０　田中義人：Common Knowledge logicのクリプキ完全性 10：20―１１：20 本浦庄太：On the semantic meaning of reduction axioms in public announcement logic 11：40−12：40 鈴木信行：述語論理でのPrediction/Decision Criteriaの予備的考察

1 0

日本数学会キャリアパスセミナーのご案内
by Masahiro Kumabe 01 Mar '13

01 Mar '13

こんにちは。日本数学会、数学基礎論及び歴史分科会の評議委員の隈部です。数学会より、日本数学会キャリアパスセミナーの案内を、分科会メーリングリストにて周知するよう依頼がありましたので、以下にご案内します。 %%%%%%%%%%%%%（以下は案内文）%%%%%%%%%**%%%%%%%%%%%%%%%%%%%%%%%%% 日本数学会会員の皆様日本数学会キャリアパスセミナーへのご参加のお願い日本数学会年会でのキャリアパスセミナー開催については、皆様に何度かご連絡をさせていただきましたが、再度お願いをさせていただきたく、ここにご案内申し上げます。今回は、前回を上回る21社の企業がご参加いただけます。**情報系、金融系、開発メーカー、**出版等多彩な企業に参加をお願いしております。参加される企業は、いずれも博士課程修了者を含めて、**数理系の専門を修めた学生、**若手研究者を受け入れる意思を十分持った企業です。このような企業と連携して、数学の需要を深めるためにもぜひ、**学会会員の方々、学生の方々に多数ご参加いただきたいと考えております。学生の方々が、数学のニーズを理解していただくことと同時に、**学会会員の方々に、直接このような企業とお話をしていただき、企業との結びつきを作っていただきたいということが大きな目的となってい**ます。学生の方々への推奨とともに、学会員の皆様にもおいでいただけることを切にお願いいたします。また、**関係各所へのご周知もお願いできれば幸いです。日時３月２０日（水）１３：００−１７：００場所京都大学百周年記念時計台記念館国際交流ホール I,II 以上日本数学会数学振興WG （前田吉昭） %%%%%%%%%%%%%%%（以上）%%%%%%%%%%%**%%%%%%%%%%%%%% よろしくお願い致します。隈部

1 0

CALCO 2013: Deadline Extension
by Ichiro Hasuo 26 Feb '13

26 Feb '13

みなさま，以前お知らせした国際会議 CALCO の締め切りが一週間延びました．まだ間に合います！のでどうか投稿をご検討ください．蓮尾一郎 http://www-mmm.is.s.u-tokyo.ac.jp/~ichiro/ ======================== [Apologies for multiple copies] *** -------------------- DEADLINE EXTENSION ------------------------- *** To allow for some delays in submission of papers to CALCO 2013, the deadline has been moved by one week. See the new dates in the call for papers below and at the CALCO'13 web page http://coalg.org/calco13/ ========================================================================= CALL FOR PAPERS: CALCO 2013 5th International Conference on Algebra and Coalgebra in Computer Science September 3 - 6, 2013 Warsaw, Poland http://coalg.org/calco13/ ========================================================================= Abstract submission: March 1, 2013 Paper submission: March 8, 2013 Author notification: May 6, 2013 Final version due: June 3, 2013 ========================================================================= -- SCOPE -- CALCO aims to bring together researchers and practitioners with interests in foundational aspects, and both traditional and emerging uses of algebra and coalgebra in computer science. It is a high-level, bi-annual conference formed by joining the forces and reputations of CMCS (the International Workshop on Coalgebraic Methods in Computer Science), and WADT (the Workshop on Algebraic Development Techniques). Previous CALCO editions took place in Swansea (Wales, 2005), Bergen (Norway, 2007), Udine (Italy, 2009) and Winchester (UK, 2011). The fifth edition will be held in Warsaw, the capital of Poland. -- INVITED SPEAKERS -- Andrej Bauer - University of Lubljana, Sl Mikołaj Bojańczyk - Warsaw University, PL Neil Ghani - University of Strathclyde, UK Damien Pous - CNRS, ENS-Lyon, F -- TOPICS OF INTEREST -- We invite submissions of technical papers that report results of theoretical work on the mathematics of algebras and coalgebras, the way these results can support methods and techniques for software development, as well as experience with the transfer of the resulting technologies into industrial practice. We encourage submissions in topics included or related to those listed below. * Abstract models and logics - Automata and languages - Categorical semantics - Modal logics - Relational systems - Graph transformation - Term rewriting - Adhesive categories * Specialised models and calculi - Hybrid, probabilistic, and timed systems - Calculi and models of concurrent, distributed, mobile, and context-aware computing - General systems theory and computational models (chemical, biological, etc.) * Algebraic and coalgebraic semantics - Abstract data types - Inductive and coinductive methods - Re-engineering techniques (program transformation) - Semantics of conceptual modelling methods and techniques - Semantics of programming languages * System specification and verification - Algebraic and coalgebraic specification - Formal testing and quality assurance - Validation and verification - Generative programming and model-driven development - Models, correctness and (re)configuration of hardware/middleware/architectures, - Process algebra -- NEW TOPICS -- This edition of CALCO will feature two new topics, and submission of papers on these topics is especially encouraged. * Corecursion in Programming Languages - Corecursion in logic / constraint / functional / answer set programming - Corecursive type inference - Coinductive methods for proving program properties - Implementing corecursion - Applications * Algebra and Coalgebra in quantum computing - Categorical semantics for quantum computing - Quantum calculi and programming languages - Foundational structures for quantum computing - Applications of quantum algebra -- SUBMISSION GUIDELINES -- Prospective authors are invited to submit full papers in English presenting original research. Submitted papers must be unpublished and not submitted for publication elsewhere. Experience papers are welcome, but they must clearly present general lessons learned that would be of interest and benefit to a broad audience of both researchers and practitioners. As with previous editions, the proceedings will be published in the Springer LNCS series. Final papers should be no more than 15 pages long in the format specified by Springer (see http://www.springer.de/comp/lncs/authors.html). It is recommended that submissions adhere to that format and length. Submissions that are clearly too long may be rejected immediately. Proofs omitted due to space limitations may be included in a clearly marked appendix. Both an abstract and the full paper must be submitted by their respective submission deadlines. A special issue of the open access journal Logical Methods in Computer Science (http://www.lmcs-online.org), containing extended versions of selected papers, is also being planned. Submissions will be handled via EasyChair https://www.easychair.org/conferences/?conf=calco2013 -- BEST PAPER AND BEST PRESENTATION AWARDS -- For the first time, this edition of CALCO will feature two kinds of awards: a best paper award whose recipients will be selected by the PC before the conference and a best presentation award, elected by the participants. -- IMPORTANT DATES -- Abstract submission: February 22, 2013 Paper submission: March 1, 2013 Author notification: May 6, 2013 Final version due: June 3, 2013 -- PROGRAMME COMMITTEE -- Luca Aceto - Reykjavik University, Iceland Jiří Adámek - TU Braunschweig, D Lars Birkedal - IT University of Copenhagen, DK Filippo Bonchi - CNRS, ENS-Lyon, F Corina Cirstea - University of Southhampton, UK Bob Coecke - University of Oxford, UK Andrea Corradini - University of Pisa, I Mai Gehrke - Université Paris Diderot - Paris 7, F H. Peter Gumm - Philipps University Marburg, D Gopal Gupta - University of Texas at Dallas, USA Ichiro Hasuo - Tokyo University, Japan Reiko Heckel - University of Leicester, UK (cochair) Bart Jacobs - Radboud University Nijmegen, NL Ekaterina Komendantskaya - University of Dundee, Scotland, UK Barbara König - University of Duisburg-Essen, D José Meseguer - University of Illinois, Urbana-Champaign, USA Marino Miculan - University of Udine, I Stefan Milius - Friedrich-Alexander Universität Erlangen-Nürnberg, D (cochair) Larry Moss - Indiana University, Bloomington, USA Till Mossakowski - DFKI Lab Bremen and University of Bremen, D Prakash Panangaden - McGill University, Montreal, Canada Dirk Pattinson - Australian National University, AUS Dusko Pavlovic - Royal Holloway, University of London, UK Daniela Petrisan - University of Leicester, UK John Power - University of Bath, UK Jan Rutten - CWI Amsterdam and Radboud University Nijmegen, NL Lutz Schröder - Friedrich-Alexander Universität Erlangen-Nürnberg, D Monika Seisenberger - Swansea University, UK Sam Staton - University of Cambridge, UK Alexandra Silva - Radboud University Nijmegen and CWI Amsterdam, NL Pawel Sobocinski - University of Southampton, UK Yde Venema - University of Amsterdam, NL Uwe Wolter - University of Bergen, NO -- ORGANISING COMMITTEE -- Bartek Klin (University of Warsaw, Poland) Andrzej Tarlecki (University of Warsaw, Poland) -- LOCATION -- Warsaw, the capital of Poland, is a lively city with many historic monuments and sights, but also with a thriving business district. It is easily accessible via two airports: the main Chopin Airport, used by most international carriers, and the recently open Warsaw Modlin Airport (30 minutes away by rail), used by budget airlines. -- SATELLITE WORKSHOPS -- CALCO 2013 will be preceded by the CALCO Early Ideas Workshop, chaired by Monika Seisenberger (Swansea University). The workshop is dedicated to presentation of work in progress and original research proposals. PhD students and young researchers are particularly encouraged to contribute. Attendance at the workshop is open to all - it is anticipated that many CALCO conference participants will want to attend the CALCO Early Ideas workshop (and vice versa). A workshop dedicated to tools based on algebraic and/or coalgebraic principles, CALCO Tools, will be held alongside the main conference, chaired by Lutz Schröder (Friedrich Alexander Universität Erlangen-Nürnberg). Papers of this workshop will be included in the CALCO proceedings. -- CALCO Early Ideas Overview -- The CALCO Early Ideas Workshop invites submissions on the same topics as the CALCO conference: reporting results of theoretical work on the mathematics of algebras and coalgebras, the way these results can support methods and techniques for software development, as well as experience with the transfer of the resulting technologies into industrial practice. The list of topics of particular interest is shown on the main CALCO 2013 page. CALCO Early Ideas presentations will be selected according to originality, significance, and general interest, on the basis of submitted 2-page short contributions. It can be work in progress, a summary of work submitted to a conference or workshop elsewhere, or work that in some other way might be interesting to the CALCO audience. A booklet with the accepted short contributions will be available at the workshop. Submissions will be handled via EasyChair https://www.easychair.org/conferences/?conf=calcoearlyideas2013 The use of LNCS style is strongly encouraged. After the workshop, authors will have the opportunity to submit a full 10-15 page paper on the same topic. The reviewing will be carried out by the CALCO Early Ideas PC, with the support of the CALCO PC. The volume of selected papers will be available online. Authors will retain copyright, and are also encouraged to disseminate the results by subsequent publication elsewhere. http://coalg.org/calco13/workshops.html#ei -- CALCO Early Ideas Dates -- 2-page short contribution submission: May 27, 2013 Notification for short contribution: June 24, 2013 Final short contribution due: July 15, 2013 CALCO Early Idead Workshop: September 2, 2013 10-15 page paper submission: October 15, 2013 Notification for paper: December 15, 2013 Final paper version due: January 15, 2014 -- CALCO Early Ideas Program Committee -- Bartek Klin, University of Warsaw, Poland John Power, University of Bath, UK Monika Seisenberger, Swansea University, UK (chair) -- CALCO-Tools Overview -- CALCO-Tools will take place on the same dates as the main CALCO conference, with no overlap between the technical programmes of the two events. Topics of interest include systems, prototypes, and tools developed specifically for the design, checking, execution, and verification of (co)algebraic specifications, but also tools targeting different application domains while making core or interesting use of (co)algebraic techniques. Tool submissions should not exceed 5 pages in LNCS format. The accepted tool papers will be included in the final proceedings of the conference. The tools should be made available on the web at the time of submission. Each submission will be evaluated by at least three reviewers; one or more of the reviewers will be asked to download and use the tool. At least one of the authors of each tool paper must attend the conference to demo the tool. http://coalg.org/calco13/workshops.html#tools -- CALCO-Tools Dates -- Paper submission: April 8, 2013 Author notification: May 6, 2013 Final version due: June 3, 2013 -- CALCO-Tools Programme Committee -- Einar Broch Johnsen, University of Oslo, Norway Mark Hills, CWI Amsterdam, The Netherlands Barbara König, University of Duisburg-Essen, Germany Dorel Lucanu, Alexandru Ioan Cuza University, Romania Dominik Luecke, CWI Amsterdam, The Netherlands Till Mossakowski, DFKI, Germany Lutz Schröder, Friedrich-Alexander Universität Erlangen-Nürnberg, Germany (chair) Alexandra Silva, Radboud University Nijmegen and CWI Amsterdam, The Netherlands -- FURTHER INFORMATION -- Queries related to submission, reviewing, and programme should be sent to the relevant conference or workshop chairs. Queries related to the organisation should be emailed to calco2013(a)mimuw.edu.pl .

1 0

３月の数学会年会について（重要）
by Masahiro Kumabe 25 Feb '13

25 Feb '13

皆様こんにちは。日本数学会の数学基礎論及び歴史分科会の連絡評議委員の隈部です。日本数学会より以下の連絡を受けたので、皆様にお知らせします。ーこれよりー会員の皆様２０１３年度分科会まで１ヶ月を切りました。今回の大会から下記の分科会と特別セッションがアブストラクト集を事前および大会当日に公開します。そのためにwebページ http://mathsoc.jp/meeting/kyoto13mar/abstract.html を用意しましたので、関係のある分科会が公開する場合は是非ご覧ください。今回の大会では函数論分科会が大会当日のアブストラクト販売を中止しますので、必要な方は事前にダウンロードをして下さいますようお願いいたします。オンラインシステム担当理事戸瀬信之ーここまでー以前にもこのメールでお知らせしましたが、当分科会では学会当日は、アブストラクトの冊子は部数を少なくして販売致しますので、会員の皆様は必ず、ホームページよりダウンロードして参加していただきますよう重ねてお願い致します。以上、よろしくお願いします。隈部

1 0

Workshop on constructivism
by Mariko Yasugi 24 Feb '13

24 Feb '13

Forwarded by Mariko Yasugi <yasugi(a)cc.kyoto-su.ac.jp> ----------------------- Original Message ----------------------- From: Yuichi Amitani <yuiami(a)gmail.com> To: Mariko Yasugi <yasugi(a)cc.kyoto-su.ac.jp> Cc: CAPE <CAPE(a)bun.kyoto-u.ac.jp> Date: Sat, 23 Feb 2013 21:09:37 +0900 Subject: Re: Sam Sandersの講演について伺い ---- -------------------------------- CAPE ワークショップ：An International Workshop on Constructivism 日時：2013年３月１日（金）午後２時〜６時場所：京都大学総合研究2号館第9講義室 http://www.kyoto-u.ac.jp/en/access/campus/main.htm （34番の建物です） CAPE International Workshop on Constructivism Date: March 1st (Fri.) 2013, 14:00-18:00 Place: 9th Lecture Room, General Research Building #2 (Sougoukenkyu 2 Goukan ), Kyoto University (No. 34 in the map below: http://www.kyoto-u.ac.jp/en/access/campus/main.htm ) Program (Each slot will have 45 minutes for a talk and 15 minutes for a Q&A session except for general discussion) 2:00-3:00 Yuta Takahashi　(Keio University): On Philosophical Significance of Gentzen's Finitism 3:00-3:10 Break 3:10-4:10 Ryota Akiyoshi (Kyoto University): Brouwer's Proof of the Bar Induction Revisited 4:10-4:20 Break 4:20-5:20 Sam Sanders (The University of Ghent): Nonstandard Analysis: a New Way to Compute 5:20-6:00 General Discussion Abstracts Yuta Takahashi　(Keio University): On Philosophical Significance of Gentzen's Finitism In the 1920s Hilbert proposed the finitary standpoint, on which he aimed to carry out Hilbert's Program. To formulate his finitary standpoint, he attempted to find the fundamental concepts in mathematics. Gentzen's finitism also made this attempt, though he had to extend Hilbert's standpoint due to G\"{o}del's incompleteness theorems. Particularly, in the 1935 consistency proof of $PA$ Gentzen included intuitionistic concepts such as the concept of choice sequences among the fundamental concepts. From philosophical point of view, their formulations of the fundamental concepts in mathematics are of remarkable importance. In this talk, we claim that by admitting choice sequences Gentzen extended the finitist conception of potential infinity. The concept of infinitely proceeding sequences generated by some calculation-rules is a typical infinite concept which can be found in Hilbert's finitary standpoint. However, Gentzen's finitism admits the infinitely proceeding sequences generated by free choices as well as ones generated by some rules. We conclude that in this respect he extended the concept of potential infinity which belongs to the finitist foundations of mathematics and this extension made his conception of potential infinity similar to intuitionists' one. Ryota Akiyoshi (Kyoto University): Brouwer's Proof of the Bar Induction Revisited In a series of papers, Brouwer had developed intuitionistic analysis, especially the theory of choice sequence. An important theorem called the ``fan theorem" is used in the development of intuitionistic analysis. The fan theorem was derived from another stronger theorem called the ``bar induction". Brouwer's argument for a justification of the bar induction contains a controversial assumption on canonical proofs of some formula. Constructive mathematicians have assumed the bar induction as axiom, hence the assumption has not been examined by them. On the other hand, Sundholm and van Atten claimed that the assumption should be regarded as transcendental one in the sense of Kant. They, however, did not give an explanation of why Brouwer needed such a problematic assumption. In this talk, we sketch a novel analysis of Brouwer's argument via infinitary proof theory. In particular, we point out that there is a close similarity between Brouwer's argument and Buchholz' the method of the $\Omega$-rule. By comparing these two arguments, we give a natural explanation of why Brouwer needed the assumption. If time is permitting, we list some open questions and problems. Sam Sanders (The University of Ghent) : Nonstandard Analysis: a New Way to Compute The system ERNA is a version of Nonstandard Analysis based on $I \Delta_0+EXP$. Recently, it was shown that many of the equivalences of $WKL_0$ over $RCA_0$ from Reverse Mathematics can be `pushed down' into ERNA's language, while preserving the equivalences, but at the price of replacing equality `=` by `$\approx$', i.e. equality up to infinitesimals from Nonstandard Analysis. We overview these results concerning ERNA and provide a possible explanation for the above similarity/robustness. In particular, we introduce `$\Omega$-invariance', a simple and elegant notion from Nonstandard Analysis meant to capture the notion of algorithm and Turing machine. Intuitively, an object is $\Omega$-invariant if it does not depend on the *choice* of infinitesimal used in its definition. We consider results regarding $\Omega$-invariance in classical and (time-permitting) constructive Reverse Mathematics. --------------------- Original Message Ends -------------------- -- mariko <yasugi(a)cc.kyoto-su.ac.jp>

1 0

ラムダ計算と論理の早春セミナー3/12--3/16
by Fujita Kenetsu 23 Feb '13

23 Feb '13

『ラムダ計算と論理の早春セミナー』のご案内日程：2013年3月12日(火) 午後5時から3月16日(土) 正午まで場所：国立大学草津セミナーハウス　　　〒377-1711 群馬県吾妻郡草津町大字草津字白根737 詳細：http://komoriyuichi.web.fc2.com/symposium/KusatsuSeminar2008/2013/ 興味をお持ちのみなさまのご参加をお待ちしております． ----------- 群馬大学　藤田憲悦

1 0

The Asian Mathematical Conference 2013 のご案内
by Masahiro Kumabe 22 Feb '13

22 Feb '13

皆様こんにちは。日本数学会、数学基礎論及び歴史分科会の評議委員の隈部です。数学会理事長より、The Asian Mathematical Conference 2013 の案内を、分科会メーリングリストにて周知するよう依頼がありましたので、以下にご案内します。会員各位 The Asian Mathematical Conference 2013 (AMC 2013) は韓国釜山で今年の6月30日（日）から7月4日（木）**の日程で開催されます。詳しくは「数学通信」**2月号に掲載されます元KMS会長でAMC2013の組織委員長**であるKimDohan 先生による情報提供や会議のwebページ http://www.kms.or.kr/amc2013/ をご覧ください。**日本数学会においてもこの会議の成功のために今後様々な支援を行**うことを予定しております。さて、**この会議の講演申し込みおよびポスターセッションの申し込みが3**月11日と迫っておりますので、会員の皆様にはご注意をお願いします。また、**この情報を会員間で共有ください。 http://www.kms.or.kr/amc2013/**sub/sub06.html<http://www.kms.or.kr/amc2013/sub/sub06.html> 一般社団法人日本数学会理事長宮岡洋一以上、よろしくお願い致します。隈部

1 0

CFP: Ninth Panhellenic Logic Symposium
by Nikolaos S. Papaspyrou 19 Feb '13

19 Feb '13

[My apologies for cross posting...] ====================================================================== PLS9: Ninth Panhellenic Logic Symposium July 15-19, 2013 National Technical University of Athens, Greece http://pls9.cs.ntua.gr/ ====================================================================== IMPORTANT DATES Deadline for submission: Friday, April 26, 2013 Notification: Wednesday, May 15, 2013 Final copy due: Wednesday June 5, 2013 ====================================================================== FIRST CALL FOR PAPERS Original papers that fall within the scope of the symposium are solicited. Prospective speakers of twenty-five-minute presentations are invited to submit a paper, in English, not exceeding six pages, by Friday, April 26, 2013. Papers should be prepared using the EasyChair class style (available from http://www.easychair.org/coolnews.cgi) and submitted electronically, using the Easy Chair conference system, at https://www.easychair.org/conferences/?conf=pls9. If possible, each submitted paper should be classified in one of the following areas (in alphabetical order): - Algebraic and Categorical Methods in Logic - Computability Theory - History and Philosophy of Logic - Logic in Computer Science - Model Theory - Nonclassical and Modal Logics - Proof Theory - Set Theory All submitted papers will be reviewed by the scientific committee of the symposium, who will make final decisions on acceptance. During the symposium, each accepted paper will be presented by one of its authors, with five extra minutes for questions. Authors of submitted papers will be notified of the decision by Wednesday, May 15, 2013. Camera-ready papers will be due by Wednesday June 5, 2013 for inclusion in the symposium proceedings which will be distributed to all participants. ====================================================================== SCIENTIFIC COMMITTEE - Costas Dimitracopoulos, University of Athens - Antonis Kakas, University of Cyprus - Lefteris Kirousis, University of Athens - George Koletsos, National Technical University of Athens - Joan Moschovakis, Occidental College and μΠλ∀ - Christos Nomikos, University of Ioannina - Nikolaos Papaspyrou, National Technical University of Athens - Athanasios Pheidas, University of Crete - George Tourlakis, York University, Canada, Chair - Athanassios Tzouvaras, Aristotle University of Thessaloniki - Stathis Zachos, National Technical University of Athens ORGANIZING COMMITTEE - Christos Nomikos, University of Ioannina - Nikolaos Papaspyrou, National Technical University of Athens, Chair - Panos Rondogiannis, University of Athens - Stathis Zachos, National Technical University of Athens -- Nikolaos S. Papaspyrou, Assistant Professor | Tel: +30-210-7723393, fax: 2519 National Technical University of Athens | Home: +30-210-7524801 School of Electrical & Computer Engineering |---------------------------------- Software Engineering Laboratory | E-mail: nickie(a)softlab.ntua.gr 15780 Zografou, Athens, Greece | URL: www.softlab.ntua.gr/~nickie/

1 0

PPL2013のご案内（参加登録:2/18まで）
by Shinya Katsumata 16 Feb '13

16 Feb '13

京都大学の勝股です。先週ご案内したばかりですが、PPL2013の参加登録の締め切り (来週月曜 2/18)が近くなったため、リマインダを兼ねて最終のご案内を御送りいたします。重複して受け取られていた場合はご容赦ください。 ---------- 東北大学の上野です． 3月に福島県会津若松市東山温泉で開催される第15回プログラミングおよびプログラミング言語ワークショップ (PPL2013) につきまして，参加登録を開始いたしましたのでお知らせします．参加登録要領 http://www.pllab.riec.tohoku.ac.jp/ppl2013/registration.html をご参照の上，日本旅行の参加登録受付ページからご登録ください．皆様のご参加をお待ちしております．最新情報は引き続き下記webページにてお知らせします． -------------------------------------------------------------------------- 第15回プログラミングおよびプログラミング言語ワークショップ（PPL2013） http://www.pllab.riec.tohoku.ac.jp/ppl2013/ 主催: 日本ソフトウェア科学会プログラミング論研究会日程: 2013年3月4日(月)〜3月6日(水) 会場: 福島県会津若松東山温泉「御宿東鳳」 http://www.onyado-toho.co.jp/ ====================================================================== 参加申し込み締切： 2013年2月18日（月）参加登録要領 http://www.pllab.riec.tohoku.ac.jp/ppl2013/registration.html をご参照の上，日本旅行の参加登録受付ページからご登録ください．皆様のご参加をお待ちしております． ====================================================================== PPL2013は，プログラミングおよびプログラミング言語に関する研究者が一堂に会し，最新の研究成果の発表，および新たな研究課題についての討論やアイディア交換等を行うことを目的とした，合宿形式のワークショップです．プログラミングおよびプログラミング言語の理論・設計・実装・処理系などに関する研究発表を，カテゴリ別に幅広く募集しています．カテゴリ１: 国内外で未発表の論文の発表カテゴリ２: 国際会議・学術雑誌等で既発表であるが，国内では未発表の研究の紹介カテゴリ３: ポスター・デモ発表（既発表・未発表の別を問いません） ※ショートプレゼンテーションは行いませんカテゴリ１の採択論文の中から，特に独創的なアイディアや顕著な成果を含むものに対して論文賞を授与する予定です．また，ポスター・デモを含む全発表のなかから，聴衆の投票により，最も優秀なプレゼンテーションに発表賞（一般の部，学生の部）を授与する予定です．詳細および最新情報は下記webページをご覧下さい． http://www.pllab.riec.tohoku.ac.jp/ppl2013/ ワークショップ全般に関する問い合わせ先：oc-ppl2013(a)kurims.kyoto-u.ac.jp ====================================================================== 招待講演 ====================================================================== 鍋島英知 (山梨大学) 村主崇行 (京都大学) 以上お二方の招待講演を予定しております． ====================================================================== 運営組織 ====================================================================== プログラム委員会青木利晃 (北陸先端科学技術大学院大学) 青谷知幸 (北陸先端科学技術大学院大学) 天野俊一 (IBM東京基礎研究所) 磯部祥尚 (産業技術総合研究所) 岩見宗弘 (島根大学) 角谷良彦 (東京大学) 勝股審也 (京都大学) [プログラム共同委員長] 小宮常康 (電気通信大学) 権藤克彦 (東京工業大学) [プログラム共同委員長] 田浦健次朗 (東京大学) 高田喜朗 (高知工科大学) 田辺良則 (国立情報学研究所) 中田景子 (Institute of Cybernetics at Tallinn University of Technology) 中野圭介 (電気通信大学) 長谷部浩二 (筑波大学) 番原睦則 (神戸大学) 松崎公紀 (高知工科大学) 実行委員会上野雄大 (東北大学) [実行委員長] 鵜川始陽 (電気通信大学) [実行副委員長] 勝股審也 (京都大学) [プログラム共同委員長] 権藤克彦 (東京工業大学) [プログラム共同委員長] --------------------------------------------------------------------------

1 0

Kobe Colloquium (Feb. 18, 2013)
by fuchino＠diamond.kobe-u.ac.jp 14 Feb '13

14 Feb '13

以下の要領でコロキウムを開催します．日時：2013年2月18日（月）15:10-16:40 場所：神戸大学自然科学総合研究棟3号館4階421室（プレゼンテーション室）講演者：Philip Welch (Univ. of Bristol) タイトル： Determinacy within Second Order Arithmetic Abstract: It was proven by H. Friedman in 1971 that the determinacy of two person perfect information games played on integers at the 5th level of the arithmetic hierarchy (so Sigma^0_5) would require the use of set theoretical axioms such as the Power Set Axiom. (This was improved by Martin to the 4th level.) Strategies for Sigma^0_k games for k =3D 1,2 were located in the Goedel L-hierachy by a folklore result (k=3D1) and Solovay (for k=3D2). We give a theorem on this kind for the last case left in the arithmetical hierarchy provable in analysis, thus for k=3D3. More recently Montalban and Shore have calculated the exact strength of determinacy provable in Second Order Number theory. We give some conjectures and a report on recent work that seeks to lift Montalban-Shore to the corresponding theory that includes a single measurable cardinal. -- best regards Saka\'e Fuchino (渕野昌) ------------------------------------------------------------------------- Kobe University Graduate School of System Informatics Rokko-dai 1-1, Nada, Kobe 657-8501 Japan e-mail: fuchino(a)diamond.kobe-u.ac.jp web page: http://kurt.scitec.kobe-u.ac.jp/~fuchino/ -------------------------------------------------------------------------

1 0

ICE 2013 Call for Papers
by Ichiro Hasuo 13 Feb '13

13 Feb '13

みなさま，国際ワークショップ ICE 2013 のお知らせです． - トピックは concurrency や coordination を軸に，verification, specification など多岐に渡ります．プログラミング言語理論や形式意味論などもスコープに入るはずです．（下をご覧ください） - フィレンツェの DisCoTec 併設です． - review の後，採否決定まで wiki による議論が行われます（レビュアー，著者，PC member 入り乱れて）．どうか投稿をご検討ください．それでは！蓮尾一郎東京大学コンピュータ科学専攻 http://www-mmm.is.s.u-tokyo.ac.jp/~ichiro/ ---------------------------------------------------------------------- [- Apologies for multiple copies -] ICE 2013 6th Interaction and Concurrency Experience June 6, 2013, Florence, Italy http://www.discotec.org/workshops/ice2013/ Satellite workshop of DisCoTec 2013 http://www.discotec.org === Highlights === - Invited talks: Davide Sangiorgi & Damien Pous - Innovative selection procedure - Special issue of Science of Computer Programming (http://www.journals.elsevier.com/science-of-computer-programming/) === Important Dates === 20 March 2013...................Full paper submission 21 March - 21 April 2013........Reviews, rebuttal, and PC discussion 24 April 2013...................Notification to authors 6 June 2013.....................ICE in Florence 15 Sept 2013....................Camera-ready for post-proceedings === Scope === Interaction and Concurrency Experiences (ICEs) is a series of international scientific meetings oriented to theoretical computer science researchers with special interest in models, verification, tools and programming primitives for complex interactions. The general scope of the venue includes theoretical and applied aspects of interactions and the synchronization mechanisms used among components of concurrent/distributed systems, related to several areas of computer science in the broad spectrum ranging from formal specification and analysis to studies inspired by emerging computational models. Topics of interest include, but are not limited to: - Process algebra and coordination: transformation, analysis and implementation - Models for distributed coordination and semantics - Techniques and tools for specification, analysis, verification of resilient interactions - Coinductive techniques for reactive systems - Languages, protocols and mechanisms for sound distributed coordination - Logics and types for interactions - Comparison among different coordination and/or execution models - Expressive power of coordination languages and execution models - Formal semantics of coordination languages - Formal verification of distributed coordinated architectures - Relations between different semantic models for coordination languages === Selection Procedure === Since its 1st edition in 2008, the distinguishing feature of ICE has been an innovative paper selection mechanism based on an interactive discussion amongst authors and PC members. During the review phase, each submitted paper is published on a Wiki and associated with a discussion forum. The discussion forum can be accessed by the authors of the paper and by all the PC members not in conflict with the paper. The forum is used by reviewers to ask questions and clarifications to the authors, allowing them to better explain all the aspects of their paper. The evaluation of the paper will keep into account not only the reviews, but also the outcome of the discussion. As witnessed by the past five editions of ICE, this procedure considerably improves the accuracy of the feedback from reviews, the fairness of the selection, the quality of camera-ready papers, and the discussion during the workshop. === The Public Wiki === After the notification, the accepted papers are published on a public forum, in order to initiate public discussions that will trigger and stimulate the scientific debate at the workshop. We believe that this will drive the workshop discussions and let prospective participants interact with each other much earlier than in more traditional events. === Submission Guidelines === We invite for three types of submissions: (1) Full Papers, (2) Short Papers, and (3) Brief Announcements of already Published Papers. Full and short papers to appear in the post-proceedings must report previously unpublished work and not be simultaneously submitted to other conferences/workshops with refereed proceedings. The ICE 2013 post-proceedings will be published in Electronic Proceedings in Theoretical Computer Science (http://eptcs.org/). In addition, we invite for brief announcements of already published results, should the authors feel like advertising their work and giving a talk. Brief announcements will not be part of the post-proceedings. Submissions must be made electronically in PDF format via EasyChair (http://www.easychair.org/conferences/?conf=ice2013). Full papers should not exceed 15 pages while short papers and brief announcements should not exceed 5 pages with the EPTCS style (http://style.eptcs.org/). Accepted (full and short) papers and brief announcements must be presented at the workshop by one of the authors. === Special Issue === Extended versions of the best full papers selected by the PC will be invited to appear in a special issue of the journal of Science of Computer Programming (http://www.journals.elsevier.com/science-of-computer-programming/ ). Such contributions will be regularly peer-reviewed according to the standard journal policy, but they will be handled in a shorter time than regular submissions. === Program Committee === Luca Aceto (Reykjavik University, Iceland) Simon Bliudze (EPFL, Switzerland) Laura Bocchi (University of Leicester, UK) Filippo Bonchi (CNRS, France) Roberto Bruni (University of Pisa, Italy) Marcello Bonsangue (Leiden University, The Netherlands) Ornela Dardha (University of Bologna/INRIA, Italy) Ichiro Hasuo (University of Tokyo, Japan) Tobias Heindel (CEA Saclay, France) Ludovic Henrio (CNRS, France) Clemens Kupke (University of Oxford, UK) Julien Lange (University of Leicester, UK) Antonia Lopes (University of Lisbon, Portugal) Giuliano Losa (EPFL, Switzerland) Claudio A. Mezzina (FBK Trento, Italy) Matteo Mio (University of Edinburgh, UK) Valentina Monreale (University of Pisa, Italy) Luca Mottola (Politecnico di Milano, Italy) Daniela Petrisan (University of Leicester, UK) Paola Spoletini (University of Insubria, Italy) Emilio Tuosto (University of Leicester, UK) Valerio Senni (IMT Lucca, Italy) Alexandra Silva (Radboud University Nijmegen, The Netherlands) Josef Widder (TU Vienna, Austria) Roberto Zunino (Università degli Studi di Trento and COSBI, Italy) === ICEcreamers === - Marco Carbone (IT University of Copenhagen, Denmark; co-chair) - Ivan Lanese (University of Bologna/INRIA, Italy) - Alberto Lluch Lafuente (IMT Lucca, Italy) - Ana Sokolova (University of Salzburg, Austria; co-chair) === Contact === ice2013(a)easychair.org === Previous editions === The previous five editions of ICE have been held on * July 6th, 2008 in Reykjavik, Iceland, co-located with ICALP'08. The post-proceedings were published in ENTCS (vol.229-3). * August 31st, 2009 in Bologna, Italy, co-located with CONCUR'09. The post-proceedings were published in EPTCS (vol.12) and selected papers appeared in a joint special issue of MSCS (with EXPRESS’09 and SOS’09, Vol. 22, Number 2). * June 10th, 2010 in Amsterdam, The Netherlands, co-located with DisCoTec'10. The post-proceedings were published in EPTCS (vol.38) and selected papers appeared in a joint special issue of SACS (with CAMPUS'10 and CS2BIO'10, Vol. XXI). * June 9th, 2011 in Reykjavik, Iceland, co-located with DisCoTec'11. The post-proceedings were published in EPTCS (vol.59) and selected papers appeared in a special issue of SACS (Vol. XXII). * June 16th, 2012 in Stockholm, Sweden, co-located with DisCoTec'12. The post-proceedings were published in EPTCS (vol.104) and a special issue of SCP is now in preparation.

1 0

Call for papers, 2nd Conf History & Philosophy of Computing, ENS Paris, oct 2013
by Kazushige TERUI 12 Feb '13

12 Feb '13

CALL FOR PAPERS, 2nd International CONFERENCE on the HISTORY AND PHILOSOPHY OF COMPUTING (HaPoC 2013) 28th - 31st October 2013 Ecole Normale Superieure, Paris. with a special session on "Computing and the Arts" at Ecole Nationale Superieure des Arts Decoratifs http://hapoc2013.sciencesconf.org We are happy to announce that the 2nd International Conference on the History and Philosophy of Computing (HaPoC 2013) will take place from the 28th to the 31st of October 2013 at the Ecole Normale Superieure in Paris (France). The birth of the computing and its sciences has often been the topic of philosophical and historical reflection. The HaPoC-conferences have decided to bring together the historical and the philosophical viewpoints. They want to create an environment for a true interdisciplinary convergence around computer science, reenforcing research on the science(s) of computing and its history and stimulating a theoretical dialogue between these domains. To furter this dialogue HaPoC has chosen to have no parallel sessions. Our invited speakers are: Janet Abbate; Bernard Chazelle (tbc); Walter Dean; Nathan Ensmenger; Jean-Yves Girard; Barbara Liskov (tbc); Margit Rosen and Franck Varenne. HaPoC 2013 is the follow-up conference to HaPoC 2011 (Gent, Belgium). Please check out the website of HaPoC 2013 for more information on the conference: http://hapoc2013.sciencesconf.org For HaPoC 2013 we welcome contributions from logicians, philosophers and historians of computing as well as from philosophically aware computer scientists and mathematicians. Topics include but are not limited to: 1. Approaches to the notion of computing a. History and Philosophy of Computability b. History and Philosophy of Computation c. History and Philosophy of Programming d. History and Philosophy of the Computer 2. Applications and uses of Computing a. History and Epistemology of the use of Computing in the sciences b. Computing and the Arts : historical and conceptual issues c. Social, ethical and paedagogical aspects of Computing We cordially invite researchers working in a field relevant to the main topics of the conference to submit a short abstract of approximately 200 words and an extended abstract of at most a 1000 words (references included) to https://www.easychair.org/conferences/?conf=hapoc2 Abstracts must be written in English and anonymized. Please note that the format of uploaded files must be .pdf or .doc. The submission deadline is: April 30th, 2013 Best regards, the organisers, Maarten Bullynck (Paris 8 & SPHERE) Jean-Baptiste Joinet (Lyon 3, IRPhil & Cirphles) ------------------------------------------ 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 YOKOYAMA Keita 09 Feb '13

09 Feb '13

皆様，東京工業大学の横山です．下記の要領でセミナーを行います．どうぞご参加ください．数理論理学セミナー (JSPS-FWO joint research seminar on mathematical logic) 日時：2月15日(金)14:30--18:00 (3講演) 場所：東京工業大学大岡山西８号館W棟11階 W1101セミナー室 14:30--15:30 Sam Sanders (Ghent University, Munich Center for Mathematical Philosophy of LMU) Title: Reuniting the antipodes: bringing together nonstandard analysis and constructive analysis Abstract: Recently, Sanders introduced an interpretation of Errett Bishop’s Constructive Analysis (BISH) inside a particular system of classical Nonstan- dard Analysis called NSA. The role of ‘algorithm’ is played by the notion Ω-invariance; Intuitively, an object is Ω-invariant if it does not depend on the choice of infinitesimal used in its definition. The role of ‘proof’ is played by the Transfer Principle of Nonstandard Analysis as follows: In the same way as the Brouwer-Heyting-Kolmogorov-interpretation is limited to provable formulas, we only consider formulas A such that A ↔ ∗A in NSA, i.e. formulas which ‘satisfy Transfer’. As NSA does not include non-trivial Transfer Principles, only some formulas A satisfy A ↔ ∗A. This interpretation from BISH into Nonstandard Analysis can be called ‘natural’ and ‘faithful’ in the following threefold way: (i) Non-constructive principles (LPO, LLPO, MP, etc.) are interpreted as Transfer Principles which are not available in the system NSA. (ii) The interpretation preserves the equivalences of Constructive Reverse Mathematics. (iii) The interpretation preserves the property that the BISH-notion of algo- rithm is weaker than that of recursive function. We discuss the interpretation from BISH into NSA, and related topics. 15:45--16:45 Tin Lok Wong (Ghent University) Title: Countable numbers in a model of arithmetic: a survey Abstract: A *countable number* in a model M of Peano arithmetic is a number that has countably many predecessors in M. I will survey some results about these countable numbers as an initial segment of the model M. Most of this talk will be accessible to everyone who has some basic knowledge in cardinals and in the Completeness Theorem for first-order logic. 17:00--18:00 Florian Pelupessy (Ghent University) Title: Unprovable theorems. Abstract: We will provide a gentle introduction to some interesting natural theorems which are not provable in Peano Arithmetic. These theorems are natural in the sense that they are similar to ordinary theorems from the mathematics literature. We will discuss two important methods of showing unprovability for these theorems, one using results from proof theory and one from model theory. ------ 問い合わせ先：横山　啓太（東京工業大学） yokoyama.k.ai(a)m.titech.ac.jp 横山啓太 -- Keita Yokoyama yokoyama.k.ai(a)m.titech.ac.jp

1 0

PPL2013 参加募集
by Shinya Katsumata 09 Feb '13

09 Feb '13

京都大学の勝股です。 PPL2013の参加募集案内をお送りいたします。本日参加登録が可能となりました。参加登録の締切(2/18)まであまり時間がないため、もし周りに参加を検討されていらっしゃる方がおられましたら、お声掛けをしていただければ幸いです。＃この案内を重複して受け取られた場合、ご容赦ください。 ---------- 東北大学の上野です． 3月に福島県会津若松市東山温泉で開催される第15回プログラミングおよびプログラミング言語ワークショップ (PPL2013) につきまして，参加登録を開始いたしましたのでお知らせします．参加登録要領 http://www.pllab.riec.tohoku.ac.jp/ppl2013/registration.html をご参照の上，日本旅行の参加登録受付ページからご登録ください．皆様のご参加をお待ちしております．最新情報は引き続き下記webページにてお知らせします． -------------------------------------------------------------------------- 第15回プログラミングおよびプログラミング言語ワークショップ（PPL2013） http://www.pllab.riec.tohoku.ac.jp/ppl2013/ 主催: 日本ソフトウェア科学会プログラミング論研究会日程: 2013年3月4日(月)〜3月6日(水) 会場: 福島県会津若松東山温泉「御宿東鳳」 http://www.onyado-toho.co.jp/ ====================================================================== 参加申し込み締切： 2013年2月18日（月）参加登録要領 http://www.pllab.riec.tohoku.ac.jp/ppl2013/registration.html をご参照の上，日本旅行の参加登録受付ページからご登録ください．皆様のご参加をお待ちしております． ====================================================================== PPL2013は，プログラミングおよびプログラミング言語に関する研究者が一堂に会し，最新の研究成果の発表，および新たな研究課題についての討論やアイディア交換等を行うことを目的とした，合宿形式のワークショップです．プログラミングおよびプログラミング言語の理論・設計・実装・処理系などに関する研究発表を，カテゴリ別に幅広く募集しています．カテゴリ１: 国内外で未発表の論文の発表カテゴリ２: 国際会議・学術雑誌等で既発表であるが，国内では未発表の研究の紹介カテゴリ３: ポスター・デモ発表（既発表・未発表の別を問いません） ※ショートプレゼンテーションは行いませんカテゴリ１の採択論文の中から，特に独創的なアイディアや顕著な成果を含むものに対して論文賞を授与する予定です．また，ポスター・デモを含む全発表のなかから，聴衆の投票により，最も優秀なプレゼンテーションに発表賞（一般の部，学生の部）を授与する予定です．詳細および最新情報は下記webページをご覧下さい． http://www.pllab.riec.tohoku.ac.jp/ppl2013/ ワークショップ全般に関する問い合わせ先：oc-ppl2013(a)kurims.kyoto-u.ac.jp

1 0

Seminar on Thu Feb 21
by Akitoshi Kawamura 08 Feb '13

08 Feb '13

皆様東京大の河村ですお世話になっております新学術領域研究「計算限界解明」（ELC）A01班「数理論理学からの計算限界解析」では 2月21日（木）午後に東大本郷キャンパスで下記の講演会を開催致します詳しくはウェブ頁を御覧下さい http://www-imai.is.s.u-tokyo.ac.jp/~kawamura/elc/seminar_H250221.html 計算理論と数理論理学の両方から多くの皆様の参加をお待ちしております講演会そのものに参加申込は不要ですが懇親会に御参加の場合はウェブ頁よりお早めに申込をお願い致します（締切2/17または定員になるまで） # なお「計算限界解明」のイベントとしましては # 先日垂井先生からも案内のありました # キックオフシンポジウム（3月14〜17日、東京品川）も是非御参加下さい # こちらも参加費は（宴会等を除いて）ありませんが # 登録をお願いしておりますのでお早めにお願い致します -- 河村彰星東京大学大学院情報理工学系研究科コンピュータ科学専攻助教（今井研究室） 03-5841-4097 http://www-imai.is.s.u-tokyo.ac.jp/~kawamura/index_j.html 記 ELC Seminar on February 21, 2013 http://www-imai.is.s.u-tokyo.ac.jp/~kawamura/elc/seminar_H250221.html Speakers * Kazushige Terui (Kyoto University) * Sebastian Müller (Charles University) * Martin Ziegler (TU Darmstadt) Time Thursday 13:45-, February 21, 2013 Place Room 214, Science Building 7 (理学部七号館214室), University of Tokyo ---- 13:50-14:50 Kazushige Terui (Kyoto University) Type Theoretic Approaches to Implicit Computational Complexity Implicit computational complexity (ICC) aims at giving a qualitative accout to various complexity classes. A typical approach to ICC is to consider a computational model (in finite model theory, recursion theory, term rewriting, functional programming, etc.) and propose a　*qualitative* criterion/certificate for a program in the model to be executed within a given time/space bound (e.g. polynomial time). Here we are particularly interested in higher order functional programming languages, which are often modeled by lambda calculus. It is then types that give a criterion/certificate for the resource bound. Because of the Curry-Howard correspondence, it is also linked to constructive logics. Linear logic plays a prominent role in this context. The purpose of this talk is to give a general overview of the type-theoretic approaches to ICC. It will be neither comprehensive nor detailed. I will just review some nice ideas in the past development, and discuss their future possibilities from my very personal (and sometimes critical) point of view. The topics will be chosen from the following list: - safe recursion in higher order - linearity and various modalities - arithmetic systems based on ICC - realizability semantics - denotational semantics - time-space tradeoff in lambda calculus ---- 15:10-16:10 Sebastian Müller (Charles University) Short Refutations of Random 3CNF in TC0-Frege (joint work with Iddo Tzameret) A classical result by Chvatal and Szemeredi states that with high probability, a given random 3CNF is unsatisfiable, if the clause-to-variable ratio is larger than 8 ln(2). On the other hand, on almost all unsatisfiable random 3CNF with a clause-to-variable ratio of less than n^0,5 (where n is the number of variables) Resolution fails to witness that unsatisfiability efficiently (due to Ben-sasson and Wigderson). On the other hand, Feige, Kim and Ofek constructed a witness for unsatisfiability that is polynomial-time constructable and works for random 3CNF with a clause-to-variable ratio above n^0,4. Iddo Tzameret and me formalized this witness in a weak bounded arithmetic theory called VTC^0. I will explain this result and sketch the main steps of the proof and later eloborate on the consequences for propositional proof system. As a direct consequence we receive efficient refutability of such formulas in TC^0-Frege proof systems and, with the above, a separation between such systems and Resolution on a random, dense set. ---- 16:30-17:30 Martin Ziegler (TU Darmstadt) Real Benefit of Promises and Advice (joint work with Ulrike Brandt and Klaus Ambos-Spies) Promises are a standard way to formalize partial algorithms; and advice quantifies nonuniformity. For decision problems, the latter it is captured in common complexity classes such as P/poly, that is, with advice growing in size with that of the input. We advertise constant-size advice and explore its theoretical impact on the complexity of classification problems – a natural generalization of promise problems -- and on real functions and operators. Specifically we exhibit problems that, without any advice, are decidable/computable but of high complexity while, with (each increase in the permitted size of) advice, (gradually) drop down to polynomial-time. ---- 18:00- Dinner (Please register on the webpage if you are coming to the dinner.)

1 0

Prof. Helmut Schwichtenberg Lecture at NII Logic Seminar
by Makoto Tatsuta 08 Feb '13

08 Feb '13

Prof. Helmut Schwichtenberg Lecture at NII Logic Seminar Date: February 21, 2013, 14:00--16:00 Place: National Institute of Informatics, Lecture Room 1208 (12th floor) 場所: 国立情報学研究所 12階 1208室 (半蔵門線,都営地下鉄三田線・新宿線神保町駅または東西線竹橋駅より徒歩5分) (地図 http://www.nii.ac.jp/about/access/) Speaker: Prof. Helmut Schwichtenberg (Ludwig Maximilian University of Munich) Title: Proofs and computations with infinite data Abstract: Ulrich Berger and Monika Seisenberger recently studied extraction from proofs involving (only) abstract reals. They considered a proof using coinduction of the proposition that any two reals in [-1,1] have their average in the same interval, and informally extract a Haskell program working with stream representations of reals. We report on a formalization of this proof, and a machine-extraction of its computational content, in the Minlog proof assistant. This required an extension of this system to also take coinduction into account. The underlying formal system is a theory TCF of computable functionals. It is similar to Heyting arithmetic in all finite types, but with the Scott/Ershov partial continuous functionals as the domain of quantifiers. TCF has free type, predicate and function variables, to allow for abstract developments (groups, fields, real analysis). The underlying inference machinery is minimal logic (implication, universal quantification plus inductively and coinductively defined predicates). Computable functionals (of finite type, with free algebras at ground types) are given by their defining equations. Since the logic is constructive, program extraction by means of a realizability interpretation is possible and a soundness theorem holds. 問合せ先: 龍田真 (国立情報学研究所) e-mail: tatsuta(a)nii.ac.jp http://research.nii.ac.jp/~tatsuta

1 0

Dr. Sam Sanders Lecture at NII Logic Seminar
by Makoto Tatsuta 08 Feb '13

08 Feb '13

Dr. Sam Sanders Lecture at NII Logic Seminar Date: February 13, 2013, 13:30--15:30 Place: National Institute of Informatics, Lecture Room 1904 (19th floor) 場所: 国立情報学研究所 19階 1904室 (半蔵門線,都営地下鉄三田線・新宿線神保町駅または東西線竹橋駅より徒歩5分) (地図 http://www.nii.ac.jp/about/access/) Speaker: Dr. Sam Sanders (University of Ghent) Title: Reuniting the antipodes: Bringing together Nonstandard Analysis and Constructive Analysis Abstract: Constructive Analysis (aka BISH) was introduced by Errett Bishop as a redevelopment of Mathematics with a focus on computational content. As such, BISH is based on the BHK (Brouwer-Heyting-Kolmogorov) interpretation of logic, where the notions of `proof' and `algorithm' are central. Constructive Reverse Mathematics (CRM) is a spin-off from Harvey Friedman's `Reverse Mathematics' program where the base theory is based on BISH. In this talk, we introduce an interpretation of BISH in classical Nonstandard Analysis. The role of `proof' in this interpretation is played by the Transfer Principle of Nonstandard Analysis. The role of `algorithm' is played by `$\Omega$-invariance'. Intuitively, an object is $\Omega$-invariant if it does not depend on the *choice* of infinitesimal used in its definition. Using this new interpretation, we obtain many of the well-known results form CRM. In particular, all non-constructive principles (like LPO, LLPO, MP, etc) are interpreted as Transfer Principles, which are not available in our nonstandard base theory. Finally, the interpretation preserves the property that not all $\Delta_1$-formulas are decidable in BISH. We discuss applications in (Homotopy) Type Theory. 問合せ先: 龍田真 (国立情報学研究所) e-mail: tatsuta(a)nii.ac.jp

1 0

Prof. Yue Yang Lecture at NII Logic Seminar
by Makoto Tatsuta 08 Feb '13

08 Feb '13

Prof. Yue Yang Lecture at NII Logic Seminar Date: February 12, 2013, 14:00--16:00 Place: National Institute of Informatics, Lecture Room 1210 (12th floor) 場所: 国立情報学研究所 12階 1210室 (半蔵門線,都営地下鉄三田線・新宿線神保町駅または東西線竹橋駅より徒歩5分) (地図 http://www.nii.ac.jp/about/access/) Speaker: Prof. Yue Yang (National University of Singapore) Title: The strength of Ramsey Theorem for Pairs Abstract: Ramsey Theorem is a well-known theorem in combinatorics. However, a special weak form of it (Ramsey Theorem for Pairs) has been a hot topic in Recursion Theory and Reverse Mathematics. In this talk I will give a survey on some recent progresses related to combinatoric principles weaker than Ramsey's Theorem for Pairs. In particular, I will speak about some results obtained by Chitat Chong, Ted Slaman and me on the first order and second order arithmetical consequences of Ramsey Theorem for Pairs. 問合せ先: 龍田真 (国立情報学研究所) e-mail: tatsuta(a)nii.ac.jp http://research.nii.ac.jp/~tatsuta

1 0

=?ISO-2022-JP?B?UmU6IEVMQxskQjgmNWY9ODJxIScbKEIzGyRCN24bKEI=?=14( 木） ), 13(水), 17(日)午後午後
by Jun Tarui 06 Feb '13

06 Feb '13

みなさま，１月３０日のメール（このメールの最後にあるもの）でお伝えしましたスケジュールの最新版をみなさまの参考のためお伝えします。主な変更点は、TBAとなっていたいくつかの講演タイトルが決定したことです。参加ご検討くださるようお願いします。垂井 -------------------------------- Mar13(Wed) Satellite Mini-Workshop, Shinagawa venue: Kyoto Univ Shinagawa Office, Shinagawa (in: Intercity Shinagawa Building A, 27th floor) http://www.kyoto-u.ac.jp/ja/tokyo-office http://goo.gl/aCgSE registration not necessary; no participation fee; everybody is welcome organizers: Yoshio Okamoto (UEC), Suguru Tamaki (Kyoto U), Jun Tarui (UEC) each talk will have a 15-min break in the middle 10:30--12:15 David Zuckerman: Randomness Extraction: A Survey 12:15--13:40 lunch (on your own) 13:40--15:25 Ran Raz: Parallel Repetition of Two Prover Games: A Survey 15:25--15:45 break 15:45--17:30 Noam Nisan: Algorithmic Mechanism Design: Multi-unit Auctions 18:00-- impromptu dinner party at Shinagawa ------------------------------- Tokyo Complexity Workshop (Main Workshop): venue: Shinagawa Prince Hotel, Main Tower 8th floor, Room: "Turquoise 8" http://www.al.ics.saitama-u.ac.jp/elc/ws/ http://goo.gl/aCgSE fee for reception/banquet; no fee otherwise; please register in all cases Mar14(Thu) 13:20--13:30 opening 13:30--14:20 Umesh Varirani: Quantum Hamiltonian Complexity: through the computational lens 14:20--14:35 break 14:35--15:25 Rahul Jain: TBA 15:25--15:40 break 15:40--16:30 Pavel Pudlak: Polynomial Hierarchy and Bounded Arithmetic Hierarchy. 16:30--16:45 break 16:45--17:35 Ryan O'Donnell: Approximability and Proof Complexity 18:00--20:00 reception Mar15(Fri) 09:00--09:50 Noam Nisan: Selling Two Objects (in Three Models) 09:50--10:15 break 10:15--11:05 Ketan Mulmuley: The GCT Chasm 11:05--11:30 break 11:30--12:20 Joshua Grochow: Geometric Complexity Theory unifies and generalizes many known lower bounds (an introduction to GCT) 12:20--14:00 lunch (on your own) 14:00--14:50 Shachar Lovett: The probabilistic method - new frontiers 14:50--15:15 break 15:15--16:05 Zeev Dvir: Locally Decodable Codes: recent progress and open problems 16:05--16:30 break 16:30--17:20 Luca Trevisan: Spectral Graph Theory Mar16(Sat) 09:00--09:50 Raghu Meka: Recent Progress in Unconditional Derandomization 09:50--10:15 break 10:15--11:05 David Zuckerman: Pseudorandomness from Shrinkage 11:05--11:30 break 11:30--12:20 Irit Dinur: TBA 12:20--14:00 lunch (lunch on your own) 14:00--14:50 Rocco Servedio: TBA 14:50--15:15 break 15:15--16:05 Pinyan Lu: Complexity Dichotomies of Counting Problems 16:05--16:30 break 16:30--17:20 Ran Raz: Interactive Channel Capacity 18:00--20:00 banquet Mar17(Sun) 09:00--09:50 Valentine Kabanets: Yin and Yang of computing: From circuit lower bounds to compression and SAT algorithms, and back 09:50--10:05 break 10:05--10:55 Eric Allender: Strengthening the Link between Complexity Classes and Kolmogorov Complexity 10:55--11:10 break 11:10--12:00 Yuichi Yoshida: Robust approximation of CSPs: Universal algebra meets optimization -------------------------------- Mar17(Sun) Satellite Mini-Workshop on Geometric Complexity Theory(GCT) venue: 2nd floor meeting room, Campus Innovation Center, Tamachi http://www.cictokyo.jp/access.html http://goo.gl/aCgSE registration not necessary; no participation fee; everybody is welcome organizers: Takeshi Tokuyama (Tohoku U), Susumu Ariki (Osaka U), Jun Tarui (UEC) speakers: Ketan Mulmuley and Joshua Grochow 14:00--18:15 (with 3 breaks) 18:30-- impromptu dinner party at Tamachi ------------------------------- Mar19(Tue) Satellite Mini-Workshp, Kyoto venue: Room 111, RIMS, Kyoto Univ, Kyoto http://www.kurims.kyoto-u.ac.jp/en/access-01.html http://goo.gl/aCgSE registration not necessary; no participation fee; everybody is welcome organizers: Shin-ichi Tanigawa (RIMS), Suguru Tamaki (Kyoto U), Jun Tarui (UEC) 13:15--14:15 Raghu Meka: Beating the Union Bound via Gaussian Geometry 14:15--14:30 break 14:30--15:30 Zeev Dvir: Locally Decodable Codes: recent progress and open problems 15:30--15:45 break 15:45--17:15 Ketan Mulmuley: talk on geometric complexity theory 18:00-- impropmtu dinner party around Sanjo/Shijo-Kawara-machi -------------------------------- Speakers: Eric Allender (Rutgers) www.cs.rutgers.edu/~allender/ Irit Dinur (Weizmann) www.wisdom.weizmann.ac.il/~dinuri/ Zeev Dvir (Princeton) www.cs.princeton.edu/~zdvir/ Josh Grochow (U Toronto) www.cs.toronto.edu/~jgrochow/ Rahul Jain (Nat Univ Singapore) www.comp.nus.edu.sg/~rahul/ Valentine Kabanets (Simon Fraser) www.cs.sfu.ca/~kabanets/ Shachar Lovett (UCSD) https://sites.google.com/site/shacharlovetthomepage/ Pinyan Lu (Microsoft Research Asia and Shanghai Jiao Tong Univ) http://research.microsoft.com/en-us/people/pinyanl/ Raghu Meka (Princeton, IAS) www.math.ias.edu/~raghu/ Ketan Mulmuley (Chicago) www.cs.uchicago.edu/people/mulmuley Noam Nisan (Hebrew U) www.cs.huji.ac.il/~noam/ Ryan O'Donnell (CMU) www.cs.cmu.edu/~odonnell/ Pavel Pudlak (Math Institute of Czech Republic) www.math.cas.cz/~pudlak/ Ran Raz (Weizmann) www.wisdom.weizmann.ac.il/~ranraz/ Rocco Servedio (Columbia) www.cs.columbia.edu/~rocco/ Luca Trevisan (Stanford) http://theory.stanford.edu/~trevisan/ Umesh Vazirani (UC Berkeley) http://www.cs.berkeley.edu/~vazirani/ Yuichi Yoshida (National Institute of Informatics, Tokyo) http://research.nii.ac.jp/~yyoshida/ David Zuckerman (U Texas, Austin) www.cs.utexas.edu/~diz/ At 10:08 13/01/30, Jun Tarui wrote: >みなさま， > >電通大の垂井です． > >計算限界解明プロジェクト http://www.al.ics.saitama-u.ac.jp/elc/ >のキックオフメイン集会とサテライト集会に関して >プログラム作成と企画の主担当をしています． > >まだ調整中の部分もあるのですが，みなさまの参考のために >現時点での予定をお伝えします．ぜひ参加ご検討ください． > > >サテライト集会：参加費なしで登録不要です． >当日夕方に参加希望を現地で尋ねる形の懇親食事会を予定しています． > >メイン集会：参加費はなしですが，一部講演のみ聴講の場合でも >登録をお願いしています．登録締め切りは２月２８日です． > >よろしくお願いします． > >垂井淳 >-------------------------------------------- >Exploring the Limits of Computation (ELC) >Tokyo Complexity Workshop and Satellite Mini-Workshops: >http://www.al.ics.saitama-u.ac.jp/elc/ws/ > > >Mar13(Wed) Satellite Mini-Workshop, Shinagawa > >venue: Kyoto Univ Shinagawa Office, Shinagawa >http://www.kyoto-u.ac.jp/ja/tokyo-office http://goo.gl/aCgSE >registration not necessary; no participation fee; everybody is welcome >organizers: Yoshio Okamoto(UEC), Suguru Tamaki(Kyoto U), Jun Tarui(UEC) > >each talk will have a 15-min break in the middle >10:30--12:15 TBA >12:15--13:40 lunch (on your own) >13:40--15:25 Ran Raz: Parallel Repetition of Two Prover Games: A Survey >15:25--15:45 break >15:45--17:30 Noam Nisan: Algorithmic Mechanism Design: Multi-unit Auctions >18:00-- impromptu dinner party at Shinagawa > > >Mar17(Sun) Satellite Mini-Workshop on Geometric Complexity Theory(GCT) > >venue: 2nd floor meeting room, Campus Innovation Center, Tamachi >http://www.cictokyo.jp/access.html http://goo.gl/aCgSE >registration not necessary; no participation fee; everybody is welcome >organizers: Takeshi Tokuyama(Tohoku U), Susume Ariki(Osaka U), Jun Tarui(UEC) > >speakers: Ketan Mulmuley and Joshua Grochow > >14:00--18:15 (with 3 breaks) >18:30-- impromptu dinner party at Tamachi > > >Mar19(Tue) Satellite Mini-Workshp, Kyoto >venue: Room 111, RIMS, Kyoto Univ, Kyoto >http://www.kurims.kyoto-u.ac.jp/en/access-01.html http://goo.gl/aCgSE >registration not necessary; no participation fee; everybody is welcome >organizers: Shin-ichi Tanigawa(RIMS), Suguru Tamaki(Kyoto U), Jun Tarui(UEC) > >13:15--14:15 Raghu Meka: Beating the Union Bound via Gaussian Geometry >14:15--14:30 break >14:30--15:30 Zeev Dvir: Locally Decodable Codes: recent progress and open problems >15:30--15:45 break >15:45--17:15 Ketan Mulmuley: talk on geometric complexity theory >18:00-- impropmtu dinner party around Sanjo/Shijo-Kawara-machi > > >Tokyo Complexity Workshop (Main Workshop): tentative schedule as of Jan 30th >venue: Shinagawa Prince Hotel, Main Tower 8th floor, Room: "Turquoise 8" >http://www.al.ics.saitama-u.ac.jp/elc/ws/ http://goo.gl/aCgSE >fee for reception/banquet; no fee otherwise; please register in all cases > >Mar14(Thu) >13:20--13:30 opening >13:30--14:20 Umesh Varirani: Quantum Hamiltonian Complexity: > through the computational lens >14:20--14:35 break >14:35--15:25 Rahul Jain: TBA >15:25--15:40 break >15:40--16:30 Pavel Pudlak: Polynomial Hierarchy and Bounded Arithmetic Hierarchy. >16:30--16:45 break >16:45--17:35 Ryan O'Donnell: Approximability and Proof Complexity >18:00--20:00 reception > >Mar15(Fri) >09:00--09:50 Noam Nisan: Selling Two Objects (in Three Models) >09:50--10:15 break >10:15--11:05 Ketan Mulmuley: The GCT Chasm >11:05--11:30 break >11:30--12:20 Joshua Grochow: Geometric Complexity Theory unifies and generalizes > many known lower bounds (an introduction to GCT) >12:20--14:00 lunch >14:00--14:50 Shachar Lovett: The probabilistic method - new frontiers >14:50--15:15 break >15:15--16:05 Zeev Dvir: Locally Decodable Codes: recent progress and open problems >16:05--16:30 break >16:30--17:20 Luca Trevisan: TBA > >Mar16(Sat) >09:00--09:50 Raghu Meka: Recent Progress in Unconditional Derandomization >09:50--10:15 break >10:15--11:05 David Zuckerman: Pseudorandomness from Shrinkage >11:05--11:30 break >11:30--12:20 Irit Dinur: TBA >12:20--14:00 lunch >14:00--14:50 Rocco Servedio: TBA >14:50--15:15 break >15:15--16:05 Pinyan Lu: TBA >16:05--16:30 break >16:30--17:20 Ran Raz: Interactive Channel Capacity >18:00--20:00 banquet > >Mar17(Sun) >09:00--09:50 Valentine Kabanets: Yin and Yang of computing: From circuit lower bounds > to compression and SAT algorithms, and back >09:50--10:05 break >10:05--10:55 Eric Allender: Strengthening the Link between Complexity Classes > and Kolmogorov Complexity >10:55--11:10 break >11:10--12:00 Yuichi Yoshida: Robust approximation of CSPs: > Universal algebra meets optimization > >Speakers: > >Eric Allender (Rutgers) www.cs.rutgers.edu/~allender/ >Irit Dinur (Weizmann) www.wisdom.weizmann.ac.il/~dinuri/ >Zeev Dvir (Princeton) www.cs.princeton.edu/~zdvir/ >Josh Grochow (U Toronto) www.cs.toronto.edu/~jgrochow/ >Rahul Jain (Nat Univ Singapore) www.comp.nus.edu.sg/~rahul/ >Valentine Kabanets (Simon Fraser) www.cs.sfu.ca/~kabanets/ >Shachar Lovett (Princeton, IAS) > https://sites.google.com/site/shacharlovetthomepage/ >Pinyan Lu (Microsoft Research Asia and Shanghai Jiao Tong Univ) > http://research.microsoft.com/en-us/people/pinyanl/ >Raghu Meka (Princeton, IAS) www.math.ias.edu/~raghu/ >Ketan Mulmuley (Chicago) www.cs.uchicago.edu/people/mulmuley >Noam Nisan (Hebrew U) www.cs.huji.ac.il/~noam/ >Ryan O'Donnell (CMU) www.cs.cmu.edu/~odonnell/ >Pavel Pudlak (Math Institute of Czech Republic) > www.math.cas.cz/~pudlak/ >Ran Raz (Weizmann) www.wisdom.weizmann.ac.il/~ranraz/ >Rocco Servedio (Columbia) www.cs.columbia.edu/~rocco/ >Luca Trevisan (Stanford) > http://theory.stanford.edu/~trevisan/ >Umesh Vazirani (UC Berkeley) > http://www.cs.berkeley.edu/~vazirani/ >Yuichi Yoshida (National Institute of Informatics, Tokyo) > http://research.nii.ac.jp/~yyoshida/ >David Zuckerman (U Texas, Austin) www.cs.utexas.edu/~diz/

1 0

仙台ロジックスクール
by Tanaka Kazuyuki 06 Feb '13

06 Feb '13

仙台ロジックスクール SLS2013 （日本ベルギー合同勉強会）すでにご案内申し上げておりますCTFM研究集会(２月１８日〜２１日，東工大) http://sendailogic.math.tohoku.ac.jp/CTFM/ のサテライトとして，仙台にて学生・若手のための勉強会を下記の通り行います。【日程】　２月２２日（金）・２３日（土）9:00 開場【場所】　仙台国際センター　小会議室８【講師】　S. Simpson，Yang Yue，Wu Guohua 　　　　　照井一成，宮部賢志，秋吉亮太（敬称略） ※詳細は，下記ウェブ・ページをご覧ください。 http://sendailogic.math.tohoku.ac.jp/SLS/ 　――――――――――――――――――――――― 参加費は無料ですが，会場準備の都合上，参加される方は事前申し込みをお願いします。【申し込み期限】　2月11日（祝）【申し込み・問い合わせ先】　sendailogic(a)gmail.com 　(担当：朴) 下の申込書をカット＆ペーストして必要事項を記入のうえ，上のアドレス（朴）までお送りください。２２日の夜に懇親会（参加費３千円程度）を予定しておりますので、出欠を併せてお知らせください。 ※　宿泊については，近くのホテルの部屋をいくつかおさえてありますので，必要な方はお問い合わせください。幹事：田中一之，山崎武（東北大学・理学研究科）　――――――――――――――――――――――― 仙台ロジックスクール SLS2013　申込書　お名前　所属・身分　ご連絡先　講演会参加　　22日（　）　23日（　）　懇親会参加　　22日（　）　―――――――――――――――――――――――

1 0

Kobe Colloquium (Feb 6, 2013, Pelupessy)
by Makoto Kikuchi 04 Feb '13

04 Feb '13

Kobe Colloquium on Logic, Statistics and Informatics 以下の要領でコロキウムを開催します。日時：2013年2月6日（水）15:10-16:40 場所：神戸大学自然科学総合研究棟3号館4階421室（プレゼンテーション室）講演者：Florian Pelupessy (Ghent) ======================================================================== 題目：Connecting the provable with the unprovable アブストラクト： Since Gödels famous incompleteness theorems it is well known that there exist theorems which are not provable in Peano Arithmetic. In the last decades of the last century many mathematically interesting examples of such unprovable statements emerged, for example: the Paris-Harrington theorem, the Kanamori-McAloon theorem, Kruskal's tree theorem, Hydra battles and Goodstein sequences. In these theorems it is possible to insert a parameter function, where the resulting theorem variant with constant parameter is provable, but the variant with as parameter the identity function is unprovable. An obvious question in these cases is at which threshold between those functions (ordered by eventual domination) the resulting theorem changes from provable to unprovable: the phase transition for provability of the theorem. We study these phase transitions with the goal of better understanding unprovability. We will be examining the transition results for three Ramsey theorem variants: Friedman's adjacent Ramsey theorem, the Paris-Harrington theorem and the Kanamori-McAloon theorem. For these theorems it is possible to show a deep connection between lower/upper bound estimates for the variants with constant parameter values and the threshold values for the parametrised theorems. This shows an influence of mathematics which is provable at a level slightly stronger than exponential function arithmetic on provabiltiy at the level of Peano Arithmetic. ======================================================================== 交通：阪急六甲駅またはJR六甲道駅から神戸市バス36系統「鶴甲団地」行きに乗車，「神大本部工学部前」停留所下車，徒歩すぐ． http://www.kobe-u.ac.jp/info/access/rokko/rokkodai-dai2.htm 連絡先：菊池誠　mkikuchi(a)kobe-u.ac.jp

1 0

重要なご連絡ーアブストラクトの公開について（訂正）
by Masahiro Kumabe 03 Feb '13

03 Feb '13

皆様複数受け取られた場合はご容赦ください。こんにちは。日本数学会の数学基礎論及び歴史分科会の連絡評議委員の隈部です。先日、学会発表におけるアブストラクトの公開についてのご連絡を、メールにてお知らせしましたが、訂正があります。重要な内容ですので、是非ご一読お願い致します。＊学会における一般講演のアブストラクトについて２０１３年度年会から、数学会として、一般講演のアブストラクトをPDFファイルとして、学会開催前に、数学会のホームペジにて公開することをご連絡しましたが、これは、数学基礎論及び歴史分科会においては、学会会員内だけの公開です。昨年９月の分科会総会でそのように決まっていました。ここにお詫びして訂正致します。申し訳ありませんでした。従いまして、学会会員でない方は、アブストラクトの冊子を学会会場で購入してご覧になれます。以上の件、お間違いのないようにご理解ください。隈部

1 0

【参加申込締切2013年2月4日(月)】CTFM 2013, Tokyo, 18-20, Feb 2013
by Naohi Eguchi 01 Feb '13

01 Feb '13

Logic-ml の皆様，以下の研究会の参加申込締切が迫ってまいりましたのでご案内させていただきます． Computability Theory and Foundations of Mathematics (CTFM 2013) (2013年2月18日(月)～2月20日(水)，東京工業大学大岡山キャンパス) 参加ご希望の方は参加登録ページよりお申込ください． http://sendailogic.math.tohoku.ac.jp/CTFM/registration.html 参加申込締切：2013年2月4日(月) 多くの方々の参加申込をお待ちいたしております．江口直日，Sam Sanders, 田中一之 CTFM(a)math.tohoku.ac.jp ============================================================ Computability Theory and Foundations of Mathematics (Tokyo Institute of Technology, Tokyo, Japan, February 18 - 20, 2013) http://sendailogic.math.tohoku.ac.jp/CTFM/ ============================================================ 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, Constructive Mathematics, Theory of Randomness and Computational Complexity Theory. This is a successor workshop to Workshop on Proof Theory and Computability Theory 2012 - Philosophical Frontiers in Reverse Mathematics (February 20 - 23, 2012, Tokyo, Japan). -------------------------------------------- Deadline of Registration: February 4th, 2013 -------------------------------------------- Invited Speakers: Chi Tat Chong (National University of Singapore) Erik Palmgren (Stockholm University) Michael Rathjen (University of Leeds) Helmut Schwichtenberg (LMU Munich) Stephen G. Simpson (Pennsylvania State University) Yang Yue (National University of Singapore) Wu Guohua (Nanyang Technological University) -------------------------------------------- Programme Committee: Toshiyasu Arai (Chiba) Naohi Eguchi (Tohoku) Hajime Ishihara (JAIST) Ryo Kashima (Tokyo Institute of Technology) Sam Sanders (Ghent) Kazuyuki Tanaka (Tohoku, Co-chair) Andreas Weiermann (Ghent, Co-chair) Takeshi Yamazaki (Tohoku) Keita Yokoyama (Tokyo Institute of Technology) --------------------------------------------

1 0

Eighth NII Type Theory Workshop
by Makoto Tatsuta 01 Feb '13

01 Feb '13

Eighth NII Type Theory Workshop Date: February 6, 2013, 10:40--16:50 Place: National Institute of Informatics, Room 1904 (19th floor) 場所: 国立情報学研究所 19階 1904室 (半蔵門線,都営地下鉄三田線・新宿線神保町駅または東西線竹橋駅より徒歩5分) (地図 http://www.nii.ac.jp/about/access/) Program: 10:40--11:20 Toshihiko Uchida (The Graduate University for Advanced Studies) Title: A Partial Translation from lambda U to lambda 2 11:20--12:00 Daisuke Kimura (National Institute of Informatics) Title: Linear Pure Type Systems 12:00--14:00 Lunch Break 14:00--14:40 Kazuyuki ASADA (National Institute of Informatics) Title: Curry-Howard Correspondence between Dialectica Interpretation and Bidirectional Transformation 14:40--15:20 Makoto Tatsuta (National Institute of Informatics) Title: Dual Calculus with Inductive and Coinductive Types 15:20--15:50 Tea Break 15:50--16:50 Stefano Berardi (Torino University) Title: A Curry-Howard result for various subclassical logics Abstracts: ---------------------------------------------------------------------- Toshihiko Uchida (The Graduate University for Advanced Studies) Title: A Partial Translation from lambda U to lambda 2 Abstract: Girard showed that every type of sort * (i.e., proposition) is inhabited in lambda U. Barendregt state without proof that every type of sort Box (i.e., domain) is also inhabited in the system. In this talk, we show that the second statement is not the case by giving a partial translation from lambda U to lambda 2. ---------------------------------------------------------------------- Daisuke Kimura (National Institute of Informatics) Title: Linear Pure Type Systems Abstract: This talk proposes a linear variant of Pure Type Systems (PTSs), called linear pure type systems (LPTSs). It is a general framework, which provides a uniform way to treat various linear type systems that have the features of linear logic. We first introduce a subframework of LPTSs, called multiplicative linear pure type systems (MLPTSs), in which only variables that linearly occur are abstracted. All MLPTSs are consistent and satisfy strong normalization. However their expressive power is rather weak. We then give LPTSs by extending MLPTSs with exponentials. Each PTS can be embedded into a LPTS. We also show the equivalence of strong normalizability of PTSs and LPTSs by giving mutual translations between them. ---------------------------------------------------------------------- Kazuyuki ASADA (National Institute of Informatics) Title: Curry-Howard Correspondence between Dialectica Interpretation and Bidirectional Transformation Abstract: We give Curry-Howard style correspondence between (propositional logic part of) Dialectica interpretation and bidirectional transformation. Dialectica interpretation was introduced by Godel to show relative consistency of Heyting Arithmetic to System T. Independently, bidirectional transformation arose in database community for automatic view-update problem, and recently have been studied in programming language community to formulate languages for bidirectional transformations. A bidirectional transformation consists of a pair of forward ("usual") transformation and a backward ("inverse") transformation, and we usually assume that they satisfy some standard axioms called GetPut law and PutGet law. We show GetPut law naturally fits the above correspondence to Dialectica interpretation, and this gives a way of extending a language for bidirectional transformations with GetPut law. Then we modify the above scheme for PutGet law and the combination of GetPut and PutGet laws. We also show that Paiva's variant of Dialectica model, GC, corresponds to the category for inverse computation. Then for the result by Paiva that the original Dialectica category is the coKleisli category of some comonad on GC, we give similar result for PutGet law, and we utilize this to investigate further categorical structures of these models. Also we see that a kind of Diller-Nahm variant of Dialectica interpretation corresponds to backward-partial bidirectional transformation. ---------------------------------------------------------------------- Makoto Tatsuta (National Institute of Informatics) Title: Dual Calculus with Inductive and Coinductive Types Abstract: This talk gives an extension of Dual Calculus by introducing inductive types and coinductive types. The same duality as Dual Calculus is shown to hold in the new system, that is, this talk presents its involution for the new system and proves that it preserves both typing and reduction. The duality between inductive types and coinductive types is shown by the existence of the involution that maps an inductive type and a coinductive type to each other. The strong normalization in this system is also proved. First, strong normalization in second-order Dual Calculus is shown by translating it into second-order symmetric lambda calculus. Next, strong normalization in Dual Calculus with inductive and coinductive types is proved by translating it into second-order Dual Calculus. This is a joint work with Daisuke Kimura. ---------------------------------------------------------------------- Stefano Berardi (Torino University) Title: A Curry-Howard result for various subclassical logics Abstract: We introduce games with Sequential Backtracking as a model for various sub-classical logic that have implication as a primitive connective. We define a one-sided version of the logical systems, whose proofs have a tree isomorphism (a kind of ``Curry Howard'' isomorphism) with respect to the winning strategies of the game semantics. We use this correspondence to interpret various classical proofs as learning algorithms. ---------------------------------------------------------------------- 問合せ先　龍田 (tatsuta(a)nii.ac.jp)

1 0

数学基礎論及び歴史分科会からの重要なお知らせ
by Masahiro Kumabe 01 Feb '13

01 Feb '13

皆様複数受け取られた場合はご容赦ください。こんにちは。日本数学会の数学基礎論及び歴史分科会の連絡評議委員の隈部です。学会に関して、以下の通りお知らせします。重要な内容ですので、是非ご一読お願い致します。（１）学会における一般講演のアブストラクトについて２０１３年度年会から、数学会として、一般講演のアブストラクトをPDFファイルとして、学会開催前に、数学会のホームペジにて公開することになりました。公開する時期は、学会が開催される２週間前までには公開する予定でいますが、詳しい内容については、学会のホームページにアクセスして、その都度ご確認ください。なおアブストラクトは、学会の会員外の方もダウンロードできるようにする予定です。これにより、アブストラクトを事前に各個人がプリントアウトし、それを持参して、学会に臨むことができるようになります。（２）（１）の対応に関連して、学会会場にて販売されていたアブストラクトの冊子の販売については、分科会として、以下の通りとすることになりました。アブストラクトの冊子での販売は、上記変更による混乱を避けるため、２０１３年度年会においては、続けます。ただし販売部数が減少することが予想されるため、用意する部数を減らします。アブストラクトの冊子の購入を希望される方は、この点ご了解ください。また出来る限り、事前にアブストラクトをプリントアウトあるいはダンロードして、学会に臨まれることをお願いします。当分科会のアブストラクトは、会員外の方もダウンロードできますので、できるだけそのようにお願いします。アブストラクトの冊子での販売は、赤字が予想されますので、なるべく早い時期に廃止する方向で考えています。そのためにもスムーズな移行ができるよう、ご協力お願いします。（３）２０１３年度年会は京都で行われますが、開催期間の京都のホテルが既に混み合っていると数学会から連絡を受けました。ですから、至急ホテルの予約をしていただきますようお願いいたします。以上です。連絡評議委員隈部正博

1 0

CAPE Truth theory and Logic Workshopのお知らせ
by Shunsuke Yatabe 31 Jan '13

31 Jan '13

みなさま複数受け取られた場合はご容赦ください。 2月13日に京都大学で行われる CAPE Truth theory and Logic Workshop のご案内をご転送させて頂きます。矢田部俊介 ---------- Forwarded message ---------- CAPE Truth theory and Logic Workshopのお知らせ皆様京都大学大学院文学研究科附属応用哲学・倫理学教育研究センター（CAPE）の主催にて、 CAPE Truth theory and Logic Workshopが下記のように開催されます。今回は特別講演として、ブリストル大学のPhilip Welch先生に、チューリングの数学の業績に関する一般向け講演（元々は6'th European Cogress of Mathematics で行われたもの）をお願いしました（1600-1745の最終枠です）。専門家以外の方も、ぜひお越し下さい。京都大学大学院文学研究科附属応用哲学・倫理学教育研究センター http://www.bun.kyoto-u.ac.jp/cape/cape-top_page/ 事務補佐　　竹中利彦〒606-0085 京都市左京区吉田本町　京都大学文学部内 CAPE(a)bun.kyoto-u.ac.jp **************************************************************************************** CAPE Truth theory and Logic Workshop Date: February 13 (Wed) 9:00-17:00, Place: The 8th lecture room, "Research Bldg. No. 2 (Sougou Kenkyu 2-Goukan)" of Kyoto University, No34 of the map in http://www.kyoto-u.ac.jp/en/access/campus/main.htm （京都大学総合研究2号館第8講義室） CAPE Website: http://www.bun.kyoto-u.ac.jp/cape/cape-top_page/ Timetable: 9:00-10:15 Shunsuke Yatabe "Yablo paradox and semantics of coinductive language" 10:30-11:45 Graham E. Leigh "Global reflection and theories of truth" 13:15-14:30 Katsuhiko Sano "What is the corresponding first-order logic to coalgebraic modal logic?" 14:30-15:45 Leon Horsten " One hundred years of semantic paradox" 16:00-17:15 Philip Welch "Alan Turing's Mathematical work" Abstracts: Shunsuke Yatabe (Kyoto University) title: Yablo paradox and semantics of coinductive language Abstract: We generalize the framework of Barwise and Etchmendy's "the liar" to that of coinductive language, and focus on a diﬃculty of constructing semantics. We deﬁne a game theoretic semantics, which can be regarded as a version of Austin semantics. Graham E. Leigh (University of Oxford) title: Global reflection and theories of truth Abstract: This talk explores the relationship between the global reflection principle ("If A is provable, A is true") and its arithmetic cousins ("If A is provable then A"). I will provide a proof-theoretic analysis of a number of axiomatic theories of truth expanded by transfinite hierarchies of reflection principles. Katsuhiko Sano (School of Information Science, Japan Advanced Institute of Science and Technology) title: What is the corresponding first-order logic to coalgebraic modal logic? Abstract: It is well-known that modal logic over Kripke models can be regarded as the bisimulation-invariant fragment of first-order logic, where the notion of bisimulation tells us when given two Kripke models are `similar' with each other. This is called Van Benthem's characterization theorem. The main aim of this talk is to propose a corresponding first-order syntax with Van Benthem-style characterization to coalgebraic modal logic, a uniform framework to cover modal logic over Kripke models, modal logic over neighborhood models, graded modal logic, probabilistic modal logic, etc. This talk focuses on a conceptual background to explain our strategy of finding a corresponding FO syntax for coalgebraic modal logic. A key idea consists in Arthur Prior's early idea of hybrid logic (esp. modal operators for pointed truth) and C. C. Chang's FO syntax for neighborhood models. This talk is based on a joint work with Dirk Pattinson (ANU), Tadeusz Litak (Friedrich-Alexander University of Erlangen and Nuremberg (FAU)), and Lutz Schroeder (FAU). Leon Horsten (University of Bristol) title: One hundred years of semantic paradox Abstract: This article contains an overview of the main problems, themes and theories relating to the semantic paradoxes in the twentieth century. From this historical overview I tentatively draw some lessons about the way in which the field may evolve in the next decade. Philip Welch (University of Bristol) title: Alan Turing's Mathematical work -- このメールは Google グループのグループ「京都現代哲学コロキアム」の登録者に送られています。このグループから退会し、メールの受信を停止するには、kyoto_colloquium+unsubscribe(a)googlegroups.com にメールを送信します。その他のオプションについては、https://groups.google.com/groups/opt_out にアクセスしてください。

1 0

ELC研究集会：3月14(木） ), 13(水), 17(日)午後午後
by Jun Tarui 30 Jan '13

30 Jan '13

みなさま，電通大の垂井です．計算限界解明プロジェクト http://www.al.ics.saitama-u.ac.jp/elc/ のキックオフメイン集会とサテライト集会に関してプログラム作成と企画の主担当をしています．まだ調整中の部分もあるのですが，みなさまの参考のために現時点での予定をお伝えします．ぜひ参加ご検討ください．サテライト集会：参加費なしで登録不要です．当日夕方に参加希望を現地で尋ねる形の懇親食事会を予定しています．メイン集会：参加費はなしですが，一部講演のみ聴講の場合でも登録をお願いしています．登録締め切りは２月２８日です．よろしくお願いします．垂井淳 -------------------------------------------- Exploring the Limits of Computation (ELC) Tokyo Complexity Workshop and Satellite Mini-Workshops: http://www.al.ics.saitama-u.ac.jp/elc/ws/ Mar13(Wed) Satellite Mini-Workshop, Shinagawa venue: Kyoto Univ Shinagawa Office, Shinagawa http://www.kyoto-u.ac.jp/ja/tokyo-office http://goo.gl/aCgSE registration not necessary; no participation fee; everybody is welcome organizers: Yoshio Okamoto(UEC), Suguru Tamaki(Kyoto U), Jun Tarui(UEC) each talk will have a 15-min break in the middle 10:30--12:15 TBA 12:15--13:40 lunch (on your own) 13:40--15:25 Ran Raz: Parallel Repetition of Two Prover Games: A Survey 15:25--15:45 break 15:45--17:30 Noam Nisan: Algorithmic Mechanism Design: Multi-unit Auctions 18:00-- impromptu dinner party at Shinagawa Mar17(Sun) Satellite Mini-Workshop on Geometric Complexity Theory(GCT) venue: 2nd floor meeting room, Campus Innovation Center, Tamachi http://www.cictokyo.jp/access.html http://goo.gl/aCgSE registration not necessary; no participation fee; everybody is welcome organizers: Takeshi Tokuyama(Tohoku U), Susume Ariki(Osaka U), Jun Tarui(UEC) speakers: Ketan Mulmuley and Joshua Grochow 14:00--18:15 (with 3 breaks) 18:30-- impromptu dinner party at Tamachi Mar19(Tue) Satellite Mini-Workshp, Kyoto venue: Room 111, RIMS, Kyoto Univ, Kyoto http://www.kurims.kyoto-u.ac.jp/en/access-01.html http://goo.gl/aCgSE registration not necessary; no participation fee; everybody is welcome organizers: Shin-ichi Tanigawa(RIMS), Suguru Tamaki(Kyoto U), Jun Tarui(UEC) 13:15--14:15 Raghu Meka: Beating the Union Bound via Gaussian Geometry 14:15--14:30 break 14:30--15:30 Zeev Dvir: Locally Decodable Codes: recent progress and open problems 15:30--15:45 break 15:45--17:15 Ketan Mulmuley: talk on geometric complexity theory 18:00-- impropmtu dinner party around Sanjo/Shijo-Kawara-machi Tokyo Complexity Workshop (Main Workshop): tentative schedule as of Jan 30th venue: Shinagawa Prince Hotel, Main Tower 8th floor, Room: "Turquoise 8" http://www.al.ics.saitama-u.ac.jp/elc/ws/ http://goo.gl/aCgSE fee for reception/banquet; no fee otherwise; please register in all cases Mar14(Thu) 13:20--13:30 opening 13:30--14:20 Umesh Varirani: Quantum Hamiltonian Complexity: through the computational lens 14:20--14:35 break 14:35--15:25 Rahul Jain: TBA 15:25--15:40 break 15:40--16:30 Pavel Pudlak: Polynomial Hierarchy and Bounded Arithmetic Hierarchy. 16:30--16:45 break 16:45--17:35 Ryan O'Donnell: Approximability and Proof Complexity 18:00--20:00 reception Mar15(Fri) 09:00--09:50 Noam Nisan: Selling Two Objects (in Three Models) 09:50--10:15 break 10:15--11:05 Ketan Mulmuley: The GCT Chasm 11:05--11:30 break 11:30--12:20 Joshua Grochow: Geometric Complexity Theory unifies and generalizes many known lower bounds (an introduction to GCT) 12:20--14:00 lunch 14:00--14:50 Shachar Lovett: The probabilistic method - new frontiers 14:50--15:15 break 15:15--16:05 Zeev Dvir: Locally Decodable Codes: recent progress and open problems 16:05--16:30 break 16:30--17:20 Luca Trevisan: TBA Mar16(Sat) 09:00--09:50 Raghu Meka: Recent Progress in Unconditional Derandomization 09:50--10:15 break 10:15--11:05 David Zuckerman: Pseudorandomness from Shrinkage 11:05--11:30 break 11:30--12:20 Irit Dinur: TBA 12:20--14:00 lunch 14:00--14:50 Rocco Servedio: TBA 14:50--15:15 break 15:15--16:05 Pinyan Lu: TBA 16:05--16:30 break 16:30--17:20 Ran Raz: Interactive Channel Capacity 18:00--20:00 banquet Mar17(Sun) 09:00--09:50 Valentine Kabanets: Yin and Yang of computing: From circuit lower bounds to compression and SAT algorithms, and back 09:50--10:05 break 10:05--10:55 Eric Allender: Strengthening the Link between Complexity Classes and Kolmogorov Complexity 10:55--11:10 break 11:10--12:00 Yuichi Yoshida: Robust approximation of CSPs: Universal algebra meets optimization Speakers: Eric Allender (Rutgers) www.cs.rutgers.edu/~allender/ Irit Dinur (Weizmann) www.wisdom.weizmann.ac.il/~dinuri/ Zeev Dvir (Princeton) www.cs.princeton.edu/~zdvir/ Josh Grochow (U Toronto) www.cs.toronto.edu/~jgrochow/ Rahul Jain (Nat Univ Singapore) www.comp.nus.edu.sg/~rahul/ Valentine Kabanets (Simon Fraser) www.cs.sfu.ca/~kabanets/ Shachar Lovett (Princeton, IAS) https://sites.google.com/site/shacharlovetthomepage/ Pinyan Lu (Microsoft Research Asia and Shanghai Jiao Tong Univ) http://research.microsoft.com/en-us/people/pinyanl/ Raghu Meka (Princeton, IAS) www.math.ias.edu/~raghu/ Ketan Mulmuley (Chicago) www.cs.uchicago.edu/people/mulmuley Noam Nisan (Hebrew U) www.cs.huji.ac.il/~noam/ Ryan O'Donnell (CMU) www.cs.cmu.edu/~odonnell/ Pavel Pudlak (Math Institute of Czech Republic) www.math.cas.cz/~pudlak/ Ran Raz (Weizmann) www.wisdom.weizmann.ac.il/~ranraz/ Rocco Servedio (Columbia) www.cs.columbia.edu/~rocco/ Luca Trevisan (Stanford) http://theory.stanford.edu/~trevisan/ Umesh Vazirani (UC Berkeley) http://www.cs.berkeley.edu/~vazirani/ Yuichi Yoshida (National Institute of Informatics, Tokyo) http://research.nii.ac.jp/~yyoshida/ David Zuckerman (U Texas, Austin) www.cs.utexas.edu/~diz/

1 0

Logic Zoo Workshop 2013 プログラム (1月31日東京)
by Yoichi Hirai 25 Jan '13

25 Jan '13

みなさま東京大学萩谷研の平井洋一です。先般ご案内のLogic Zooワークショップのプログラムを流します。ご参加お待ちしております。平井洋一 ◆日時と場所 2013年1月31日(木) 10:00〜17:00 東京大学本郷キャンパス化学東館236室(理学部7号館より入る) ◆プログラム 10:00〜11:30 (TBA) ・Kazuyuki Asada (NII) 　Curry-Howard Correspondence between Dialectica Interpretation and Bidirectional Transformation ・Yoshihiko Kakutani (Univ. Tokyo) and/or Daisuke Kimura (NII) 　What is natural numbers in call-by-name lambda-mu? ・Ichiro Hasuo (Univ. Tokyo) 　Nonstandard Static Analysis: Discrete Verification Methodologies Transferred to Hybrid Applications 12:00〜13:00 (TBA) ・Mamoru Kaneko (Univ. Tsukuba) 　Infinite Regresses arising from Prediction/Decision Making in Games (with Tai-Wei Hu) ・Yoichi Hirai (Univ. Tokyo) 　Complexity of Conditinal XPath Containment 14:00〜15:00 (TBA) ・Andrzej Murawski (Univ. Warwick) 　TBA ・Kensuke Kojima (Kyoto University) 　A Hoare logic for SIMT programs 15:30〜17:00 (Yoichi Hirai) ・Shunsuke Yatabe (Kyoto University (AIST)) 　Naive Set Theory and Coinduction ・Masaki Hara (Univ. Tokyo) 　Coqで直観主義命題論理の決定性を証明する (On proving decidability of Intuitionistic Propositional Calculus on Coq) ・Toshiki Takahashi (Free Scientist) 　Botanical Shapes Generated by 3rd Data Structure, "Poker" ◆その他情報 http://logiczoo13.pira.jp/

1 0

証明論と書換えに関するワークショップのご案内
by Nao Hirokawa 23 Jan '13

23 Jan '13

皆様３月４日〜８日に金沢市石川県立美術館で開催されます「第３回証明論と書換えに関するワークショップ」のご案内を致します。このワークショップは証明論と計算論研究者の交流を目的としたインフォーマルワークショップです。参加希望される方は廣川 <pr2013(a)jaist.ac.jp> までご連絡下さい。廣川 ====================================================================== Call for Participants PR 2013 3rd Workshop on Proof Theory and Rewriting 4 (Mon) - 8 (Fri) March, 2013 Kanazawa, Japan http://www.jaist.ac.jp/~hirokawa/pr2013/ ====================================================================== The workshop aims at bringing together researchers in proof theory and rewriting to facilitate the exchange of ideas between these tightly connected fields. The workshop is organised as informal one, and not only presentations about published results but also about work in progress are welcome. We welcome participants from all areas, but due to space restrictions in the venue, we kindly ask to contact Nao Hirokawa <pr2013(a)jaist.ac.jp> beforehand. Previous editions of the workshop were held in Obergurgl (2010) and Obergurgl (2006). SCOPE - proof theory and applications - classical logic, intuitionistic logic, linear logic - term rewriting, higher-order rewriting, graph rewriting - typed/untyped lambda calculi - complexity analysis, implicit computational complexity - decidability, computability - theorem proving ... VENUE Ishikawa Prefectural Museum of Art 2-1 Dewa-machi, Kanazawa, Ishikawa, Japan SPEAKERS Toshiyasu Arai (Chiba University) Martin Avanzini (University of Innsbruck) Matthias Baaz (University of Technology, Vienna) Arnold Beckmann (Swansea University) Josef Berger (University of Greifswald) Frederic Blanqui (INRIA-LIAMA) Guillaume Bonfante (LORIA) Ulrik Buchholtz Ugo Dal Lago (Bologna) Naohi Eguchi (Tohoku University) Nao Hirokawa (JAIST) Dieter Hofbauer (ASW BA Saarland) Martin Hofmann (LMU Muenchen) Jean-Pierre Jouannaud (Ecole Polytechnique) Ulrich Kohlenbach (TU Darmstadt) Gyesik Lee (Hankyong National University) Jean-Yves Marion (LORIA) Aart Middeldorp (University of Innsbruck) Georg Moser (University of Innsbruck) Keisuke Nakano (University of Electro-Communications, Tokyo) Erik Palmgren (Stockholm University) Michel Parigot (CNRS, Paris) Norbert Preining (JAIST) Sam Sanders (Ghent University) Masahiko Sato (Kyoto University) Helmut Schwichtenberg (LMU Muenchen) Christian Sternagel (JAIST) Kazushige Terui (Kyoto University) Toshihiko Uchida (SOKENDAI, Tokyo) Johannes Waldmann (HTWK Leipzig) Gunnar Wilken (OIST) ORGANISING COMMITTEE Nao Hirokawa (JAIST) Hajime Ishihara (JAIST) Georg Moser (University of Innsbruck) Mizuhito Ogawa (JAIST) Norbert Preining (JAIST) Satoshi Tojo (JAIST)

1 0

RTA 2013: Last Call for Papers
by Nao Hirokawa 23 Jan '13

23 Jan '13

皆様 RTA 2013 の論文募集をご案内致します。今回の RTA はオランダ Eindhoven で行われ、TLCA 2013 との共催です。ぜひ投稿をご検討下さい。なお投稿締切は strict deadline となっております。廣川　直 (JAIST) ************************************************************************* RTA 2013: LAST CALL FOR PAPERS 24th International Conference on Rewriting Techniques and Applications June 24 - 26, 2013 Eindhoven, The Netherlands co-located with TLCA 2013 as part of RDP 2013 http://rta2013.few.vu.nl/ ************************************************************************* abstract submission February 1 2013 paper submission February 5 2013 (THIS IS A STRICT DEADLINE !) rebuttal period March 18-21 2013 notification April 4 2013 final version April 26 2013 ************************************************************************* The 24th International Conference on Rewriting Techniques and Applications (RTA 2013) is organized as part of the Federated Conference on Rewriting, Deduction, and Programming (RDP 2013), together with the 11th International Conference on Typed Lambda Calculi and Applications (TLCA 2013), and several workshops. RDP 2013 will be held at the Eindhoven University of Technology in the Netherlands. *** INVITED SPEAKERS *** - Simon Peyton-Jones (Microsoft Research, UK) joint invited speaker for TLCA+RTA 2013 - Jarkko Kari (University of Turku, Finland) invited speaker for RTA 2013 - Mitsu Okada (Keio University, Japan) invited speaker for RTA 2013 *** TOPICS OF INTEREST *** RTA is the major forum for the presentation of research on all aspects of rewriting. Typical areas of interest include (but are not limited to): Applications: case studies; analysis of cryptographic protocols; rule-based (functional and logic) programming; symbolic and algebraic computation; SMT solving; theorem proving; system synthesis and verification; proof checking; reasoning about programming languages and logics; program transformation; XML queries and transformations; systems biology; homotopy theory; implicit computational complexity; Foundations: equational logic; universal algebra; rewriting logic; rewriting models of programs; matching and unification; narrowing; completion techniques; strategies; rewriting calculi; constraint solving; tree automata; termination; complexity; modularity; Frameworks: string, term, and graph rewriting; lambda-calculus and higher-order rewriting; constrained rewriting/deduction; categorical and infinitary rewriting; stochastic rewriting; net rewriting; binding techniques; Petri nets; higher-dimensional rewriting; Implementation: implementation techniques; parallel execution; rewrite and completion tools; certification of rewriting properties; abstract machines; explicit substitutions; automated (non)termination and confluence provers; automated complexity analysis. *** PUBLICATION *** The proceedings will be published by LIPIcs (Leibniz International Proceedings in Informatics). LIPIcs is open access, meaning that publications will be available online and free of charge, and authors keep the copyright for their papers. LIPIcs publications are indexed in DBLP. For more information about LIPIcs please consult: <http://www.dagstuhl.de/en/publications/lipics> Also, authors of selected papers will be invited to submit an extension of their RTA 2013 paper to a special issue of Logical Methods in Computer Science (LMCS) <http://www.lmcs-online.org/index.php>. *** SUBMISSION GUIDELINES *** Submissions must be - original and not submitted for publication elsewhere, - written in English, - a research paper, or a problem set, or a system description, - in pdf prepared with pdflatex using the LIPIcs stylefile: <http://drops.dagstuhl.de/styles/lipics/lipics-authors.tgz>, - at most 10 pages for system description, at most 15 pages for the other two types of submissions - submitted electronically through the EasyChair system at: <https://www.easychair.org/conferences/?conf=rta2013>. The page limit and the deadline for submission are strict. Additional material for instance proof details, may be given in an appendix which is not subject to the page limit. However, submissions must be self-contained within the respective page limit; reading the appendix should not be necessary to assess the merits of a submission. *** PROGRAMME COMMITTEE CHAIR *** Femke van Raamsdonk (VU University Amsterdam, The Netherlands) *** PROGRAMME COMMITTEE *** Eduardo Bonelli National University of Quilmes, Argentina Byron Cook Microsoft Research Cambridge, UK Stephanie Delaune ENS Cachan, France Gilles Dowek Inria Paris-Rocquencourt, France Maribel Fernandez King's College London, UK Nao Hirokawa JAIST Ishikawa, Japan Delia Kesner University Paris-Diderot, France Helene Kirchner Inria Paris-Rocquencourt, France Barbara Koenig University Duisburg Essen, Germany Temur Kutsia Johannes Kepler University Linz, Austria Aart Middeldorp University of Innsbruck, Austria Vincent van Oostrom Utrecht University, The Netherlands Femke van Raamsdonk VU University Amsterdam, The Netherlands Kristoffer Rose IBM Research New York, USA Manfred Schmidt-Schauss Goethe University Frankfurt, Germany Peter Selinger Dalhousie University, Canada Paula Severi University of Leicester, UK Aaron Stump The University of Iowa, USA Tarmo Uustalu Institute of Cybernetics Tallinn, Estonia Roel de Vrijer VU University Amsterdam, The Netherlands Johannes Waldmann HTWK Leipzig, Germany Hans Zantema Eindhoven University of Technology, The Netherlands *** CONFERENCE CHAIR *** Hans Zantema (Eindhoven University of Technology, The Netherlands) *** STEERING COMMITTEE *** Mauricio Ayala-Rincon Brasilia University, Brasilia Frederic Blanqui INRIA Tsinghua University Beijing, China Salvador Lucas Technical University of Valencia, Spain Georg Moser (chair) University of Innsbruck, Austria Masahiko Sakai Nagoya University, Japan Sophie Tison University of Lille, France *** FURTHER INFORMATION *** Questions related to submission, reviewing, and programme should be sent to the programme committee chair Femke van Raamsdonk, email femke at few.vu.nl.

1 0

セミナー案内
by KASHIMA Ryo 21 Jan '13

21 Jan '13

数理論理学セミナーのご案内日時：1月25日(金)15:00から場所：東京工業大学大岡山西８号館W棟11階 W1101セミナー室話者：宮部賢志（京大数解研）題目：一様Kurtzランダムネスに対する独立性定理概要：アルゴリズム的ランダムネスでは，ある2進無限列がランダムかどうかについて，様々な定式化を与える． Martin-L\"ofランダムネスはそのうちの一つで，次のような結果が知られている．「ある列がMLランダムであることと，その列の奇数番目の文字の列AがMLランダムかつ，偶数番目の文字の列が，Aから見てMLランダムであること，が同値となる」この定理はvan Lambalgen's Theoremと呼ばれているが，日本語では独立性定理と呼んでいる．ランダムネスの理論では様々なランダムの概念を考察する．他のランダムの概念に付いては，独立性定理が成り立たないことが知られていたが，筆者は一様相対化の場合は，Schnorrや計算可能ランダムについて，独立性定理が成り立つことを主張した．その後，Demuthランダムネスについても同様の結果が知られている．本発表では，Kurtzランダムネスの一様相対化の場合の独立性定理について報告する． ------ 問い合わせ先：鹿島亮（東京工業大学） kashima(a)is.titech.ac.jp

1 0

European Master's Program in Computational Logic
by Bertram Fronhöfer 18 Jan '13

18 Jan '13

Dear all, I'd like to draw your attention to the fact that fresh Erasmus Mundus scholarships are available for Non-European AND European students who enroll in our European Master's Program in Computational Logic in the fall of 2013. The deadline for application is 31 January, 2013. More details are given below. In particular, I'd like to draw your attention to the fact that we are able to provide grants to EU-students for doing their project at the National ICT of Australia (NICTA). Please spread this information as wide as possible among friends and colleagues, at your old universities and the places, where you currently live and work. Many thanks -- Steffen ******************************************************************************************************* The European Master's Program in Computational Logic We are glad to announce to you the possibility to join our European Master's Program of Computational Logic. This program is offered jointly at the Free-University of Bozen-Bolzano in Italy, the Technische Universität Dresden in Germany, the Universidade Nova de Lisboa in Portugal and the Technische Universität Wien in Austria. Within this program you have the choice to study at two /three of the four European universities. In addition, you can do your project work at the National ICT of Australia (NICTA). You will graduate with a MSc in Computer Science and obtain a joint degree. Information on the universities and the program including the application procedure is provided here: http://www.emcl-study.eu/home.html Language of instruction is English. Tuition fees are 3.000 EUR (for non-European students) and 1.000 (for European students) per year. We would like to draw your attention to the ERASMUS-MUNDUS scholarship program. The ERASMUS-MUNDUS consortium offers 2-year scholarships up to 48.000 EUR for non-EU students and up to 23.000 EUR for EU students of our European Master's Program in Computational Logic. More information on the scholarship program is available from: http://www.emcl-study.eu/fileadmin/emcl_booklet_tree/ma_em_grant.html Do not hesitate to contact us if you have any further questions. Kind regards -- Steffen Hölldobler Prof. Dr. Steffen Hoelldobler International Center for Computational Logic Technische Universität Dresden 01062 Dresden, Germany phone: [+49](351)46 33 83 40 fax: [+49](351)46 33 83 42 email: sh(a)iccl.tu-dresden.de

1 0

CfPart: CTFM 2013, Tokyo, 18-20, Feb 2013
by Naohi Eguchi 15 Jan '13

15 Jan '13

研究会のご案内以下の要領で計算可能性，逆数学等に関する研究会を開催いたします． Computability Theory and Foundations of Mathematics (CTFM 2013) (2013年2月18日(月)〜2月20日(水)，東京工業大学大岡山キャンパス) 参加ご希望の方は参加登録ページよりお申込ください． http://sendailogic.math.tohoku.ac.jp/CTFM/registration.html 参加申込締切：2013年2月4日(月) 多くの方々の参加申込をお待ちいたします．江口直日，Sam Sanders, 田中一之 CTFM(a)math.tohoku.ac.jp ============================================================ Computability Theory and Foundations of Mathematics (Tokyo Institute of Technology, Tokyo, Japan, February 18 - 20, 2013) http://sendailogic.math.tohoku.ac.jp/CTFM/ ============================================================ 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, Constructive Mathematics, Theory of Randomness and Computational Complexity Theory. This is a successor workshop to Workshop on Proof Theory and Computability Theory 2012 - Philosophical Frontiers in Reverse Mathematics (February 20 - 23, 2012, Tokyo, Japan). -------------------------------------------- Deadline of Registration: February 4th, 2013 -------------------------------------------- Invited Speakers: Chi Tat Chong (National University of Singapore) Erik Palmgren (Stockholm University) Michael Rathjen (University of Leeds) Helmut Schwichtenberg (LMU Munich) Stephen G. Simpson (Pennsylvania State University) Yang Yue (National University of Singapore) Wu Guohua (Nanyang Technological University) -------------------------------------------- Programme Committee: Toshiyasu Arai (Chiba) Naohi Eguchi (Tohoku) Hajime Ishihara (JAIST) Ryo Kashima (Tokyo Institute of Technology) Sam Sanders (Ghent) Kazuyuki Tanaka (Tohoku, Co-chair) Andreas Weiermann (Ghent, Co-chair) Takeshi Yamazaki (Tohoku) Keita Yokoyama (Tokyo Institute of Technology) --------------------------------------------

1 0

NIIレクチャーシリーズのお知らせ(Randy Goebel)
by Ken Satoh 11 Jan '13

11 Jan '13

NIIレクチャーシリーズのお知らせ国立情報学研究所(NII)では、海外の情報学に関係する著名研究者を招聘し、レクチャーシリーズを行っております。今回は、ＡＩの黎明期からＡＩの研究をされてきたカナダ・アルバータ大学のRandy Goebel先生の連続レクチャーのお知らせです。今回はＡＩ原理をビッグデータに応用する最先端の研究の講演を行っていただきます。講師:Prof. Randy Goebel (department of Computing Science at the University of Alberta, in Edmkonton, Alberta, Canada) 講義名：Do the emerging tools for managing big data fit with the founding principles of Artificial Intelligence? http://www.nii.ac.jp/en/event/list/0212 場所：国立情報学研究所 20階 2010室講義日：2013/2/12, 20, 26, 3/1 時間: 13:30-15:00 出席は無料で、どなたでも参加できます。参加のご検討よろしくお願いします。佐藤　健国立情報学研究所および総研大 ======= NII Lecture Series Title: Do the emerging tools for managing big data fit with the founding principles of Artificial Intelligence? ideas on the integration of the advice taker, structured inference, reasoning with incomplete information, and building multi-scale models from data. Speaker: Prof. Randy Goebel (department of Computing Science at the University of Alberta, in Edmkonton, Alberta, Canada) He is also vice president of the innovates Centre of Research Excellence (iCORE) at Alberta Innovates Technology Futures (AITF), chair of the Alberta Innovates Academy, and principle investigator in the Alberta Innovates Centre for Machine Learning. He received the B.Sc. (Computer Science), M.Sc. (Computing Science), and Ph.D. (Computer Science) from the Universities of Regina, Alberta, and British Columbia, respectively. At AITF, Randy is in charge of reshaping research investments (graduate student scholarships, research chairs, research centres). His research interests include applications of machine learning to systems biology, visualization, and web mining, as well as work on natural language processing, web semantics, and belief revision. Randy has experience working on industrial research projects in crew scheduling, pipeline scheduling, and steel mill scheduling, as well as scheduling and optimization projects for the energy industry in Alberta. Randy has held appointments at the University of Waterloo, University of Tokyo, Multimedia University (Malaysia), Hokkaido University (Sapporo), and has had research collaborations with DFKI (German Research Centre for Artificial Intelligence), NICTA (National ICT Australia), RWC (Real World Computing project, Japan), ICOT (Institute for New Generation Computing, Japan), NII (National Institute for Informatics, Tokyo), and is actively involved in academic and industrial collaborative research projects in Canada, Australia, Europe, and China. Abstract: The modern discipline of computer science has many facets, but what has clearly emerged in the last decade are three themes based on 1) rapidly accumulating volumes of data, 2) inter- and cross-disciplinary application of computer science to all scientific disciplines, and 3) a renewed interest in the semantics of complex information models, spanning a spectrum from semantic web, natural language, to multi-scale systems biology. This series of four lectures will attempt to knit together these three themes, by presenting the ideas that have emerged in their support: the rapid development and extension of machine learning theory and methods to help make sense of accumulating volumes of data, the application of computer science to nearly all scientific disciplines, especially those whose progress now necessarily relies on the management and interpretation of large data, and finally, the revival of a focus on semantics of information models based on data. Outline: Lecture 1: Connecting Advice Taking and Big Data Lecture 2: Structured inference and incomplete information Lecture 3: Natural Language Processing: Compressing Data to Models Lecture 4: Hypothesis Management with Symbols and Pictures Place: Lecture room 2010, 20th floor, National Institute of Informatics Date: 13:30pm-15:00pm, February 12, 20, 26, March 1, 2013 Lecture 1 Connecting Advice Taking and Big Data Tuesday, February 12, 2013, 13:30 - 15:00 A fundamental premise of Artificial Intelligence (AI) is the ability for a computer program to improve its behaviour by taking advice. Incremental accumulation of advice or knowledge has never been easier than today, when the rate of data capture is higher than ever before, and the management of big data and deployment of machine learning are coupled to help manage the transition from data to knowledge. This lecture uses simple technical concepts from nearly sixty years of AI, to identify some of the research challenges of managing big data, and exploiting knowledge emergent from big data. The goal is to find some important research priorities based on the motivation of the Advice Taker, and the current state of big data management and machine learning. Lecture 2 Structured inference and incomplete information Wednesday. February. 20, 13:30 - 15:00 If the foundation of Artificial Intelligence (AI) is the accumulation and use of knowledge, then a necessary stop is the structuring knowledge to be able to make inferences. The organization structures required to facilitate inference now span a broad spectrum of mathematical methods, including everything from simple propositional logic to sophisticated statistical and probabilistic inference. The two foundational components of computational inference are semantics of formal reasoning, and the development of reasoning methods to deal with incomplete information. This lecture reviews the foundational components of semantics and reasoning systems, including the development of goal-oriented reasoning based on abductive reasoning, the connection between logical and probabilistic systems, and especially how the architecture of reasoning systems can provide the basis for managing hypotheses in the face of incomplete information. Lecture 3 Natural Language Processing: Compressing Data to Models Tuesday. February. 26, 13:30 - 15:00 The problem of machine processing of natural language (NLP) has long been a research focus of artificial intelligence. This is partly because the use of natural language is easily conceived as a cognitive task requiring human-like intelligence. It is also because the rational structures for computer interpretation of language require the full suite of computational tools developed over the last hundred years (grammar, dictionaries, logic, parsing, inference, and context management). Most of the recent practical advances in NLP have arisen in the context of simple machine learning applied to large language corpora, to induce fragments of language models that provide the basis for interpretive and generative manipulation of language. These largely statistical models are arisen in what has been called the "pendulum swing" of NLP, in which statistical models have recently dominated those based on structural linguistics. In this lecture, we look at the concept of noisy corpora and their role in language models, including some interesting alternative sources of data for building language models. The applications range from complex language summary to the information extraction from medical, legal, and historical documents. Lecture 4 Hypothesis Management with Symbols and Pictures Friday. March. 1, 13:30 - 15:00 The current suite of Artificial Intelligence (AI) tools has provided a basis for sophisticated human-computer interfaces based on more than typing in language. In fact, one can develop multi-level representations that provide the basis for direct manipulation of visualizations. By constraining the repertoire of direct manipulations, one can enrich human computer interaction so that both humans and machines can understand and exploit visual interaction. This lecture shows how such direction manipulation requires a large repertoire of formal reasoning methods, and provides the sketch of formal framework and the problems arising in its development.

1 0

Cristian S. Calude氏、Elena Calude氏講演会のお知らせ（中央大学研究開発機構）
by Kohtaro Tadaki 11 Jan '13

11 Jan '13

＜重複してお受け取りの方はご容赦ください＞皆様：中央大学の只木と申します。中央大学研究開発機構では、来週19日土曜日、ニュージーランド研究者Cristian S. Calude氏（オークランド大学）およびElena Calude氏（マッセイ大学）をお招きし、下記要領で講演会を開催します。皆様、奮ってご参加下さい。 ---------------------------------- 只木孝太郎 (Kohtaro Tadaki) 中央大学研究開発機構〒112-8551 東京都文京区春日1-13-27 E-mail: tadaki(a)kc.chuo-u.ac.jp WWW: http://www2.odn.ne.jp/tadaki/ ---------------------------------------------------------- Cristian S. Calude氏、Elena Calude氏講演会 ◆日時： 2013年1月19日（土）15時00分〜 17時30分 ◆場所：中央大学後楽園キャンパス 5号館1階 5138号室（下記参照） ◆参加申込：不要 ---------------------------------------------------------- [ 講演内容 ] ◆15時00分〜16時00分講演題目：The complexity of mathematical problems 講演者：Cristian S. Calude (University of Auckland, NZ) and Elena Calude (Massey University, NZ) 講演要旨： Evaluating (or even guessing) the degree of complexity of an open problem, conjecture or mathematically proven statement is not an easy task not only for beginners, but also for the most experienced mathematicians. Is there a (uniform) method to evaluate, in some objective way, the difficulty of a mathematical statement or problem? The question is not trivial because mathematical problems can be so diverse. But, is there any indication that all, or most, or even a large part of mathematical problems have a kind of "commonality" allowing a uniform evaluation of their complexity? How could one compare a problem in number theory with a problem in complex analysis, a problem in algebraic topology or a theorem in dynamical systems? Surprisingly enough, such "commonalities" do exist for many mathematical problems. One of them is based on the possibility of expressing the problem in terms of (very) simple programs reducible to a (natural) question in theoretical computer science, the so-called "halting problem". A more general "commonality" can be discovered using the inductive type of computation, a computation more general the Turing computability. As a consequence, uniform approaches for evaluating the complexity of a large class of mathematical problems/conjectures/statements can be, and have been, developed. This talks reviews current progress and some open problems. ◆16時30分〜17時30分講演題目： The Kochen-Specker theorem and quantum randomness 講演者： Cristian S. Calude (University of Auckland, NZ) 講演要旨： The Kochen-Specker theorem shows the impossibility for a hidden variable theory to consistently assign values to certain (finite) sets of observables in a way that is noncontextual and consistent with quantum mechanics. If we require noncontextuality, the consequence is that many observables must not have pre-existing definite values. However, the Kochen-Specker theorem does not allow one to determine which observables must be value indefinite. In this talk we present an improvement on the Kochen-Specker theorem which allows one to actually locate observables which are provably value indefinite. Various technical and subtle aspects relating to this formal proof and its connection to quantum mechanics are discussed. This result is then utilized for the proposal and certification of a dichotomic quantum random number generator operating in a three-dimensional Hilbert space. ------------------------------------------------------------ 会場への道順： [中央大学後楽園キャンパスへのアクセスガイド] http://www.chuo-u.ac.jp/chuo-u/access/index_j.html http://www.chuo-u.ac.jp/chuo-u/access/access_korakuen_j.html [中央大学後楽園キャンパスマップ] http://www.chuo-u.ac.jp/chuo-u/campusmap/korakuen_j.html ------------------------------------------------------------

1 0

HAS 2013: Deadline Extended
by Ichiro Hasuo 07 Jan '13

07 Jan '13

みなさま，東京大学の蓮尾です．あけましておめでとうございます．以前お知らせした ETAPS 併設ワークショップの HAS，締切が 1/21 に延長になりました．Post-proceeding ですので，論文の preliminary version でも大歓迎，とのことです．ご投稿を検討いただければ幸いです．どうかよろしくお願いいたします．それでは！蓮尾一郎 http://www-mmm.is.s.u-tokyo.ac.jp/~ichiro/ =========================== [Apologies for multiple copies] [Please note: submission deadline extended to January, 12] ************************************************************************************************************ ********* CALL FOR PAPERS Third Workshop on Hybrid Autonomous Systems (HAS 2013) A satellite event of European Joint Conferences on Theory and Practice of Software, ETAPS 2013 March 17, 2013, Rome, Italy http://www2.warwick.ac.uk/fac/sci/maths/people/staff/bujorianu/has2013/ ************************************************************************************************************ ********* SCOPE: The interest on autonomous systems is increasing both in industry and academia. Such systems must operate with limited human intervention in a changing environment and must be able to compensate for significant system failures without external intervention. The hybrid discrete-continuous models constitute appropriate models of autonomous systems . Hybrid systems have behaviours characterised by the interaction between continuous and discrete dynamics and research in the area is driven by several school of thoughts. One approach is mainly focussed on applications to automation systems and the models and methods are centred on the concept of hybrid automaton (deterministic or probabilistic). A distinct school of thought interprets hybrid systems as control systems with regime change. Such systems are highly adaptive and suitable for modelling autonomic behaviours. The most prominent models of this approach are the stochastic hybrid systems and the mixed logical and dynamical systems. There is a clear research opportunity to combine these approaches for developing models, methods, techniques, methodologies, tools and environments for autonomous systems engineering. This workshop brings together researchers interested in all aspects of autonomy and resilience of hybrid systems. TOPICS: Topics include (but are not limited to): Ø new modelling paradigms for autonomous systems; Ø verification and safety certification techniques; Ø modelling, analysis and control of hybrid systems; Ø uncertainty and stochastic modelling; Ø multi-agent systems; Ø algebraic and categorical methods; Ø interaction between hybrid modelling and complexity science; Ø reports on case studies and practical experiments; Ø autonomous systems in natural science (e.g. from biology, ecology, climate). INVITED SPEAKERS: * Maria Domenica di Benedetto, L'Aquila University, IT * Radu Grosu, Vienna University of Technology, AU * Rafael Wisniewski, Aalborg University, DEN SUBMISSIONS: In order to encourage participation and discussion, this workshop solicits the submission of regular papers, which must contain original work, and must not have been previously published, nor be under consideration for publication elsewhere. The accepted submissions should clearly indicate the membership to one of the following categories: - technical contributions; - tutorials on a topic of importance; - surveys on large extent cross-disciplinary research (e.g., project outcomes);wor - reports on early stage or ongoing work. For each category of submission the novelty of the submission has to be clearly stated and the page limit should vary between 6 and 15 pages. All submissions must be in PDF format and use the EPTCS latex style, see http://style.eptcs.org/. Submissions can be made on the following website: https://www.easychair.org/conferences/login_as_yes.cgi?a=3413468 The workshop PC will review all regular paper submissions to select appropriate ones, ones for acceptance in each category, based on their relevance, merit, originality, and technical content. The authors of accepted submissions are expected to present and discuss their work at the workshop. Accepted regular papers will be published in the Electronic Proceedings in Theoretical Computer Science (EPTCS). A special issue in a journal is under consideration. IMPORTANT DATES: Submission (regular paper): *extended* January 12, 2013 Notification: January 24, 2013 Final version (ETAPS proceedings): February 14, 2013 Workshop: March 17, 2013 Final version (EPTCS post proceedings): TBA ORGANIZATION: PC Chairs: * Luca Bortolussi, University of Trieste, IT * Manuela Bujorianu, University of Warwick, UK * Giordano Pola, University of L’Aquila, IT Program Committee: * Ezio Bartocci, TU Wien, AU * Maria Domenica di Benedetto, L'Aquila University, IT * Luca Bortolussi, University of Trieste, IT (co-Chair) * Manuela Bujorianu, University of Warwick, UK (co-Chair) * Alberto Casagrande, Univeristy of Trieste, IT * Thao Dang, Verimag, FR * Louise Dennis, University of Liverpool, UK * Clare Dixon, University of Liverpool, UK * Alexandre Donzé, UC Berkeley, US * Martin Fränzle, Carl von Ossietzky Universität, DE * Ichiro Hasuo, University of Tokio, JP * Agung Julius, Rensselaer Polytechnic Institute, US * Toshimitsu Ushio, Osaka University, JP * Giordano Pola, L'Aquila University, IT (co-Chair) * Rom Langerak, University of Twente, NL * David Parker, University of Birmingham, UK * Guido Sanguinetti, University of Edinburgh, UK * Olaf Stursberg, University of Kassel, DE

1 0

CALCO 2013: Second Call for Papers
by Ichiro Hasuo 04 Jan '13

04 Jan '13

みなさま，こんにちは！東京大学の蓮尾です．国際会議 CALCO 2013 の案内を（再度）お送りします．トピックは代数・余代数・形式検証の理論一般，開催地はポーランド・ワルシャワ，締切は2月末です．どうか投稿をご検討ください．それでは！蓮尾一郎 http://www-mmm.is.s.u-tokyo.ac.jp/ [Apologies for multiple copies] ========================================================================= SECOND CALL FOR PAPERS: CALCO 2013 5th International Conference on Algebra and Coalgebra in Computer Science September 3 - 6, 2013 Warsaw, Poland http://coalg.org/calco13/ ========================================================================= Abstract submission: February 22, 2013 Paper submission: March 1, 2013 Author notification: May 6, 2013 Final version due: June 3, 2013 ========================================================================= -- SCOPE -- CALCO aims to bring together researchers and practitioners with interests in foundational aspects, and both traditional and emerging uses of algebra and coalgebra in computer science. It is a high-level, bi-annual conference formed by joining the forces and reputations of CMCS (the International Workshop on Coalgebraic Methods in Computer Science), and WADT (the Workshop on Algebraic Development Techniques). Previous CALCO editions took place in Swansea (Wales, 2005), Bergen (Norway, 2007), Udine (Italy, 2009) and Winchester (UK, 2011). The fifth edition will be held in Warsaw, the capital of Poland. -- INVITED SPEAKERS -- Andrej Bauer - University of Lubljana, Sl Miko??aj Boja??czyk - Warsaw University, PL Neil Ghani - University of Strathclyde, UK Damien Pous - CNRS, ENS-Lyon, F -- TOPICS OF INTEREST -- We invite submissions of technical papers that report results of theoretical work on the mathematics of algebras and coalgebras, the way these results can support methods and techniques for software development, as well as experience with the transfer of the resulting technologies into industrial practice. We encourage submissions in topics included or related to those listed below. * Abstract models and logics - Automata and languages - Categorical semantics - Modal logics - Relational systems - Graph transformation - Term rewriting - Adhesive categories * Specialised models and calculi - Hybrid, probabilistic, and timed systems - Calculi and models of concurrent, distributed, mobile, and context-aware computing - General systems theory and computational models (chemical, biological, etc.) * Algebraic and coalgebraic semantics - Abstract data types - Inductive and coinductive methods - Re-engineering techniques (program transformation) - Semantics of conceptual modelling methods and techniques - Semantics of programming languages * System specification and verification - Algebraic and coalgebraic specification - Formal testing and quality assurance - Validation and verification - Generative programming and model-driven development - Models, correctness and (re)configuration of hardware/middleware/architectures, - Process algebra -- NEW TOPICS -- This edition of CALCO will feature two new topics, and submission of papers on these topics is especially encouraged. * Corecursion in Programming Languages - Corecursion in logic / constraint / functional / answer set programming - Corecursive type inference - Coinductive methods for proving program properties - Implementing corecursion - Applications * Algebra and Coalgebra in quantum computing - Categorical semantics for quantum computing - Quantum calculi and programming languages - Foundational structures for quantum computing - Applications of quantum algebra -- SUBMISSION GUIDELINES -- Prospective authors are invited to submit full papers in English presenting original research. Submitted papers must be unpublished and not submitted for publication elsewhere. Experience papers are welcome, but they must clearly present general lessons learned that would be of interest and benefit to a broad audience of both researchers and practitioners. As with previous editions, the proceedings will be published in the Springer LNCS series. Final papers should be no more than 15 pages long in the format specified by Springer (see http://www.springer.de/comp/lncs/authors.html). It is recommended that submissions adhere to that format and length. Submissions that are clearly too long may be rejected immediately. Proofs omitted due to space limitations may be included in a clearly marked appendix. Both an abstract and the full paper must be submitted by their respective submission deadlines. A special issue of the open access journal Logical Methods in Computer Science (http://www.lmcs-online.org), containing extended versions of selected papers, is also being planned. Submissions will be handled via EasyChair https://www.easychair.org/conferences/?conf=calco2013 -- BEST PAPER AND BEST PRESENTATION AWARDS -- For the first time, this edition of CALCO will feature two kinds of awards: a best paper award whose recipients will be selected by the PC before the conference and a best presentation award, elected by the participants. -- IMPORTANT DATES -- Abstract submission: February 22, 2013 Paper submission: March 1, 2013 Author notification: May 6, 2013 Final version due: June 3, 2013 -- PROGRAMME COMMITTEE -- Luca Aceto - Reykjavik University, Iceland Ji???? Ad??mek - TU Braunschweig, D Lars Birkedal - IT University of Copenhagen, DK Filippo Bonchi - CNRS, ENS-Lyon, F Corina Cirstea - University of Southhampton, UK Bob Coecke - University of Oxford, UK Andrea Corradini - University of Pisa, I Mai Gehrke - Universit?? Paris Diderot - Paris 7, F H. Peter Gumm - Philipps University Marburg, D Gopal Gupta - University of Texas at Dallas, USA Ichiro Hasuo - Tokyo University, Japan Reiko Heckel - University of Leicester, UK (cochair) Bart Jacobs - Radboud University Nijmegen, NL Ekaterina Komendantskaya - University of Dundee, Scotland, UK Barbara K??nig - University of Duisburg-Essen, D Jos?? Meseguer - University of Illinois, Urbana-Champaign, USA Marino Miculan - University of Udine, I Stefan Milius - Friedrich-Alexander Universit??t Erlangen-N??rnberg, D (cochair) Larry Moss - Indiana University, Bloomington, USA Till Mossakowski - DFKI Lab Bremen and University of Bremen, D Prakash Panangaden - McGill University, Montreal, Canada Dirk Pattinson - Imperial College London, UK Dusko Pavlovic - Royal Holloway, University of London, UK Daniela Petrisan - University of Leicester, UK John Power - University of Bath, UK Jan Rutten - CWI Amsterdam and Radboud University Nijmegen, NL Lutz Schr??der - Friedrich-Alexander Universit??t Erlangen-N??rnberg, D Monika Seisenberger - Swansea University, UK Sam Staton - University of Cambridge, UK Alexandra Silva - Radboud University Nijmegen and CWI Amsterdam, NL Pawel Sobocinski - University of Southampton, UK Yde Venema - University of Amsterdam, NL Uwe Wolter - University of Bergen, NO -- ORGANISING COMMITTEE -- Bartek Klin (University of Warsaw, Poland) Andrzej Tarlecki (University of Warsaw, Poland) -- LOCATION -- Warsaw, the capital of Poland, is a lively city with many historic monuments and sights, but also with a thriving business district. It is easily accessible via two airports: the main Chopin Airport, used by most international carriers, and the recently open Warsaw Modlin Airport (30 minutes away by rail), used by budget airlines. -- SATELLITE WORKSHOPS -- CALCO 2013 will be preceded by the CALCO Early Ideas Workshop, chaired by Monika Seisenberger (Swansea University). The workshop is dedicated to presentation of work in progress and original research proposals. PhD students and young researchers are particularly encouraged to contribute. Attendance at the workshop is open to all - it is anticipated that many CALCO conference participants will want to attend the CALCO Early Ideas workshop (and vice versa). A workshop dedicated to tools based on algebraic and/or coalgebraic principles, CALCO Tools, will be held alongside the main conference, chaired by Lutz Schr??der (Friedrich Alexander Universit??t Erlangen-N??rnberg). Papers of this workshop will be included in the CALCO proceedings. -- CALCO Early Ideas Overview -- The CALCO Early Ideas Workshop invites submissions on the same topics as the CALCO conference: reporting results of theoretical work on the mathematics of algebras and coalgebras, the way these results can support methods and techniques for software development, as well as experience with the transfer of the resulting technologies into industrial practice. The list of topics of particular interest is shown on the main CALCO 2013 page. CALCO Early Ideas presentations will be selected according to originality, significance, and general interest, on the basis of submitted 2-page short contributions. It can be work in progress, a summary of work submitted to a conference or workshop elsewhere, or work that in some other way might be interesting to the CALCO audience. A booklet with the accepted short contributions will be available at the workshop. Submissions will be handled via EasyChair https://www.easychair.org/conferences/?conf=calcoearlyideas2013 The use of LNCS style is strongly encouraged. After the workshop, authors will have the opportunity to submit a full 10-15 page paper on the same topic. The reviewing will be carried out by the CALCO Early Ideas PC, with the support of the CALCO PC. The volume of selected papers will be available online. Authors will retain copyright, and are also encouraged to disseminate the results by subsequent publication elsewhere. http://coalg.org/calco13/workshops.html#ei -- CALCO Early Ideas Dates -- 2-page short contribution submission: May 27, 2013 Notification for short contribution: June 24, 2013 Final short contribution due: July 15, 2013 CALCO Early Idead Workshop: September 2, 2013 10-15 page paper submission: October 15, 2013 Notification for paper: December 15, 2013 Final paper version due: January 15, 2014 -- CALCO Early Ideas Program Committee -- Bartek Klin, University of Warsaw, Poland John Power, University of Bath, UK Monika Seisenberger, Swansea University, UK (chair) -- CALCO-Tools Overview -- CALCO-Tools will take place on the same dates as the main CALCO conference, with no overlap between the technical programmes of the two events. Topics of interest include systems, prototypes, and tools developed specifically for the design, checking, execution, and verification of (co)algebraic specifications, but also tools targeting different application domains while making core or interesting use of (co)algebraic techniques. Tool submissions should not exceed 5 pages in LNCS format. The accepted tool papers will be included in the final proceedings of the conference. The tools should be made available on the web at the time of submission. Each submission will be evaluated by at least three reviewers; one or more of the reviewers will be asked to download and use the tool. At least one of the authors of each tool paper must attend the conference to demo the tool. http://coalg.org/calco13/workshops.html#tools -- CALCO-Tools Dates -- Paper submission: April 8, 2013 Author notification: May 6, 2013 Final version due: June 3, 2013 -- CALCO-Tools Programme Committee -- Einar Broch Johnsen, University of Oslo, Norway Mark Hills, CWI Amsterdam, The Netherlands Barbara K??nig, University of Duisburg-Essen, Germany Dorel Lucanu, Alexandru Ioan Cuza University, Romania Dominik Luecke, CWI Amsterdam, The Netherlands Till Mossakowski, DFKI, Germany Lutz Schr??der, Friedrich-Alexander Universit??t Erlangen-N??rnberg, Germany (chair) Alexandra Silva, Radboud University Nijmegen and CWI Amsterdam, The Netherlands -- FURTHER INFORMATION -- Queries related to submission, reviewing, and programme should be sent to the relevant conference or workshop chairs. Queries related to the organisation should be emailed to calco2013(a)mimuw.edu.pl . [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

ESSS 2013 -- submission deadline extended
by 山形賴之 26 Dec '12

26 Dec '12

ESSS 2013の論文投稿締め切りが延長されました。皆様の投稿をお待ちしております。 ================================================== 2nd International Workshop on Engineering Safety and Security Systems March 18, 2013, Luxembourg Co-located with ICST 2013 in Luxembourg, March 18-22, 2013 More information: http://www.comp.nus.edu.sg/~pat/esss2013/ =================================================== Important dates ----------------- * January 6th 2013: Submission deadline (extended) * February 11th 2013: Notification of acceptance/rejection (extended) * March 18th 2013: Workshop Introduction of the Workshop ----------------- The International Workshop on Engineering Safety and Security Systems (ESSS) aims at contributing to the challenge of constructing reliable and secure systems. The workshop covers areas such as formal specification, (extended) type checking, model checking, program analysis/transformation, model-based testing and model-driven software construction. The workshop will bring together researchers and industry R&D expertise together to exchange their knowledge, discuss their research findings, and explore potential collaborations. Theme of the Workshop ----------------- The main theme of the workshop is methods and techniques for constructing large reliable and secure systems. The goal of the workshop is to establish a platform for the exchange of ideas, discussion, cross-fertilization, inspiration, co-operation, and dissemination. The topics of the workshop include, but are not limited to: -- methods, techniques and tools for system safety and security -- methods, techniques and tools for analysis, certification, and debugging of complex safety and security systems -- model-based and verification-based testing -- emerging application domains such as cloud computing and cyber-physical systems -- case studies and experience reports on the use of formal methods for analyzing safety and security systems Submissions guidelines ----------------- Paper submissions must be original, unpublished work. Submissions should be in made via the Easychair site: https://www.easychair.org/conferences/?conf=esss2013. Submitted manuscripts should be in English and formatted in the style of the IEEE Computer Society Proceedings Format (see http://www.ieee.org/conferences_events/conferences/publishing/templates.html ). Papers should not exceed 6 pages for full papers and 2 pages for short papers, including figures, references, and appendices. All submissions should be in PDF format. Submissions not adhering to the specified format and length may be rejected immediately, without review. All workshop papers will be published in the IEEE Digital Library in the form of a post-proceedings. A pre-workshop version of the papers will be available on the workshop website prior. Publication of accepted articles requires the commitment of one of the authors to register for the workshop and present the paper. General chair ----------------- Sjouke Mauw, University of Luxembourg, Luxembourg Program chairs ----------------- Yang Liu, Nanyang Technological University, Singapore Jun Pang, University of Luxembourg, Luxembourg Program committee ----------------- Etienne Andre, Universite Paris 13, France Cyrille Artho, AIST, Japan Marieke Huisma, University of Twente, The Netherlands Weiqiang Kong, Kyushu University, Japan Keqin Li, SAP Research, France Yang Liu, Nanyang Technological University, Singapore Zhiming Liu, UNU/IIST Macao, China Sjouke Mauw, University of Luxembourg, Luxembourg Jun Pang, University of Luxembourg, Luxembourg Geguang Pu, East China Normal University, China Mohammad Torabi Dashti, ETH Zurich, Switzerland Anton Wijs, Eindhoven University of Technology Yoriyuki Yamagata, AIST, Japan -- 山形頼之独立行政法人産業技術総合研究所研究員 E-mail: yoriyuki.yamagata(a)aist.go.jp http://staff.aist.go.jp/yoriyuki.yamagata/

1 0

QIT28のご案内
by NISHIMURA Harumichi 26 Dec '12

26 Dec '12

logic-mlの皆様，来年５月に開催される第２８回量子情報技術研究会（QIT28）のご案内をQIT28世話人に代わって投稿させていただきます．よろしくお願いいたします．名古屋大学大学院情報科学研究科西村治道 http://www.math.cm.is.nagoya-u.ac.jp/~hnishimura/ --- 第28回量子情報技術研究会研究会の内容情報科学と量子力学を融合させた新しい分野、量子情報科学に関する研究会です。情報を担う物理系の量子力学的側面を積極的に活かした新しい情報処理原理の研究とそこから開かれる新しい学問体系の構築および新しい情報技術パラダイムの創生を目指して、情報科学、物理学、光エレクトロニクスを含む理学、工学、数理科学に携わる研究者間に自由な討論の場を提供し、この研究分野の発展を図ることを目的としています。期日 2013年5月27日（月）, 28日（火）会場北海道大学創成科学研究棟大会議室（〒001-0021 札幌市北区北21条西10丁目）発表募集内容発表募集分野（申込状況によっては査読可能性あり）：量子情報、量子計算、量子暗号など広く量子情報技術に関わる理論的研究、実験的研究、計算機科学的研究、数学的研究、およびその他関連分野定員 150名参加費事前振込み一般6,000円, 学生1,000円． (当日会場払いは一般7,000円, 学生2,000円) (懇親会は別途）研究会参加申込要領参加申込は下記Webにて受付けます． http://staff.aist.go.jp/s-kawabata/qit/ 講演（口頭，ポスター）申込，予稿集原稿PDF提出は電子情報通信学会のWebシステムを使用する予定．【講演申込締切】 2013年4月12日（金）；口頭講演 2013年4月26日（金）；ポスター講演【予稿集原稿提出】 2013年4月26日（金）【参加申込締切】 2013年5月2日（木）【問合先】富田章久（北海道大学大学院情報科学研究科）竹内繁樹（北海道大学電子科学研究所/大阪大学産業科学研究所）長谷川俊夫（三菱電機株式会社情報技術総合研究所） E-mail: qit28(a)ml.hokudai.ac.jp 主催量子情報技術時限研究専門委員会 (委員長枝松圭一(東北大)) 共催応用物理学会量子エレクトロニクス研究会物質・デバイス領域共同研究拠点北海道大学電子科学研究所

1 0

SAT 2013 Call For Papers
by Naoyuki Tamura 25 Dec '12

25 Dec '12

# 重複の場合はご容赦ください．神戸大学の田村と申します．メーリングリストをお借りして，来年7月にヘルシンキで開催されます SAT 2013 の Call For Papers をお送りします． -- 田村直之 (tamura(a)kobe-u.ac.jp) 神戸大学情報基盤センター〒657-8501 神戸市灘区六甲台町1-1 Phone: 078-803-5364, Fax: 078-803-5375 http://bach.istc.kobe-u.ac.jp/tamura-jp.html COPRIS+SCALA+CSP=SOLVER ------------------------------------------------------------------------- 1st CALL FOR PAPERS Sixteenth International Conference on THEORY AND APPLICATIONS OF SATISFIABILITY TESTING --- SAT 2013 --- Helsinki, Finland, July 8-12, 2013 http://sat2013.cs.helsinki.fi/ Abstract submission deadline: February 1, 2013 Paper submission deadline: February 8, 2013 ------------------------------------------------------------------------- The International Conference on Theory and Applications of Satisfiability Testing (SAT) is the primary annual meeting for researchers studying the theory and applications of the propositional satisfiability problem, broadly construed. Besides plain propositional satisfiability, it includes Boolean optimization (including MaxSAT and Pseudo-Boolean (PB) constraints), Quantified Boolean Formulas (QBF), Satisfiability Modulo Theories (SMT), and Constraint Programming (CP) for problems with clear connections to Boolean-level reasoning. Many hard combinatorial problems can be encoded as SAT instances, in the broad sense mentioned above, including problems in formal verification (hardware and software), artificial intelligence, and operations research. More recently, biology, cryptology, data mining, machine learning, and mathematics have been added to the growing list. The SAT conference aims to further advance the field by soliciting original theoretical and practical contributions in these areas with a clear connection to satisfiability. SAT 2013 takes place in Helsinki, the capital of Finland. Helsinki is a vibrant Scandinavian and international city with a lot to offer to visitors. SAT 2013 takes place during the main summer season, allowing one to experience the whitenights during which the sun almost never sets. IMPORTANT DATES =============== (Follow http://sat2013.cs.helsinki.fi/ for updates.) February 1, 2013: Abstract Submission February 8, 2013: Paper Submission March 18, 2013 (approx.): Response from Authors begins, lasts 72 hours April 3, 2013: Acceptance Notifications April 22, 2013: Final Camera-Ready Versions July 8, 2013: Workshops begin July 9-12, 2013: Main Conference SCOPE ===== SAT 2013 welcomes scientific contributions addressing different aspects of the satisfiability problem. interpreted in a broad sense. Domains include MaxSAT and Pseudo-Boolean (PB) constraints, Quantified Boolean Formulae (QBF), Satisfiability Modulo Theories (SMT), Constraint Satisfaction Problems (CSP). Topics include (but are not restricted to) Theoretical advances (including exact algorithms, proof complexity, and other complexity issues); Practical search algorithms; Knowledge compilation; Implementation-level details of SAT solving tools and SAT-based systems; Problem encodings and reformulations; Applications (including both novel applications domains and improvements to existing approaches); Case studies and reports on insightful findings based on rigorous experimentation. OUT OF SCOPE ============ Papers claiming to resolve a major long-standing open theoretical question in mathematics or computer science (such as those for which a Millennium Prize is offered, see http://www.claymath.org/millennium) are outside the scope of the conference because there is insufficient time in the schedule to referee such papers; instead, such papers should be submitted to an appropriate technical journal. SUBMISSIONS =========== Submissions to SAT 2013 are solicited in three paper categories, describing original contributions: REGULAR PAPERS (9 to 15 pages, excluding references) Regular papers should contain original research, with sufficient detail to assess the merits and relevance of the contribution. For papers reporting experimental results, authors are strongly encouraged to make their data and implementations available with their submission. Submissions reporting on case studies are also encouraged, and should describe details, weaknesses, and strengths in sufficient depth. SHORT PAPERS (up to 8 pages, excluding references) The same evaluation criteria apply to short papers as to regular papers. They will be reviewed to the same standards of quality as regular papers, but will naturally contain less quantity of new material. Short papers will have the same status as regular papers and be eligible for the same awards (to be announced later). TOOL PAPERS (up to 6 pages, excluding references) A tool paper should describe the implemented tool and its novel features. Here "tools" are interpreted in a broad sense, including descriptions of implementations of core SAT solving techniques (solvers, preprocessors, etc.), systems exploiting SAT solvers or their extensions for solving interesting problem domains, etc. A demonstration is expected to accompany a tool presentation. Papers describing tools that have already been presented previously are expected to contain significant and clear enhancements to the tool. The software for the tool should be made publicly available, for accepted tool papers, and should at least be available to reviewers for evaluation during the review period. Evaluation criteria will include (but not be limited to) accurate documentation, usability, and potential for furthering the state of the art. For the latter criterion, availability of source code will be a significant factor. This is an evolving category, and technical issues involving software availability should be discussed with the program chairs. Be sure to check the conference web page for updates on this category. Papers describing unpublished tool-related work, providing details on a system and the novel algorithms it implements, as well as an experimental evaluation of the system's performance, can also be submitted as regular papers. For all paper categories, the page limits stated above do not include references, but do include all other material intended to appear in the conference proceedings. An additional technical appendix may be included, but it must be clearly labeled as supplementary material and may or may not be examined during review based of the considerations of individual reviewers. The appendix may contain detailed proofs, examples, descriptions of publicly available software related to the submission, or other information that does not fit the page limit. However, the appendix will not be included in the conference proceedings. The main contributions should be made accessible within the page limits, without having to rely on the appendix. Submissions should not be under review elsewhere nor be submitted elsewhere while under review for SAT 2013, and should not consist of previously published material. Submissions must use the Springer LNCS style without modifications, and must be written in English. All papers submissions are done exclusively via the SAT 2013 EasyChair Conference Service at http://www.easychair.org/conferences/?conf=sat2013 . PROCEEDINGS =========== All accepted papers will be published in the proceedings of the conference, which will be published within the Springer LNCS series. PROGRAM CHAIRS ============== Matti Jarvisalo University of Helsinki, Finland Allen Van Gelder University of California at Santa Cruz, USA PROGRAM COMMITTEE ================= Gilles Audemard Fahiem Bacchus Armin Biere Maria Luisa Bonet Lucas Bordeaux Uwe Bubeck Samuel Buss Nadia Creignou Leonardo de Moura John Franco Enrico Giunchiglia Ziyad Hanna Marijn Heule Holger H. Hoos Jinbo Huang Tommi Junttila Matti Jarvisalo Arist Kojevnikov Daniel Kroening Oliver Kullmann Daniel Le Berre Florian Lonsing Ines Lynce Joao Marques-Silva Alexander Nadel Jakob Nordstrom Albert Oliveras Ramamohan Paturi Jussi Rintanen Olivier Roussel Ashish Sabharwal Lakhdar Sais Roberto Sebastiani Bart Selman Peter Stuckey Stefan Szeider Naoyuki Tamura Allen Van Gelder Toby Walsh ================================================================

1 0

[CFP] ATVA 2013 (Hanoi, 10/15-18, 2013)
by Ogawa Mizuhito 23 Dec '12

23 Dec '12

$B3'MM(B $B!v!vJ#?t<u$1<h$i$l$?J}$O$4MF<O$/$@$5$$!#!v!v(B $B>.@n!w(BJAIST $B$G$9!#(B2013$BG/(B10$B7n$K%O%N%$$G9T$o$l$^$99q:]2q5D(BATVA$B$N(B 1st call for paper $B$r$*Aw$j$$$?$7$^$9!#O@J8Ej9FDy$a@Z$j$O(B4$B7n(B6$BF|(B $B$H$^$@@h$G$9$,!"(B10$B7n$N%O%N%$$OAV$d$+$J;~4|$G$9!#$U$k$C$FEj9F$r(B $B$47W2h$/$@$5$$!#(B $B>.@n?p;K(B (JAIST) http://www.jaist.ac.jp/~mizuhito --------------------------------------------------------------- CALL FOR PAPERS ATVA 2013 11th International Symposium on Automated Technology for Verification and Analysis October 15 - 18, 2013, Hanoi, Vietnam ==================== The ATVA series of symposia is intended to promote research in theoretical and practical aspects of automated analysis, verification and synthesis in Asia by providing a forum for interaction between the regional and international research communities and industry in the field. The previous editions of the symposium were held in Taiwan, Beijing, Tokyo, Seoul, Macao, Singapore, Taipei and Thiruvananthapuram. Organised by the University of Engineering and Technology VNU Hanoi, ATVA 2013 will be held in the campus of Vietnam National University, Hanoi from October 15th to October 18th, 2013. SCOPE ATVA 2013 solicits high quality submissions in areas related to the theory and practice of automated analysis and verification of hardware and software systems. Topics of interest include, but are not limited to: - Formalisms for modeling hardware, software and embedded systems - Specification and verification of finite-state, infinite-state and parameterized system - Program analysis and software verification - Analysis and verification of hardware circuits, systems-on-chip and embedded systems - Analysis of real-time, hybrid, priced/weighted and probabilistic systems - Deductive, algorithmic, compositional and abstraction/refinement techniques for analysis and verification - Analytical techniques for safety, security, and dependability - Testing and runtime analysis based on verification technology - Analysis and verification of parallel and concurrent hardware/software systems - Verification in industrial practice - Applications and case studies Theory papers should preferably be motivated by practical problems, and applications should be based on sound theory and should solve problems of practical interest. SUBMISSION Submissions are invited in two categories: regular research papers and tool papers. Submitted papers must present original and unpublished work, and must not be concurrently submitted to any other conference or journal. Regular paper submissions are restricted to 15 pages inSpringer's LNCS format, and tool paper submissions are restricted to 4 pages in the same format. Proofs and details omitted due to space constraints may be put in an appendix. Any such additional material will be read by reviewers/program committee members at their discretion. Authors are therefore urged to include details necessary for evaluation of the technical merit of their work within the prescribed page limits. Tool papers must include information about a URL from where the tool can be downloaded or accessed on-line for evaluation. The URL must also contain a set of examples, and a user's manual that describes usage of the tool through examples. In case the tool needs to be downloaded and installed, the URL must also contain a document clearly giving instructions for installation of the tool on Linux/Windows/MacOS. Authors must upload PDF files of their papers throughEasyChair at: https://www.easychair.org/conferences/?conf=atva2013 Accepted papers in both categories will be published by Springer as a LNCS volume. At least one author of each accepted paper must also register for the conference and present the paper. KEYNOTE TALKS AND TUTORIALS Keynote talks and tutorials will be given by: - Alessandro Cimatti (ITC-IRST, Italy) - Marta Kiwakowska (Oxford, UK) - Jerome Leroux (Bordeaux, France) IMPORTANT DATES - April 06, 2013: Paper submission deadline - Jun 1, 2013: Paper acceptance/rejection notification - July 5, 2013: Camera-ready copy deadline - October 15 - 18, 2013: Main conference & Tutorials ORGANIZING COMMITTEES General Chair - Nguyen Ngoc Binh (UET-VNU Hanoi, Vietnam) Steering Committee - E. Allen Emerson (U. of Texas-Austin, USA) - Teruo Higashino (Osaka Univeristy, Japan) - Insup Lee (U. of Pennsylvania, USA) - Doron A. Peled (Bar Ilan University, Israel) - Farn Wang (National Taiwan University, Taiwan) - Hsu-Chun Yen (National Taiwan University, Taiwan) Programme Committee Co-Chairs - Hung Dang-Van (UET-VNU Hanoi, Vietnam) - Mizuhito Ogawa (JAIST, Japan) Publicity Chair - Thao Dang (Verimag, France) Finance/Registration Chair - Thanh-Tho Quan (HCMUT, Vietnam) Local Chair - Hoang Truong (UET-VNU Hanoi, Vietnam) PROGRAMME COMMITTEE - Christel Baier (Germany) - Jonathan Billington (Australia) - Gianpiero Cabodi (Italy) - Supratik Chakraborty (India) - Wei-Ngan Chin (Singapore) - Thao Dang (France) - Hung Dang-Van (Vietnam, Co-chair) - Deepak D'Souza (India) - E.Allen Emerson (USA) - Martin Frnzle (Germany) - Masahiro Fujita (Japan) - Susanne Graf (France) - Teruo Higashino (Japan) - Alan Hu (Canada) - Franjo Ivancic (USA) - Jie-Hong Roland Jiang (Taiwan) - Joost-Pieter Katoen (Germany) - Zurab Khasidashvili (Israel) - Moonzoo Kim (Korea) - Gerwin Klein (Australia) - Fribourg Laurent (France) - Insup Lee (USA) - Xuandong Li (China) - Annabelle McIver (Australia) - Madhavan Mukund (India) - Pham Ngoc-Hung (Vietnam) - Thanh-Binh Nguyen (Vietnam) - Viet-Ha Nguyen (Vietnam) - Mizuhito Ogawa (Japan, Co-chair) - Thanh-Tho Quan (Vietnam) - Venkatesh R (India) - Ganesan Ramalingam (India) - Abhik Roychoudhury (Singapore) - Hiroyuki Seki (Japan) - Martin Steffen (Norway) - Sofiene Tahar (Canada) - Hoang Truong (Vietnam) - Mahesh Viswanathan (USA) - Farn Wang (Taiwan) - Bow-Yaw Wang (China) - Ji Wang (China) - Hsu-Chun Yen (Taiwan) - Wang Yi (Sweden) - Shoji Yuen (Japan) - Wenhui Zhang (China) CONFERENCE VENUE Historical Campus, Vietnam National University, 19 Le Thanh Tong street, Hoan Kiem district, Hanoi, Vietnam.

1 0

LICS 2013 Last Call for Papers
by Kazushige TERUI 20 Dec '12

20 Dec '12

LAST CALL FOR PAPERS Twenty-Eighth Annual ACM/IEEE Symposium on LOGIC IN COMPUTER SCIENCE (LICS 2013) June 25-28, 2013, New Orleans, USA http://lii.rwth-aachen.de/lics/lics13/ LICS 2013 will be hosted by Tulane University, in New Orleans, LA USA, from June 25th to 28th, 2013. LICS 2013 will be co-located with MFPS13 (23-25 June) and CSF13 (28-30 June). The LICS Symposium is an annual international forum on theoretical and practical topics in computer science that relate to logic, broadly construed. We invite submissions on topics that fit under that rubric. Suggested, but not exclusive, topics of interest include: automata theory, automated deduction, categorical models and logics, concurrency and distributed computation, constraint programming, constructive mathematics, database theory, decision procedures, description logics, domain theory, finite model theory, theory of automatic structures, formal aspects of program analysis, formal methods, foundations of computability, higher-order logic, lambda and combinatory calculi, linear logic, logic in artificial intelligence, logic programming, logical aspects of bioinformatics, logical aspects of computational complexity, logical aspects of quantum computation, logical frameworks, logics of programs, modal and temporal logics, model checking, probabilistic systems, process calculi, programming language semantics, proof theory, real-time systems, reasoning about security, rewriting, type systems and type theory, and verification. Important Dates: Authors are required to submit a paper title and a short abstract of about 100 words in advance of submitting the extended abstract of the paper. Titles & Short Abstracts Due : January 7, 2013 Extended Abstracts Due : January 14, 2013 Author Notification (approximate) : March 22, 2013 Final Versions Due for Proceedings: April 26, 2013 Deadlines are firm; late submissions will not be considered. All submissions will be electronic via http://easychair.org/conferences/?conf=lics2013. Submission Instructions: Every extended abstract must be submitted in the IEEE Proceedings 2-column 10pt format and may not be longer than 10 pages, including references. LaTeX style files will be available on the conference website. The extended abstract must be in English and provide sufficient detail to allow the program committee to assess the merits of the paper. It should begin with a succinct statement of the issues, a summary of the main results, and a brief explanation of their significance and relevance to the conference and to computer science, all phrased for the non-specialist. Technical development directed to the specialist should follow. References and comparisons with related work must be included. (If necessary, detailed proofs of technical results may be included in a clearly-labeled appendix, to be consulted at the discretion of program committee members.) Extended abstracts not conforming to the above requirements will be rejected without further consideration. Papers selection will be merit-based, with no a priori limit on the number of accepted papers. Results must be unpublished and not submitted for publication elsewhere, including the proceedings of other symposia or workshops. The program chair must be informed, in advance of submission, of any closely related work submitted or about to be submitted to a conference or journal. Authors of accepted papers are expected to sign copyright release forms. One author of each accepted paper is expected to present it at the conference. Short Presentations: A session of short presentations, intended for descriptions of student research, works in progress, and other brief communications, is planned. These abstracts will not be published. Dates and guidelines will be posted on the LICS website. Kleene Award for Best Student Paper: An award in honor of the late Stephen C. Kleene will be given for the best student paper(s), as judged by the program committee. Special Issues: Full versions of up to three accepted papers, to be selected by the program committee, will be invited for submission to the Journal of the ACM. Additional selected papers will be invited to a special issue of Logical Methods in Computer Science. Sponsorship: The symposium is sponsored by the IEEE Technical Committee on Mathematical Foundations of Computing and by ACM SIGACT, in cooperation with the Association for Symbolic Logic and the European Association for Theoretical Computer Science. Program Chair: Orna Kupferman, Hebrew University Program Committee: Parosh A. Abdulla, Uppsala University Amal Ahmed, Northeastern Universtiy Sergei Artemov, City University of New York Andrei Bulatov, Simon Fraser University Yijia Chen, Shanghai Jiao Tong University Veronique Cortier, CNRS, Loria Mariangiola Dezani-Ciancaglini, Univ. di Torino Thomas Ehrhard, CNRS, Universite Paris Diderot Javier Esparza, Technische Universitaet Muenchen Kousha Etessami, University of Edinburgh Maribel Fernandez, King’s College London Santiago Figueira, University of Buenos Aires Simon Gay, University of Glasgow Martin Grohe, Humboldt-Universitaet zu Berlin Martin Hofmann, LMU Munich Petr Jancar, Technical University Ostrava Barbara Jobstmann, CNRS, Verimag and Jasper DA Patricia Johann, University of Strathclyde Bakhadyr Khoussainov, The University of Auckland Antonina Kolokolova, University of Newfoundland Victor Marek, University of Kentucky Angelo Morzenti, Politecnico di Milano Lawrence Moss, Indiana University Madhavan Mukund, Chennai Math. Institute Anca Muscholl, Universite Bordeaux Mogens Nielsen, Aarhus University Catuscia Palamidessi, INRIA, Ecole Polytechnique Luc Segoufin, INRIA, ENS Cachan Natarajan Shankar, SRI International Alexandra Silva, Radboud University Nijmegen Balder ten Cate, UC Santa Cruz Kazushige Terui, Kyoto University Ron van der Meyden, Univ. of New South Wales Jeannette M. Wing, Carnegie Mellon University Nobuko Yoshida, Imperial College London Conference Chair: Mike Mislove, Tulane University Workshop Chair: Patricia Bouyer-Decitre, CNRS, ENS Cachan Publicity Chair: Andrzej Murawski, University of Leicester General Chair: Luke Ong, University of Oxford Organizing Committee: Martin Abadi, Luca Aceto, Rajeev Alur, Franz Baader, Paul Beame, Patricia Bouyer-Decitre, Adriana Compagnoni, Anuj Dawar, Nachum Dershowitz, Martin Escardo, Maribel Fernandez, Martin Grohe, Orna Grumberg, Jean-Pierre Jouannaud, Phokion Kolaitis, Orna Kupferman, Benoit Larose, Vlatko Lipovac, Michael Mislove, Georg Moser, Andrzej Murawski, Luke Ong (chair), Andre Scedrov, Philip Scott, David Shmoys, Matt Valeriote Advisory Board: Martin Abadi, Samson Abramsky, Rajeev Alur, Bob Constable, Thierry Coquand, Thomas Henzinger, Phokion Kolaitis, Dexter Kozen, Dale Miller, John Mitchell, Prakash Panangaden, Andrew Pitts, Gordon Plotkin, Moshe Vardi, Glynn Winskel ------------------------------------------ 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

First Announcement ― TACL 2013
by Hiroakira Ono 18 Dec '12

18 Dec '12

[Apologies for multiple copies] ====================================================== TOPOLOGY, ALGEBRA AND CATEGORIES IN LOGIC (TACL 2013) ====================================================== July 28 - August 1, 2013 Department of Mathematics, Vanderbilt University Nashville, Tennessee USA http://www.math.vanderbilt.edu/~tacl2013/ The Sixth International Conference on Topology, Algebra and Categories in conjunction with the 28th Annual Shanks Lecture Series Scope --------- Studying logics via semantics is a well-established and very active branch of mathematical logic, with many applications, in computer science and elsewhere. The area is characterized by results, tools and techniques stemming from various fields, including universal algebra, topology, category theory, order, and model theory. The program of the conference TACL 2013 will focus on three interconnecting mathematical themes central to the semantical study of logics and their applications: algebraic, categorical, and topological methods. This is the sixth conference in the series Topology, Algebra and Categories in Logic (TACL, formerly TANCL). Earlier installments of this conference have been organized in Tbilisi (2003), Barcelona (2005), Oxford (2007), Amsterdam (2009), Marseilles (2011). Confirmed invited speakers ------------------------------------- Vladimir Voevodsky, Institute for Advanced Studies, USA (Shanks Lecturer) Nick Bezhanishvili, Utrecht University, The Netherlands Leo Cabrer, University of Oxford, UK Silvio Ghilardi, University of Milan, Italy George Metcalfe, University of Bern, Switzerland Alex Simpson, University of Edinburgh, UK Featured topics --------------------- Contributed talks can deal with any topic dealing with the use of algebraic, categorical or topological methods in either logic or computer science. This includes, but is not limited to, the following areas: * Algebraic structures in CS * Algebraic logic * Coalgebra * Categorical methods in logic * Domain theory * Lattice theory * Lattices with operators * Many-valued and fuzzy logics * Modal logics * Non-classical logics * Ordered topological spaces * Ordered algebraic structures * Pointfree topology * Proofs and Types * Residuated structures * Semantics * Stone-type dualities * Substructural logics * Topological semantics of modal logic Submissions ----------------- Contributed presentations will be of two types: o 20 minutes long presentations in parallel sessions and o featured, 30 minutes long, plenary presentations. The submission of an abstract will be required to be selected for a contributed presentation of either kind. While preference will be given to new work, results that have already been published or presented elsewhere will also be considered. More information on the submission procedure, as well as a link to the EasyChair system, can be found at the conference web site. Important dates ---------------------- April 1, 2013: Abstract submission deadline May 1, 2013: Notification to authors July 28-August 1, 2013: Conference Program Committee --------------------------- Steve Awodey, Carnegie Mellon University Guram Bezhanishvili, New Mexico State University David Gabelaia, Razmadze Mathematical Institute, Tbilisi Nick Galatos (co-chair), University of Denver Mai Gehrke, LIAFA, University of Paris Diderot Rob Goldblatt, Victoria University, Wellington John Harding, New Mexico State University Ramon Jansana, University of Barcelona Peter Jipsen, Chapman University Achim Jung, University of Birmingham Alexander Kurz (co-chair), University of Leicester Vincenzo Marra, University of Milan Hiroakira Ono, Japan Advanced Institute of Science and Technology Alessandra Palmigiano, University of Amsterdam Hilary Priestley, St Anne's College, Oxford James Raftery, University of KwaZulu-Natal, Durban Thomas Streicher, Technical University of Darmstadt Kazushige Terui, Kyoto University Constantine Tsinakis, Vanderbilt University Yde Venema, University of Amsterdam Michael Zakharyaschev, Birkbeck College, University of London Organizing Committee ------------------------------- Chris Conidis, Vanderbilt University Lianzhen Liu, Jiangnan University, China Warren McGovern, Florida Atlantic University Francesco Paoli, University of Cagliari Rebecca Steiner, Vanderbilt University Constantine Tsinakis (chair), Vanderbilt University William Young, Vanderbilt University Expression of interest ------------------------------ We would greatly appreciate your taking two minutes to express your level of interest in the conference by filling out a simple form on the conference web site under "Express Interest". This will help the Organizing Committee with their planning. You can also opt-out from receiving future announcements by clicking the link at the bottom of this email. More Information ----------------------- TACL 2013 web site: http://www.math.vanderbilt.edu/~tacl2013/ Use this site for local information, including hotel accommodations, for travel information and registration, and for submitting a request for financial support. Any queries for the Program Committee (such as usage of the EasyChair conference system, abstract submission guidelines, conference program, etc.) should be sent to tacl2013(a)gmail.com. Queries for the local Organizing Committee (registration, hotel accommodations, financial support and reimbursements, technology infrastructure, etc.) should be sent to tacl2013oc(a)vanderbilt.edu.

1 0

First Announcement — TACL 2013 TACL 2013
by Kent, Curt 18 Dec '12

18 Dec '12

[Apologies for multiple copies] ====================================================== TOPOLOGY, ALGEBRA AND CATEGORIES IN LOGIC (TACL 2013) ====================================================== July 28 - August 1, 2013 Department of Mathematics, Vanderbilt University Nashville, Tennessee USA http://www.math.vanderbilt.edu/~tacl2013/ The Sixth International Conference on Topology, Algebra and Categories in conjunction with the 28th Annual Shanks Lecture Series Scope --------- Studying logics via semantics is a well-established and very active branch of mathematical logic, with many applications, in computer science and elsewhere. The area is characterized by results, tools and techniques stemming from various fields, including universal algebra, topology, category theory, order, and model theory. The program of the conference TACL 2013 will focus on three interconnecting mathematical themes central to the semantical study of logics and their applications: algebraic, categorical, and topological methods. This is the sixth conference in the series Topology, Algebra and Categories in Logic (TACL, formerly TANCL). Earlier installments of this conference have been organized in Tbilisi (2003), Barcelona (2005), Oxford (2007), Amsterdam (2009), Marseilles (2011). Confirmed invited speakers ------------------------------------- Vladimir Voevodsky, Institute for Advanced Studies, USA (Shanks Lecturer) Nick Bezhanishvili, Utrecht University, The Netherlands Leo Cabrer, University of Oxford, UK Silvio Ghilardi, University of Milan, Italy George Metcalfe, University of Bern, Switzerland Alex Simpson, University of Edinburgh, UK Featured topics --------------------- Contributed talks can deal with any topic dealing with the use of algebraic, categorical or topological methods in either logic or computer science. This includes, but is not limited to, the following areas: * Algebraic structures in CS * Algebraic logic * Coalgebra * Categorical methods in logic * Domain theory * Lattice theory * Lattices with operators * Many-valued and fuzzy logics * Modal logics * Non-classical logics * Ordered topological spaces * Ordered algebraic structures * Pointfree topology * Proofs and Types * Residuated structures * Semantics * Stone-type dualities * Substructural logics * Topological semantics of modal logic Submissions ----------------- Contributed presentations will be of two types: o 20 minutes long presentations in parallel sessions and o featured, 30 minutes long, plenary presentations. The submission of an abstract will be required to be selected for a contributed presentation of either kind. While preference will be given to new work, results that have already been published or presented elsewhere will also be considered. More information on the submission procedure, as well as a link to the EasyChair system, can be found at the conference web site. Important dates ---------------------- April 1, 2013: Abstract submission deadline May 1, 2013: Notification to authors July 28-August 1, 2013: Conference Program Committee --------------------------- Steve Awodey, Carnegie Mellon University Guram Bezhanishvili, New Mexico State University David Gabelaia, Razmadze Mathematical Institute, Tbilisi Nick Galatos (co-chair), University of Denver Mai Gehrke, LIAFA, University of Paris Diderot Rob Goldblatt, Victoria University, Wellington John Harding, New Mexico State University Ramon Jansana, University of Barcelona Peter Jipsen, Chapman University Achim Jung, University of Birmingham Alexander Kurz (co-chair), University of Leicester Vincenzo Marra, University of Milan Hiroakira Ono, Japan Advanced Institute of Science and Technology Alessandra Palmigiano, University of Amsterdam Hilary Priestley, St Anne's College, Oxford James Raftery, University of KwaZulu-Natal, Durban Thomas Streicher, Technical University of Darmstadt Kazushige Terui, Kyoto University Constantine Tsinakis, Vanderbilt University Yde Venema, University of Amsterdam Michael Zakharyaschev, Birkbeck College, University of London Organizing Committee ------------------------------- Chris Conidis, Vanderbilt University Lianzhen Liu, Jiangnan University, China Warren McGovern, Florida Atlantic University Francesco Paoli, University of Cagliari Rebecca Steiner, Vanderbilt University Constantine Tsinakis (chair), Vanderbilt University William Young, Vanderbilt University Expression of interest ------------------------------ We would greatly appreciate your taking two minutes to express your level of interest in the conference by filling out a simple form on the conference web site under "Express Interest". This will help the Organizing Committee with their planning. You can also opt-out from receiving future announcements by clicking the link at the bottom of this email. More Information ----------------------- TACL 2013 web site: http://www.math.vanderbilt.edu/~tacl2013/ Use this site for local information, including hotel accommodations, for travel information and registration, and for submitting a request for financial support. Any queries for the Program Committee (such as usage of the EasyChair conference system, abstract submission guidelines, conference program, etc.) should be sent to tacl2013(a)gmail.com<mailto:tacl2013@gmail.com>. Queries for the local Organizing Committee (registration, hotel accommodations, financial support and reimbursements, technology infrastructure, etc.) should be sent to tacl2013oc(a)vanderbilt.edu<mailto:tacl2013oc@vanderbilt.edu>. To unsubscribe from this list, please send an email to LISTSERV(a)LIST.VANDERBILT.EDU<mailto:LISTSERV@LIST.VANDERBILT.EDU> with "SIGNOFF TACL2013" as the body of message.

1 0

ESSLLI Student Seminar 2013 - First Call for Papers
by Mauricio Hernandes 17 Dec '12

17 Dec '12

mlの皆様, As asked by the Chair of the Student Seminar I am forwarding the information below. Regards Mauricio Hernandes First Call for Papers ESSLLI 2013 STUDENT SESSION Held during The 25th European Summer School in Logic, Language and Information Düsseldorf, Germany, August 5-16, 2013 Deadline for submissions: April 1st, 2013 https://www.easychair.org/conferences/?conf=essllistus2013 *ABOUT*: The Student Session of the 25th European Summer School in Logic, Language, and Information (ESSLLI) will take place in *Düsseldorf, Germany on August 5-16, 2013*. We invite submissions of original, unpublished work from students in any area at the intersection of Logic & Language, Language & Computation, or Logic & Computation. Submissions will be reviewed by several experts in the field, and accepted papers will be presented orally or as posters and will appear in the student session proceedings in Springer. This is an excellent opportunity to receive valuable feedback from expert readers and to present your work to a diverse audience. *A SEPARATE POSTER SESSION*: Note that this year there are two separate kinds of submissions, one for the oral presentations and one for the posters. This means that papers can be directly submitted as posters. Reviewing and ranking will be done separately. We particularly encourage submissions for posters. More detailed guidelines regarding submission can be found on the Student Session website: http://stus2013.loriweb.org/, (links to previous years' proceedings are also available there). Please direct inquiries about submission procedures or other matters relating to the Student Session to margotcolinet(a)gmail.com For general inquiries about ESSLLI 2013, please consult the main ESSLLI 2013 page, http://esslli2013.de/. Kind regards, *The ESSLLI 2013 Student Session Organization Committee*, Chair: Margot Colinet (Université Paris Diderot-Paris 7) LOCO (LOgic and Computation) co-chairs: Ronald de Haan (Technische Universität Wien) Michał Zawidzki (Uniwersytet Łódzki) LOLA (LOgic and LAnguage) co-chairs: Agata Renans (Universität Potsdam) Barbara Tomaszewicz (University of Southern California) LACO (LAnguage and Computation) co-chairs: Pierre Bourreau (Heinrich-Heine-Universität Düsseldorf) Julia Zinova (Heinrich-Heine-Universität Düsseldorf)

1 0

*** 場所と時間を変更しました *** Talk by Keiko Nakata (Tallinn U of Tech), Tue 18 December 2012
by Ichiro Hasuo 17 Dec '12

17 Dec '12

みなさま，念のため，明日の中田景子さんのご講演について場所と時間の変更のご案内を再度お送りします．どうかよろしくお願いいたします！蓮尾一郎 ---------- Forwarded message ---------- From: Ichiro Hasuo <ichiro(a)is.s.u-tokyo.ac.jp> Date: Thu, Dec 13, 2012 at 9:06 AM Subject: *** Time & Venue Changed *** Talk by Keiko Nakata (Tallinn U of Tech), Tue 18 December 2012 To: logic-ml <logic-ml(a)sato.kuis.kyoto-u.ac.jp>, sonoteno <sonoteno(a)m.aist.go.jp>, jssst-ppl(a)kb.ecei.tohoku.ac.jp みなさま，こんにちは！東京大学の蓮尾と申します．先日お知らせした，タリン工科大学の中田景子さんによるご講演ですが，＊＊時間と場所を変更＊＊させてください．（日程は同じです）急なお知らせで申し訳ありません．また，会場の国立情報学研究所では，中田さんのご講演の前（13:30-15:30）に ToPS セミナーが開催されます．そちらにも是非どうぞ！ http://takeichi.ipl-lab.org/~tops/upcoming_seminar.html 蓮尾一郎 http://www-mmm.is.s.u-tokyo.ac.jp/ ============================================= Tue 18 December 2012, 16:00-17:30 Keiko Nakata (Tallinn University of Technology), 2 Talks 国立情報学研究所 12階 1208号室 Rm. 1208, 12F, National Institute of Informatics Access: http://www.nii.ac.jp/en/about/access *** 場所・時間が変わりました *** *** The time and venue have been changed *** 中田さんのご講演の前（13:30-15:30）に，同じ場所で ToPS セミナーが開催されます．そちらにも是非どうぞ！http://takeichi.ipl-lab.org/~tops/upcoming_seminar.h… Prior to Dr. Nakata’s talk there will be a “ToPS seminar” at the same location. The talks will be of similar research interests. http://takeichi.ipl-lab.org/~tops/upcoming_seminar.html Talk 1: Proving open induction using delimited control operators Open Induction (OI) is a principle classically equivalent to Dependent Choice, which is, unlike the later, closed under double-negation translation and A-translation. In the context of Constructive Reverse Mathematics, Wim Veldman has shown that, in presence of Markov's Principle, OI on Cantor space is equivalent to Double-negation Shift (DNS). With Danko Ilik, we have reworked Veldman's proof to give a constructive proof of OI, where DNS is interpreted using delimited control operators. Joint work with Danko Ilik. Talk 2: Walking through infinite trees with mixed induction and coinduction: A Proof Pearl with the Fan Theorem and Bar Induction. We study temporal properties over infinite binary red-blue trees in the setting of constructive type theory. We consider several familiar path-based properties, typical to linear-time and branching-time temporal logics like LTL and CTL*, and the corresponding tree-based properties, in the spirit of the modal mu-calculus. We conduct a systematic study of the relationships of the path-based and tree-based versions of ``eventually always blueness '' and mixed inductive-coinductive ``almost always blueness'' and arrive at a diagram relating these properties to each other in terms of implications that hold either unconditionally or under specific assumptions (Weak Continuity for Numbers, the Fan Theorem, Lesser Principle of Omniscience, Bar Induction). Joint work with Marc Bezem and Tarmo Uustalu.

1 0

Logic Zoo Workshop 2013 (Jan. 31, Tokyo)
by Yoichi Hirai 13 Dec '12

13 Dec '12

みなさま東京大学萩谷研の平井洋一より、Logic Zooワークショップのご案内です。 2013年1月31日(木)東京開催です(前日30日には平井洋一の博士論文公聴会)。講演・前日夕食の申込は 2013年1月15日(火) 締切です。詳細及び申込 http://logiczoo13.pira.jp 論理をみつける話から論理を調べる話、論理を使う話までご講演、ご参加をお待ちしております。平井洋一 Logic Zoo Workshop 2013 (Jan. 31, Tokyo) ======================================== A workshop on living, playing or working logics. Topics include: - substructural and more exotic logics - type systems - programming languages - mathematics on non-classical logics - software verification - logics for social, economical, legal or linguistic analysis. Organizer: Yoichi Hirai yh(a)lyon.is.s.u-tokyo.ac.jp Schedule and Location --------------------- - 2013 Jan. 31 (Thu), 10:00--17:00 - Room 236, through Science Bldg. 7, 理学部7号館2階より化東236室 Hongo campus, the Univ. of Tokyo 東京大学本郷キャンパス - with four blackboards 黒板4枚あり Registration ------------ Please register for your talk slot and/or dinner by Jan. 15, 2013. A talk will be 30-minute long (tentative estimation). Fill this form and send it to yh(a)lyon.is.s.u-tokyo.ac.jp ================================== Logic Zoo (Jan. 31) Registration name: affiliation: eve-dinner on 30th: yes / no / not decided giving a talk: yes / not decided title: TBD or a title ================================== Some Other Events ----------------- 2013-01-30 (Wed): Defense and Dinner 12:00--14:00 Yoichi Hirai's defense (first half is public): Hyper-Lambda Calculi Room 102, Science Bldg. 7, Hongo campus, the Univ. of Tokyo 19:00--21:00 Dinner: Logic Zoo Eve nearby restaurant 2013-01-31 (Thu): Workshop 10:00--17:00 Logic Zoo Workshop Room 236, through Science Bldg. 7, Hongo campus, the Univ. of Tokyo

1 0

*** Time & Venue Changed *** Talk by Keiko Nakata (Tallinn U of Tech), Tue 18 December 2012
by Ichiro Hasuo 13 Dec '12

13 Dec '12

みなさま，こんにちは！東京大学の蓮尾と申します．先日お知らせした，タリン工科大学の中田景子さんによるご講演ですが，＊＊時間と場所を変更＊＊させてください．（日程は同じです）急なお知らせで申し訳ありません．また，会場の国立情報学研究所では，中田さんのご講演の前（13:30-15:30）に ToPS セミナーが開催されます．そちらにも是非どうぞ！ http://takeichi.ipl-lab.org/~tops/upcoming_seminar.html 蓮尾一郎 http://www-mmm.is.s.u-tokyo.ac.jp/ ============================================= Tue 18 December 2012, 16:00-17:30 Keiko Nakata (Tallinn University of Technology), 2 Talks 国立情報学研究所 12階 1208号室 Rm. 1208, 12F, National Institute of Informatics Access: http://www.nii.ac.jp/en/about/access *** 場所・時間が変わりました *** *** The time and venue have been changed *** 中田さんのご講演の前（13:30-15:30）に，同じ場所で ToPS セミナーが開催されます．そちらにも是非どうぞ！http://takeichi.ipl-lab.org/~tops/upcoming_seminar.h… Prior to Dr. Nakata’s talk there will be a “ToPS seminar” at the same location. The talks will be of similar research interests. http://takeichi.ipl-lab.org/~tops/upcoming_seminar.html Talk 1: Proving open induction using delimited control operators Open Induction (OI) is a principle classically equivalent to Dependent Choice, which is, unlike the later, closed under double-negation translation and A-translation. In the context of Constructive Reverse Mathematics, Wim Veldman has shown that, in presence of Markov's Principle, OI on Cantor space is equivalent to Double-negation Shift (DNS). With Danko Ilik, we have reworked Veldman's proof to give a constructive proof of OI, where DNS is interpreted using delimited control operators. Joint work with Danko Ilik. Talk 2: Walking through infinite trees with mixed induction and coinduction: A Proof Pearl with the Fan Theorem and Bar Induction. We study temporal properties over infinite binary red-blue trees in the setting of constructive type theory. We consider several familiar path-based properties, typical to linear-time and branching-time temporal logics like LTL and CTL*, and the corresponding tree-based properties, in the spirit of the modal mu-calculus. We conduct a systematic study of the relationships of the path-based and tree-based versions of ``eventually always blueness '' and mixed inductive-coinductive ``almost always blueness'' and arrive at a diagram relating these properties to each other in terms of implications that hold either unconditionally or under specific assumptions (Weak Continuity for Numbers, the Fan Theorem, Lesser Principle of Omniscience, Bar Induction). Joint work with Marc Bezem and Tarmo Uustalu.

1 0

講演のお知らせ
by minami＠kurt.cla.kobe-u.ac.jp 12 Dec '12

12 Dec '12

皆様，重複してお受け取りの際はご容赦ください。以下の要領で名古屋数学基礎論/集合論セミナーを開催します．興味のある方は是非参加を検討ください．日時：12月14日（金）15：30〜場所：場所：名古屋大学情報科学（研究科）棟1階105 講演者：嘉田勝（大阪府立大学）講演タイトル：強制拡大で位相空間の性質は保存されるか位相空間論の未解決問題に集合論的手法でアプローチするうえで、「強制拡大で位相空間の性質が保存されるか否か」が重要な鍵となることがある。ここで、位相空間の性質の保存とは、基底モデルに属する位相空間に対して、その強制拡大における対応物として「同一の点集合と開基で定まる位相空間」を考えるときに、基底モデルでみたされる空間の性質が強制拡大でもみたされることを意味するものとする。本講演では、半順序がみたす性質と、その半順序による強制拡大で保存される位相空間の性質との関係について、いくつかの結果を紹介する。 ================================================= アクセス：地下鉄名城線名古屋大学駅から徒歩5〜10分． http://www.nagoya-u.ac.jp/global-info/access-map/higashiyama/index.html http://www.is.nagoya-u.ac.jp/intro/contact.html この講演に関する情報は以下のHPでもご覧になれます． http://researchmap.jp/cardinal_invariants/research-blog/

1 0

Kobe Colloquium on Logic, Statistics and Informatics, Dec. 10 (David Aspero)
by Joerg Brendle 07 Dec '12

07 Dec '12

Kobe Colloquium on Logic, Statistics and Informatics 以下の要領でコロキウムを開催します。日時：2012年12月10日（月）13:20-14:50 場所：神戸大学自然科学総合研究棟3号館4階421室（プレゼンテーション室）講演者：David Aspero (Technische Universitaet Wien, Austria) ======================================================================== 題目：Some set theory with restricted choice アブストラクト：I am planning to present the proofs of three theorems involving set theory without the Axiom of Choice or with just restricted forms of AC. One is an observation of mine concerning very large cardinals in a ZF context, another one is a result from a paper by P. Larson and Shelah, and another one a result of Shelah from [Sh835]. ======================================================================== 交通：阪急六甲駅またはJR六甲道駅から神戸市バス36系統「鶴甲団地」行きに乗車，「神大本部工学部前」停留所下車，徒歩すぐ． http://www.kobe-u.ac.jp/info/access/rokko/rokkodai-dai2.htm 連絡先：ブレンドレヨーグ brendle(a)kurt.scitec.kobe-u.ac.jp

1 0

Post-doc position available at AIST Kansai: Test generation/optimization
by Takashi KITAMURA 05 Dec '12

05 Dec '12

みなさま、こんにちは。産総研の北村崇師と申します。本研究所の Cyrille Artho に代わり、ポスドク募集のご案内させて頂きます。応募のご検討、及び、関係各位へのご周知をいただけますと幸いです。 ==================================================== Post-doc position available at AIST Kansai: Test generation/optimization ==================================================== Research related to: • Test generation using model-based testing/constraint solving. • Test case minimization using heuristics like delta debugging. Start: 2013 (ideally April, but can be adjusted). Duration: 1 year (extensible dep. on evaluation and restrictions below). • Location: AIST Amagasaki, Japan (20 minutes from Osaka); Research Institute for Secure Systems, System Life-cycle Group. http://www.risec.aist.go.jp/ • Requirements: – Ph.D.at the time when the contract starts; degree must have been awarded less than 7 years ago. – Strong know-how in software analysis and algorithms. – Experience with Java or Scala, and C. – Good written and spoken communication in English. • If interested, please submit your résumé with your publications and a list software projects in which you have participated. • Contact:c.artho@aist.go.jp -- Takashi KITAMURA t.kitamura(a)aist.go.jp, http://staff.aist.go.jp/t.kitamura/ Research Institute for Secure Systems (RISEC) National Institute of Advanced Industrial Science and Technology (AIST)

1 0

55th Tokyo Programming Seminar (Dec 18)
by Kazuyuki ASADA 05 Dec '12

05 Dec '12

[Apologies for multiple copies] Dear all, I am pleased to announce the 55th Tokyo Programming Seminar, which will be held at NII on December 18th (Tue). Oleg Kiselyov Non-deterministic choice in a conventional programming language: Enough for logic programming? Hugo Pacheco Bidirectional Data Transformation by Calculation A detailed program is attached below. I'm looking forward to meeting you at the seminar. Best regards, Kazuyuki Asada ---- The 55th ToPS http://takeichi.ipl-lab.org/~tops/upcoming_seminar.html Time: December 18th (Tue) 2012, 13:30--15:30 Place: Rm. 1208, 12F, National Institute of Informatics Speaker: 1. Oleg Kiselyov Non-deterministic choice in a conventional programming language: Enough for logic programming? Abstract: Logic programming is a fascinating approach, especially for AI and natural language processing. It is greatly appealing to declaratively state the properties of the problem and let the system find the solution. Most intriguing is the ability to run programs `forwards' and `backwards'. However, the built-in search methods of logic programming systems don't fit all problems and hardly if at all customizable. Mainly, quite many computations and models are mostly deterministic. Implementing them in a logic programming language is significantly inefficient and requires extensive use of problematic features such as cut. Another problem is interfacing logic programs with mainstream language libraries: if mode analysis is not available (as is often the case), one has to live with run-time instantiatedness errors. An alternative to logic programming, where non-determinism is default, is a deterministic programming system (such as Scheme, OCaml, Scala or Haskell -- or even C) with (probabilistic) non-determinism as an option. Is this a good alternative? We explore this question. We will use Hansei -- a probabilistic programming system implemented as a library in OCaml -- to solve a number of classic logic programming problems, from zebra to scheduling, to parser combinators, to reversible type checking. http://okmij.org/ftp/kakuritu/logic-programming.html 2. Hugo Pacheco Bidirectional Data Transformation by Calculation Abstract: The advent of bidirectional programming, in recent years, has led to the development of a vast number of approaches from various computer science disciplines. These are often based on domain-specific languages in which a program can be read both as a forward and a backward transformation that satisfy some desirable consistency properties. Despite the high demand and recognized potential of intrinsically bidirectional languages, they have still not matured to the point of mainstream adoption. We contemplate some usually disregarded features of bidirectional transformation languages that are vital for deployment at a larger scale. The first concerns efficiency. Most of these languages provide a rich set of primitive combinators that can be composed to build more sophisticated transformations. Although convenient, such compositional languages are plagued by inefficiency and their optimization is mandatory for a serious application. The second relates to configurability. As update translation is inherently ambiguous, users shall be allowed to control the choice of a suitable strategy. The third regards genericity. Writing a bidirectional transformation typically implies describing the concrete steps that convert values in a source schema to values a target schema, making it impractical to express very complex transformations, and practical tools shall support concise and generic coding patterns.

1 0

RTA 2013: Second Call for Papers
by Nao Hirokawa 04 Dec '12

04 Dec '12

皆様 RTA 2013 の論文募集をご案内致します。今回の RTA はオランダ Eindhoven で行われ、TLCA 2013 との共催となっています。ぜひ投稿をご検討下さい。廣川　直 (JAIST) ************************************************************************* RTA 2013: SECOND CALL FOR PAPERS 24th International Conference on Rewriting Techniques and Applications June 24 - 26, 2013 Eindhoven, The Netherlands collocated with TLCA 2013 as part of RDP 2013 http://rta2013.few.vu.nl/ ************************************************************************* abstract submission February 1 2013 paper submission February 5 2013 rebuttal period March 18-21 2013 notification April 4 2013 final version April 26 2013 ************************************************************************* The 24th International Conference on Rewriting Techniques and Applications (RTA 2013) is organized as part of the Federated Conference on Rewriting, Deduction, and Programming (RDP 2013), together with the 11th International Conference on Typed Lambda Calculi and Applications (TLCA 2013), and several workshops. RDP 2013 will be held at the Eindhoven University of Technology in the Netherlands. *** INVITED SPEAKERS (NEW) *** - Simon Peyton-Jones (Microsoft Research, UK) joint invited speaker for TLCA+RTA 2013 - Jarkko Kari (University of Turku, Finland) invited speaker for RTA 2013 - Mitsu Okada (Keio University, Japan) invited speaker for RTA 2013 *** TOPICS OF INTEREST *** RTA is the major forum for the presentation of research on all aspects of rewriting. Typical areas of interest include (but are not limited to): Applications: case studies; analysis of cryptographic protocols; rule-based (functional and logic) programming; symbolic and algebraic computation; SMT solving; theorem proving; system synthesis and verification; proof checking; reasoning about programming languages and logics; program transformation; XML queries and transformations; systems biology; homotopy theory; implicit computational complexity; Foundations: equational logic; universal algebra; rewriting logic; rewriting models of programs; matching and unification; narrowing; completion techniques; strategies; rewriting calculi; constraint solving; tree automata; termination; complexity; modularity; Frameworks: string, term, and graph rewriting; lambda-calculus and higher-order rewriting; constrained rewriting/deduction; categorical and infinitary rewriting; stochastic rewriting; net rewriting; binding techniques; Petri nets; higher-dimensional rewriting; Implementation: implementation techniques; parallel execution; rewrite and completion tools; certification of rewriting properties; abstract machines; explicit substitutions; automated (non)termination and confluence provers; automated complexity analysis. *** PUBLICATION *** The proceedings will be published by LIPIcs (Leibniz International Proceedings in Informatics). LIPIcs is open access, meaning that publications will be available online and free of charge, and authors keep the copyright for their papers. LIPIcs publications are indexed in DBLP. For more information about LIPIcs please consult: <http://www.dagstuhl.de/en/publications/lipics> *** SUBMISSION GUIDELINES *** Submissions must be - original and not submitted for publication elsewhere, - written in English, - a research paper, or a problem set, or a system description, - in pdf prepared with pdflatex using the LIPIcs stylefile: <http://drops.dagstuhl.de/styles/lipics/lipics-authors.tgz>, - at most 10 pages for system description, at most 15 pages for the other two types of submissions - submitted electronically through the EasyChair system at: <https://www.easychair.org/conferences/?conf=rta2013>. The page limit and the deadline for submission are strict. Additional material for instance proof details, may be given in an appendix which is not subject to the page limit. However, submissions must be self-contained within the respective page limit; reading the appendix should not be necessary to assess the merits of a submission. *** PROGRAMME COMMITTEE CHAIR *** Femke van Raamsdonk (VU University Amsterdam, The Netherlands) *** PROGRAMME COMMITTEE *** Eduardo Bonelli National University of Quilmes, Argentina Byron Cook Microsoft Research Cambridge, UK Stephanie Delaune ENS Cachan, France Gilles Dowek Inria Paris-Rocquencourt, France Maribel Fernandez King's College London, UK Nao Hirokawa JAIST Ishikawa, Japan Delia Kesner University Paris-Diderot, France Helene Kirchner Inria Paris-Rocquencourt, France Barbara Koenig University Duisburg Essen, Germany Temur Kutsia Johannes Kepler University Linz, Austria Aart Middeldorp University of Innsbruck, Austria Vincent van Oostrom Utrecht University, The Netherlands Femke van Raamsdonk VU University Amsterdam, The Netherlands Kristoffer Rose IBM Research New York, USA Manfred Schmidt-Schauss Goethe University Frankfurt, Germany Peter Selinger Dalhousie University, Canada Paula Severi University of Leicester, UK Aaron Stump The University of Iowa, USA Tarmo Uustalu Institute of Cybernetics Tallinn, Estonia Roel de Vrijer VU University Amsterdam, The Netherlands Johannes Waldmann HTWK Leipzig, Germany Hans Zantema Eindhoven University of Technology, The Netherlands *** CONFERENCE CHAIR *** Hans Zantema (Eindhoven University of Technology, The Netherlands) *** STEERING COMMITTEE *** Mauricio Ayala-Rincon Brasilia University, Brasilia Frederic Blanqui INRIA Tsinghua University Beijing, China Salvador Lucas Technical University of Valencia, Spain Georg Moser (chair) University of Innsbruck, Austria Masahiko Sakai Nagoya University, Japan Sophie Tison University of Lille, France *** FURTHER INFORMATION *** Questions related to submission, reviewing, and programme should be sent to the programme committee chair Femke van Raamsdonk, email femke at few.vu.nl.

1 0

Talk by Keiko Nakata (Tallinn University of Technology), Tue 18 December 2012
by Ichiro Hasuo 03 Dec '12

03 Dec '12

みなさま，東京大学の蓮尾と申します．来る12月18日，タリン工科大学の中田景子さんをお迎えしてご講演いただきます．（2題，連続講演です）詳細は以下です．ご興味のある方はぜひお越しください！蓮尾一郎 http://www-mmm.is.s.u-tokyo.ac.jp/ -------------------------------------------------------------------------------------------------------------- Tue 18 December 2012, 16:40-18:10 Keiko Nakata (Tallinn University of Technology), 2 titles 理学部7号館1階 102教室 Room 102, School of Science Bldg. No. 7 Title Proving open induction using delimited control operators Abstract Open Induction (OI) is a principle classically equivalent to Dependent Choice, which is, unlike the later, closed under double-negation translation and A-translation. In the context of Constructive Reverse Mathematics, Wim Veldman has shown that, in presence of Markov's Principle, OI on Cantor space is equivalent to Double-negation Shift (DNS). With Danko Ilik, we have reworked Veldman's proof to give a constructive proof of OI, where DNS is interpreted using delimited control operators. Joint work with Danko Ilik. --- Title Walking through infinite trees with mixed induction and coinduction: A Proof Pearl with the Fan Theorem and Bar Induction. Abstract We study temporal properties over infinite binary red-blue trees in the setting of constructive type theory. We consider several familiar path-based properties, typical to linear-time and branching-time temporal logics like LTL and CTL*, and the corresponding tree-based properties, in the spirit of the modal mu-calculus. We conduct a systematic study of the relationships of the path-based and tree-based versions of ``eventually always blueness '' and mixed inductive-coinductive ``almost always blueness'' and arrive at a diagram relating these properties to each other in terms of implications that hold either unconditionally or under specific assumptions (Weak Continuity for Numbers, the Fan Theorem, Lesser Principle of Omniscience, Bar Induction). Joint work with Marc Bezem and Tarmo Uustalu.

1 0

PPL2013論文募集
by Shinya Katsumata 01 Dec '12

01 Dec '12

（重複の場合はご容赦ください．）東京工業大学の権藤と京都大学の勝股と申します．来年3月に福島県会津若松東山温泉で開催される第15回プログラミングおよびプログラミング言語ワークショップ (PPL2013) のご案内（2回目）です．みなさまのご投稿，ご参加をお待ちしております．論文投稿・発表申込方法の詳細と招待講演者の情報を追加いたしました．カテゴリ1はeasy chairを通して，カテゴリ2, 3は下記投稿用メールアドレスまでお申込ください． -------------------------------------------------------------------------- 第15回プログラミングおよびプログラミング言語ワークショップ（PPL2013） http://www.pllab.riec.tohoku.ac.jp/ppl2013/ 論文募集主催: 日本ソフトウェア科学会プログラミング論研究会日程: 2013年3月4日(月)〜3月6日(水) 会場: 福島県会津若松東山温泉「御宿東鳳」http://www.onyado-toho.co.jp/ PPL2013は，プログラミングおよびプログラミング言語に関する研究者が一堂に会し，最新の研究成果の発表，および新たな研究課題についての討論やアイディア交換等を行うことを目的とした，合宿形式のワークショップです．プログラミングおよびプログラミング言語の理論・設計・実装・処理系などに関する研究発表を，カテゴリ別に幅広く募集します．カテゴリ１: 国内外で未発表の論文の発表カテゴリ２: 国際会議・学術雑誌等で既発表であるが，国内では未発表の研究の紹介カテゴリ３: ポスター・デモ発表（既発表・未発表の別を問いません） ※ショートプレゼンテーションは行いませんカテゴリ１の採択論文の中から，特に独創的なアイディアや顕著な成果を含むものに対して論文賞を授与する予定です．また，ポスター・デモを含む全発表のなかから，聴衆の投票により，最も優秀なプレゼンテーションに発表賞（一般の部，学生の部）を授与する予定です．カテゴリ１（国内外未発表論文） ------------------------------ 完成した理論やシステムの研究発表のみならず，萌芽的なアイディアや問題点の提示等も歓迎します．発展途上の研究内容も積極的に採録する方針です（ただし，PPLでの発表として相応しくないと判断される場合は，この限りではありません）．また，カテゴリ1で発表された研究については，会場での討議や査読コメントをもとにその完成度を高め，将来の学術雑誌・会議等での業績に結び付けることを奨励しています．そのため，予稿集の配布は参加者のみへの限定的なものとする予定です．採録された論文は，PPL2013参加者に配布される予稿集に掲載され，参加者のみがアクセス可能な形でWEB上で公開されます（論文へのリンク集ページを作成し，閲覧に必要なパスワードを参加者に連絡します）．カテゴリ１で発表された研究のうち，PPL2013プログラム委員会として優れていると認めるものは，PPL2013終了後（2013年4月下旬予定），「コンピュータソフトウェア」誌PPL2013推薦論文としての投稿が可能です．推薦論文は，PPL プログラム委員が引き続き査読を行うことによる，迅速な査読プロセスを特長としています．カテゴリ２（国外既発表論文） ---------------------------- 査読付の国際会議または学術雑誌等で既発表であるが，国内では未発表な研究の紹介をする場です．採録決定済みの研究も含みます．PPLへの関連をもとに採録を判定いたします．カテゴリ３（ポスター・デモ発表） ------------------------------------------ ２時間程度のセッション内でのポスター発表またはデモ発表です．既発表・未発表の別を問いません．PPLへの関連をもとに採録を判定いたします．また，申込多数の場合は抽選によって採否を決定する可能性があります．なお，PPL2013 ではポスターやデモによる活発な意見交換を促進したいという観点から，ショートプレゼンテーションのセッションは設けません．招待講演 -------- 鍋島英知 (山梨大学) 村主崇行 (京都大学) 以上のお二方の招待講演を予定しています． ====================================================================== 投稿・発表申込要領３つのカテゴリそれぞれに対して，投稿は以下のように行って下さい．最新の情報は上記Webページでご確認下さい．カテゴリ１（国内外未発表論文） ------------------------------ 投稿手続きは二段階です．発表申込を行った上で論文提出を行って下さい．発表申込先： https://www.easychair.org/conferences/?conf=ppl2013 発表申込締切：2012年12月21日(金) 17:00 (JST) 著者名，所属，論文タイトル，論文概要（日本語300〜400字程度もしくは英語200 words程度）を提出してください．論文提出締切：2013年1月11日(金) 17:00 (JST) 10ページ程度（最大15ページ）の論文（英語もしくは日本語，PDF形式）を提出して下さい．採否通知：2013年2月4日(月) 最終原稿提出締切：2013年2月15日(金) 17:00 (JST) 採録された論文の最終原稿の提出方法は，採否通知にてお知らせいたします． (注) カテゴリ１への投稿論文と類似の論文を，他の会議（予稿集を出版するもの）・論文誌などに同時投稿する場合は，査読の有無に関わらず，その旨を発表申込および論文提出の際に明記して下さい．PPLでは同時投稿の事実のみをもって論文を不採録とすることはありませんが，採否の決定に利用する場合があります（他の会議との重複を避けるため，発表内容についての条件付採録とすることもあります）．カテゴリ２（国外既発表論文） ---------------------------- 昨年同様，カテゴリ2の申込締切が少し早くなっていますのでご注意ください．発表申込時に採録が決定している国際会議または学術雑誌等の発表論文が対象です．理論系だけではなく実装系の論文の投稿も歓迎いたします．発表申込先： submit-ppl2013 [at] kurims.kyoto-u.ac.jp （[at]を@に置き換えて下さい）発表申込締切：2013年1月23日(水) 17:00 (JST) 原論文（ページ数不問，PDF形式）とabstract（テキスト形式）を，著者名，所属，論文タイトル，原論文の出典（発表会議名，掲載済／予定の別等）と併せて上記申込先宛にお送り下さい．採否通知：2013年2月4日(月) 最終原稿提出締切：2013年2月15日(金) 17:00 (JST) カテゴリ３（ポスター・デモ発表） ------------------------------------------ ポスター・デモの区別を行なわずに募集いたします．デモを行なう場合は，発表概要においてその旨をご説明ください．発表申込先： submit-ppl2013 [at] kurims.kyoto-u.ac.jp （[at]を@に置き換えて下さい）発表申込締切：2013年2月6日(水) 17:00 (JST) 著者名，所属，発表タイトル，発表概要（200〜300字程度），希望する発表形態（ポスター・デモの別），をテキスト形式で上記申込先宛にお送り下さい．採否通知：2013年2月15日(金) 問い合わせ先：oc-ppl2013 [at] kurims.kyoto-u.ac.jp （[at]を@に置き換えて下さい） ====================================================================== プログラム委員会青木利晃 (北陸先端科学技術大学院大学) 青谷知幸 (北陸先端科学技術大学院大学) 天野俊一 (IBM東京基礎研究所) 磯部祥尚 (産業技術総合研究所) 岩見宗弘 (島根大学) 角谷良彦 (東京大学) 勝股審也 (京都大学) [プログラム共同委員長] 小宮常康 (電気通信大学) 権藤克彦 (東京工業大学) [プログラム共同委員長] 田浦健次朗 (東京大学) 高田喜朗 (高知工科大学) 田辺良則 (国立情報学研究所) 中田景子 (Institute of Cybernetics at Tallinn University of Technology) 中野圭介 (電気通信大学) 長谷部浩二 (筑波大学) 番原睦則 (神戸大学) 松崎公紀 (高知工科大学) 実行委員会上野雄大 (東北大学電気通信研究所) [実行委員長] 鵜川始陽 (電気通信大学) [実行副委員長] 勝股審也 (京都大学) [プログラム共同委員長] 権藤克彦 (東京工業大学) [プログラム共同委員長] --------------------------------------------------------------------------

1 0

Talk by Kazushige Terui (11:00-, 29 Nov)
by Shinya Katsumata 28 Nov '12

28 Nov '12

京都大学数理解析研究所の勝股です。 11月29日11:00から、当研究所の照井一成氏が以下の講演をいたしますので、ご連絡いたします。どうぞお気軽にお越しください。 ========== Time: 11:00-12:00, 29 Nov, 2012 Place: Rm 478, Research Building 2, Main Campus, Kyoto University http://www.kyoto-u.ac.jp/en/access/campus/main.htm (See 34) 京都大学本部構内総合研究2号館 4階478号室 http://www.kyoto-u.ac.jp/ja/access/campus/map6r_y.htm (34番の建物) Speaker: Kazushige Terui (RIMS, Kyoto University) Title: Herbrand's theorem via hypercanonical extensions Abstract: よく知られているエルブランの定理を代数的に捉えたい。そのために古典論理のみならず、部分構造論理一般について考える。（様相などの単調／反単調な演算子を追加してもよい。たとえば直観主義論理、単調様相論理、線形論理、ファジー論理など）。 Lをそのような命題論理とし、その最小述語拡大をQLとすると、QLについてエルブランの定理が成り立つための代数的十分条件として、Lに対応する代数のクラスがコンパクトな完備化について閉じていることが挙げられる。そのような完備化の代表例はストーン双対性に基づくものであり、その一般化は正準拡大（canonical extensions）と呼ばれ広く研究されている。しかし部分構造論理の観点から興味深い代数のクラスの多くは、正準拡大について閉じているかどうか定かではない。そこで本講演では、新たなコンパクト完備化として超正準拡大（hypercanonical extensions）を導入する。これは非古典論理証明論における「シークエント計算⇒超シークエント計算」という発想に基づいて正準拡大を一般化したものである。それによりゲーデル＝ダメット論理、monoidal t-norm logicをはじめとする多くの論理についてエルブランの定理が系統的に成り立つことを示す。（今年度MLGにおける講演と同内容）

1 0

【訂正】Computability Theory and Foundations of Mathematics (CTFM)
by Naohi Eguchi 26 Nov '12

26 Nov '12

Logic-ml の皆様，先日ご案内しました計算可能性，逆数学等に関する研究会 Computability Theory and Foundations of Mathematics (CTFM) (2013年2月18日(月)〜2月20日(水)，東京工業大学大岡山キャンパス) http://sendailogic.math.tohoku.ac.jp/CTFM/ につきまして，講演申し込み締め切りが2013年12月18日となっていましたが*2012年*12月18日(火)の誤りでした．訂正してお詫び申し上げます．江口直日　(CTFM プログラム委員) 問い合わせ先　CTFM(a)math.tohoku.ac.jp ============================================================ Computability Theory and Foundations of Mathematics (Tokyo Institute of Technology, Tokyo, Japan, February 18 - 20, 2013) http://sendailogic.math.tohoku.ac.jp/CTFM/ ============================================================ 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, Constructive Mathematics, Theory of Randomness and Computational Complexity Theory. This is a successor workshop to Workshop on Proof Theory and Computability Theory 2012 - Philosophical Frontiers in Reverse Mathematics (February 20 - 23, 2012, Tokyo, Japan). -------------------------------------------- Deadline of Submission for Presentations: December 18, 2013 /*2012*/ -------------------------------------------- Invited Speakers: Chi Tat Chong (National University of Singapore) Erik Palmgren (Stockholm University) Michael Rathjen (University of Leeds) Helmut Schwichtenberg (LMU Munich) Stephen G. Simpson (Pennsylvania State University) Yang Yue (National University of Singapore) Wu Guohua (Nanyang Technological University) -------------------------------------------- Programme Committee: Toshiyasu Arai (Chiba) Naohi Eguchi (Tohoku) Hajime Ishihara (JAIST) Ryo Kashima (Tokyo Institute of Technology) Sam Sanders (Ghent) Kazuyuki Tanaka (Tohoku, Co-chair) Andreas Weiermann (Ghent, Co-chair) Takeshi Yamazaki (Tohoku) Keita Yokoyama (Tokyo Institute of Technology) --------------------------------------------

1 0

Postdoc positions, Tokyo/Kyoto, Computation Theory
by Akitoshi Kawamura 26 Nov '12

26 Nov '12

皆様東京大学の河村と申しますメーリングリストをお借りして新学術領域研究「計算限界解明」（代表：渡辺治）の研究員の公募（締切12月20日）について御案内させて頂きます計算量理論の諸問題への挑戦を目標とする研究領域ですがウェブページにありますように数理論理学的手法も中心テーマの一つでございます国内外を問わず皆様の周りの方々に広くお知らせ頂ければ幸いです -- 河村彰星東京大学大学院情報理工学系研究科コンピュータ科学専攻　助教 http://www-imai.is.s.u-tokyo.ac.jp/~kawamura/index_j.html ％％％％％％％％％％％％％％％％％％％％％％％％％％％ポスドク募集文部科学省科学研究費補助金新学術領域研究　「多面的アプローチの統合による計算限界の解明」代表者：渡辺治 (東京工業大学） http://www.al.ics.saitama-u.ac.jp/elc/ では、下記のように4名の研究員を募集いたします。国際公募する予定で英語での文章しかございませんが、ご容赦下さい。よろしくお願いいたします。 --------------------------------------------------------------------- Two-year post-doctoral positions, Tokyo and Kyoto, Computation Theory --------------------------------------------------------------------- http://www.al.ics.saitama-u.ac.jp/elc/en/?pd The newly established Center for Exploring the Limits of Computation (CELC, Tokyo, Japan) seeks applications for four post-doctoral fellow positions in Computational Complexity Theory and related areas. The appointments are for two years starting in April 2013 (or as soon as possible). A monthly salary of approximately 350,000 Japanese yen plus a research allowance will be offered. Applicants should hold a PhD in theoretical computer science or related fields (or be expected to do so by July 2013). Two of the fellows will be based at the Tokyo site (Tokyo Institute of Technology and the CELC) and two at the Kyoto site (Kyoto University). Collaboration with other research groups of the ELC project (including visits for several months) will be encouraged and supported. Applications should include * a curriculum vitae, * list of publications, * a research statement, and * three letters of referees (to be sent directly from the referees). Applications and letters of referees should be sent via email to elc-pd-application(a)is.titech.ac.jp. Priority will be given to applications received by December 20, 2012. Applicants may be invited to an interview in early 2013 (the travel expenses will be covered). --------- About ELC --------- Exploring the Limits of Computation (ELC) is a five-year research project funded by the Japanese Ministry of Education, Culture, Sports, Science and Technology. Project Title (formal): A multifaceted approach toward understanding the limitations of computation Short Title: Exploring the Limits of Computation (ELC) Project Term: 2012.7 - 2017.3 Researchers have proposed various techniques for investigating the limits of computation, many of which have been sharpened in depth during the last two decades. We may soon be entering the stage of expecting some big breakthrough results toward understanding the limits of computation. In this project, we investigate these techniques and relationships among them with the goal of finding the next steps toward a big breakthrough. We propose the following three lines of research, each of which will be conducted by three core research groups (i.e., nine core research groups altogether). A. Team for pushing the current frontier of research on the limits of computation. B. Team for investigating the limits of computation by using various algorithmic/optimization techniques (even by using supercomputers). C. Team for introducing new approaches to and interpretations of the existing techniques for investigating the limits of computation. We also create a research center (CELC) in Tokyo for investigating computational complexity theory by stimulating worldwide collaborations among researchers based on our core research groups, hosting short/long term visitors and postdoctoral researchers, and organizing various meetings and workshops. We welcome researchers working on subjects related to computational complexity theory to join us for various occasions. Project webpage http://www.al.ics.saitama-u.ac.jp/elc/en/

1 0

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Logic-ml