Logic-ml March 2019

9 participants
12 discussions

セミナー案内
by KASHIMA Ryo 06 Sep '19

06 Sep '19

数理論理学セミナーのお知らせ東工大大岡山キャンパスで定期的に開催しているセミナー（普段はlogic-mlには流していません）の特別版を　　９月８日（金）と１５日（金）に開催します。以下に「話者（所属）題目」の一覧を載せました。どなたでも参加できますが、普段のセミナー案内を受け取っていない方の場合はご一報ください。 ----- 鹿島亮東京工業大学情報理工学院数理・計算科学系 kashima(a)is.titech.ac.jp ＝＝＝＝＝＝＝＝【８日（金）】西牟田祐樹（慶應大）一般化乗法的論理結合子のシーケント化定理とdecomposabilityについて藤原誠（早大）Bar induction and restricted classical logic 武原直紀（東工大）直観主義二階命題論理と論理式完備ハイティング代数について松田直祐（神奈川大）Curry's last problemへの弱い解答中村誠希（東工大）関係Kleene代数におけるatomic negationについて（仮題）新屋良磨（東大）論文紹介 Cyclic Arithmetic Is Equivalent to Peano Arithmetic 【１５日（金）】池上貴大（東工大）様相命題論理におけるツリーシークエント計算（仮題）河野友亮（東工大）Quantum logic の implication algebra と restricted negation について（仮題）鹿島亮（東工大）２階の関数記号を持つ１階述語論理について山﨑紗紀子（首都大）ゲーデル・マッキンゼイ・タルスキの定理の証明論的証明ー後件複数な直観主義論理のG3-style sequent calculus を用いてー大森仁（京大）Jaskowskiのdiscussive logicの周辺金沢誠（国立情報学研）Context-Free Languages with Finite Context and Kernel Properties 高橋正子 Grzegorczyk階層について＝＝＝＝以上＝＝＝＝

1 8

Talk by Gordon Plotkin on 1st April 2019 at Kyoto
by Masahito Hasegawa 26 Mar '19

26 Mar '19

皆様、来週の月曜（４月１日）、京都大学数理解析研究所で、プログラム意味論などの研究で著名なGordon Plotkinさん（Edinburgh大学）の講演があります。詳細は下記のとおりです。関心をお持ちの方のご来聴を歓迎します。どうぞよろしくお願いいたします。京都大学数理解析研究所長谷川真人 ========== Time: 14:00-15:00, 1st April 2019 (Mon.) Place: Room 110, Research Institute for Mathematical Sciences, Kyoto University 京都大学数理解析研究所（本館）１階１１０号室 http://www.kurims.kyoto-u.ac.jp/en/access-01.html Speaker: Gordon Plotkin (LFCS, University of Edinburgh) Title: One-and-a-half simple differentiable programming languages Abstract: Languages for learning pose interesting foundational challenges. We look at one case: the foundations of differentiable programming languages with a first-class differentiation operator. Graphical and linguistic facilities for differentiation have proved their worth over recent years for deep learning (deep learning makes use of gradient descent optimisation methods to choose weights in neural nets). Automatic differentiation, also known as algorithmic differentiation, goes much further back, at least to the early 1960s, and provides efficient techniques for differentiation, e.g., via source code transformation. It seems fair to say, however, that differentiable programming languages have begun to appear only recently. It seems further fair to say that, while there has certainly been some foundational study of differentiable programming languages, there is ample opportunity to do more. We investigate the semantics of a simple first-order functional programming language with reals, product types, and a first-class reverse-mode differentiation operator (reverse-mode differentiation generalises gradients). The semantics employs a standard concept of real analysis: smooth multivariate functions with open domain. It turns out that such partial functions fit well with programming constructs such as conditionals and recursion; indeed they form a complete partial order, and so standard fixed-point methods can be applied. We give an operational semantics which, roughly, can be seen as a formalisation of a version of the trace (or tape) method used to implement automatic differentiation. The semantics consists of three parts: ordinary evaluation, symbolic evaluation to eliminate control constructs, and a source-code transformation to symbolically differentiate terms with no control constructs, >From a programming language point of view, however, many types are lacking, particularly sum types and recursive types, such as lists. We conclude with a brief presentation of notions of shapely datatypes and smooth functions. These can be used to give the semantics of such types and the usual functions between them while retaining first-class differentiation. This work constitutes only an initial exploration, and we look forward to a rich field connecting two worlds: programming languages and their foundations, and real analysis and allied areas of mathematics. ==========

