Kisoron-ml December 2014

2 participants
3 discussions

JAIST Logic Workshop Series 2015
by Hajime Ishihara 03 Feb '15

03 Feb '15

皆様来年3月に金沢で開催されるJAIST Logic Workshop Series 2015のお知らせです。ふるってご投稿・ご参加ください。問合せ先：石原　哉・木原貴行・根元多佳子・横山啓太北陸先端科学技術大学院大学情報科学研究科 e-mail: jlws2015(a)jaist.ac.jp -------------------------------------------------------- *Call for Abstracts* JAIST LOGIC WORKSHOP SERIES 2015 Constructivism and Computability 2 March 2015 – 6 March 2015 Shiinoki Cultural Complex, Kanazawa, Japan http://www.jaist.ac.jp/is/labs/ishihara-lab/jlws2015/ -------------------------------------------------------- IMPORTANT DATES November 30 - deadline for abstract submissions December 25 - notification of accepted contributions February 15 - deadline for registrations March 2-6 - Constructivism and Computability workshop TUTORIALS * Giovanni Sambin (University of Padova) * Hideki Tsuiki (Kyoto University) * Stanley Wainer (University of Leeds) INVITED SPEAKERS * Ulrich Berger (Swansea University) * Takayuki Kihara (JAIST) * Graham Leigh (Vienna University of Technology) * Michael Rathjen (University of Leeds) * Masahiko Sato (Kyoto University) * Makoto Tatsuta (National Institute of Informatics) PROGRAM COMMITTEE * Toshiyasu Arai (Chiba University) * Andrej Bauer (University of Ljubljana) * Ulrich Berger (Swansea University) * Hajime Ishihara (co-chair, JAIST) * Masahiro Kumabe (Open University of Japan) * Erik Palmgren (Stockholm University) * Peter Schuster (University of Leeds) * Helmut Schwichtenberg (co-chair, LMU Munich) * Dieter Spreen (University of Siegen, UNISA Pretoria) * Kazuyuki Tanaka (Tohoku University) SUBMISSIONS Submissions of short abstracts (1 page in PDF format) are accepted through easychair.org, see https://easychair.org/conferences/?conf=jlws2015 DESCRIPTION JAIST Logic Workshop Series is a workshop series bringing together researchers from mathematical logic and its application, especially to artificial intelligence and software science. Each workshop has its own focus on a specific area of research in mathematical logic and its application. Previous workshops have been held in Kanazawa 2013, 2014 and 2014: http://www.jaist.ac.jp/~hirokawa/pr2013/ http://www.jaist.ac.jp/~preining/wpp/ http://www.jaist.ac.jp/~v-sano/jw2014/index.html In 2015, JAIST Logic Workshop Series focuses on “Constructivism and Computability” aiming at interaction and knowledge transfer between constructive mathematics and computability theory. The workshop is held being affiliated with EU FP7 Marie Curie Actions IRSES projects COMPUTAL (http://computal.uni-trier.de/) and CORCON (http://corcon.net/), but is open to all researchers in the areas. SCOPE Constructive mathematics and computability, and related areas including but not limited to: intuitionistic logic and type theory, proof theory, constructive analysis and topology, program extraction from proofs, recursion theory, computable analysis and topology, classical/constructive reverse mathematics, algorithmic randomness, real number computation etc. LOCAL ORGANIZERS * Hajime Ishihara (JAIST) * Takayuki Kihara (JAIST) * Takako Nemoto (JAIST) * Keita Yokoyama (JAIST) The workshop is supported by: * Japan Advanced Institute of Science and Technology (JAIST) CO-LOCATED WORKSHOP * JSPS-NUS Joint Workshop in Mathematica Logic and Foundations of Mathematics (6-7 March 2015, at the same venue)

1 2

東大数理集中講義のお知らせ
by 渡辺純成 09 Dec '14

09 Dec '14

基礎論歴史分科会MLの皆様、東京学芸大の渡辺純成です。数学史を主題とする集中講義（東京大数理科学研究科）のお知らせです。入試で忙しい時期になりますが、皆様、お誘い合わせの上、お出で下さい。なお、広くお知らせするために複数のメーリングリストに投稿しておりますが、重複して受け取られた方々にはご海容いただけますと幸いです。 ────2014年11月13日　渡辺純成 ============= 講師：中根美知代氏（日本大学理工学研究所）期日：2015 年 1 月 5 日（月）から 9 日（金）まで時間：１４時５０分から１６時５０分まで場所：東京大学大学院数理科学研究科（駒場）１２３講義室題名：解析学への歴史の試み：「代数解析」の新系譜概要：「解析」という語は、古代ギリシアから導入されているが、時代とともに、その意味が異なっている。「代数解析」で示される事柄も、近代・18世紀・19 世紀・現代では大きく変化している。この言葉を手がかりに、今日、「解析学」と呼ばれている分野が形成されていく過程を部分的に明らかにする。古代から18世紀までの「解析」の変化を概観して歴史の流れを掴んだ上で、19世紀の数学者たちの原論文を参照しながら、実際に理論が作られていく過程を見ていく。自分で数学史に取り組んでみようとするときに有用な、基礎的な知識もあわせて紹介していきたい。以下のような順序ですすめていく。 1．代数解析前史　古代ギリシアの解析・イスラームの「代数＝解析」との捉え方 2. 代数解析から無限小解析へ　Viète・Descartesによる代数＝解析の捉え方　17-18世紀における無限小解析の形成 3．教科としての「代数解析」　Euler の『無限解析序説』・Lagrange が名づけた「代数解析」　Cauchyが「代数解析」で講義したもの 4. 今日の微積分学の起源　Cauchyの教科書の成果と限界 Cauchyの不備はどのように乗り越えられたかエピローグ：Euler　と「今日の代数解析」

