logic-ml の皆様
JAISTの廣川と申します。2月に金沢市で行われます論理と計算に関する ワークショップのご案内を申し上げます。
-------------------------------------------------------------------------------------- Workshop on Logic and Computation
February 8–9, Kanazawa
http://www.jaist.ac.jp/is/labs/ogawa-lab/wlc11.html --------------------------------------------------------------------------------------
The workshop aims at promoting interactions among logicians from proof theory, computability, and rewriting. Several internationally renowned scientists will participate and contribute talks on recent developments.
We welcome participants from all areas and all levels, but due to space restrictions in the venue, the Kanazawa Noh Museum, we kindly ask to contact the organizers at [email protected] beforehand.
The tentative program is as follows: February 8: 10:00-11:00 Ulrich Berger (Swansea, UK) Extraction of verified algorithms in exact real arithmetic
11:00-11:20 Break
11:20-12:00 Monika Seisenberger (Swansea, UK) Program Extraction from Constructive and Classical Proofs: Higman's Lemma
12:00-13:50 Lunch break
13:50-14:30 Guillaume Bonfante (Nancy, France) Comparing implicit characterization by program transformations
14:30-15:10 Masahiko Sato (Kyoto, Japan) Formalization of Mathematics
15:10-15:30 Break
15:30-16:10 Christian Fermüller (Vienna, Austria) Parallel Dialogue Games and Hypersequents for Intermediate Logics
16:10-16:50 Nao Hirokawa (Nomi, Japan) Rewriting Techniques in Complexity Analysis
February 9: 10:00-11:00 Constantine Tsinakis (Nashville, USA) The Finite Embeddability Property for Algebras of Logic
11:00-11:20 Break
11:20-12:00 Dominik Klein (Nomi, Japan) Maximal Completion
12:00-13:50 Lunch break
13:50-14:30 Matthias Baaz (Vienna, Austria) Epsilon-calculus for non-classical logics
14:30-15:10 Agata Ciabattoni (Vienna, Austria) Power and limits of analytic calculi: towards a systematic proof theory for nonclassical logics
15:10-15:30 Break
15:30-16:10 Norbert Preining (Nomi, Japan) Satsifiability in Gödel Logics
16:10-16:50 Kazushige Terui (Kyoto, Japan) Church => Scott = Ptime: an application of resource sensitive realizability
Closing
-- 廣川 直 （北陸先端科学技術大学院大学）