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

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

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Logic-ml