皆様
早稲田大学の藤原誠です。
以下の要領で研究集会
Computability Theory and Foundations of Mathematics 2016
(2016年9月20日(火)~9月21日(水)、早稲田大学国際会議場)
を開催いたします。
講演を希望される方は8月31日までに以下に沿って講演要旨をお送り下さい。
(締切日が迫ってからの連絡となってしまい申し訳ありません。)
http://www.sendailogic.com/CTFM2016/submission.html
本研究集会への参加は自由ですが、20日夜の懇親会に参加される方は9月12日までに以下より参加登録をお願いいたします。
準備の都合上、懇親会に参加されない方も事前に参加登録をしていただけると助かります。
http://www.sendailogic.com/CTFM2016/registration.html
詳しくは下記ホームページをご覧ください。
http://www.sendailogic.com/CTFM2016/
本研究集会に関するお問い合わせは以下へお願いいたします。
ctfm2016[at]fastmail.com
どうぞよろしくお願いいたします。
==============================================================
Computability Theory and Foundations of Mathematics 2016
Waseda University, Tokyo, Japan, September 20 - 21, 2016
http://www.sendailogic.com/CTFM2016/
==============================================================
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, Set Theory, Philosophy of
Mathematics, Constructive Mathematics, Theory of Randomness and
Computational Complexity Theory.
This is the sixth conference of the CTFM conference series:
http://www.jaist.ac.jp/CTFM/CTFM_SERIES/
This conference is supported by the Waseda Insitute for Advanced Study
and JSPS KAKENHI Grant Numbers JP26540001 and JP15H03634.
-------------------------------------------------------------------------------------------------------------------------
Invited speakers:
• David Belanger (National University of Singapore)
• Chi Tat Chong (National University of Singapore)
• Daisuke Ikegami (Tokyo Denki University)
• Wei Li (National University of Singapore)
• Kenshi Miyabe (Meiji University)
• Paul Shafer (Ghent University)
• Frank Stephan (National University of Singapore)
• Philip Welch (University of Bristol)
• Guohua Wu (Nanyang Technological University)
• Takeshi Yamazaki (Tohoku University)
• Yang Yue (National University of Singapore)
-------------------------------------------------------------------------------------------------------------------------
Submission deadline for presentations:
August 31, 2016
-------------------------------------------------------------------------------------------------------------------------
Registration deadline:
September 12, 2016.
(It will still be possible to register for the conference after the deadline, but in that case the participant cannot attend the banquet.
The banquet will be held on September 20 (18:30-20:30), at the same place as the conference venue.)
-------------------------------------------------------------------------------------------------------------------------
Organising Committee:
Makoto Fujiwara (Waseda University, co-chair)
Florian Pelupessy (Tohoku University)
Kazuyuki Tanaka (Tohoku University, co-chair)
Toshimichi Usuba (Waseda University)
Keita Yokoyama (JAIST)
============================================
藤原 誠 (Makoto Fujiwara)
早稲田大学高等研究所
(Waseda Institute for Advanced Study, Waseda University)
E-mail: makoto_fujiwara(a)aoni.waseda.jp
============================================
皆様
ルートヴィヒ・マクシミリアン大学ミュンヘンのHelmut
Schwichtenberg先生の講演のお知らせです。
どうぞふるってご参加ください。
問合せ先:
石原 哉
北陸先端科学技術大学院大学 情報科学系
e-mail: ishihara(a)jaist.ac.jp
-----------------------------------------------
* JAIST Logic Seminar Series *
* The seminar below is held as a part of JSPS Core-to-Core Program,
A. Advanced Research Networks, and EU FP7 Marie Curie Actions IRSES
project CORCON.
(http://www.jaist.ac.jp/logic/ja/core2core, https://corcon.net/)
Date: Thursday 25 August, 2016, 13:30-15:10
Place: JAIST, Lecture room I2
(Access: http://www.jaist.ac.jp/english/location/access.html)
Speaker: Helmut Schwichtenberg (Ludwig-Maximilians-Universität München)
Title: Invariance axioms for realizability
Abstract:
Kolmogorov (1932) proposed to consider mathematical formulas
as problems asking for solutions. Following this idea it seems
reasonable to extend arithmetical theories by adding invariance axioms,
which state that every formula is equivalent to the (internal) formula
stating that it has a realizer. We sketch such a theory, which in
addition allows to fine-tune the computational content of proofs by
decorations of the logical connectives. A soundness theorem holds.
皆様
インスブリア大学のMarco Benini先生の講演のお知らせです。
どうぞふるってご参加ください。
問合せ先:
石原 哉
北陸先端科学技術大学院大学 情報科学系
e-mail: ishihara(a)jaist.ac.jp
-----------------------------------------------
* JAIST Logic Seminar Series *
* The seminar below is held as a part of JSPS Core-to-Core Program,
A. Advanced Research Networks, and EU FP7 Marie Curie Actions IRSES
project CORCON.
(http://www.jaist.ac.jp/logic/ja/core2core, https://corcon.net/)
Date: Monday 8 August, 2016, 13:30-15:10
Place: JAIST, Collaboration room 7 (I-56)
(Access: http://www.jaist.ac.jp/english/location/access.html)
Speaker: Marco Benini (University of Insubria)
Title: Variations on the Higman's Lemma
Abstract:
The Higman's Lemma says that if A is a well-quasi-order, so
is the set of finite sequences over A with the order induced by
embedding. By considering the structure of the categories of
well-founded quasi-orders and well-quasi-orders, another proof of the
Lemma will be derived, along with a number of variants, which may be
of some interest.
皆様
台湾 National Chung Cheng University のRen-June Wangさんの講演会のお知らせです。
どうぞふるってご参加ください。
問合せ先:
佐野勝彦
北陸先端科学技術大学院大学 情報科学系
e-mail: v-sano(a)jaist.ac.jp
-----------------------------------------------------------------
* JAIST Logic Seminar Series *
Date: Thursday, 7th July 2016, 15:30-17:00
Place: JAIST, IS school collaboration room 7, 5F
(Access: http://www.jaist.ac.jp/english/top/access/index.html)
Speaker: Ren-June Wang (Department of Philosophy, National Chung Cheng
University)
Title: Logical Omniscience and Deductive Rationality
Abstract: Epistemic logic as an important tool for reasoning about an
intellectual agent’s epistemic states has long suffered from the
so-called logical omniscience problem since the beginning of its
introduction. The problem indicates an idealized assumption on the
part of the agent presented by a formalism of such kind. Although
alternative epistemic formalisms have been proposed for dealing with
the problem, there is no sight of that the problem is settled. Thus in
this talk I will try my hand firstly to give an analysis of the
problem, hopefully to pin down the source of the problem, and
accordingly provide an advice as to what is the right direction of
solving the problem. At the end of the talk I will suggest that what
we need is not a formalism with a machinery that can limit what is
known by the agent, but one with more powerful expressivity such that
the resource that an agent will consume in the course of his/her
reasoning, such as the temporal duration, can be explicitly stated.
--
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
皆様
ジェノヴァ大学のEugenio Moggi先生の特別集中講演のお知らせです。
どうぞふるってご参加ください。
問合せ先:
石原 哉
北陸先端科学技術大学院大学 情報科学系
e-mail: ishihara(a)jaist.ac.jp
-----------------------------------------------
* JAIST Logic Seminar Series *
* This series of lectures is held as a part of JSPS Core-to-Core Program,
A. Advanced Research Networks, and EU FP7 Marie Curie Actions IRSES
project CORCON.
(http://www.jaist.ac.jp/logic/ja/core2core, https://corcon.net/)
Dates: Tuesday 2 August, 2016, 13:30-15:10
Thursday 4 August, 2016, 13:30-15:10
Friday 5 August, 2016, 10:50-12:30
Place: JAIST, Collaboration room 7 (I-56)
(Access: http://www.jaist.ac.jp/english/location/access.html)
Speaker: Eugenio Moggi (University of Genova)
*Tuesday 2 August, 2016, 13:30-15:10*
LECTURE 1: Categories of Classes for Collection Types
ABSTRACT. Collection types have been proposed by Buneman and others (in
the '90) as a way to
capture database query languages in a typed setting. In 1998 Manes
introduced the notion of collection
monad on the category S of sets as a suitable semantics for collection
types. The canonical example of
collection monad is the finite powerset monad Pf.
In order to account for the algorithmic aspects of database languages,
the category S is unsuitable, and
should be replaced with other categories, whose arrows are maps
computable by "low complexity"
algorithms. We propose "realizability for DSL" (Domain Specific
Languages), where the starting point
is a monoid C of endomaps on a set D, instead of a combinatory algebra
on D, as a way to get such
categories by constructions like the category A[C] of "assemblies".
To get Pf in a systematic way we borrow ideas from AST (Algebraic Set
Theory, started by Joyal and
Moerdijk in the '90), where they fix a notion of "small" map in a
category of "classes", and read "small"
as "finite".
*Thursday 4 August, 2016, 13:30-15:10*
LECTURE 2: Hybrid System Trajectories as Partial Continuous Maps
ABSTRACT. Hybrid systems (HS) are dynamic systems that exhibit both
continuous and discrete
dynamic behavior: they can flow (according to a differential equation)
and jump (according to a
transition relation). HS can be used for modeling rigid body dynamics
with impacts, and more
generally Cyber-Physical Systems.
HS can exhibit Zeno behaviors, that arise naturally in rigid body
dynamics with impacts, but are absent
from purely discrete or purely continuous systems. Dealing properly with
these behaviors is a
prerequisite to give sound definitions of concepts such as reachability.
We propose the use of partial continuous maps (PCM) as trajectories that
describe how a HS evolves
over time. PCMs enable a notion of trajectory that can go beyond Zeno
points.
*Friday 5 August, 2016, 10:50-12:30*
LECTURE 3: Models, Over-approximations and Robustness
ABSTRACT. Hybrid systems, and related formalisms, have been successfully
used to model Cyber-
Physical Systems. The usual definition of "reachability", in terms of
the reflexive and transitive closure
of a transition relation, is unsound for Zeno systems. We propose "safe
reachability", which gives an
over-approximation of the set of states that are "reachable in finite
time" from a set of initial states.
Moreover, mathematical models are always a simplification of the system
they are meant to describe,
and one must be aware of this mismatch, when using these models for
system analyses.
In safety analysis it is acceptable to use over-approximations of the
system behavior, indeed they are
the bread and butter of counterexample guided abstraction refinement
(CEGAR).
We propose a notion of safe (time-bounded) reachability, which is also
robust wrt arbitrary small overapproximations,
and argue that it is particularly appropriate for safety analysis.
皆様
オークランド大学のBakhadyr Khoussainov先生の講演のお知らせです。
どうぞふるってご参加ください。
問合せ先:
石原 哉
北陸先端科学技術大学院大学 情報科学系
e-mail: ishihara(a)jaist.ac.jp
-----------------------------------------------
* JAIST Logic Seminar Series *
Date: Monday 20 June, 2016, 15:20-17:00
Place:JAIST, Collaboration room 7 (I-56)
(Access: http://www.jaist.ac.jp/english/location/access.html)
Speaker: Bakhadyr Khoussainov (University of Auckland)
Title: Computably Enumerable Structures: Domain dependency
Abstract:
Computably enumerable structures arise naturally in algebra
and computer science. In algebra examples include finitely
presented universal algebras such as finitely presented groups.
In computer science, these are abstract data types
defined by equational or quasi-equational specifications.
The domains of these algebraic structures are quotient sets
of the form $\omega/E$, where $\omega$ is the set of
natural numbers and $E$ is a computably enumerable (c.e.)
equivalence relations. We consider c.e. structures whose
domains are of the form $\omega/E$ and study various properties
of these structures and their dependence on the domain $\omega/E$