筑波大学の石川竜一郎さんからの依頼により、代理でご案内を投稿します。
国際ワークショップ:
International Workshop on Game Theory, Epistemic Logic, & Related Topics
が8月27日から30日まで、筑波大学で開かれます。
詳しくは
http://infoshako.sk.tsukuba.ac.jp/~ishikawa/gamelogic12/
をご覧ください。
宜しくお願い致します。
鈴木信行@静岡大学
Logic-ml $B$N3'MM!$(B
$B$3$s$P$s$O!$ElKLBg3X$NKYH*2B9($G$9!%(B
7$B7n(B20$BF|!J6b!K$KElKLBg3X$K$F2<5-%;%_%J!<$r9T$$$^$9$N$G!$6=L#$N$"$kJ}$O$<$R$4;22C$/$@$5$$!%(B
$BFs9V1i$4$6$$$^$9!%(B
*************************************************************************
$BF|;~!'(B7$B7n(B20$BF|!J6b!K(B15:30$B!A(B17:00
$B>l=j!'ElKLBg3X(B $BKL@DMU;3%-%c%s%Q%9(B $BM}3X9gF1Eo(B 1201$B9f<<(B
$B-!(B15:30$B!A(B16:00
$B9V1i<T!'(B $B;3:j!!Ip(B $B!J(B $BElKLBg3XBg3X1!!&M}3X8&5f2J(B $B!K(B
$B%?%$%H%k!'(B The Optimal Bounded Marriage Theorem
$B%"%V%9%H%i%/%H!'(B
J. Hirst showed that WKL_0 is equivalent over RCA_0 to the assertion
that every bounded marriage problem satisfying Hall condition has a
solution. In this talk, arranging the result, we mainly prove that
ACA_0 is equivalent over RCA_0 to the assertion that every bounded
marriage problem of the finite total utility satisfying Hall condition
has an optimal solution.
$B-"(B16:00$B!A(B17:00
$B9V1i<T!'(B $B2,K\(B $B7=;K(B $B!J@gBf9bEy@lLg3X9;!&Am9g2J3X7O!K(B
$B%?%$%H%k!'(B $BL?BjMMAj&L7W;;$N0l3,3HD%$K$D$$$F(B
$B%"%V%9%H%i%/%H!'(B
$BK\H/I=$G$O!$0l3,MMAj&L7W;;(B($BL?BjMMAj&L7W;;$N0l3,3HD%(B)$B$H$=$N<~JU>u67$K$D$$$F2r@b$9$k!%$^$:!$0l3,MMAj&L7W;;$r9=C[$9$k$K;j$kGX7J$H$7$F!$7A<0<jK!$K$D$$$F=R$Y$k!%(B
$B<!$K!$L?BjMMAj&L7W;;$H0l3,=R8lO@M}$r9g$o$;$F!$0l3,MMAj&L7W;;$rDj5A$9$k!%$=$N8e!$0l3,MMAj&L7W;;$N@-<A$N$&$A!$40A4@-$HI=8=NO$K$D$$$F=R$Y$k!%$5$i$K!$0l3,MMAj&L7W;;$NE,MQNc$H$7$F!$%;%^%U%)$K$h$kAj8_GS=|$NBEEv@->ZL@$r>R2p$9$k!%:G8e$K!$$^$H$a$H4XO"2]Bj$N>R2p$r9T$&!%(B
*************************************************************************
$B0J>e$G$9!%(B
$B%;%_%J!<>pJs$N>\:YEy$O2<5-@gBf%m%8%C%/$N%[!<%`%Z!<%8$+$i$b$4Mw$$$?$@$1$^$9!%(B
https://sites.google.com/site/sendailogichomepage/
$BKYH*!!2B9((B
-- --
$BElKLBg3XBg3X1!!!M}3X8&5f2J(B
$B?t3X@l96!!;:3X41O"7H8&5f0w(B
E-mail: higurashi3873(a)yahoo.co.jp
logic-ml の皆様、
北陸先端科学技術大学院大学の佐野勝彦と申します。
9/10-9/14 に金沢で開催されるLATD 2012 の Call for participation をお送りいたします。
重複してお受け取りの場合はどうぞご容赦ください。
佐野勝彦
=====================================================================
Logic, Algebra and Truth Degrees 2012
http://www.jaist.ac.jp/rcis/latd12/
Call for participation
The third official meeting of the EUSFLAT Working Group on Mathematical
Fuzzy Logic [1] will be held on 10-14 September 2012 in Kanazawa, Japan.
The conference is organized by Research Center for Integrated Science [2],
Japan Advanced Institute of Science and Technology [3].
We invite interested researchers to participate in the conference. The
program has been settled and can be found at the web page
http://www.jaist.ac.jp/rcis/latd12/index.php?program
Conference Web Site:
http://www.jaist.ac.jp/rcis/latd12/
Programme Committee:
. Stefano Aguzzoli (University of Milano, Italy)
. Matthias Baaz (Vienna University of Technology, Austria)
. Petr Cintula (Academy of Sciences, Czech Republic)
. Carles Noguera (CSIC, Spain)
. Hiroakira Ono (JAIST, Japan), Chair
. James Raftery (University of KwaZulu-Natal, South Africa)
. Constantine Tsinakis (Vanderbilt University, USA)
Program:
Invited Speakers and the respective titles (abstracts on the web page):
. Rostislav Horčík (Academy of Sciences, Czech Republic)
Quasiequational Theory of Square-increasing Residuated Lattices
is Undecidable
. Emil Jeřábek (Academy of Sciences, Czech Republic)
Admissibility and unification with parameters
. Daniele Mundici (University of Florence, Italy)
When every principal congruence is an intersection of maximal congruences
. Greg Restall (University of Melbourne, Australia)
Exotic Sequent Calculi for Truth Degrees
. Luca Spada (University of Salerno, Italy)
The multifarious representations of MV-algebras
Tutorial:
. Felix Bou (University of Barcelona, Spain)
(Un)Decidability in Monadic Fuzzy Predicate Logics
Contributed talks:
. Stefano Aguzzoli, Tommaso Flaminio and Enrico Marchioni
Finite Forests. Their Algebras and Logics
. Majid Alizadeh, Mohammad Ardeshir and Wim Ruitenburg
Modal Basic Propositional Logic
. Conrad Asmus
Towards Many Valued Dependence Logics
. Matthias Baaz and Agata Ciabattoni
Proof theory for non-classical logics: negative results
. Paolo Baldi, Agata Ciabattoni and Lara Spendier
Standard completeness for extensions of MTL: an automated approach
. Libor Behounek
Feasibility of program runs in fuzzified Propositional Dynamic Logic
. Marjon Blondeel, Tommaso Flaminio and Lluís Godo
Relating fuzzy autoepistemic logic and Łukasiewicz KD45 modal logic
. Felix Bou, Francesc Esteva and Lluis Godo
On possibilistic modal logics over Gödel logic
. Félix Bou, Marco Cerami and Francesc Esteva
Concept Satisfiability in finite-valued Fuzzy Description Logics is
PSPACE-complete
. Rodica Ceterchi
The Decomposition of Linearly Ordered Pseudo-Hoops
. Petr Cintula, Rostislav Horcík and Carles Noguera
A basic fuzzy logic which is really basic and fuzzy
. Oliver Fasching and Matthias Baaz
An analytic calculus for Gödel logics with an operator that shifts
truth values
. Christian Fermüller and Christoph Roschger
Extending Giles's Game for Lukasiewicz Logic to Fuzzy Quantification
. Nikolaos Galatos
The finite embeddability property for varieties of distributive,
integral residuated lattices
. Sándor Jenei
Recent results on involute FLe-monoids
. Michiro Kondo
States on bounded commutative residuated lattices
. Tomasz Kowalski
BCK is not structurally complete
. Michał Kozak
Double Negation in Intuitionistic Style Sequent Systems for Residuated
Lattices
. Tomas Kroupa and Ondrej Majer
Nash Equilibria in a Class of Zero-Sum Games Represented by McNaughton
Functions
. Jan Kühr
BCK-algebras and triple construction
. Antonio Ledda, Tomasz Kowalski and Francesco Paoli
On independent varieties and some related notions
. Leonardo Manuel Cabrer and Vincenzo Marra
Advances on Unification in MV-algebras
. Vincenzo Marra and Stefano Aguzzoli
Betting on events observed over an interval of time: de Finetti's
Dutch-Book argument for Goedel logic
. Yoshihiro Maruyama
Diagonals, Paradoxes, and the Edge of Consistency: classical, quantum,
and fuzzy
. Yuri Movsisyan and Diana Davidova
Representation theorem for interlaced q-bilattices
. Petra Murinová
Structure of generalized intermediate syllogisms
. Liu Doing Ning and Zhe Lin
Proof Theoretical Investigations on Substructure Modal Logic
. Hitoshi Omori and Katsuhiko Sano
Generalizing Functional Completeness in Belnap-Dunn's Four Valued System
. Jan Paseka and Michal Botur
Tense MV-algebras and related operators
. Milan Petrík
Algebraic webs on more general structures
. James Raftery
Inconsistency lemmas in algebraic logic
. Umberto Rivieccio
Implicative twist-structures
. Takahiro Seki
Disjunction Property of Non-Associative Substructural Logics
. Shawn Standefer
Revision theory and Field's theory of truth
. Nobu-Yuki Suzuki
Remarks on Ono's Two Problems: Existence and Disjunction Properties
in Super-Intuitionistic Predicate Logics
. Peter Verdée
Paraconsistent logic and degrees of believe
. Thomas Vetterlein
Construction methods for finite commutative tomonoids
. Shunsuke Yatabe
A constructive naive set theory and the $\omega$-rule
. William Young
Free MV-algebras inside Free Abelian l-groups
Registration:
Registration is required and can be done at
http://www.jaist.ac.jp/rcis/latd12/index.php?registration
Conference dates:
The scientific program will start Monday morning (10 September) and finish
Friday noon (14 September). Wednesday afternoon we plan an excursion.
Venue:
The conference will be held in the city of Kanazawa [4,5,6], located in the
Ishikawa prefecture of Japan on the Japan Sea.
The venue is the Ishikawa Prefectural Museum of Art [7] in the center
of Kanazawa.
Local Organizing Committee:
. Norbert Preining (JAIST, Japan), Chair
. Katsuhiko Sano (JAIST, Japan)
. Kazushige Terui (Kyoto University, Japan)
. Shunsuke Yatabe (AIST, Japan)
For further information please contact: latd12(a)jaist.ac.jp
[1] http://www.mathfuzzlog.org/
[2] http://www.jaist.ac.jp/rcis/en/
[3] http://www.jaist.ac.jp/
[4] http://en.wikipedia.org/wiki/Kanazawa,_Ishikawa
[5] http://www.kanazawa-tourism.com/
[6] http://wikitravel.org/en/Kanazawa
[7] http://www.ishibi.pref.ishikawa.jp/index_j.html
(重複して受け取られた場合はご容赦ください)
名古屋大学の中村と申します。
法情報学に関する国際ワークショップ JURISIN2012 の CFP をお送りします。
今年の11月30日から12月1日にかけて宮崎で開催されます。
多数のご投稿をお待ちしております。
[Apologies for multiple copies]
---------------------------------------------------
Call for Papers:
Sixth International Workshop on Juris-informatics (JURISIN 2012)
Nov.30 - Dec. 1, 2012
http://www.kl.i.is.nagoya-u.ac.jp/jurisin2012/
Amusement Zone Miyazaki (The JA-AZM Hall)
Kirishima 1-1-1, Miyazaki, Japan
with a support of The Japanese Society for Artificial Intelligence in
association with Fourth JSAI International Symposia on AI (JSAI-isAI 2012)
**** Submission Deadline: September 17, 2012 ****
**** Aims and scope ****
Juris-informatics is a new research area which studies legal issues
from the perspective of informatics. The purpose of this workshop is
to discuss both the fundamental and practical issues for
juris-informatics among people from the various backgrounds such as
law, social science, information and intelligent technology, logic and
philosophy, including the conventional "AI and law" area. We solicit
unpublished papers on theories, technologies and applications on
juris-informatics.
**** Topics ****
Relevant topics include, but are not limited to, the following:
* Legal reasoning
* Argumentation/Argumentation agent
* Legal term ontology
* Formal legal knowledge-base/Intelligent management of legal
knowledge-base
* Translation of legal documents
* Computer-aided law education
* Use of Informatics and AI in law
* Legal issues on ubiquitous computing/multi-agent system/the Internet
* Social implications of use of informatics and AI in law
**** Submissions ****
We welcome and encourage the submission of high quality, original
papers, which are not simultaneously submitted for publication
elsewhere except as a submission to JURIX 2012 (The 25th International
Conference on Legal Knowledge and Information Systems). The double
submission policy with JURIX 2012 is as follows:
1. Papers being submitted both to JURISIN2012 and JURIX2012 must note
this on the title page.
2. A paper to be presented at JURISIN2012 must be withdrawn from
JURIX2012 and vice versa according to the choice by the authors.
3. If the authors do not follow this double submission policy, the paper
by the authors will not be included in the proceedings of JURISIN 2012.
Papers should be written in English, formatted according to the
Springer Verlag LNCS style in a pdf form, which can be obtained from
http://www.springeronline.com, and not exceed 14 pages including
figures, references, etc.
If you use a word file, please follow the instruction of the format
designated at the workshop page, and then convert it into a pdf form
and submit it at the paper submission page.
If a paper is accepted, at least one author of the paper must register
the workshop and present it.
**** Proceedings ****
A printed volume of the proceedings with ISBN will be available at the
workshop.
**** Post Proceedings****
The chair of JSAI-IsAI 2012 is now negotiating with Springer Verlag to
publish selected papers of the workshop in the JSAI-isAI 2012
post-proceedings as a volume of LNAI. If it is the case, the authors
of papers presented at the workshop will be asked to extend their
contributions, possibly incorporating the results of the workshop
discussion, to be included in the workshop post-proceedings, after
another round of refereeing.
Note that the selected papers of the previous workshops were publisehd
as volumes of LNAI4914(JURISIN 2007), LNAI5447(JURISIN 2008),
LNAI6284(JURISIN 2009), LNAI6797(JURISIN2010) and LNAI7258(JURISIN2011),
respectively.
**** Financial Support for Students ****
We have received from JSAI partical economical support for travelling
costs for promising foreign students whose papers have been accepted
to be presented at JURISIN2012. The amount of the whole support is
250,000 yen and we divide it to students who need a support. The
actual support will vary based on the number of applicants and where
students come from. Please contact the chairperson (mnakamur ((at))
law.nagoya-u.ac.jp) for details.
**** Important Dates ****
Submission Deadline: September 17, 2012
Notification: October 15, 2012
Camera Ready Copy due: October 29, 2012
JURISIN 2012: November 30 - December 1, 2012
**** Workshop Chair ****
Makoto Nakamura, Nagoya University, Japan
Katsuhiko Toyama, Nagoya University, Japan
**** Organizing Committee Members ****
Makoto Nakamura, Nagoya University, Japan
Katsumi Nitta, Tokyo Institute of Technology, Japan
Seiichiro Sakurai, Meiji Gakuin University, Japan
Ken Satoh, National Institute of Informatics and Sokendai, Japan
Satoshi Tojo, Japan Advanced Institute of Science and Technology(JAIST),
Japan
Katsuhiko Toyama, Nagoya University, Japan
**** Programme Committee Members ****
Thomas Agotnes, University of Bergen, Norway
Phan Minh Dung, AIT, Thailand
Tom Gordon, Franfoher FOKUS, Germany
Guido Governatori, The University of Queensland, Australia
Tokuyasu Kakuta, Nagoya University, Japan
Takehiko Kasahara, Toin University of Yokohama, Japan
Masahiro Kozuka, Kanazawa University, Japan
Makoto Nakamura, Nagoya University, Japan
Katsumi Nitta, Tokyo Institute of Technology, Japan
Paulo Novais, University of Minho, Portugal
Jeremy Pitt, Imperial College, UK
Henry Prakken, University of Utrecht & Groningen, The Netherlands
Seiichiro Sakurai, Meiji Gakuin University, Japan
Ken Satoh, National Institute of Informatics and Sokendai, Japan
Akira Shimazu, Japan Advanced Institute of Science and Technology, Japan
Fumihiko Takahashi, Meiji Gakuin University, Japan
Satoshi Tojo, Japan Advanced Institute of Science and Technology, Japan
Katsuhiko Toyama, Nagoya University, Japan
Radboud Winkels, The University of Amsterdam, the Netherlands
Shin-ichi, Yoro, Osaka University, Japan
John Zeleznikow, Victoria University, Australia
**** Home page of JURISIN 2012 ****
http://www.kl.i.is.nagoya-u.ac.jp/jurisin2012/
**** preivous JURISIN workshops ****
JURISIN2007 http://research.nii.ac.jp/~ksatoh/jurisin.html
JURISIN2008 http://www.ntt.dis.titech.ac.jp/jurisin2008/
JURISIN2009 http://research.nii.ac.jp/~ksatoh/jurisin2009.html
JURISIN2010 http://research.nii.ac.jp/~ksatoh/jurisin2010.html
JURISIN2011 http://research.nii.ac.jp/~ksatoh/jurisin2011.html
For any inquiry, please send it to "jurisin2012 ((at)) kl.i.is.nagoya-u.ac.jp".
--
中村 誠@名古屋大学大学院法学研究科附属法情報研究センター
Makoto Nakamura ( mnakamur(a)law.nagoya-u.ac.jp )
Japan Legal Information Institute,
Graduate School of Law, Nagoya University
TEL:(052)789-5145 / FAX:(052)789-3800
$B3'MM!"(B
$B5~ETBg3XBg3X1!M}3X8&5f2J$G$O!"0J2<$NFbMF$G=8Cf9V5A!JA4#42s!K(B
$B$rM=Dj$7$F$*$j$^$9!#9V;U$O!"El5~Bg3X$NO!Hx0lO:@h@8$G$9!#(B
$BM>Be?t$NM}O@$N7W;;5!2J3X$X$N1~MQ$K$D$$$F!"=iJb$+$i>\$7$/2r@b(B
$B$7$FD:$1$k$H;G$C$F$*$j$^$9!J7wO@$K4X$9$kM=HwCN<1$OITMW!"$H$N(B
$B$3$H$G$9!K!#(B
$BM}3X8&5f2J$N3+9V2JL\$G$9$,!"4X?4$r$*;}$A$NJ}$O$I$J$?$G$b$*5$(B
$B7Z$K$4MhD02<$5$$!#ITL@$JE@$,$"$j$^$7$?$i!"D9C+@n$^$G$*Ld$$9g(B
$B$o$;$/$@$5$$!#(B
$BD9C+@n???M(B <hassei at kurims.kyoto-u.ac.jp>
$B5~ETBg3X?tM}2r@O8&5f=j(B
$B5~ETBg3XBg3X1!M}3X8&5f2J?t3X!&?tM}2r@O@l96?tM}2r@O7O(B
$B?tM}2r@OFCJL9V5A#1(B $B7W;;5!2J3X!J=8Cf9V5A!K(B
$B!V(BCategorical Algebra and Coalgebra:
An Instance of Category Theory in Computer Science$B!W(B
$B9V(B $B;U!'O!Hx(B $B0lO:(B $B;a(B $B!JEl5~Bg3XBg3X1!>pJsM}9)3X7O8&5f2J(B $B9V;U!K(B
$BF|(B $B;~!'#2#0#1#2G/#77n#1#9F|!#0F|!#1F|!Wn#1F|(B $B#1#4;~!A(B
$B>l(B $B=j!'Am9g8&5f#29f4[#43,(B $B#4#7#89f<<(B
$B!JCm!'KLIt$N?tM}2r@O8&5f=jK\4[$G$O$"$j$^$;$s!#I4K|JW$NFnElB&$G$9!#(B
$BCO?^$O(B http://www.kurims.kyoto-u.ac.jp/~hassei/map-2.jpg $B!K(B
Abstract
Category theory is an abstract mathematical language that is used in
many different branches of mathematics. It has also found successful
applications in computer science - in fact, in many different
ways. The classic example is in the semantics of functional
programming, where types are objects and programs are arrows. In this
course we focus on another eminent use of categories in computer
science, namely categorical algebra and coalgebra.
The bottom-line here is: a coalgebra is a categorical abstraction of
dynamics, i.e. a state-based system like an automaton; and an algebra
(especially an initial one) is an abstraction of syntax, i.e. the set
of well-formed programs. Plotkin's structural operational semantics -
connecting syntax and dynamics - also allows an elegant categorical
modeling via a distributive law.
After exhibiting these basics of the (co)algebraic modeling in
computer science, we proceed to a more advanced categorical structure
of presheaf categories. We introduce the necessary categorical
machineries - (co)end, Kan extension, Yoneda lemma, etc. - as well as
demonstrate their applications in name-passing calculi like the
pi-calculus.
No preliminary knowledge in category theory is assumed. The course
materials will be announced at the course website.
$B0u:~MQ0FFb!'(B
http://www.kurims.kyoto-u.ac.jp/~hassei/hasuo2012.pdf
*Call for Papers*
TARK 2013
14th Conference on Theoretical Aspects of Rationality and Knowledge
January 7-9, 2013
The Institute of Mathematical Sciences, Chennai, India
Conference website: http://www.imsc.res.in/tark/
About the Conference
The mission of the TARK conferences is to bring together researchers
from a wide variety of fields, including Artificial Intelligence,
Cryptography, Distributed Computing, Economics and Game Theory,
Linguistics, Philosophy, and Psychology, in order to further our
understanding of interdisciplinary issues involving reasoning about
rationality and knowledge. Topics of interest include, but are not
limited to, semantic models for knowledge, belief, awareness and
uncertainty, bounded rationality and resource-bounded reasoning,
commonsense epistemic reasoning, epistemic logic, epistemic game
theory, knowledge and action, applications of reasoning about
knowledge and other mental states, belief revision, and foundations of
multi-agent systems.
Invited Speakers
Pierpaolo Battigalli, Bocconi University
Lin Fangzhen, Hong Kong University of Science and Technology
Rineke Verbrugge, University of Groningen
Submissions are now invited to TARK 2013. Extended Abstracts can be
submitted here:
https://www.easychair.org/conferences/?conf=tark2013
Strong preference will be given to papers whose topic is of interest
to an interdisciplinary audience, and papers should be accessible to
such an audience. Papers will be held to the usual high standards of
research publications. In particular, they should 1) contain enough
information to enable the program committee to identify the main
contribution of the work; 2) explain the significance of the work --
its novelty and its practical or theoretical implications; and 3)
include comparisons with and references to relevant literature.
Abstracts should be no longer than ten double-spaced pages (4,000
words). Optional technical details such as proofs may be included in
an appendix. An email address of the contact author should be
included. Papers arriving late or departing significantly from these
guidelines risk immediate rejection. One author of each accepted
paper will be expected to present the paper at the conference.
Economists should be aware that special arrangements have been made
with certain economics journals (in particular, with International
Journal of Game Theory, Games and Economic Behavior, Journal of
Economic Theory, and Mathematical Social Sciences, so that publication
of an extended abstract in TARK will not prejudice publication of a
full journal version.
TARK 2013 will precede the Indian Conference on Logics and
Applications (ICLA) held from January 10 - 12, 2013, also at the
Institute for Mathematical Sciences in Chennai, India.
TARK 2013 is the 14th conference of the TARK conference series.
Previous conferences have been held bi-annually around the world. The
most recent conference was held 2011 at the University of Groningen,
Netherlands, see http://www.philos.rug.nl/TARK2011/. The proceedings
of all previous TARK conferences can be accessed here
http://www.tark.org/.
TARK 2013 is the first TARK conference to be held in India. It is also
the first TARK conference to be held in January.
Key Dates for TARK 2013
Submission of abstracts: September 3, 2012
Notification of authors: October 29, 2012
Camera ready copy of accepted papers: November 30, 2012
Conference: January 7 - 9, 2013, Institute of Mathematical Sciences,
Chennai, India
Program Committee
Samson Abramsky, Oxford University
Thomas Agotnes, Universitetet i Bergen
Hans van Ditmarsch, Universidad de Sevilla
Amanda Friedenberg, Arizona State University
Aviad Heifetz, The Open University of Israel
Jerome Lang, CNRS and Université Paris-Dauphine
Fenrong Liu, Tsinghua University
Larry Moss, Indiana University, Bloomington
Antonio Penta, University of Wisconsin-Madison
Andres Perea, Maastricht University
Ramaswamy Ramanujam, Institute for Mathematical Sciences, Chennai
Olivier Roy, Ludwig-Maximilians-Universität München
Burkhard C. Schipper, University of California, Davis
Marciano Siniscalchi, Northwestern University
Giacomo Sillari, Scuola Normale Superiore, Pisa
Nobuyuki Suzuki,Shizuoka University
Jonathan Zvesper, London
Local Organizing Committee
Sujata Ghosh, Indian Statistical Institute, Chennai
Kamal Lodaya, Institute of Mathematical Sciences, Chennai
R. Ramanujam, Institute of Mathematical Sciences, Chennai
S. P. Suresh, Chennai Mathematical Institute
Program Chair
Burkhard C. Schipper
University of California, Davis
Department of Economics
One Shields Avenue
Davis, CA 95616, USA
Email: bcschipper-at-ucdavis-dot-edu
Local Organizing Chair
R. Ramanujam
Institute for Mathematical Sciences
CIT Campus, Taramani
Chennai 600 113, India.
Email: tark2013org at gmail dot com
Chair of the TARK Conference Series
Joe Halpern
Cornell University
Computer Science Department
Kobe Colloquium on Logic, Statistics and Informatics
以下の要領でコロキウムを開催します。
日時:2012年6月28日(木)15:10-16:40
場所:神戸大学自然科学総合研究棟3号館4階421室(プレゼンテーション室)
講演者:Paul Larson (Miami University, Oxford, Ohio)
========================================================================
題目:Models of size aleph_1 in abstract elementary classes
アブストラクト:
We will present some applications of set theoretic techniques to the study
of models of
cardinality aleph_1 in various abstract elementary classes. The impetus for
this work was the still-open
question of absoluteness of aleph_1-categoricity for the class of models of
a fixed sentence of L_{omega_1, omega}.
Most of our results apply to the class of analytically presented AEC's,
those whose restriction to countable models is analytic.
These classes have been studied for many years under various names. Time
permitting, connections with Vaught's
Conjecture will also be discussed. This is joint work with Baldwin and
Shelah.
========================================================================
交通:阪急六甲駅またはJR六甲道駅から神戸市バス36系統「鶴甲団地」
行きに乗車,「神大本部工学部前」停留所下車,徒歩すぐ.
http://www.kobe-u.ac.jp/info/access/rokko/rokkodai-dai2.htm
連絡先:ブレンドレ ヨーグ brendle(a)kurt.scitec.kobe-u.ac.jp
AiML-2012: CALL FOR PARTICIPATION
9-TH INTERNATIONAL CONFERENCE ON ADVANCES IN MODAL LOGIC
COPENHAGEN, 22-25 AUGUST, 2012
http://hylocore.ruc.dk/aiml2012.html
Advances in Modal Logic is an initiative aimed at presenting
the state of the art in modal logic and its various applications. The
initiative consists of a conference series together with volumes based on
the conferences. Information about the AiML series can be obtained at
http://www.aiml.net. AiML-2012 is the ninth conference in the series.
REGISTRATION: Please see http://hylocore.ruc.dk/aiml2012/registration.php
NOTE THAT THE DEADLINE FOR EARLY REGISTRATION IS JUNE 29.
ACCEPTED PAPERS: Please see http://hylocore.ruc.dk/aiml2012/accepted.php
CONFERENCE LOCATION
Advances in Modal Logic 2012 will be held at
the IDA conference centre in downtown Copenhagen:
http://ida.dk/sites/moedecenter/english/Sider/EnglishForside.aspx
This is in easy walking distance from Copenhagen Central Station and a
number of reasonably priced hotels.
INVITED SPEAKERS
Lev Beklemishev (Moscow State University)
Johan van Benthem (University of Amsterdam and Stanford University)
Lars Birkedal (IT University of Copenhagen, Denmark)
Patrick Blackburn (Roskilde University)
Balder ten Cate (UC Santa Cruz)
Larisa Maksimova (Novosibirsk State University)
SPECIAL SESSION ON HYBRID LOGIC. Hybrid logic is an extension of modal logic
allowing to refer explicitly to states of the model in the syntax of formulas.
There will be a special session of AiML devoted to papers on hybrid logic.
The scope of the special session is standard hybrid-logical machinery like
nominals, satisfaction operators, and the downarrow binder, but also other
extensions of modal logic can be considered.
SPECIAL SESSION IN HONOUR OF LARISA MAKSIMOVA. There will be a
special session of AiML devoted to papers and talks in honour of Larisa
Maksimova, in recognition of her many outstanding contributions to modal
logic.
PROGRAMME COMMITTEE
Carlos Areces (FaMAF, Universitad Nacional de Cordoba, Argentina)
Philippe Balbiani (IRIT, Toulouse, France)
Lev Beklemishev (Moscow State University, Russia)
Guram Bezhanishvili (New Mexico State University, USA)
Nick Bezhanishvili (Imperial College London, UK)
Patrick Blackburn (Roskilde University, Denmark)
Thomas Bolander (Technical University of Denmark)
Torben Brauner (Roskilde University, Denmark)
Giovanna Corsi (Università di Bologna, Italy)
Giovanna D'Agostino (Università di Udine, Italy)
Stephane Demri (LSV, ENS Cachan, France)
Melvin Fitting (Lehman College, CUNY, USA)
Robert Goldblatt (Victoria University of Wellington, New Zealand)
Valentin Goranko (Technical University of Denmark)
Rajeev Gore (Australian National University, Australia)
Andreas Herzig (IRIT, Toulouse, France)
Ian Hodkinson (Imperial College London, UK)
Wiebe van der Hoek (University of Liverpool, UK)
Rosalie Iemhoff (University of Utrecht, The Netherlands)
Alexander Kurz (University of Leicester, UK)
Tadeusz Litak (University of Leicester, UK)
Hiroakira Ono (Japan Advanced Institute of Science and Technology)
Martin Otto (Technical University of Darmstadt, Germany)
Alessandra Palmigiano (ILLC, University of Amsterdam, The Netherlands)
Renate Schmidt (University of Manchester, UK)
Lutz Schröder (Friedrich-Alexander-Universität Erlangen-Nürnberg)
Valentin Shehtman (Moscow State University, Russia)
Dimiter Vakarelov (Sofia University, Bulgaria)
Yde Venema (ILLC, University of Amsterdam, The Netherlands)
Heinrich Wansing (Ruhr University Bochum, Germany)
Frank Wolter (University of Liverpool, UK)
Michael Zakharyaschev (Birkbeck College, London, UK)
PROGRAMME COMMITTEE CO-CHAIRS
Silvio Ghilardi (Università degli Studi di Milano, Italy)
Lawrence Moss (Indiana University, USA)
ORGANIZING COMMITTEE CO-CHAIRS
Thomas Bolander (Technical University of Denmark)
Torben Braüner (Roskilde University, Denmark)
FURTHER INFORMATION. Please see http://hylocore.ruc.dk/aiml2012/
ENQUIRIES. E-mail enquiries should be directed to aiml2012(a)easychair.org
We will hold the 4th 「論数哲」(PhilLogMath) workshop. Our aim is to
provide opportunities of detailed discussions among philosophers,
logicians, mathematicians and linguists. We focus on theoretical and
computational linguistics this time. Everyone is welcome.
website url: http://researchmap.jp/jopyjeyia-21098/#_21098
Date : July 16 (Mon) National holiday (海の日)
Place: Seiryo Kaikan (Nagata-cho, Tokyo)
http://metropolis.co.jp/listings/venues/type/stage-venue/seiryo-kaikan/
Time table
10:00-12:00 上垣渉(MIT)
尺度推意(scalar implicature)、その材料とレシピ
13:30-15:00 八木沢敬 (カルフォルニア州立大学)
可能世界を超える可能性
15:30-17:00 上出哲広 (サイバー大学)
An embedding-based method for non-classical logics
Every slots consists of 60 minutes talk and 30 minutes discussion basically.
Abstracts:
上垣渉 尺度推意(scalar implicature)、その材料とレシピ
自然言語の文は、ときに、それに含まれる語彙を「字義通り」に解釈した意味よりも強い(取り消し可能な)解釈を生み出すことがある。例えば、日本語母語話者は、日本語において選言に対応するとされる「pまたはq」は、「pかつq、ではない」(あるいは「pかつqであるとは話者は知らない」)という解釈をもつという直観をもつ。Grice(1975)
以降、このような事実は、文が表す意味を「字義通りの意味(literal
meaning)」と「推意(implicature)」に分け、前者は言語に固有の文法的メカニズムによって生み出され、後者は言語に限らないコミュニケーション一般における推論によって字義通りの意味から導きだされるとする考えが言語学においては一般的である。ただ、後者の推意を生み出すメカニズムがどのようなものであるかに関しては、近年まで理論的な精緻化は比較的乏しく、推意は伝統的な意味論的分析を守るために分析と事実の齟齬を放り込んでおくためのある種のブラックボックス(あるいは「語用論的ゴミ箱(pragmatic
wastebasket)」)として機能していた傾向がある。ところが、推意とくに尺度推意(scalar
implicature)の近年の研究の展開において、字義通りの意味から推意が導かれる具体的なメカニズムの理論が精緻化されてきている(例えば、Jäger(2011),
Franke (2009) によるゲーム理論的モデル、Goodman & Stuhlmuller
(2012)によるベイズ理論を用いたモデル、Chierchia (2004), Chierchia, Fox & Spector
(2011)による尺度推意を文法自体に組み込むモデルなど)。本発表では、この理論的展開において重要な意義をもつ二つの問題、すなわち
(i)推意を生み出すのは「文法外」のメカニズムに限られるのか、(ii)推意の導出の際に用いられる代替発話(alternative
utterances)の集合はいかにして規定されるのか、についての最近の研究を紹介する。そして、(i)の問題については、推意を文法に組み込む仮説がその主要な証拠としてきた「埋め込まれた尺度推意(embedded
scalar implicature)」が、必ずしも推意に関する語用論的な見方と矛盾しないこと、(ii)の問題については、談話における「議題となる疑問(Question
under Discussion)」が代替発話を規定するのに重要な役割を果たすことを議論したい。
八木沢敬 可能世界を超える可能性
標準的な可能世界の枠組みでは、すべての可能性は何らかの可能世界での実現として理解される。本論では、この理解を批判する。まず、標準的な可能世界の枠組みによる様相の理解の根底にあるアイデアを「別域の方法」(method
of alternatives)として同定し、次に、それを可能世界を擁する論理空間そのものに関する様相言明に適用することによって、可能世界での実現としては理解できない可能性の概念を明らかにする。それにあたって、現実世界についての様相、信念の様相、背理法の使用、思考の様相などを考察する。
上出哲広 An embedding-based method for non-classical logics
An embedding-based proof method for some non-classical logics is
presented. This method can uniformly prove the
cut-elimination,completeness, decidability and Craig interpolation
theorems for some non-classical logics including some paraconsistent
and temporal logics. This method is based on two theorems for
syntactically and semantically embedding the required non-classical
logic into its negation-less or time-less fragment. Firstly in this
talk, some results on Nelson's paraconsistent logic and its neighbors,
which have recently been obtained by Kamide and Wansing, are
presented. Secondly, some results on linear-time temporal logic and
its neighbors are presented.
Workshop organizer:
Yuko Murakami
Shunsuke Yatabe ( shunsuke.yatabe(a)aist.go.jp )
Takuro Onishi ( takuro.onishi(a)gmail.com )
Logic-ml $B$N3'MM!$(B
$B$3$s$P$s$O!$ElKLBg3X$NKYH*2B9($G$9!%(B
$B2<5-$NMWNN$G!$ElKLBg3X!JEDCf0lG78&!K$K$F8&5f2q$r9T$$$^$9$N$G!$6=L#$N$"$kJ}$O$<$R$4;22C$/$@$5$$!%(B
$B;09V1i$4$6$$$^$9!%(B
*************************************************************************
Sendai Logic Workshop
$BF|;~!'(B6$B7n(B1$BF|!J6b!K(B14:00$B!A(B17:30
$B>l=j!'ElKLBg3X(B $BKL@DMU;3%-%c%s%Q%9(B $BM}3X9gF1Eo(B 1201$B9f<<(B
$B-!(B14:00$B!A(B15:00
$B9V1i<T!'</Eg(B $BN<(B $B!JEl5~9)6HBg3XBg3X1!(B $B>pJsM}9)3X8&5f2J!K(B
$B%?%$%H%k!'(BCTL$B$H<~JU$NO@M}$N8xM}2=$K$D$$$F(B
$B%"%V%9%H%i%/%H!'(B
Computation Tree Logic (CTL) $B$O!$;~4V$N?d0\$KH<$C$F>uBV$,JQ2=$9$k%7%9%F%`$N5-=R$KMQ$$$i$l$kMMAjO@M}!J;~AjO@M}!K$NBeI=$G$"$k!#(B
$BK\9V1i$NL\E*$O!$(BCTL$B$H$=$N<~JU$NO@M}$KBP$9$k%R%k%Y%k%HN.8xM}2=$H40A4@-$K$D$$$F=iJb$+$i2r@b$7!$9V1i<T$N:G6a$N;E;v!J(BECTL$B$N8xM}2=!K$d<h$jAH$_$?$$LdBj!JMMAj&L7W;;$N40A4@-$NJL>ZL@!K$K$D$$$F@bL@$9$k$3$H$G$"$k!#(B
$BM=HwCN<1$O8EE5L?BjO@M}$N40A4@-DjM}DxEY$G==J,$NM=Dj!#(B
$B-"(B15:15$B!A(B16:15
$B9V1i<T!':,85(B $BB?2B;R(B $B!JKLN&@hC<2J3X5;=QBg3X1!Bg3X(B $B>pJs2J3X8&5f2J!K(B
$B%?%$%H%k!'(BWadge $B%2!<%`$N%P%j%(!<%7%g%s$H(B Wadge $B3,AX(B
$B%"%V%9%H%i%/%H!'(B
Wadge [3] $B$K$h$jDj5A$5$l$?(B Wadge $B3,AX$OO"B34X?t$K$h$k5UA|$K$D$$$FJD$8$?%/%i%9$N@.$93,AX$G!"(BBorel $B3,AX$d(B
Hausdorff $B$N=89g:9$K$h$k3,AX$h$j$b$h$j:Y$+$$=89g$N3,AX$rM?$($k!#(B
$B$3$N3,AX$N3F%/%i%9$N=89gA`:n$K$h$k5-=R$O(B Louveau [2] $B$K$h$jM?$($i$l$?$,!"(B $BHs>o$KHQ;($G$"$k!#(B
Wadge $B3,AX$G??$KF1$8<!?t$r$b$D=89g$O(B Wadge $B%2!<%`$K$h$jFCD'$E$1$i$l$k$,!"(BDuparc [1]
$B$G$O$3$N%2!<%`$N%P%j%(!<%7%g%s$K$h$j(B Wadge $B%/%i%9$N<!?t$N5-=R$N4JN,2=$rM?$((B
$B$F$$$k!#(B
$BK\9V1i$G$O(B [1] $B$NFbMF$rCf?4$K!"(BWadge $B%2!<%`$H(B Wadge $B3,AX$K4X$9$k8&5f$r>R2p$9$k!#(B
$B;29MJ88%!'(B
[1] J. Duparc, Wadge Hierarchy and Veblen Hierarchy. Part I: Borel
Sets of Finite Rank. Journal of Symbolic Logic 66(1), pp. 56-86, 2001
[2] A. Louveau, Some results in the Wadge hierarchy of Borel sets,
Cabal seminar 79-81, Lecture
Notes in Mathematics, vol. 1019, Springer Verlag, 1983, pp. 28-55.
[3] W.W. Wadge, Reducibility and determinateness on the Baire space.,
Ph.D. thesis, Berkeley, 1984.
$B-#(B16:30$B!A(B17:30
$B9V1i<T!'O!Hx(B $B0lO:(B $B!JEl5~Bg3XBg3X1!(B $B>pJsM}9)3X7O8&5f2J!K(B
$B%?%$%H%k!'(BProgramming with Infinitesimals: A While-Language for Hybrid
System Modeling
(Joint Work with Kohei Suenaga, Kyoto University)
$B%"%V%9%H%i%/%H!'(B
We add, to the common combination of a WHILE-language and a
Hoare-style program logic, a constant dt that represents an
infinitesimal (i.e. infinitely small) value. The outcome is a
framework for modeling and verification of hybrid systems: hybrid
systems exhibit both continuous and discrete dynamics and getting them
right is a pressing challenge. We rigorously define the semantics of
programs in the language of nonstandard analysis, on the basis of
which the program logic is shown to be sound and relatively complete.
If the time allows, our recent prototype automatic prover will also be
demonstrated.
$B;29MJ88%!'(B
Kohei Suenaga and Ichiro Hasuo.
Programming with Infinitesimals: A While-Language for Hybrid System Modeling.
Proc. ICALP 2011, Track B. LNCS 6756, p. 392-403. Springer-Verlag.
*************************************************************************
$B0J>e$G$9!%(B
$B%;%_%J!<>pJs$O2<5-@gBf%m%8%C%/$N%[!<%`%Z!<%8$+$i$b$4Mw$$$?$@$1$^$9!%(B
https://sites.google.com/site/sendailogichomepage/
$BKYH*!!2B9((B
-- --
$BElKLBg3XBg3X1!!!M}3X8&5f2J(B
$B?t3X@l96!!;:3X41O"7H8&5f0w(B
E-mail: higurashi3873(a)yahoo.co.jp
$B3'MM!"(B
$B0J2<$NFbMF$G#2#8F|!J7n!K$K9V1i$rFs7oM=Dj$7$F$$$^$9!#(B
Herbelin$B$5$s$N9V1i$O(BFLOPS2012$B$N$*OC$N3HD%HG$G$9!#(B
$B$I$&$>$4MhD0$/$@$5$$!#(B
$BD9C+@n???M(B <hassei(a)kurims.kyoto-u.ac.jp>
$B5~ETBg3X?tM}2r@O8&5f=j(B
====================================================
Date: 28 May 2012 (Monday) 14:30-17:00
14:30-15:30 talk by Vivek Nigam
16:00-17:00 talk by Hugo Herbelin
Venue: Room 478, General Research Building No.2, Kyoto University
(Access information & map:
http://www.kyoto-u.ac.jp/en/accesshttp://www.kurims.kyoto-u.ac.jp/~hassei/map-2.jpg)
$BCm!'?tM}2r@O8&5f=jK\4[$G$O$"$j$^$;$s!#(B
$BI4K|JW$N$=$P$NAm9g8&5fFs9f4[$N(B4$B3,$G$9!#(B
====================================================
Speaker: Vivek Nigam (Ludwig Maximilian University of Munich)
Title: An Extended Framework for Specifying and Reasoning about Proof Systems
Abstract:
It has been shown that linear logic can be successfully used as a
framework for both specifying proof systems for a number of logics,
as well as proving fundamental properties about the specified systems.
In this paper, we show how to extend the framework with subexponentials
in order to be able to declaratively encode a wider range of proof systems,
including a number of non-trivial proof systems such as
a multi-conclusion intuitionistic logic, classical modal logic S4, and
intuitionistic Lax logic. Moreover, we propose methods for checking
whether an encoded proof system has important properties, such as if it
admits cut-elimination, the completeness of atomic identity rules,
and the invertibility of its inference rules. Finally, we present a tool
implementing some of these specification/verification methods.
This is a joint work with Giselle Reis and Elaine Pimentel.
====================================================
Speaker: Hugo Herbelin
(Laboratoire PPS, CNRS, INRIA & Universite Paris Diderot)
Title: Classical call-by-need sequent calculi: The unity of semantic artifacts
Abstract:
We systematically derive a classical call-by-need sequent calculus,
which does not require an unbounded search for the standard redex,
by using the unity of semantic artifacts proposed by Danvy et al.
The calculus serves as an intermediate step toward the generation of an
environment-based abstract machine. The resulting abstract machine is
context-free, so that each step is parametric in all but one component.
The context-free machine elegantly leads to an environment-based CPS
transformation. This transformation is observationally different from a
natural classical extension of the transformation of Okasaki et al., due to
duplication of un-evaluated bindings. We further demonstrate the usefulness
of a systematic approach by deriving an abstract machine and
CPS for an alternative classical call-by-need calculus.
(Joint work with Zena M. Ariola, Paul Downen, Keiko Nakata & Alexis Saurin)
====================================================