1 0

第40回量子情報技術研究会(QIT40)のご案内
by Yasuhito Kawano 22 Mar '19

22 Mar '19

皆様 NTT の河野と申します。本メーリングリストをお借りして、第40回量子情報技術研究会(QIT40)の会告案内を送らせていただきます。よろしくお願いいたします。 ----------------------------------------------------------------- 第40回量子情報技術研究会（QIT40）研究会の内容：　　情報科学と量子力学を融合させた新しい分野，量子情報科学に関する研究会です．　情報を担う物理系の量子力学的側面を積極的に活かした新しい情報処理原理の研究と　そこから開かれる新しい学問体系の構築および新しい情報技術パラダイムの創生を　目指して，情報科学，物理学，光エレクトロニクスを含む理学，工学，数理科学に　携わる研究者間に自由な討論の場を提供し，この研究分野の発展を図ることを目的と　しています．　　第40回研究会を下記のように開催いたします．現在この分野で活躍する研究者は勿論，　自分の研究資産が何らかの形で使えそうだと予感している研究者・技術者など，　広く関連する分野の研究者・技術者からの発表を募集致します．聴講のみの参加も　歓迎致しますので，奮ってお申し込みください．　　なお，第38回研究会から学生発表賞を創設いたしました．応募方法等については，　下記のQITウェブサイトをご確認下さい．日時: 2019年5月20日(月)〜21日(火) 会場: 九州大学筑紫キャンパス筑紫ホール (〒816-8580　福岡県春日市春日公園6-1) 発表募集分野 (申し込み状況によっては査読の可能性あり)：　量子情報，量子計算，量子暗号など広く量子情報技術に関わる理論的研究，実験的研究，　計算機科学的研究，数学的研究，および，その他関連分野．定員: 200名参加費：　一般4,000円，学生3,000円懇親会費：一般4,000円，学生2,000円 ※当日現地支払いの場合，参加費・懇親会費は上記に+1,000円が増額されます．　（参加事前登録または銀行振込が期限に間に合わない場合も，これに該当します．） ※学生限定・当日受付・予稿集なし・懇親会なしの参加費1,000円という選択肢もあります．　こちらは事前手続き不要です．研究会参加申込要領：　参加申込は下記 Web にて受付けます：　https://www.ieice.org/es/qit/ 　講演 (口頭，ポスター) の申込，予稿集原稿PDFの提出は，電子情報通信学会の　Webシステムを使用する予定．各種締切：【口頭講演申込締切】　　2019年4月19日（金）【ポスター講演申込締切】2019年4月19日（金）【予稿原稿提出締切】　　2019年4月19日（金）【参加申込締切】　　　　2019年4月24日（水）【問合せ先】　原田裕一 (九州大学) 　落合啓之（九州大学）　廣川真男（広島大学）　和久井健太郎（情報通信研究機構）　Email: qit40(a)gic.kyushu-u.ac.jp 主催: 量子情報技術特別研究専門委員会 (委員長: 平野琢也(学習院大学)) 共催: 応用物理学会量子エレクトロニクス研究会

1 0

2nd CFP: 3rd International Workshop on User-Oriented Logic Paradigms
by Christos Rodosthenous 19 Mar '19

19 Mar '19