2 2

The 49th MLG Meeting: Program
by Katsuhiko Sano 01 Dec '14

01 Dec '14

$BBh(B49$B2s(B MLG $B?tM}O@M}3X8&5f=82q$N$40FFb(B $B!J=EJ#$7$F$*<u$1<h$j$N:]$O$4MF<O$/$@$5$$!#!K(B $BKLN&@hC<2J3X5;=QBg3X1!Bg3X$N:4Ln>!I'$G$9!#(B 2014$BG/EY(BMLG$B?tM}O@M}3X8&5f=82q!JBh(B49$B2s!K$r2<5-$NMWNN$G3+:E$7$^$9!#(B $B9V1i!&=IGq$N?=$79~$_$ODy$a@Z$j$^$7$?$,!$;22C$9$k$3$H$O2DG=$G$9!#(B $B$=$N>l9g!";22C?M?t$N4X78$G!$G0$N$?$a;d$^$G%a!<%k$G$40lJs$/$@$5$$(B $B!J;22CHq!J2q>lBe!K(B3000$B1_$r$$$?$@$/M=Dj$G$*$j$^$9!K!#(B $B$I$&$>$h$m$7$/$*4j$$$$$?$7$^$9!#(B ========================================= $BBh(B49$B2s(B MLG $B?tM}O@M}3X8&5f=82q3+:EMWNN(B ========================================= $B4|4V(B: 2014 $BG/(B 12 $B7n(B 5 $BF|(B($B6b(B) $B!A(B 12 $B7n(B 7 $BF|(B($BF|(B) $B>l=j(B: $B;3Cf29@t2O</Aq%m%$%d%k%[%F%k!J(BJR$B2C2l29@t1X$+$i<V$GLs(B20$BJ,!$2C2l29@t1X$+$iAw7^$"$j!K(B $B")(B922-0126 $B@P@n8)2C2l;T;3Cf29@t2O</D.%[(B100, URL : http://www.daiwaresort.jp/kajikasou/ $B%[!<%`%Z!<%8!'(Bhttps://sites.google.com/site/mlg2014kaga/ $B9V1i%W%m%0%i%`!'(B 12/5 (Fri) 1315--1325 $B3+2q(B (opening) 1325--1400 $B;3yu(B $B<S5*;R(B ($B<sETBg3XEl5~(B), Constructive Embedding from Logics of Strict Implication to Modal Logics via Cut-free and complete Labelled Sequent Calculus 1400--1435 $B6b;R(B $B<i(B ($BAa0pEDBg3X(B), Game Theoretic Decidability and Undecidability 1435--1510 $B4X(B $BN49((B ($B?73cBg3X(B), A Note on American Plan Semantics of Relevant Modal Logics 1530--1605 $B0KF#(B [email protected]'(B (JAIST), A relationship between classical and intuitionistic linear logic 1605--1640 $B>>ED(B $BD>M4(B ($BEl5~9)6HBg3X(B), Intuitionistic tree sequent calculus and intuitionistic lambda rho calculus 1640--1715 $BNkLZ(B $B?.9T(B ($B@E2,Bg3X(B), Two weak variants of existence property in intermediate predicate logics 12/6 (Sat) 0930--1005 $B2#9B(B $B63J?(B ($BF|K\Bg3X(B), $BCf4VO@M}$NItJ,BN7O$H$=$NJ]B83HBg$K$D$$$F(B 1005--1040 PREINING Norbert (JAIST), Separating intermediate predicate logics of well-founded and dually well-founded structures by monadic sentences 1100--1135 $B6bBt(B $B@?(B ($B9qN)>pJs3X8&5f=j(B), Toward a Logic of Cumulative Quantification 1135--1210 $B2#;3(B $B7<B@(B (JAIST), What is needed to characterize the natural number system? 1340--1415 $BEDCf(B $B5A?M(B ($B6e=#;:6HBg3X(B), Algebraic models for description logics 1415--1450 Jonni Virtema (JAIST), Tableau calculi for propositional dependence logics 1450--1510 $B:4!9LZ(B $B9nL&(B ($BFn;3Bg3X(B), The exact K4-models constructed from the exact S4-models 1530--1605 $BLnB<(B $B>0?7(B (JAIST), Revising a Labelled Sequent Calculus for Public Announcement Logic 1605--1640 $B5HB<(B $BOB?M(B (JAIST), A general analysis on proof structures 1900-- $B:)?F2q(B (Conference dinner) 12/7 (Sun) 0930--1005 $B2-:d(B $B>MJ?(B ($BElKLBg3X(B), Lindstrom extension on finite models 1005--1040 $B2CF#(B $BH%(B ($BEl5~9)6HBg3X(B), $BM-8B%U%l!<%`$K$*$1$kMMAjO@M}<0$N(Bvalidity$B$H7W;;NL$K$D$$$F(B 1100--1135 $BsnF#(B $B?.?C(B ($BEl5~9)6HBg3X(B), lambda-mu-calculus $B$N?d0\N'$N=|5n(B 1135--1210 $B:4F#(B $B2mI'(B ($B5~ETBg3XL>M@65<x(B), A name-free lambda-calculus 1210--1220 Closing --- MLG49 $B@$OC?M(B $B:4Ln>!I'!JKLN&@hC<2J3X5;=QBg3X1!Bg3X!K(B E-mail : mlg.logic.japan(a)gmail.com / katsuhiko.sano(a)gmail.com

1 0

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Kisoron-ml December 2014