Logic-ml January 2013

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

12 participants
15 discussions

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

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 Masahiro Kumabe 31 Jan '13

31 Jan '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 17 Jan '13

17 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

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Logic-ml January 2013