*** IULP 2019 *** 3rd International Workshop on User-Oriented Logic Paradigms June 3 or 4, 2019 https://iulp2019.uni-leipzig.de Collocated with the 15th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2019) Philadelphia, USA June 4 - 6, 2019 -------------------------------------------- Since the emergence of logic reasoning paradigms, such as logic programming, argumentation, and other non-monotonic reasoning formalisms, a lot of theoretical work has been done, for example with respect to different semantics and their properties. More recently, implementations and IDEs emerged which have been used for various problem-solving applications. However, user-friendliness is still an issue for both experts and non-experts working with logic paradigms; for example experts benefit from features like debugging and heuristic tuning, non-experts from educational material, explanations, and intuitive visualisations - all of which are ongoing topics of research. The 3rd International Workshop of User-Oriented Logic Paradigms (IULP) focuses on discussing different aspects involved in making logic paradigms more user-friendly/oriented, where the "user" could be either an expert of the paradigm, or a non-expert who simply uses tools developed for the paradigm in some application. IULP aims to bring together researchers working on different logic paradigms, such as answer set programming, constraint logic programming, probabilistic logic programming, abductive logic programming, inductive logic programming, argumentation, principles of teaching etc., as user- friendliness is an important topic in all of these areas. IULP aims to provide an international forum for researchers in the AI, KR, and applied sciences community to discuss and present advances in theories, formalisms, and applications to deliver the mature and well-defined methods of logic paradigms to a wider audience. We solicit the submission of papers broadly centred on issues and research related to user-friendliness in logic paradigms and related fields. We welcome papers of either theoretical or practical nature, including work in progress. IMPORTANT DATES -------------------------------------------- * Submission deadline: Sun, March 31st 2019 * Notification to authors: Mon, April 29th 2019 * Camera-ready version due: Mon, May 20th 2019 * Workshop date: June 3 or 4, 2019 TOPICS -------------------------------------------- Topics of interest include (but are not limited to): * IDEs * debugging * explanations * visualisation * best practice * modularity * usage of natural language * heuristic tuning * LP education * language extensions * transparency * algorithmic bias * credibility * accountable systems SUBMISSIONS -------------------------------------------- Papers must be formatted in Springer LNCS style (http://www.springer.com/lncs) and should not exceed 13 pages (excluding references and appendices). All submissions have to be written in English and submitted electronically as a PDF through easychair (https://easychair.org/conferences/?conf=iulp2019). A short system demonstration version which should not exceed 6 pages (excluding references and appendices) can be submitted electronically too. We encourage the submission of original research on all topics as well as relevant results that have been submitted or accepted elsewhere provided that the initial publication is mentioned in a footnote on the first page. Note that authorship is not anonymous and that at least one author of each accepted paper is required to attend the workshop to present the contribution. PROCEEDINGS -------------------------------------------- There are no formal proceedings for IULP. The accepted papers will be published as a technical report and will be made available in the Computing Research Repository (CoRR). The copyright of the papers lies with the authors and, as far as IULP is concerned, authors are free to submit their work to other conferences and workshops. COMMITTEE -------------------------------------------- Chairs: * Stefan Ellmauthaler (Leipzig University) * Christos Rodosthenous (Open University of Cyprus) Program Committee * Bart Bogaerts (Vrije Universiteit Brussel) * Gerhard Brewka (Leipzig University) * Marina De Vos (University of Bath) * Marc Denecker (Katholieke Universiteit Leuven) * Martin Gebser (Potsdam University) * Antonis C. Kakas (University of Cyprus) * Antonio Lieto (University of Turin) * Loizos Michael (Open University of Cyprus) * Yisong Wang (Guizhou University) * Stefan Woltran (Vienna University of Technology) CONTACT -------------------------------------------- iulp2019 [at] informatik [dot] uni-leipzig [dot] de HOMEPAGE -------------------------------------------- https://iulp2019.uni-leipzig.de

