logic-mlの皆様
京都大学の湯山です.
来月9月25日(月)〜29日(金)に京都で開催される研究集会 CCC 2023
の参加募集について,下記の通りお知らせいたします.
参加登録の締切は9月13日(水)ですが,参加人数把握のため,早めに登録いただけますと幸いです.
Takao Yuyama
湯山孝雄
京都大学数理解析研究所
yuyama(a)kurims.kyoto-u.ac.jp
----
CALL FOR PARTICIPATION
CCC 2023: Continuity, Computability, Constructivity – From Logic to
Algorithms
Research Institute for Mathematical Sciences, Kyoto University
Kyoto, Japan, September 25 - 29, 2023
Participation can be online or in person and is free of charge.
A link for the registration can be found on the following conference
website:
https://www.i.h.kyoto-u.ac.jp/ccc2023/
Please register early, so that we can confirm the number of participants.
Deadline for registration: September 13
====================================================
Topics: constructive mathematics, constructive analysis, computable
analysis, exact real number computation
CCC is a workshop series that brings together researchers applying
logical methods to the development of algorithms, with a particular
focus on computation with infinite data, where issues of continuity,
computability and constructivity play major roles. Specific topics
include 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 correct algorithms
for computations with real numbers and other continuous data, which are
of increasing importance in safety critical applications and scientific
computation.
========================================================
Invited Speakers:
Johanna Franklin (Hofstra University, USA)
Alexander G. Melnikov (Victoria University of Wellington, NZ)
Takako Nemoto (Tohoku University, Sendai, JP)
Siegfried M. Rump (Hamburg University of Technology, DE)
Linda Westrick (Penn State University, USA)
========================================================
Programme Committee
Ulrich Berger (Swansea, UK)
Daniel Graça (Faro, Portugal)
Takayuki Kihara (Nagoya, Japan)
Milly Maietti (Padua, Italy)
Norbert Müller (Trier, Germany) (chair)
Sewon Park (Kyoto, Japan)
Svetlana Selivanova (Novosibirsk, Russia)
Chuangjie Xu (Munich, Germany)
Martin Ziegler (KAIST, Republic of Korea)
Organizing Committee
Matthew de Brecht (Kyoto, Japan)
Akitoshi Kawamura (Kyoto, Japan) (co-chair)
Sewon Park (Kyoto, Japan)
Holger Thies (Kyoto, Japan) (co-chair)
Hideki Tsuiki (Kyoto, Japan)
Takao Yuyama (Kyoto, Japan)
皆様
東北大の横山です.
直前のご案内になりまして恐縮ですが,以下の通りセミナーを開催いたしますのでご案内いたします.
https://sites.google.com/view/sendai-logic/
日時:8月29日(火) 15:00-
場所:東北大学理学研究科合同A棟803号室
(当日はzoom配信を実施予定です.
zoomにて参加を希望される方は,五十里さん(hiroyuki.ikari.q8(a)dc.tohoku.ac.xn--jp)-u63b4b3ai1gucvn3231fnbwb)
講演者:仁木哲 (ルール大学ボーフム)
題目:
How can an intuitionistic logician understand connexive constructible falsity?
概要:
Constructivists have usually understood negation as an implication to
absurdity. Nonetheless, there have also been dissenting voices to this
conception, one of the most notable among which are ones who advocate
an alternative notion called constructible falsity. Nels David Nelson
(1918-2003) introduced this notion as a `strong’ form of negation,
which provides a direct counter-example to its negand. This
`strongness’ is however often eschewed in favour of paraconsistency,
making the resulting negation, severed of its relationship with
intuitionistic negation, harder for intuitionistic logicians to
comprehend. The issue is more serious in a variant of constructible
falsity introduced by Heinrich Wansing, which validates so-called
`connexive’ principles. This is due to the provability of a
contradictory pair of formulas, which prohibits an interpretation of
it as a `strong’ negation without bringing triviality. As a result,
Wansingian negation should appear even more mysterious to the eyes of
intuitionistic logicians. Another way to relate intuitionistic and
Wansingian negations is to accept the law of excluded middle for the
latter, as studied by Wansing and Hitoshi Omori. This move, however,
compromises constructivity, and therefore is perhaps not so preferable
either. In this talk, I will try to shed some lights on this issue, by
discussing other ways to introduce an interaction between
intuitionistic and Wansing negations. I will compare relative
advantages of the interactions, which may enable intuitionistic
logicians to better understand Wansingian negation and its
connexivity.
どうぞよろしくお願いいたします.
横山啓太
--
Keita Yokoyama
Mathematical Institute, Tohoku University
Aoba, Sendai, JAPAN, 980-8578
keita.yokoyama.c2(a)tohoku.ac.jp