Logic-ml October 2013

18 participants
25 discussions

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

31 Oct '13

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

1 0

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

30 Oct '13

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

1 0

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

29 Oct '13

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

1 0

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

26 Oct '13

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

1 0

JAIST Logic Seminar Series
by Hajime Ishihara 26 Oct '13

26 Oct '13

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

1 2

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

23 Oct '13

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

1 0

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

23 Oct '13

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

1 0

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

22 Oct '13

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

1 0

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

22 Oct '13

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

1 0

JAIST Logic Seminar Series
by Takako Nemoto 22 Oct '13

22 Oct '13

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

1 0

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Logic-ml October 2013