1 0

Nagoya logic seminar
by 吉信康夫 14 Mar '19

14 Mar '19

皆様：名古屋大学の吉信です。以下の要領で名古屋ロジックセミナーを開催します。日時：3月19日(火) 15:30〜場所：名古屋大学大学院情報学研究科棟314室講演者：Sabrina Ouazzani(エコール・ポリテクニーク) タイトル：How to compute with an infinite time Turing machine? 概要：In this talk, we present infinite time Turing machines (ITTM), from the original definition of the model to some new infinite time algorithms. We will present algorithmic techniques that allow to highlight some properties of the ITTM-computable ordinals. In particular, we will study gaps in ordinal computation times, that is to say, ordinal times at which no infinite time program halts. We will explain some properties of the gaps in the ordinal computation times. 多数の方のご参加をお待ちしております。

1 0

[CFP] The Coq Workhsop 2019
by Jacques Garrigue 13 Mar '19

13 Mar '19

皆様、名古屋大学のGarrigueです。本メーリングリストをお借りして、 2019年9月にポートランド(オレゴン州)で開催される Coq Workshop 2019の CFPを送らせていただきます。ぜひ投稿をご検討ください。投稿〆切：2019-06-04 (2ページの概要) よろしくお願いいたします。 -- ********************************************************************* The Coq Workshop 2019: Call for Talk Proposals Colocated with the 10th International Conference on Interactive Theorem Proving (ITP 2019), Portland, OR, USA ********************************************************************** We are pleased to invite you to submit talk proposals for the Coq workshop 2019, which will be held on September 8 2019, in Portland, OR, USA. The Coq workshop is part of ITP 2019 (https://itp19.cecs.pdx.edu/). The Coq workshop 2019 is the 10th Coq Workshop. The Coq Workshop series (https://coq.inria.fr/coq-workshop/) brings together Coq (https://coq.inria.fr/) users, developers, and contributors. While conferences usually provide a venue for traditional research papers, the Coq Workshop focuses on strengthening the Coq community and providing a forum for discussing practical issues, including the future of the Coq software and its associated ecosystem of libraries and tools. Thus, the workshop will be organized around informal presentations and discussions, supplemented with invited talks. We invite all members of the Coq community to propose informal talks, discussion sessions, or any potential uses of the day allocated to the workshop. Important dates: - June 4 2019: Deadline for abstract submission - July 2 2019: Notification to authors - September 8 2019: Workshop Submission Instructions: Authors should submit short proposals through EasyChair (https://easychair.org/conferences/?conf=coq2019) in the form of a PDF extended abstract of less than 2 pages, in full-page single-column style. Relevant subject matter includes but is not limited to: - Theory and implementation of the Calculus of Inductive Constructions - Language or tactic features - Plugins and libraries for Coq - Techniques for formalization programming languages and mathematics - Applications and experience in education and industry - Tools and platforms built on Coq (including interfaces) - Formalization tricks and pearls Program Committee: - Reynald Affeldt (AIST) - Christian Doczkal (CNRS - LIP, ENS Lyon) - Jacques Garrigue (Nagoya University) - Chantal Keller (LRI, Univ. Paris-Sud) - Dominique Larchey-Wendling (CNRS, Loria) - Gregory Malecha (BedRock Systems Inc.) - Pierre-Marie Pédrot (INRIA) - Ilya Sergey (Yale-NUS College and NUS School of Computing) - John Wiegley (DFINITY) Organization contact (co-chairs): reynald.affeldt AT aist.go.jp, garrigue AT math.nagoya-u.ac.jp For more information: https://staff.aist.go.jp/reynald.affeldt/coq2019/

1 0

UNIF 2019: 2nd CFP
by Takahito Aoto 13 Mar '19

13 Mar '19

単一化に関するワークショップのご案内です．タイトル&アブストラクトの〆切が4/14，本文の〆切が4/21となっています． FSCDのサテライトワークショップとして6/24に開催です．ご投稿を検討頂ければ幸いです． --- 青戸等人(新潟大学) ------------------------------------------------------------------ Second Call for Papers: UNIF 2019 Website: http://www.mat.unb.br/unif2019 The 33rd International Workshop on Unification is the 33rd event in a series of international meetings devoted to unification theory and its applications. Unification is concerned with the problem of making two terms equal, finding solutions for equations, or making formulas equivalent. It is a fundamental process used in a number of fields of computer science, including automated reasoning, term rewriting, logic programming, natural language processing, program analysis, types, etc. Traditionally, the scope of the UNIF workshops has covered the topic of unification in a broad sense. Topics of interest to this forum include, but are not limited to: Unification algorithms, calculi, and implementations Equational unification and unification modulo theories Admissibility of Inference Rules Unification in modal, temporal and description logics Narrowing Formalisation of unification Matching Problems Applications Unification in Special Theories Higher-Order Unification Combination problems Constraint Solving Disunification Complexity Issues Type Checking and reconstruction The International Workshop on Unification (UNIF) is a yearly forum for researchers in unification theory and related fields to meet old and new colleagues, to present recent (even unfinished) work, and to discuss new ideas and trends. It is also a good opportunity for young researchers and scientists working in related areas to get an overview of the state of the art in unification theory. The workshop is proposed to be hosted by the 4th International Conference on Formal Structures for Computation and Deduction (FSCD, Dortmund, 24-29 June 2019). ** Invited Speakers Jörg Siekmann (DFKI and University of Saarland) Narciso Marti-Oliet (Universidad Complutense de Madrid) ** Submission Instructions Following the tradition of UNIF, we call for submissions of abstracts (5 pages) in EasyChair style, to be submitted electronically as PDF through the EasyChair submission site: https://easychair.org/conferences/?conf=unif2019 Abstracts will be evaluated by the Programme Committee (if necessary with support from external reviewers) regarding their significance for the workshop. We will allow work presented/submitted in/to another conference. Accepted abstracts will be presented at the workshop and included in the informal proceedings of the workshop, available in printed form at the workshop and in electronic form from the UNIF homepage: http://www.pps.jussieu.fr/~treinen/unif/ Based on the number and quality of submissions we will decide whether to organise a special journal issue. ** Important Dates Submission of titles and abstracts: April 14, 2019 Submission of full paper: April 21, 2019 Author notification: May 31, 2019 Camera-ready papers: June 4, 2019 UNIF 2019: June 24, 2019 (intended) ** Program Committee - Serdar Erbatur (LMU Munich) co-chair - Daniele Nantes Sobrinho (Universidade de Brasília) - co-chair - Takahito Aoto (Niigata University) - Alexander Baumgartner (University of Chile) - Mauricio Ayala Rincón (Universidade de Brasília) - Evelyne Contejean (LRI, CNRS, Univ Paris-Sud, Orsay) - Kimberly Cornell (The College of Saint Rose) - Santiago Escobar (Universitat Politècnica de València) - Maribel Fernández (King's College London) - Temur Kutsia (RISC- Johannes Kepler University Linz) - Jordy Levy (IIIA - CSIC) - Hai Lin (Shenyang Normal University) - Christopher Lynch (Clarkson University) - Andrew M. Marshall (University of Mary Washington) - Catherine Meadows (US Naval Research Laboratory) - Paliath Narendran (University at Albany--SUNY) - Christophe Ringeissen (INRIA) - David Sabel (Ludwig Maximilian University of Munich) - René Thiemann ( University of Innsbruck) - Manfred Schmidt-Schauss (Goethe-University Frankfurt am Main) - Ralf Treinen (IRIF- Université Paris-Diderot) - Daniel Lima Ventura (Universidade Federal de Goiás) ** Organizers Daniele Nantes Sobrinho (Universidade de Brasília) (dnantes(at)mat.unb.br) Serdar Erbatur (LMU Munich) (serdar.erbatur(at)ifi.lmu.de) ------------------------------------------------------------------

1 0

ENTROPY 2019: Second Call for Papers - Co-located with EuroS&P'19
by David Nowak 12 Mar '19

12 Mar '19

NEW: two more invited speakers ************************************************************************** Second Call for papers — ENTROPY 2019 ENabling TRust through Os Proofs … and beYond Second International workshop on the use of theorem provers for modelling and verification at the hardware-software interface https://entropy2019.sciencesconf.org Co-located with EuroS&P'19, KTH, Stockholm, June 2019 ************************************************************************** INVITED SPEAKERS Dominique Bolignano, Prove & Run Gernot Heiser, University of New South Wales Frank Piessens, KU Leuven Peter Sewell, University of Cambridge IMPORTANT DATES Paper submission: March 11 2019 Author notification: April 10, 2019 Camera-ready versions: April 22, 2019 (strict) Workshop: 16 June 2019 AIM AND SCOPE Low level software such as kernels and drivers, along with the hardware this software runs on, is critical for application security. In contrast with user applications, OS kernel software runs in privileged CPU mode and is thus highly critical. Large projects such as seL4, VeriSoft, CertiKoS and Prosper have invested considerable resources in developing formally verified systems such as hypervisors and microkernels, supplying proofs that they satisfy critical properties. Such proofs are delicate in terms of the scale and complexity of real systems, the models used in performing the proof search, and the relations between the two, which recent vulnerabilities such as Spectre and Meltdown have shown to be a highly non-trivial issue. The purpose of this workshop is to share, compare and disseminate best practices, tools and methodologies to verify OS kernels, also setting the stage for future steps in the direction of fully verified systems, dealing with issues related to modelling, model validation, and large proof maintenance through system evolution. On one hand, we need to make low-level proofs more scalable, modular and cost-effective. On the other hand, once certified systems are available, preservation and maintenance of their proofs of validity become key questions. The goal of the ENTROPY workshop is to provide a forum for researchers and practitioners in this space, linking operating systems, formal methods, and hardware architecture, interested in system design as well as machine verified mathematical proofs using proof assistants such as Coq, Isabelle and HOL4. This will be the second edition of the ENTROPY workshop series. The first workshop was organised by the Pip Development Team at University of Lille in 2018. TOPICS OF INTEREST Specific topics include, but are not limited to: * Verified kernels and hypervisors * Verified security architectures and models * Tools and frameworks for hardware security analysis * Tools and frameworks for security analysis * Formal hardware models and model validation techniques * Theorem prover based tools and frameworks for verification of low level code * Combinations of static analysis and theorem proving * Theories and techniques for compositional security analysis * Case studies and industrial experience reports * Proof maintenance techniques and problems * Compositional models and verification techniques * Proof oriented design The aim of the workshop is to stimulate innovation and active exchange of ideas, so position papers, work-in-progress and industrial experience submissions are welcome. SUBMISSION AND PUBLICATION There are two categories of submissions: 1. Regular papers describing fully developed work and complete results (10 pages, references included, IEEE format) 2. Short papers, position papers, industry experience reports, work-in-progress submissions (4 pages, references included, IEEE format) All papers should be in English and describe original work that has not been published or submitted elsewhere. The submission category should be clearly indicated. All submissions will be fully reviewed by members of the Programme Committee. Papers will appear in IEEE Xplore in a companion volume to the regular EuroS&P proceedings. For formatting and submission instructions see https://entropy2019.sciencesconf.org. PROGRAM CHAIRS Mads Dam, KTH Royal Institute of Technology David Nowak, CNRS and University of Lille PROGRAM COMMITTEE Christoph Baumann, Ericsson AB Gustavo Betarte, Univ. de la República, Uruguay David Cock, ETH Zurich Mads Dam, KTH Royal Institute of Technology (chair) Anthony Fox, ARM Deepak Garg, MPI Saarbrucken Ronghui Gu, Columbia University Samuel Hym, Univ. Lille Thomas Jensen, INRIA and Univ. Rennes Toby Murray, Univ. Melbourne David Nowak, CNRS & Univ. Lille (chair) Vicente Sanchez-Leighton, Orange Labs Thomas Sewell, Chalmers -- David Nowak http://www.cristal.univ-lille.fr/~nowakd/

1 1

LCC 2019（7月8日・パトラ）発表募集
by Akitoshi Kawamura 11 Mar '19

11 Mar '19

メーリングリストの皆様九大の河村と申します。7月に国際会議ICALPの併設集会としてギリシアのパトラで行われる「論理学と計算量」研究集会LCC 2019の御案内をお送りいたします。投稿は3～4ページで、締切は5月1日です。 =========================================================== First Call for Contributions LCC 2019 20th International Workshop on Logic and Computational Complexity July 8, 2019, Patras, Greece Collocated with ICALP 2019 http://www.cs.swansea.ac.uk/lcc/ =========================================================== LCC meetings are aimed at the foundational interconnections between logic and computational complexity, as present, for example, in implicit computational complexity (descriptive and type-theoretic methods); deductive formalisms as they relate to complexity (e.g. ramification, weak comprehension, bounded arithmetic, linear logic and resource logics); complexity aspects of finite model theory and databases; complexity-mindful program derivation and verification; computational complexity at higher type; and proof complexity. The program will consist of invited lectures as well as contributed talks selected by the Program Committee. IMPORTANT DATES: * submission May 1, 2019 * notification May 20, 2019 * workshop July 8, 2019 SUBMISSION: Submissions must be in English and in the form of an abstract of about 3-4 pages. All submissions should be submitted through Easychair at: https://easychair.org/conferences/?conf=lcc19 We also welcome submissions of abstracts based on work submitted or published elsewhere, provided that all pertinent information is disclosed at submission time. There will be no formal reviewing as is usually understood in peer-reviewed conferences with published proceedings. The program committee checks relevance and may provide additional feedback. PROGRAM COMMITTEE: Lauri Hella, Co-chair, Tampere University, Finland Monika Seisenberger, Co-chair, Swansea University, UK Sam Buss, University of California, San Diego, US Anupam Das, University of Copenhagen, Denmark Anuj, Dawar, University of Cambridge, UK Akitoshi Kawamura, Kyushu University, Fukuoka, Japan Arne, Meier, University of Hannover, Germany Lidia Tendera, University of Opole, Poland CONTACT: To contact the workshop organizers, please send an e-mail to lcc19(a)easychair.org -- 河村彰星九州大学システム情報科学研究院情報学部門〒819-0395　福岡市西区元岡744 092-802-3806 kawamura(a)inf.kyushu-u.ac.jp

1 0

Nagoya logic seminar
by 吉信康夫 05 Mar '19

05 Mar '19

皆様：名古屋大学の吉信です。先日ご案内いたしました名古屋ロジックセミナーについて、概要をいただきましたのであらためてお知らせいたします。日時：3月8日(金) 15:30〜場所：名古屋大学大学院情報学研究科棟314室講演者：渕野昌(神戸大学) タイトル：Reflection axioms which imply the continuum is very large 概要：Stationary logic の variations 対する，``妥当な'' Löwenheim-Skolem Theorem が成立するべきである，という前提のもとで，連続体の濃度は $\aleph_1$ あるいは $\aleph_2$ あるいは非常に大きなもの (weakly Mahlo, weakly hyper Mahlo 等) になるかのいずれかとなることを示す．この三分律に対応する３つの generic supercompactness axioms についても論ずる．多数の方のご参加をお待ちしております。

1 0

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Logic-ml March 2019