Home ƒZƒ~ƒi[ ’k˜b‰ï W’†u‹` Œ¤‹†W‰ï Œ¤‹†ŽÒÐ‰î ƒAƒNƒZƒX ƒLƒƒƒ“ƒpƒX

@ ƒZƒ~ƒi[î•ñ


@¡T‚̃Zƒ~ƒi[
@—ˆTˆÈ~‚̃Zƒ~ƒi[
@‰ß‹Ž‚Ì‹L˜^
@2010”N“x‚Ì‹L˜^

@ 2010”N@5ŒŽ3“úiŒŽj`5ŒŽ7“úi‹àj



  • 5ŒŽ3“úiŒŽj@
    ®”˜_ƒZƒ~ƒi[(‡“¯“801)
    ‹x‚ÝiŒ›–@‹L”O“új

  • 5ŒŽ6“ú(–Ø)
    ‰ž—p”ŠwƒZƒ~ƒi[@
    ‹x‚Ý

  • 5ŒŽ7“ú(‹à)
    13:30--
    ‘㔊ô‰½ŠwƒZƒ~ƒi[ (”Šw“208)@
    ¬“c@’‰—Y Ži“Œ–k‘å–¼—_‹³Žöj
    Finite graphs, crystal lattices and convex tilings

    15:30--16:30 ƒƒWƒbƒNƒZƒ~ƒi[@(‡“¯“1201)
    –x”¨ ‰ÀG Ž (“Œ–k‘åŠw‘åŠw‰@—ŠwŒ¤‹†‰È)
    Weak theories of concatenation and undecidability

    16:00--17:30 CRESTƒZƒ~ƒi[@(î•ñ‰ÈŠwŒ¤‹†“3ŠK¬‰ï‹cŽº)
    ™•ô@L–¾ Ži“Œ–k‘åŠw‘åŠw‰@—ŠwŒ¤‹†‰Èj
    ‹«ŠE‚É‹ì“®—Í‚ðŽ‚”r‘¼‰ß’ö‚Ì—¬‘Ì—ÍŠw‹ÉŒÀ‚Æ‘å•Î·Œ´—‚ÌЉîII



“Œ–k‘åŠw@@/@@—Šw•”E—ŠwŒ¤‹†‰È@@/@@î•ñ‰ÈŠwŒ¤‹†‰È@@/@@”ŠwêUŒ¤‹†Ž‘—¿Žº@@/@@‚¨–⇂¹