皆様、産総研の山形と申します。Swansea大学のArnold Beckmann教授の講演会を下記の通り開催いたします。Beckmann教授は限定算術、証明複雑度およびそれらと計算複雑度との関係などを研究されています。
入構に事前登録が必要なため、参加ご希望の方は12月12日正午までに山形まで、お名前と所属をお知らせください。参加ご希望の方は必ず事前に連絡していただくようお願いします。
講演日時:12月13日14:00-15:00
場所:産総研関西センター C-6棟2階第16会議室
https://goo.gl/maps/ZJzcgE1agWLxypsk7
*************************
Arnold Beckmann: Consistency of equational theories and the separation
problem for bounded arithmetic
Abstract: The separation problem for bounded arithmetic is one of the
most important problems in the area due to its tight connections to the
question whether computational complexity classes can be separated, the
Millennium problem whether P equals NP or not being the most well-known
one. Well studied candidates for separating theories of bounded
arithmetic are consistency statements of formal theories, building on
Kurt Goedel's famous incompleteness theorems. The most promising
consistency statements are given by those of certain equational
theories. In our talk, we will review the results on consistency of
equational theories in the context of the separation problem for bounded
arithmetic. We explain the progress that has been made over recent
years to advance this problem, and state the research programme that has
resulted from it.
*************************
よろしくご参集ください。
—
山形賴之
国立研究開発法人 産業技術総合研究所 主任研究員
http://staff.aist.go.jp/yoriyuki.yamagata/
投稿の締め切りが 12月28日になりました。
=====================================================
AWPL 2020: 5th Asian Workshop on Philosophical Logic
7-9 April 2020
Hangzhou, China
https://www.xixilogic.org/events/awpl2020/ <https://www.xixilogic.org/events/awpl2020/>
=====================================================
CALL FOR PAPERS
The 5th Asian Workshop on Philosophical Logic, 7-9 April 2020, Hangzhou, China
Asian Workshop on Philosophical Logic (AWPL) is an event-series initiated by a group of Asian logicians, and in 2012 the first installment took place at the JAIST in Japan. It is devoted to promote awareness, understanding, and collaborations among researchers in philosophical logic and related fields. The workshop emphasizes the interplay of philosophical ideas and formal theories. Topics of interest include non-classical logics, philosophical logics, algebraic logics, and their applications in computer science, cognitive science, and social sciences. The second, third and fourth workshops took place successfully in Guangzhou (2014), Taipei (2016) and Beijing (2018), respectively. The previous post conference proceedings were published in the Studia Logica book series “Logic in Asia” (http://www.springer.com/series/13080?detailsPage=titles <http://www.springer.com/series/13080?detailsPage=titles>) with Springer.
The Fifth Asian Workshop on Philosophical Logic (AWPL 2020) will be held in Hangzhou, China, on 7-9 April 2020, organized by the Institute of Logic and Cognition at Zhejiang University.
The AWPL 2020 workshop is an event in the Zhejiang Logic for AI Summit (ZjuLogAI 2020, https://www.xixilogic.org/zjulogai/ <https://www.xixilogic.org/zjulogai/>) which takes place on 6-10 April 2020. All AWPL participants are invited to attend other events as well.
------------------------
INVITED SPEAKERS (confirmed)
Christoph Benzmüller <http://page.mi.fu-berlin.de/cbenzmueller/> (Freie Universität Berlin)
------------------------
SUBMISSION
All submissions should present original works not previously published. Submissions should be typeset in English, using the LNCS template (https://www.springer.com/gp/computer-science/lncs/conference-proceedings-gu… <https://www.springer.com/gp/computer-science/lncs/conference-proceedings-gu…>), be prepared as a PDF file with at most 12 pages (including reference list, appendixes, acknowledgements, etc.), and be sent to the workshop electronically via EasyChair (https://easychair.org/conferences/?conf=awpl2020 <https://easychair.org/conferences/?conf=awpl2020>) by the corresponding author on time. It is assumed that, once a submission is accepted, at least one of its authors will attend the workshop and present the accepted work. After the workshop, selected submissions will be invited to revise and submit to a post conference proceedings, to be published in the “Logic in Asia” series.
------------------------
IMPORTANT DATES
Submission deadline: 28 December 2019.
Notification: 1 January 2020
Workshop: 7-9 April 2020
------------------------
PROGRAM COMMITTEE (to be confirmed)
Thomas Ågotnes, University of Bergen
Nick Bezhanishvili, University of Amsterdam
Sujata Ghosh, Indian Statistical Institute
Meiyun Guo, South-West University, China
Fengkui Ju, Beijing Normal University
Kok-Yong Lee, National Chung Cheng University
Beishui Liao, Zhejiang University (chair)
Hanti Lin, University of California Davis
Fenrong Liu, Tsinghua University
Hu Liu, Sun Yat-Sen University
Xinwen Liu, Chinese Academy of Social Sciences
Minghui Ma, Sun Yat-Sen University
Hiroakira Ono, JAIST, Japan
Eric Pacuit, University of Maryland
R Ramanujam, Institute of Mathematical Sciences, India
Olivier Roy, University of Bayreuth
Katsuhiko Sano, Hokkaido University
Yì N. Wáng, Zhejiang University (co-chair)
Chin-Mu Yang, Taiwan National University
Jiji Zhang, Lingnan University
_______________________________________________
Logic-ml mailing list
Logic-ml(a)fos.kuis.kyoto-u.ac.jp <mailto:Logic-ml@fos.kuis.kyoto-u.ac.jp>
http://www.fos.kuis.kyoto-u.ac.jp/cgi-bin/mailman/listinfo/logic-ml <http://www.fos.kuis.kyoto-u.ac.jp/cgi-bin/mailman/listinfo/logic-ml>
みなさま
直前になりましたが、第2回の基礎論セミナー
のお知らせです。
どなたでも聴講できますので
ご興味のおありの方はどうぞいらして下さい。
web page:
https://www.ms.u-tokyo.ac.jp/seminar/logic/
新井敏康
第2回基礎論セミナー
日時:2019年11月21日(木)13:30-15:00
場所:東京大学大学院数理科学研究科 003号室
講演者:佐藤憲太郎
title:
Self-referential Theorems for Finitist Arithmetic
abstract::
The finitist logic excludes,on the syntax level, unbounded quantifiers
and accommodates only bounded quantifiers.
The following two self-referential theorems for arithmetic theories
over the finitist logic will be considered:
Tarski's impossibility of naive truth predicate and
Goedel's incompleteness theorem.
Particularly, it will be briefly explained that
(i) the naive truth theory over the finitist arithmetic with summation
and multiplication
is consistent and proves its own consistency, and that
(ii) by the use of finitist arithmetic, the hierarchy of consistency strengths,
based on Goedel's second incompleteness theorem,
can be extended downward (to the area not reachable by first order
predicate arithmetic).
This is a joint work with Jan Walker, and overlaps significantly with
his doctoral dissertation.
問合せ先:新井敏康
tosarai(a)ms.u-tokyo.ac.jp
Workshop Announcement
Categorical Algebra and Computation
A Workshop in Honour of John Power on the occasion of his 60th Birthday
23rd December 2019
Research Institute for Mathematical Sciences, Kyoto University
http://www.kurims.kyoto-u.ac.jp/~hassei/ajp60/
We are delighted to host a workshop in honour of John Power on the occasion of
his 60th birthday at RIMS, Kyoto University. John, recently retired and now
a honorary professor at Macquarie University, Sydney, is staying in Kyoto as
a visiting professor of RIMS for the winter of 2019/2020. During his stay in
Kyoto, John turns 60.
John has made substantial contributions in category theory and its applications
to computer science throughout his career. At the same time, he has been
a wonderful teacher, mentor and friend to many of us, with his exceptional
insights, kindness, and humour.
Since the 1990's John has regularly visited Japan and worked with Japanese
researchers, including several PhD students and young postdocs.
John's presence has made great impact on Japanese research community of
semantics of computation and related fields; John has co-authored a number of
papers with young Japanese researchers and served as their mentor.
This workshop will feature talks by John's friends and collaborators as well as
young Japanese researchers who are under the influence of John's work
in a broad sense.
The speakers will include
- Soichiro Fujii (Kyoto University)
- Shin-ya Katsumata (NII, Tokyo)
- Yoshiki Kinoshita (Kanagawa University)
- Yuichi Komorida (NII, Tokyo)
- Steve Lack (Macquarie University)
- Ken Sakayori (University of Tokyo)
and John Power.
Registration
Attendance is free. Please register at the workshop webpage
http://www.kurims.kyoto-u.ac.jp/~hassei/ajp60/
so that we can estimate the number of participants. (We plan to supply tea,
coffee and sweets during the break.)
Venue
The workshop will take place in the conference room 420 of the RIMS main
building located in the North Campus of the university. For access
information and maps see
http://www.kurims.kyoto-u.ac.jp/en/access-01.html
Organizers
- Masahito Hasegawa (local organizer) (Kyoto University)
- Ichiro Hasuo (NII, Tokyo)
- Makoto Takeyama (Kanagawa University)
ーーーーーーーーーーーーーーーーーーーーーーーーーーーー
直前の告知となり申し訳けありませんが、11が月7日木曜日が講演会日の案内をさせていただければありがたいです。ご検討の程、お願い申し上げます。。
岡田光弘 慶應義塾大学文学部哲学専攻
*******************************************************************************************
Jean-Baptiste Joinet教授(Dept Philosophy, Univ Lyon) , 11月7日(木)Nov.7th
(Thurs) 慶應大 Keio U.
******************************************************************************************
三田ロジックセミナー Mita Logic Seminar
11月7日 November 7th
慶應義塾大学三田キャンパス Mita Campus, Keio University
講演者SPEAKER: Jean-Baptiste Joinet (Université de Lyon, IRPhiL, Idex Lyon)
タイトルTITLE: Types and behavioral indiscernibility
***************************************************************************
参加自由、事前登録無し。お気軽にお立ち寄りください。No registration needed
***************************************************************************
アブストラクトは以下をご覧ください。Abstract attached below.
日時Date:
11月7日(木) November 7th (Thu.), 16:30-18:00
場所Venue:
慶應義塾大三田キャンパス大学院校舎1階312番教室(下のキャンパスマップ3番)
Classroom 312, 1F of Graduate School Building, Mita Campus, Keio University
(#3 of the Campus Map below)
構内図Campus Map:
https://www.keio.ac.jp/en/assets/download/maps/mita/map_mita.pdf
お問い合わせ先:慶應義塾大学文学部岡田光弘研究室
東京都港区三田2-15-45
三田ロジックセミナー
Email: logic(a)abelard.flet.keio.ac.jp <mailto:logic@abelard.flet.keio.ac.jp>
----------------------------------------------------------
アブストラクトABSTRACT:
Types and behavioral indiscernibility
In computing theory, the type of a program is an information partially
specifying the task it performs. Within the framework of (what is
usually called) the Proofs-as-Programs and Propositions-as-Types
paradigm, a type (a.k.a. a proposition) is defined as a set of programs
having some common behavior w.r.t. a specific undecidable property (the
termination of execution when entering in interaction with contexts).
The talk will be devoted to investigate the underlying classifying
methodology used to define the notion of type (typing by closure by
bi-orthogonality) which, in that particular case, is used to classify
computational behaviors.