皆様、
以下の要領で研究集会
Computability Theory and Foundations of Mathematics 2014
(2014年2月17日(月)〜2月20日(木),東京工業大学大岡山キャンパス)
を開催いたします.
invited speakers 等の情報については、近日中に下記のホームページにて公開致します。
http://www.jaist.ac.jp/CTFM/temp/CTFM2014/index.html
12月15日より講演の募集を開始致しますので、宜しく参加・講演をご検討ください。
============================================================
Computability Theory and Foundations of Mathematics
(Tokyo Institute of Technology, Tokyo, Japan, February 17 - 20, 2014)
http://www.jaist.ac.jp/CTFM/temp/CTFM2014/index.html
============================================================
Computability Theory and Foundations of Mathematics (CTFM) aims to
develop computability theory and logical foundations of Mathematics. The
scope involves the topics Computability Theory, Reverse Mathematics,
Nonstandard Analysis, Proof Theory, Constructive Mathematics, Theory of
Randomness and Computational Complexity Theory.
--------------------------------------------
Submission for Presentations:
December 15, 2013 -- January 15, 2014
--------------------------------------------
Organizing Committee:
Hajime Ishihara(JAIST)
Ryo Kashima(Tokyo Institute of Technology, local chair)
Sam Sanders (Ghent)
Stephen G. Simpson (Pennsylvania State)
Kazuyuki Tanaka (Tohoku, chair)
Keita Yokoyama (JAIST)
--------------------------------------------
Program Committee:
Kojiro Higuchi (Chiba)
Takayuki Kihara(JAIST)
Kenshi Miyabe(Tokyo)
Takako Nemoto(JAIST)
Sam Sanders (Ghent)
Takeshi Yamazaki (Tohoku)
Keita Yokoyama (JAIST, chair)
Keisuke Yoshii (Tohoku)
--------------------------------------------
どうぞよろしくお願い致します。
横山啓太
--
Keita Yokoyama
y-keita(a)jaist.ac.jp
皆様
Imperial College London のRobert A. Kowalski 教授の講演を開催いたします。
どうぞふるってご参加ください。
問い合わせ先:
東条 敏
北陸先端科学技術大学院大学 情報科学研究科
e-mail: tojo(a)jaist.ac.jp
-----------------------------------------------
* JAIST Logic Seminar Series *
Date: Thursday 21 November, 2013, 15:10--16:40
Place: JAIST, Collaboration room 7 (I-56)
(Access: http://www.jaist.ac.jp/english/location/access.html)
Speaker: Robert A. Kowalski (Imperial College London)
Title: Towards a Logic-based Framework for Computing
(Joint work with Fariba Sadri)
Abstract:
In this talk, I present a logic-based, framework for Computing,
inspired by artificial intelligence, but scaled down for practical
database and programming applications. Computation in the framework is
viewed as the task of generating a sequence of state transitions, with
the purpose of making an agent’s goals all true. States are
represented by sets of atomic sentences (or facts), representing the
values of program variables, tuples in a coordination language, facts
in relational databases, or Herbrand models.
In the model-theoretic semantics of the framework, the
entire sequence of states and events is contained in a single
model-theoretic structure, by associating time stamps with facts and
events. But in the operational semantics, facts are updated
destructively, without time stamps. We show that the model generated
by destructive updates is identical to the model generated by
reasoning with facts containing time stamps. We also extend the model
with intentional predicates and composite event predicates defined by
logic programs containing conditions in first-order logic, which query
the current state.
Speaker's bio:
Professor Robert A. Kowalski (Emeritus Professor and Distinguished
Research Fellow) at Imperial College London.
Robert Kowalski studied at the University of Chicago, the University
of Bridgeport, Stanford University, the University of Warsaw, and the
University of Edinburgh, where he completed his PhD in 1970.
Kowalski has been an advisor to the UNDP Knowledge Based Systems
Project in India and to DFKI, the German Institute for Artificial
Intelligence. He co-ordinated the European Community Basic Research
Project, Compulog, and was the founder of the European Compulog
Network of Excellence. Since 2009, he has been an advisor to the
Department of Immunization, Vaccines and Biologicals, of the World
Health Organization in Geneva.
Kowalski is a Fellow of the Association for the Advancement of
Artificial Intelligence, the European Co-ordinating Committee for
Artificial Intelligence, and the Association for Computing Machinery.
He received the IJCAI (International Joint Conference of Artificial
Intelligence) award for Research Excellence in 2011.
--
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
皆様
リュブリャナ大学の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