Logic-ml

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

1792 discussions

JAIST Logic Seminar Series (6th Oct. 2015 by Hsing-chien Tsai)
by Katsuhiko Sano 19 Sep '15

19 Sep '15

皆様 National Chung-Cheng UniversityのHsing-chien Tsai先生の講演のお知らせです。どうぞふるってご参加ください。問合せ先：佐野勝彦北陸先端科学技術大学院大学情報科学研究科 e-mail: v-sano(a)jaist.ac.jp ------------------------------ * JAIST Logic Seminar Series * Date and Time: Tuesday, 6th October 2015, 15:30--17:00 Title: On Some General Methods of Proving Decidability or Undecidability Place: Collaboration room No.7, 5th floor of IS building No. 3, JAIST (Access: http://www.jaist.ac.jp/english/location/access.html) Speaker: Hsing-chien Tsai (Department of Philosophy, National Chung-Cheng University) Abstract: This talk will first introduce some useful general methods of proving the decidability or the undecidability of a first-order logical theory, and then will show some applications of those methods. The methods to be looked into are heavily involved with checking whether or not two models (or two classes of models) stand in certain relations. Here the two most-checked relations between two models are back-and-forth equivalence and definability (that is, defining one into another). In this light, this talk will also briefly discuss some general theorems concerning the two aforementioned model theoretical relations. -- Katsuhiko Sano School of Information Science Japan Advanced Institute of Science and Technology IS building No.1 7F, 1-1 Asahidai, Nomi, Ishikawa, 923-1292, Japan

1 0

証明論研究集会 & SLACS のご案内
by Toshihiko Kurata 17 Sep '15

17 Sep '15

皆様， 2015年度の「証明論研究集会」と「記号論理と情報科学研究集会（SLACS）」について，合同開催の案内をメイルさせて頂きます．どちらの研究集会も数理論理学，計算の理論，情報科学などの理論・応用に関係する様々な話題が発表されていて研究者・学生の貴重な相互交流の場となっています．完成された研究のみならず発展途上の話題も大歓迎ですので，気軽に講演・参加を御検討下さい．開催日：2015年12月14日（月）〜16日（水）場所：南山大学名古屋キャンパスS棟(教室棟)7階S74教室世話役：佐々木克巳（南山大学）倉田俊彦（法政大学）詳細はHP https://sites.google.com/site/ptslacs2015/ をご覧頂けたらと思います．講演を希望される方は，御手数ですが ------------------------------------- 題目講演者名所属 e-mail アドレス概要講演時間懇親会参加希望その他の希望（講演日など） ------------------------------------- を pt.slacs2015(a)gmail.com までメイル下さい．申込期限は12月04日（金）とします．それでは，よろしくお願いいたします． -- Toshihiko Kurata, Hosei University e-mail: kurata(a)hosei.ac.jp

1 0

RIMS研究集会「モデル理論における独立概念と次元の研究」のご案内
by Hirotaka Kikyo 14 Sep '15

14 Sep '15

（重複して受け取られた場合はご容赦ください）下記の要領で、RIMS研究集会を開催いたします。モデル理論に関連する話題の研究集会です。モデル理論に関連するテーマでの発表を募集いたします。 Anand Pillay 教授、Byunghan Kim教授を含む数名の外国人がすでに参加を表明されてます。概要 RIMS研究集会「モデル理論における独立概念と次元の研究」日時：2015年12月14日月曜日午後〜2015年12月16日水曜日午前場所：京都大学数理解析研究所110教室研究代表者：桔梗宏孝　副代表：池田宏一郎数理研：http://www.kurims.kyoto-u.ac.jp/~kyodo/workshop-ja.html 集会ホームページ：https://sites.google.com/site/modeltheory2015/ 講演を希望される人は次の情報を代表者の桔梗までお知らせください。 (連絡先：kikyo(a)kobe-u.ac.jp) ----- (1)氏名 (2)所属 (3)職名/学年 (4)講演題目 (5)旅費援助の希望の有無 (6)参加日程 ------ 旅費の援助は原則として講演者に限らせていただきます。桔梗宏孝神戸大学大学院システム情報学研究科

1 0

数学基礎論若手の会2015のご案内
by kota takeuchi 14 Sep '15

14 Sep '15

（重複して受け取られた場合はご容赦ください）皆様筑波大学の竹内耕太と申します。2015年度の数学基礎論若手の会のお知らせをさせていただきます。皆様の周りに基礎論の勉強をされている学生や興味を持っておられる方がいらっしゃいましたらぜひお勧めしていただければ幸いです。また必ずしも若手ではない方の参加も歓迎しています。皆様のご参加をお待ちしています。 ---------------------------------------------------------------------------------------------------- 数学基礎論若手の会2015のご案内数学基礎論若手の会は，数学基礎論を専攻する学生および若手研究者の研究交流を目的とする合宿形式の研究集会です．講演はオリジナルの成果発表に限らず，研究の途中報告や研究内容の紹介など幅広く募集しています．また，これから数学基礎論を勉強したいと思っている方のご参加も歓迎します．多くの方のご参加・ご講演をお待ちしています．概要日時：2015年11月27日（金）午後 - 2015年11月29日（日）午前場所：筑波大学館山研修所（千葉県館山市）幹事：竹内耕太（筑波大学） E-mail：kota(a)math.tsukuba.ac.jp ウェブページ：http://www.math.tsukuba.ac.jp/~kota/wakate2015.html アクセス：東京から館山方面のバスにお乗りになるか、千葉駅からＪＲ内房線にて館山に行くことができます。詳細はウェブページをご確認ください。参加費用：宿泊料金：1人1泊2000円(相部屋) 食事料金：朝食500円、昼食700円、夕食900円（部分的な参加も可能です．懇親会の会費は別途（～1000円）いただく予定です．）参加申し込み：参加をご希望の方は，以下の情報を幹事の竹内（kota(a)math.tsukuba.ac.xn--jp)-u63b3a4a5b9eucvn0er468j. 申し込み締切：2015年11月6日(金) ---------------------------------------------------------------- (1)氏名： (2)所属： (3)職名/学年： (4)講演希望の有無（タイトルは後日でも可）: (5)研修施設での宿泊と食事の要/不要: 27日：宿泊・夕食 28日：宿泊・朝食・昼食・夕食 29日：朝食 (6)その他：ご質問, 部屋割り希望, 講演希望日など。 ---------------------------------------------------------------- 竹内耕太筑波大学数理物質系数学域

1 0

FLOPS2016 論文募集 (deadline extension)
by Yukiyoshi Kameyama 08 Sep '15

08 Sep '15

皆様、(重複して受け取られた場合は、御容赦ください。) 国際会議FLOPS2016 -- Functional and Logic Programming -- の論文募集(最終)をお送りします。投稿締切が延長され、9/25 (any time zone) となっています。 (abstract の締切は 9/21 (any time zone) です。) 論文投稿をよろしくおねがいします。 -- 亀山幸義 (筑波大学) http://logic.cs.tsukuba.ac.jp/~kam ------------------------------------------------------------------------------ NEW: revised submission deadlines (Sep 21 for abstracts, Sep 25 for papers) FLOPS 2016: March 3-6, 2016, Kochi, Japan Final Call For Papers http://www.info.kochi-tech.ac.jp/FLOPS2016/ Writing down detailed computational steps is not the only way of programming. The alternative, being used increasingly in practice, is to start by writing down the desired properties of the result. The computational steps are then (semi-)automatically derived from these higher-level specifications. Examples of this declarative style include functional and logic programming, program transformation and re-writing, and extracting programs from proofs of their correctness. FLOPS aims to bring together practitioners, researchers and implementors of the declarative programming, to discuss mutually interesting results and common problems: theoretical advances, their implementations in language systems and tools, and applications of these systems in practice. The scope includes all aspects of the design, semantics, theory, applications, implementations, and teaching of declarative programming. FLOPS specifically aims to promote cross-fertilization between theory and practice and among different styles of declarative programming. Scope FLOPS solicits original papers in all areas of the declarative programming: * functional, logic, functional-logic programming, re-writing systems, formal methods and model checking, program transformations and program refinements, developing programs with the help of theorem provers or SAT/SMT solvers; * foundations, language design, implementation issues (compilation techniques, memory management, run-time systems), applications and case studies. FLOPS promotes cross-fertilization among different styles of declarative programming. Therefore, submissions must be written to be understandable by the wide audience of declarative programmers and researchers. Submission of system descriptions and declarative pearls are especially encouraged. Submissions should fall into one of the following categories: * Regular research papers: they should describe new results and will be judged on originality, correctness, and significance. * System descriptions: they should contain a link to a working system and will be judged on originality, usefulness, and design. * Declarative pearls: new and excellent declarative programs or theories with illustrative applications. System descriptions and declarative pearls must be explicitly marked as such in the title. Submissions must be unpublished and not submitted for publication elsewhere. Work that already appeared in unpublished or informally published workshops proceedings may be submitted. See also ACM SIGPLAN Republication Policy. The proceedings will be published by Springer International Publishing in the Lecture Notes in Computer Science (LNCS) series, as a printed volume as well as online in the digital library SpringerLink. Post-proceedings: The authors of 4-7 best papers will be invited to submit the extended version of their FLOPS paper to a special issue of the journal Science of Computer Programming (SCP). Important dates Monday, September 21, 2015 (any time zone): Abstract Submission Friday, September 25, 2015 (any time zone): Submission deadline (FIRM) Monday, November 16, 2015: Author notification March 3-6, 2016: FLOPS Symposium March 7-9, 2016: PPL Workshop Invited Talks - Kazunori UEDA (Waseda University) The exciting time and hard-won lessons of the Fifth Generation Computer Project - Atze Dijkstra (Utrecht University) UHC: Coping with Compiler Complexity Submission Submissions must be written in English and can be up to 15 pages long including references, though pearls are typically shorter. The formatting has to conform to Springer's guidelines. Regular research papers should be supported by proofs and/or experimental results. In case of lack of space, this supporting information should be made accessible otherwise (e.g., a link to a Web page, or an appendix). Papers should be submitted electronically at https://easychair.org/conferences/?conf=flops2016 Program Committee Andreas Abel Gothenburg University, Sweden Lindsay Errington USA Makoto Hamana Gunma University, Japan Michael Hanus CAU Kiel, Germany Jacob Howe City University London, UK Makoto Kanazawa National Institute of Informatics, Japan Andy King University of Kent, UK (PC Co-Chair) Oleg Kiselyov Tohoku University, Japan (PC Co-Chair) Hsiang-Shang Ko National Institute of Informatics, Japan Julia Lawall Inria-Whisper, France Andres Loeh Well-Typed LLP, UK Anil Madhavapeddy Cambridge University, UK Jeff Polakow USA Marc Pouzet Ecole normale superieure, France Vitor Santos Costa Universidade do Porto, Portugal Tom Schrijvers KU Leuven, Belgium Zoltan Somogyi Australia Alwen Tiu Nanyang Technological University, Singapore Sam Tobin-Hochstadt Indiana University, USA Hongwei Xi Boston University, USA Neng-Fa Zhou CUNY Brooklyn College and Graduate Center, USA Organizers Andy King University of Kent, UK (PC Co-Chair) Oleg Kiselyov Tohoku University, Japan (PC Co-Chair) Yukiyoshi Kameyama University of Tsukuba, Japan (General Chair) Kiminori Matsuzaki Kochi University of Technology, Japan (Local Chair) flops2016 at logic.cs.tsukuba.ac dot jp

1 0

JAIST Logic Seminar Series
by Hajime Ishihara 05 Sep '15

05 Sep '15

皆様ジーゲン大学のDieter Spreen先生の講演のお知らせです。どうぞふるってご参加ください。問合せ先：石原　哉北陸先端科学技術大学院大学情報科学研究科 e-mail: ishihara(a)jaist.ac.jp ----------------------------------------------- * JAIST Logic Seminar Series * * This seminar is held as a part of JSPS Core-to-Core Program, A. Advanced Research Networks, and EU FP7 Marie Curie Actions IRSES project COMPUTAL (http://computal.uni-trier.de/). Date: Thursday 7 May, 2015, 13:30-15:00 Place: JAIST, Collaboration room 6 (I-57g) (Access: http://www.jaist.ac.jp/english/location/access.html) Speaker: Dieter Spreen (University of Siegen) Title: Digit Spaces - Topological Foundations Abstract: Digit spaces have been introduced by Ulrich Berger as a framework for extracting programs that deal with continuous data from formal proofs. The essential idea was to represent objects as streams of unary contractions on a complete metric space and to use coinduction on the logical side. In recent joint work on an extension of this approach to hyperspaces like the space of nonempty compact subsets of a digit space, it turned out that compact cannot be represented by such streams in general: instead one has to deal with infinite trees the nodes of which are labeled by contraction similar to the stream case. It was realized, however, that one will obtain a uniform theory, if the contractions, also called digits, are allowed to be multi-ary.

2 2

第33回量子情報技術研究会 (QIT33) のご案内
by Yasuhiro Takahashi 03 Sep '15

03 Sep '15

皆様，（重複して受け取られた場合はご容赦ください） NTT の高橋と申します．第33回量子情報技術研究会 (QIT33) の案内を転送させて頂きます．よろしくお願い致します． ---------------------------------------------------------- 第33回量子情報技術研究会(QIT33) 研究会の内容：　情報科学と量子力学を融合させた新しい分野，量子情報科学に関する研究会です．情報を担う物理系の量子力学的側面を積極的に活かした新しい情報処理原理の研究とそこから開かれる新しい学問体系の構築および新しい情報技術パラダイムの創生を目指して，情報科学，物理学，光エレクトロニクスを含む理学，工学，数理科学に携わる研究者間に自由な討論の場を提供し，この研究分野の発展を図ることを目的としています．　第33回研究会を下記のように開催いたします．現在この分野で活躍する研究者は勿論，自分の研究資産が何らかの形で使えそうだと予感している研究者・技術者など，広く関連する分野の研究者・技術者からの発表を募集致します．聴講のみの参加も歓迎致しますので，奮ってお申し込みください．日時: 2015年11月24日(火)-25日(水) 会場: NTT厚木研究開発センタ講堂　　（〒243-0198 神奈川県厚木市森の里若宮3-1）発表募集分野 (申し込み状況によっては査読の可能性あり) 　量子情報，量子計算，量子暗号など広く量子情報技術に関わる理論的研究，　実験的研究，計算機科学的研究，数学的研究，および，その他関連分野．チュートリアル・招待講演者　中村泰信 (東京大学) 　小芦雅斗（東京大学）　西村治道（名古屋大学）定員: 200名程度参加費: 事前振込み一般2,500円，学生1,000円　　　　　（当日会場払いは一般3,500円，学生2,000円）懇親会費: 事前振込み一般3,500円，学生2,000円　　　　　　（当日会場払いは余裕がある限り．一般4,000円，学生2,500円）研究会参加申込要領　参加申込は下記 Web にて受付けます　https://staff.aist.go.jp/s-kawabata/qit/qit33/ 　講演 (口頭，ポスター) の申込，予稿集原稿 PDF の提出は，　電子情報通信学会の Web システムを使用．【口頭講演申込締切】2015年10月9日(金) 【ポスター講演申込締切】2015年10月23日(金) 【予稿原稿提出締切】2015年10月23日(金) 【参加申込締切】2015年10月30日(金) 【問合せ先】　河野泰人 (NTTコミュニケーション科学基礎研究所) 　高橋康博 (NTTコミュニケーション科学基礎研究所) 　森越文明 (NTT物性科学基礎研究所) 　東　浩司 (NTT物性科学基礎研究所) 　Email:qit33@lab.ntt.co.jp 主催: 量子情報技術時限研究専門委員会 (委員長: 富田章久(北海道大学)) 共催: 応用物理学会量子エレクトロニクス研究会 ---------------------------------------------------------- -- 高橋康博 (Yasuhiro Takahashi) NTT コミュニケーション科学基礎研究所メディア情報研究部情報基礎理論研究グループ〒243-0198 神奈川県厚木市森の里若宮3-1 Tel: 046-240-3678 Fax: 046-240-4709 Email: takahashi.yasuhiro(a)lab.ntt.co.jp

1 0

「数学の哲学と証明論」ワークショップ、9月10日(木)-11日(金)、慶應義塾大学
by Yuta Takahashi 03 Sep '15

03 Sep '15

慶應義塾大学非常勤講師の高橋優太と申します。ワークショップ「数学の哲学と証明論」のご案内をお送りいたします。ぜひご参加ください。 --------------------------------------------------------------------- We apologize if you receive this message more than once. --------------------------------------------------------------------- カーネギーメロン大学W.Sieg教授をお招きして次のようなワークショップ「Philosophy of Mathematics and Proof Theory」を予定しております。参加自由です。（なお、次回はG-Y Girard教授をお招きして、11月28日-29日に開催する予定です。 Sieg教授は9月18日にも早稲田大学で別テーマの講演をなさいます。 URL:http://www.waseda.jp/wias/event/symposium/sym_150918.html ） ---- "Philosophy of Mathematics and Proof Theory" Workshop 「数学の哲学と証明論」ワークショップ Date: September 10th(Thu)-21th(Fri), 2015 日時: 2015年9月10日(木)-11日(金) Place: Hall (8F), East Building, Mita campus of Keio University. 場所: 慶應大学三田キャンパス東館8階ホール (http://www.keio.ac.jp/en/maps/mita.html ) 講演アブストラクトを始め会議のupdated informationについてはつぎのURLをご覧ください。 http://abelard.flet.keio.ac.jp/seminar/sieg2015.html ---- Tentative Program: 9/10: 13:00-13:10 Opening Remark, Mitsuhiro Okada and Ryota Akiyoshi 13:00-14:00 Kengo Okamoto (Tokyo Metropolitan University) "TBA" 14:00-15:00 Mamoru Kaneko (Waseda University) "Game Theoretic Decidability and Undecidability" (with Tai-Wei Hu) 15:00-15:20 Break 15:20-16:20 Ryota Akiyoshi (Waseda Institute for Advanced Study) "Some results in proof-theory for $\Pi^{1}_{1}$-$CA$" 16:20-17:50 Wilfried Sieg (Carnegie Mellon University) "Dedekind’s structuralism: creating concepts and deriving theorems" 17:50-18:20 Discussion 9/11: 13:30-14:20 Yuta Takahashi (Keio University) "Gentzen's 1935/36 Consistency Proofs as Means of Ascribing Constructive Senses" 14:20-15:00 Mitsuhiro Okada (Keio University) "Husserl's universal arithmatic and his proof theoretical view of formal mathematics" 15:00-15:20 Break 15:20-16:50 Wilfried Sieg (Carnegie Mellon University) "The ways of Hilbert's axiomatics: structural and formal" 16:50-17:20 Concluding Discussion --------------------------------------------------------------------- Organisers: Mitsuhiro Okada (co-chair) Ryota Akiyoshi (co-chair) Yutaro Sugimoto Yuta Takahashi 主催: 三田ロジックセミナー共催: 慶應義塾大学論理と感性のグローバル研究センター問合せ先: Mita Logic Seminar 事務局 logic(a)abelard.flet.keio.ac.jp --------------------------------------------------------------------- ABSTRACTS 9/10: Mamoru Kaneko (Waseda University) "Game Theoretic Decidability and Undecidability" (with Tai-Wei Hu) Abstract: We study the possibility of prediction/decision making in a finite 2--person game with pure strategies, following the Nash-Johansen noncooperative solution theory. We adopt the infinite-regress logic EIR² (a fixed-point extension) of the epistemic logic KD² to capture individual decision making from the viewpoint of logical inference. In the logic EIR², prediction/decision making is described by the belief set Δ_{i}(g) for player i, where g specifies a game. Our results on prediction/decision making differ between solvable and unsolvable games. For the former, we show that player i can decide whether each of his strategies is a final decision or not. For the latter, we obtain undecidability, i.e., he can neither decide some strategy to be a possible decision nor disprove it. Thus, the theory (EIR²;Δ_{i}(g)) is incomplete in the sense of Gödel's incompleteness theorem for an unsolvable game g. This result is related to "self-referential", but its main source is a discord generated by interdependence of payoffs and independent prediction/decision making. Ryota Akiyoshi (Waseda Institute for Advanced Study): "Some results in proof-theory for $\Pi^{1}_{1}$-$CA$" Abstract: In 2000's, Tait asked the question whether we can prove without ordinal notations that all proofs in $\Pi^{1}_{1}$-$CA$ with (Sch\"{u}tte's) $\omega$-rule are transformed into cut-free ones. Inspired by this, the author and Mints formulated an extension of Buchholz' $\Omega$-rule using Takeuti's distinction of explicit/implicit inference and proved the complete cut-elimination theorem for it. An answer to Tait's question is given by combining this with the author's work on "finite notations for infinitary derivations" for this kind of $\Omega$-rule. In the first part of the talk, we will explain the result with Mints. Next, we explain a connection between the $\Omega$-rule and the computability predicate by Tait-Girard. In 2008, Mints suggested that there should be a connection between these two methods because they would have a common aim to solve the difficulty how to deal with the substitution of a set term $T$ into a free second-order variable $X$ in $A(X)$. The author and Terui recently found this connection by formulating the $\Omega$-rule in the framework of the computability. We report and discuss our result. Wilfried Sieg (Carnegie Mellon University) "Dedekind's structuralism: creating concepts and deriving theorems" Abstract: Dedekind's structuralism is a crucial source for the structuralism of mathematical practice with its focus on abstract concepts like groups and fields. It plays an equally central role for the structuralism of philosophical analysis with its focus on particular mathematical objects like natural and real numbers. Tensions between these structuralisms are palpable in Dedekind's work, but are resolved in his essay Was sind und was sollen die Zahlen? In a radical shift, Dedekind extends his mathematical approach to “the” natural numbers. He creates the abstract concept of a simply infinite system, proves the existence of a “model”, insists on the stepwise derivation of theorems, and defines structure-preserving mappings between different systems that fall under the abstract concept. Crucial parts of these considerations were added only to the penultimate manuscript, for example, the very concept of a simply infinite system. The methodological consequences of this radical shift are elucidated by an analysis of Dedekind's metamathematics. Our analysis provides a deeper understanding of the essay and, in addition, illuminates its impact on the evolution of the axiomatic method and of “semantics” before Tarski. This understanding allows us to make connections to contemporary issues in the philosophy of mathematics and science. (This reports on work with Rebecca Morris.) 9/11: Yuta Takahashi (Keio University) "Gentzen's 1935/36 Consistency Proofs as Means of Ascribing Constructive Senses" Abstract: Gentzen's three consistency proofs for number theory have a common aim that originates from Hilbert's Program, namely, the aim to justify the application of classical reasoning to quantified propositions in number theory. In addition to this common aim, Gentzen gave a constructive interpretation to every number-theoretic proposition in his 1935/36 consistency proofs, while Hilbert's Program included no such interpretation. In this talk, we claim that Gentzen's interpretation took a part of his response to an objection posed by Brouwer against the significance of consistency proofs. Specifically, we argue as follows. According to Brouwer, consistency proofs for classical mathematics are of no significance, because its theorems have no sense whether or not its consistency is proved by using the methods of the Hilbert School. In order to respond to this objection, Gentzen aimed at ascribing a constructive sense to each theorem of classical number theory by means of his interpretation. Mitsuhiro Okada (Keio University) "Husserl's universal arithmatic and his proof theoretical view of formal mathematics" Abstract: We discuss Husserl's development of the conception of universal arithmatic,, with the special focus on his Double-Lecture and other manuscripts in 1901. We can see how his work is influenced from former formalists' work and, at the same time, how it is sharply contrasted to those,. such as Hankel's and Hilbert's former work. We discuss Husserl's view of proof-theoretic and computational notion of "manifold (in his own sense), and his term-rewrite theoretic notion of "definiteness" of manifold. We also discuss some significance of the Husserlian proof theoretic view of mathematics as well as some limitation (for which Wittgenstein partly solved much later). Wilfried Sieg (Carnegie Mellon University) "The ways of Hilbert's axiomatics: structural and formal" Abstract: It is a remarkable fact that Hilbert's programmatic papers from the 1920s still shape, almost exclusively, the standard contemporary perspective of his views concerning (the foundations of) mathematics; even his own, quite different work on the foundations of geometry and arithmetic from the late 1890s is often understood from that vantage point. My essay pursues one main goal, namely, to contrast Hilbert's formal axiomatic method from the early 1920s with his existential axiomatic approach from the 1890s, deeply influenced by Dedekind. Such a contrast illuminates the circuitous beginnings of the finitist consistency program and connects the complex emergence of existential axiomatics with transformations in mathematics and philosophy during the 19th century; the sheer complexity and methodological difficulties of the latter development are partially reflected in the well known, but not well understood correspondence between Frege and Hilbert. Taking seriously the goal of formalizing mathematics in an effective logical framework leads also to contemporary tasks, not just historical and systematic insights.

1 0

第33回量子情報技術研究会 (QIT33) のご案内
by Yasuhiro Takahashi 03 Sep '15

03 Sep '15

皆様， NTT の高橋と申します．第33回量子情報技術研究会 (QIT33) の案内を転送させて頂きます．よろしくお願い致します． ---------------------------------------------------------- 第33回量子情報技術研究会(QIT33) 研究会の内容：　情報科学と量子力学を融合させた新しい分野，量子情報科学に関する研究会です．情報を担う物理系の量子力学的側面を積極的に活かした新しい情報処理原理の研究とそこから開かれる新しい学問体系の構築および新しい情報技術パラダイムの創生を目指して，情報科学，物理学，光エレクトロニクスを含む理学，工学，数理科学に携わる研究者間に自由な討論の場を提供し，この研究分野の発展を図ることを目的としています．　第33回研究会を下記のように開催いたします．現在この分野で活躍する研究者は勿論，自分の研究資産が何らかの形で使えそうだと予感している研究者・技術者など，広く関連する分野の研究者・技術者からの発表を募集致します．聴講のみの参加も歓迎致しますので，奮ってお申し込みください．日時: 2015年11月24日(火)-25日(水) 会場: NTT厚木研究開発センタ講堂　　（〒243-0198 神奈川県厚木市森の里若宮3-1）発表募集分野 (申し込み状況によっては査読の可能性あり) 　量子情報，量子計算，量子暗号など広く量子情報技術に関わる理論的研究，　実験的研究，計算機科学的研究，数学的研究，および，その他関連分野．チュートリアル・招待講演者　中村泰信 (東京大学) 　小芦雅斗（東京大学）　西村治道（名古屋大学）定員: 200名程度参加費: 事前振込み一般2,500円，学生1,000円　　　　　（当日会場払いは一般3,500円，学生2,000円）懇親会費: 事前振込み一般3,500円，学生2,000円　　　　　　（当日会場払いは余裕がある限り．一般4,000円，学生2,500円）研究会参加申込要領　参加申込は下記 Web にて受付けます　https://staff.aist.go.jp/s-kawabata/qit/qit33/ 　講演 (口頭，ポスター) の申込，予稿集原稿 PDF の提出は，　電子情報通信学会の Web システムを使用．【口頭講演申込締切】2015年10月9日(金) 【ポスター講演申込締切】2015年10月23日(金) 【予稿原稿提出締切】2015年10月23日(金) 【参加申込締切】2015年10月30日(金) 【問合せ先】　河野泰人 (NTTコミュニケーション科学基礎研究所) 　高橋康博 (NTTコミュニケーション科学基礎研究所) 　森越文明 (NTT物性科学基礎研究所) 　東　浩司 (NTT物性科学基礎研究所) 　Email:qit33@lab.ntt.co.jp 主催: 量子情報技術時限研究専門委員会 (委員長: 富田章久(北海道大学)) 共催: 応用物理学会量子エレクトロニクス研究会 ---------------------------------------------------------- -- 高橋康博 (Yasuhiro Takahashi) NTT コミュニケーション科学基礎研究所メディア情報研究部情報基礎理論研究グループ〒243-0198 神奈川県厚木市森の里若宮3-1 Tel: 046-240-3678 Fax: 046-240-4709 Email: takahashi.yasuhiro(a)lab.ntt.co.jp

1 0

ワークショップ「Computations, Proofs, and Intuitions: A Workshop on Philosophy of Mathematics」
by Ryota Akiyoshi 01 Sep '15

01 Sep '15

早稲田大学高等研究所の秋吉と申します。以下の要領でワークショップ「Computations, Proofs, and Intuitions: A Workshop on Philosophy of Mathematics」(WIAS Top Runners’ Lecture Collection of Science) 開催のご案内をさせて頂きます。ご都合よろしければぜひご参加ください。 ------------------------------------------------------------------------------------------------------------------------ ***Please accept our apologies if you receive multiple copies of this email. *** ワークショップご案内：“Computations, Proofs, and Intuitions: A Workshop on Philosophy of Mathematics” We are pleased to invite you to a workshop titled “Computations, Proofs, and Intuitions: A Workshop on Philosophy of Mathematics” (WIAS Top Runners’ Lecture Collection). ワークショップ「Computations, Proofs, and Intuitions: A Workshop on Philosophy of Mathematics」(WIAS Top Runners’ Lecture Collection of Science) 開催のご案内をさせて頂きます。参加自由です。お気軽にご参加ください。 ---- Title: Computations, Proofs, and Intuitions: A Workshop on Philosophy of Mathematics 「計算，証明，直観」：数学の哲学ワークショップ Date: September 18 (Fri.), 2015 Time: 10:00 – 18:00 Place: International Conference Center (Meeting Room 2, 3rd floor), Waseda University. 日時: 2015年9月18日(金) 10:00 – 18:00 会場: 早稲田大学早稲田キャンパス国際会議場 3階第2会議室 *（*https://www.waseda.jp/top/access/waseda-campus#anc_8*）* http://www.waseda.jp/top/assets/uploads/2015/08/waseda-campus-map.pdf * Bldg. 18 on the map. PROGRAM ************* 10:00-10:10 Opening Remarks 10:10-11:10 “Game Theory and "Symbolic" Logic” Speaker: Mamoru Kaneko (Waseda University) 11:10-12:10 “Proof theory of the lambda-calculus” Speaker: Masahiko Sato (Kyoto University) 12:10-14:00 Lunch Break 14:00-15:20 “The *concept* of computation - an axiomatic characterization” Speaker: Wilfried Sieg (Carnegie Mellon University) 15:20-15:40 Break 15:40-16:40 “Kant on mathematical intuition: from an educational point of view” Speaker: Yasuo Deguchi (Kyoto University) 16:40-17:00 Break 17:00-18:00 “Aspects of the notion of computability” Speaker: Makoto Kikuchi (Kobe University) --------------------------------------------------------------------- 世話人: 秋吉亮太（早稲田高等研究所助教）主催: 早稲田高等研究所問合せ先: 秋吉亮太 georg.logic(a)gmail.com --------------------------------------------------------------------- ABSTRACTS ************* [Speaker] Mamoru Kaneko (Waseda University) [Title] Game Theory and "Symbolic" Logic [Abstract] In game theory, a player chooses/adjusts his behavior based on his understanding of the game situation and his decision/prediction criterion. In logic, a (ideal) mathematician calculates/proves a target theorem from his assumptions. An engine for such adjustments and calculations is logical inference. Such behavior is of a highly symbolic nature. However, it has been customary in the fields of mathematics as well as game theory that real targets are actual models but not symbolic expressions (axiomatizations). This attitude should be reversed when we take game theory as a serious study of human behavior/decision-making in social contexts including considerations of experiential sources for individual beliefs. This is very compatible with the basic idea of “symbolic” logic. In this presentation, we discuss various problems related to this interpretation. [Speaker] Masahiko Sato (Kyoto University) [Title] Proof theory of the lambda-calculus [Abstract] We present a new representation of lambda-terms as a subalgebra of a free algebra. As elements of the free algebra, lambda-terms are constructed without employing the abstraction operation, and this construction of lambda-terms enables us to study lambda-terms as natural finitary objects. In this setting, we will develop the lambda-calculus by defining reductions as derivations and study the proof theory of the lambda-calculus. We will develop the theory in the Minlog proof assistant developed by Helmut Schwichtenberg. [Speaker] Wilfried Sieg (Carnegie Mellon University) [Title] The *concept *of computation - an axiomatic characterization [Abstract] Computations are pervasive in contemporary science and life; they are visible everywhere. However, the *concept *of computation emerged in an almost invisible corner of our intellectual life. I will describe the context for the emergence of computability as a crucial notion in mathematics and logic with a normative philosophical component. My analysis of the emergence of this concept provides a novel perspective on *the central methodological issue *that surrounds computations, the “Church-Turing Thesis”. We focus on *calculable functions *on natural numbers and *mechanical operations *on syntactic configurations. The latter analysis leads to boundedness and locality conditions that motivate axioms for *computable dynamical systems*. Models of these axioms are all reducible to Turing machines. Cellular automata and a variety of artificial neural nets can be shown to satisfy them. Finally, I draw connections and point out directions for fascinating work. As to connections, I will emphasize that my novel perspective is rooted in the radical transformation of mathematics of the 19th century; especially, in the new form of structural axiomatics introduced by Dedekind and Hilbert. [Speaker] Yasuo Deguchi (Kyoto University) [Title] Kant on mathematical intuition: from an educational point of view [Abstract] Kantian notion of mathematical intuition has been criticized, notably by Frege, as too psychological or private to be the proper base of mathematics. This talk will challenge such an allegation by paying attentions to its historical backgrounds, especially that of German mathematical education. First, it focuses on Kantian notion of arithmetical intuition, and identifies one of its main resources; ’Segner’s arithmetic'. Since Vaihinger published his influential commentary of the first critique, Kantians of many variants have almost unanimously believed that it was one of his books; i.e., ‘Principle’. But this talk claims that it is his another book; i.e., ‘Lectures’. Segner’s ‘Lecture’ rather than ‘principle’ occupies a significant position in German history of mathematical education: it is a complement to the pedagogical tradition, so called, 'formal cultivation’ that was initiated by Ch. Wolff. In ‘Lectures', Segner employed such intuitive representations of numbers as points and asterisks, to make the rigid formality of mathematical thinking more approachable to the younger audiences. Since Segner’s intuitive examples of numbers and arithmetic operations were intended to be used in the context of classroom education, they should be publicly available for both teachers and students, and therefore visible and even manipulatable. Based on those observations, this talk claims that Kantian notion of mathematical intuition inherited this visibility, manipulability and public nature of Segner’s exemplars, and is not to be interpreted as being psychological or private. [Speaker] Makoto Kikuchi (Kobe University) [Title] Aspects of the notion of computability [Abstract] There are two important subclasses of the set of partial recursive functions. One is the set of primitive recursive functions and the other is the set of general or total recursive functions. The notion of computability had been scrutinized and expanded in 1930's and nowadays it is widely believed that we have succeeded in formulating the notion of computability accurately and adequately by reaching the concept of partial recursive functions. In this talk, we observe the two gaps of the three classes of computable functions and argue that the former expansion from primitive recursive functions to general recursive functions is somewhat mathematical while the latter enlargement from general recursive functions to partial recursive functions is rather philosophical. We discuss also consequences of observations of the discontinuity in the latter transition in the notion of computability.

1 0

Jump to page:

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Logic-ml