皆様
(English follows)
以下の通り、5/16(火)に金子守先生(早稲田大学政治経済学術院、特任教授)に非専門家向けのご講演(英語)をしていただきます。
事前申込みは不要ですので、どうぞふるってご参加ください。
詳細は下記ホームページをご覧ください。
https://www.waseda.jp/inst/wias/news/2017/04/25/4250/ <https://www.waseda.jp/inst/wias/news/2017/04/25/4250/>
問い合わせ先:
藤原誠(早稲田大学高等研究所)
makoto_fujiwara(a)aoni.waseda.jp <mailto:makoto_fujiwara@aoni.waseda.jp>
Dear all,
It is our pleasure to announce WIAS Seminar "Logic and Game Theory" (May 16, 2017).
The talk by Professor Mamoru Kaneko and the following discussion would be held in English.
It is free for charge and the prior registration for your attendance is not needed.
You are welcome to join us.
Best regards,
Coordinators
==================================================================
WIAS Seminar "Logic and Game Theory"
Date & Time: Tuesday, 16 May 2017, 11:00 - 12:15
Venue: Meeting room. 1 on the 5th floor, Building #9, Waseda University
Speaker: Mamoru KANEKO(Professor, Waseda University)
Title: Logic and Game Theory
Abstract:
In this presentation, I make conceptual connections between logic and game theory. First, I give a small introduction to each filed. Then, a Japanese comic story called “Konnyaku Mondo” is introduced to describe a basic problem on one’s understanding about the other person’s thought. The Konnyaku Mondo phenomena are often observed in our real lives. It is indicative of the distinction between a symbolic expression and its intended meaning; this is a very basic distinction in the modern logic. The story leads also to a new field in game theory called “Inductive Game Theory” that I and several collaborators have developed. Indeed, we construct a game theory example having the feature of the Konnyaku Mondo that two players are playing a game with mutual misunderstanding of the situation, but they cannot correct their mutual misunderstanding even after they have played the game several times.
Coordinators:
Makoto FUJIWARA (Assistant Professor, Waseda University)
Ryota AKIYOSHI (Associate Professor, Waseda University)
Kazuto OHTSUKI (Assistant Professor, Waseda University)
For more information, please see the following page:
https://www.waseda.jp/inst/wias/news-en/2017/04/25/4251/ <https://www.waseda.jp/inst/wias/news-en/2017/04/25/4251/>
Contact:
Makoto FUJIWARA
E-mail: makoto_fujiwara(a)aoni.waseda.jp <mailto:makoto_fujiwara@aoni.waseda.jp>
==================================================================
============================================
藤原 誠 (Makoto Fujiwara)
早稲田大学高等研究所
(Waseda Institute for Advanced Study, Waseda University)
E-mail: makoto_fujiwara(a)aoni.waseda.jp
============================================
Dear colleagues, (apology for multiple copies)
Let us advertise the next ERATO MMSD project colloquium talk by Sean Sedwards.
Please find the title and abstract of the talk below. You are all cordially invited.
Remote attendance is also welcome (Polycom is available in the room). Please let us know beforehand if you would like to join remotely.
Sincerely,
Akira Yoshimizu
Technical Assistant at ERATO MMSD project
----------
https://docs.google.com/document/d/1Qrg4c8XDkbO3tmns6tQwxn5lGHOrBON5LtHXXTp… <https://docs.google.com/document/d/1Qrg4c8XDkbO3tmns6tQwxn5lGHOrBON5LtHXXTp…>
Fri 28 April 2017, 15:15–17:00
NII meeting room 2010
https://www.nii.ac.jp/en/about/access/ <https://www.nii.ac.jp/en/about/access/>
Sean Sedwards (ERATO MMSD), Rare Event Simulation for Statistical Model Checking
Statistical model checking (SMC) avoids the intractable number of states associated with numerical model checking by estimating the probability of a property from a number of execution traces (simulations). Rare events nevertheless pose an important challenge to SMC because interesting properties, such as bugs and optima, are often very rare and occur infrequently in simulations. A key objective for SMC is thus to reduce the number and length of simulations necessary to produce an estimate with a given level of statistical confidence. In this talk I will describe two variance reduction approaches that address this problem: importance sampling and importance splitting. Importance sampling weights the probabilities of a system to make a rare property occur more frequently in simulations, then compensates the results by the weights. Importance splitting decomposes a rare property into the product of sub-properties that are less rare and easier to simulate. I will outline the challenges of using these techniques in SMC and highlight some practical solutions, including the recent successful application of importance sampling to stochastic timed automata.
皆様
インスブリア大学(イタリア)の Marco Benini 先生の講演のお知らせです。
どうぞふるってご参加ください。
問い合わせ先:
根元 多佳子
北陸先端科学技術大学院大学 情報科学系
email: t-nemoto(a)jaist.ac.jp
---------------------------------------------
*JAIST Logic Seminar Series*
Date: Friday, 12 May, 2017, 15:30-17:00
Place: JAIST, Collaboration room 7 (I-56)
(Access: http://www.jaist.ac.jp/english/location/access.html)
Speaker: Marco Benini (Università degli Studi dell'Insubria)
Title: Explaining the Kruskal's Tree Theorem
Abstract: The famous Kruskal's tree theorem states that the collection
of finite trees labelled over a well quasi order and ordered by
homeomorphic embedding, forms a well quasi order. Its intended
mathematical meaning is that the collection of finite, connected and
acyclic graphs labelled over a well quasi order is a well quasi order
when it is ordered by the graph minor relation.
Oppositely, the standard proof(s) shows the property to hold for trees
in the Computer Science's sense together with an ad-hoc, inductive
notion of embedding. The mathematical result follows as a consequence
in a somewhat unsatisfactory way.
In this talk, a variant of the standard proof will be illustrated
explaining how the Computer Science and the graph-theoretical
statements are strictly coupled, thus explaining why the double
statement is justified and necessary.
(* Apologies for any cross-postings. *)
=====================================================================
Call for Papers
IWC 2017
6th International Workshop on Confluence
September 8th, 2017, Oxford, United Kingdom
Collocated with FSCD 2017
http://cl-informatik.uibk.ac.at/events/iwc-2017/
=====================================================================
Confluence provides a general notion of determinism and is widely
viewed as one of the central properties of rewriting. Confluence
relates to many topics of rewriting (completion, modularity,
termination, commutation, etc.) and has been investigated in many
formalisms of rewriting such as first-order rewriting, lambda-calculi,
higher-order rewriting, constrained rewriting, conditional rewriting,
etc. Recently there is a renewed interest in confluence research,
resulting in new techniques, tool support, certification as well as
new applications.
The International Workshop on Confluence (IWC) aims at promoting
further research in confluence and related properties. IWC 2017 is
collocated with FSCD 2017. Previous editions of the workshop were held
in Nagoya (2012), Eindhoven (2013), Vienna (2014), Berlin (2015), and
Obergurgl (2016).
During the workshop, the 6th Confluence Competition (CoCo 2017) takes
place.
IMPORTANT DATES:
* submission Saturday, July 1st, 2017
* notification Saturday, July 22nd, 2017
* final version Saturday, August 5th, 2017
* workshop Friday, September 8th, 2017
(deadlines are AoE)
TOPICS:
Specific topics of interest include:
* confluence and related properties (unique normal forms, commutation,
ground confluence)
* completion
* critical pair criteria
* decidability issues
* complexity issues
* system descriptions
* certification
* applications of confluence
INVITED SPEAKERS:
tba
PROGRAM COMMITTEE:
* Beniamino Accattoli (INRIA)
* Jörg Endrullis (Vrije Universiteit Amsterdam)
* Bertram Felgenhauer (University of Innsbruck)
* Ken-Etsu Fujita (Gumma University)
* Philippe Malbos (Université Claude Bernard Lyon 1)
* Jakob Grue Simonsen (University of Copenhagen)
SUBMISSION:
We solicit short papers or extended abstracts of at most five pages.
There will be no formal reviewing. In particular, we welcome short
versions of recently published articles and papers submitted
elsewhere. The program committee checks relevance and may provide
additional feedback. The accepted papers will be made available
electronically before the workshop.
The page limit for papers is 5 pages in EasyChair style. Short papers
or extended abstracts must be submitted electronically through the
EasyChair system at:
https://www.easychair.org/conferences/?conf=iwc2017
EasyChair style:
http://easychair.org/publications/for_authors
-------
皆様
バーミンガム大学のSteve Vickers先生の講演のお知らせです。
どうぞふるってご参加ください。
問合せ先:
石原 哉
北陸先端科学技術大学院大学 情報科学系
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, EU FP7 Marie Curie Actions IRSES project
CORCON.
(http://www.jaist.ac.jp/logic/ja/core2core, https://corcon.net/), and EU
Horizon 2020
Marie Skłodowska-Curie actions RISE project CID.
Date: Monday 17, April, 2017, 15:20-17:00
Place: JAIST, Collaboration room 6 (I-57g)
(Access: http://www.jaist.ac.jp/english/location/access.html)
Speaker: Steve Vickers (University of Birmingham)
Title: Arithmetic universes as generalized point-free spaces
Abstract:
Point-free topology in all its guises (e.g. locales, formal topology)
can be understood as presenting a space as a _logical theory_, for which
the points are the models and the opens are the formulae. The logic in
question is geometric logic, its connectives being finite conjunctions
and arbitrary disjunctions, and then the Lindenbaum algebra (formulae
modulo equivalence) for a theory T is a frame O[T], a complete lattice
with binary meet distributing over all joins. Locales are frames but
with the morphisms reversed.
Grothendieck proposed Grothendieck toposes as the generalized point-free
spaces got when one moves to the first-order form of geometric logic.
Then the opens (giving truth values for each point) are not enough, and
one must move to sheaves (giving sets for each point). The Lindenbaum
algebra now becomes a Grothendieck topos Set[T], the classifying topos
for T, constructed using presheaves with a pasting condition, and closed
under finite limits and arbitrary colimits in accordance with Giraud's
theorem. The topos Set[T] canonically represents the generalized space
of models of T.
Grothendieck used the category Set of classical sets, but we now know
that it can be replaced by any elementary topos S. This base will
determine the infinities available for "arbitrary" disjunctions, as well
as governing the construction of the classifier S[T]. However, for
theories in which all the disjunctions are countable (such as the formal
space of reals) it doesn't matter which S is used, as long as it has a
natural numbers object (nno). Thus the generalized space of models of T
is not absolutely fixed as a mathematical object.
In my talk I shall present the idea of using Joyal's _arithmetic
universes_ (AUs), pretoposes with parameterized list objects, as a
base-independent substitute for Grothendieck toposes in which countable
disjunctions are intrinsic to the logic rather than being supplied
extrinsically by a base S. In [1] I have defined a 2-category Con whose
objects ("contexts") serve as geometric theories that are sufficiently
countable in nature, and whose morphisms are the maps of models. In [2]
I showed how to use Con to prove results for Grothendieck toposes,
fibred over choice of base topos. Thus we start to see AUs providing a
free-standing foundations for a significant fragment of geometric logic
and Grothendieck toposes, independent of base S.
My two papers -
[1] "Sketches for arithmetic universes" (arXiv:1608.01559)
[2] "Arithmetic universes and classifying toposes" (arXiv:1701.04611)
*Continuity, Computability, Constructivity – From Logic to Algorithms*
* (CCC 2017)*
* Loria, 26-30 June 2017*
*Call for papers*
http://ccc2017.loria.fr/
CCC is a workshop series bringing together researchers from exact real
number computation, computable analysis, effective descriptive set
theory, constructive analysis, and related areas. The overall aim is to
apply logical methods in these disciplines to provide a sound foundation
for obtaining exact and provably correctalgorithms for computations with
real numbers and related analytical data, which are of increasing
importance in safety critical applications and scientific computation.
Previous workshops have been held in Cologne 2009, Trier 2012, Gregynog
2013, Ljubljana 2014, and Kochel 2015. The conference series has always
been linked with EU-funded international research projects, with
COMPUTAL (Computable Analysis) in the years 2012-2015 and now with CID
(Computing with Infinite Data), a research network between Europe,
Chile, Japan, New Zealand, Russia, Singapore, South Africa, South Korea,
and the USA. This conference is the first CID event, but is open to all
researchers in the area.
The workshop will take place in Nancy, France.
*Scope: *The workshop specifically invites contributions in the areas of
* Exact real number computation,
* Correctness of algorithms on infinite data,
* Computable analysis,
* Complexity of real numbers, real-valued functions, etc.
* Effective descriptive set theory
* Scott's domain theory,
* Constructive analysis,
* Category-theoretic approaches to computation on infinite data,
* Weihrauch degrees,
* And related areas.
*Invited Speakers:*
* Matthew de Brecht (Kyoto, Japan)
* Bernhard Reus (Brighton, UK)
* Matthias Schröder (Darmstadt, Germany)
* Alex Simpson (Ljubljana, Slovenia)
*
*
*Submission:*
*
*
Extended abstracts (1-2 pages) of original work are welcome.
*
*
**
*Extended Deadline:*
*10 May 2017*
**
*Upload your submission via EasyChair:*
https://easychair.org/conferences/?conf=ccc20170
*Programme Committee:*
* Ulrich Berger (Swansea)
* Pieter Collins (Maastricht)
* Mathieu Hoyrup (Nancy) (co-chair)
* Erik Palmgren (Stockholm)
* Victor Selivanov (Novosibirsk)
* Dieter Spreen (Siegen) (co-chair)
* Martin Ziegler (Daejeon).
*Organizing Committee:*
* Anne-Lise Charbonnier (Nancy)
* Mathieu Hoyrup (Nancy)
こんにちは。愛媛大学の藤田です。
次回のTGSAセミナーの案内を転送します。
藤田 博司 <fujita.hiroshi.mh(a)ehime-u.ac.jp>
________________________________
差出人: Dmitri SHAKHMATOV <dmitri.shakhmatov(a)dmitri.math.sci.ehime-u.ac.jp>
送信日時: 2017年4月11日 10:55
宛先: FUJITA Hiroshi
CC: dmitri.shakhmatov(a)dmitri.math.sci.ehime-u.ac.jp
件名: 松山 TGSAセミナーのお知らせ(4月19日)
皆様、
「Matsuyama Seminar on Topology, Geometry, Set Theory and their
Applications」(松山TGSAセミナー)のお知らせです。
*****
第30回のセミナー
日時: 2017年4月19日(水) 16:30〜17:30
場所: 愛媛大学理学部2号館2階,大演習室 (201号室)
講演者: Alejandro Dorantes-Aldama (愛媛大学)
題目: Selective sequential pseudcompactness
概要: We say that a topological space $X$ is {\em selectively sequentially pseudcompact} if for every family $\{U_n:n\in\mathbb{N}\}$ of non-empty open subsets of $X$, one can choose a point $x_n\in U_n$ for each $n\in\mathbb{N}$ in such a way that the sequence $\{x_n:n\in \mathbb{N}\}$ has a convergent subsequence. We show that the class of selectively sequentially pseudcompact spaces is closed under arbitrary products and continuous images, contains the class of all dyadic spaces and forms a proper subclass of the class of strongly pseudocompact spaces introduced recently by Garc\'ia-Ferreira and Ortiz-Castillo. We prove, under the Singular Cardinal Hypothesis SCH, that if $G$ is an Abelian group admitting a pseudocompact group topology, then it can also be equipped with a selectively sequentially pseudcompact group topology. Since selectively sequentially pseudcompact spaces are strongly pseudocompact, this provides a strong positive answer to a question of Garc\'ia-Ferreira and Tomita. This is a joint work with Dmitri Shakhmatov.
講演終了後に交流会を予定しています。交流会にご参加いただける方はシャクマトフ<dmitri.shakhmatov(a)ehime-u.ac.jp>までご一報お願い致します。
以上、よろしくお願い申し上げます。
世話人(五十音順)
井上友喜
尾國新一
シャクマトフ ディミトリ
野倉嗣紀
平出耕一
平田浩一
藤田博司
山内貴光
---
ウェブページ: http://www.math.sci.ehime-u.ac.jp/MTGSA.ja.html