=================================================================
First Call for Contributions
LCC 2022
22nd International Workshop on Logic and Computational Complexity
February 20, 2022, Online
Collocated with CSL 2022
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 December 12, 2021
* notification January 3, 2022
* workshop February 20, 2022
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=lcc22
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:
Patrick Baillot (CNRS, University of Lille, France, co-chair)
Meghyn Bienvenu (CNRS, University of Bordeaux, France)
Juha Kontinen (University of Helsinki, Finland, co-chair)
Cynthia Kop (Radboud University Nijmegen, The Netherlands)
Barnaby Martin (Durhan University, UK)
Nicole Schweikardt (Humboldt-University Berlin, Germany)
CONTACT:
To contact the workshop organizers, please send e-mail to lcc22(a)easychair.org<mailto:lcc22@easychair.org>
Join the Logica Universalis Webinar!
The next session will be held on Wednesday, November 10 at 4pm CET with the talk
Calculi for Many-Valued Logics<https://link.springer.com/article/10.1007/s11787-021-00274-5>
Michael Kaminski<https://urldefense.proofpoint.com/v2/url?u=https-3A__www.cs.technion.ac.il_…> and Nissim Francez<https://urldefense.proofpoint.com/v2/url?u=https-3A__www.cs.technion.ac.il_…> (Technion, Israel)
Chair: Anna Zamansky<https://is-web.hevra.haifa.ac.il/index.php/en/dr-anna-zamansky>, Editorial Board SUL
Associate Organization: Logic in Israel
presented by Liron Cohen<https://urldefense.proofpoint.com/v2/url?u=https-3A__in.bgu.ac.il_en_Pages_…>
The Logica Universalis Webinar is a World Seminar Series connected to the journal Logica Universalis<https://www.springer.com/journal/11787/>, the book series Studies in Universal Logic<https://www.springer.com/series/7391> and the Universal Logic Project<https://logica-universalis.org/>. It is an open platform for all scholars interested in the many aspects of logic. (See the full program here<https://www.springer.com/journal/11787/updates/18988758>.)
The sessions take place on Wednesdays at 4pm CET (click here<https://www.timeanddate.com/worldclock/fixedtime.html?msg=Logica+Universali…> to convert to your timezone). They are held via Zoom and are free to attend. Please register in advance.
Registration is now open!<https://springer.zoom.us/meeting/register/tJMvdu6vrzMiHda_iDhjxw9vA9d7we9gT…>
Each session of the webinar is chaired by a member of the editorial board of the journal Logica Universalis (LU), the book series Studies in Universal Logic (SUL) or an organizer of an event of the Universal Logic Project (ULP). Sessions will start with a short presentation of a logical organization related to the region of the speaker or the topic of the talk. The talk (30 min) will focus on a recently published paper in LU, on a book in SUL, on an event or on the ULP. Talks are followed by a discussion (15 min).
Video recordings of the seminars are uploaded on the YouTube channel Universal Logic Project<https://www.youtube.com/channel/UCPS1c5ApuwjuCV9UjXHUN4w>.
---
To unsubscribe from these notifications for the Logica Universalis Webinar please send a message with 'Unsubscribe' to this e-mail address (antje.herbst(a)springernature.com<mailto:antje.herbst@springernature.com>).
--
Antje Herbst
Associate Editor Mathematics
Journals
Springer Nature
Tiergartenstraße 17, 69121 Heidelberg, Germany
T +49 62214878984
antje.herbst(a)springernature.com<mailto:antje.herbst@springernature.com>
www.springernature.com<http://www.springernature.com/>
--
Springer Nature is a leading research, educational and professional publisher, providing quality content to our communities through a range of innovative platforms, products and services. Every day, around the globe, our imprints, books, journals and resources reach millions of people - helping researchers, students, teachers & professionals to discover, learn and achieve.
--
Branch of Springer-Verlag GmbH, Heidelberger Platz 3, 14197 Berlin, Germany
Registered Office: Berlin / Amtsgericht Berlin-Charlottenburg, HRB 91881 B
Directors: Martin Mos, Dr. Ulrich Vest, Dr. Niels Peter Thomas
VerifyThis 2022: Call for Problems
apologies for multiple postings.
VerifyThis<https://www.pm.inf.ethz.ch/research/verifythis.html> is a series of program verification competitions, which has taken place annually since 2011 (with the exception of 2020). Previous competitions in the series have been held at FoVeOOS 2011, FM 2012, Dagstuhl (April 2014), and ETAPS 2015—2021.
To extend the problem pool and tend better to the needs of the participants, we are soliciting verification problems for the competition:
* A problem should contain an informal statement of the algorithm to be implemented (optionally with complete or partial pseudo code) and the requirement(s) to be verified.
* A problem should be suitable for a 60—90 minute time slot.
* Submission of reference solutions is strongly encouraged.
* Problems with an inherent language- or tool-specific bias should be clearly identified as such.
* Problems that contain several subproblems or other means of difficulty scaling are especially welcome.
* The organizers reserve the right (but no obligation) to use the problems in the competition, either as submitted or with modifications.
* Submissions from (potential) competition participants are allowed.
Problems from previous competitions can be seen at the archive<http://www.pm.inf.ethz.ch/research/verifythis/Archive.html>.
Please send submissions via email to verifythis(a)googlegroups.com<mailto:verifythis@googlegroups.com> by January 31, 2022.
The most suitable submission for competition will receive a prize.
A postdoctoral research position is available at Birkbeck, University of
London. The successful candidate will be hosted by Hubie Chen and will
work on the computational complexity of database query evaluation and
related topics. The position, which is funded by a grant from UK's
EPSRC, is offered for 1 year, with the possibility of a 1-year
extension.
Key dates: the application deadline is November 26, 2021; the starting
date is flexible.
For more information and to apply, please see:
https://cis7.bbk.ac.uk/vacancy/postdoctoral-research-assistant-462654.html.
The University of Sheffield has an opening for a Lecturer in Theoretical Computer Science. Researchers in the area of computational complexity, where the interests of the Algorithms and Verification groups in the Department overlap, are particularly encouraged to apply.
Application deadline: November 16, 2021
Further details: https://www.jobs.ac.uk/job/CKB031/lecturer-in-theoretical-computer-science
Sincerely,
Jonni Virtema