From A.Beckmann at Swansea.ac.uk Mon Mar 10 19:30:42 2025 From: A.Beckmann at Swansea.ac.uk (Arnold Beckmann) Date: Mon, 10 Mar 2025 18:30:42 +0000 Subject: [Proof Complexity] CiE 2025, 14-18 July 2025, Lisbon (Portugal) - Call for Informal Presentations Message-ID: CiE 2025: CALL FOR INFORMAL PRESENTATIONS Computability in Europe 2025 Crossroads of Computability and Logic: Insights, Inspirations, and Innovations Lisbon, Portugal July 14-18, 2025 https://bit.ly/CIE2025 Submission link: https://easychair.org/my/conference?conf=cie2025 IMPORTANT DATES: Deadline for informal presentations submission: April 22, 2025 (The notifications of acceptance for informal presentations will be sent a few days after submission) Early registration before: May 6, 2025 Conference: July 14-18, 2025 GENERAL INFORMATION CiE 2025 will be the 21st conference organized by CiE (Computability in Europe). CiE is a European association of mathematicians, logicians, computer scientists, philosophers, physicists and others interested innew developments in computability and their underlying significance for the real world. Previous meetings have taken place in Amsterdam (2005), Swansea (2006), Siena (2007), Athens (2008), Heidelberg (2009), Ponta Delgada (2010), Sofia (2011), Cambridge (2012), Milan (2013), Budapest (2014), Bucharest (2015), Paris (2016), Turku (2017), Kiel (2018), Durham (2019), Salerno (2020, virtually), Ghent (2021, virtually), Swansea (2022), Batumi (2023), and Amsterdam (2024). TUTORIAL SPEAKERS Maria Paola Bonacina (University of Verona) Igor Carboni Oliveira (University of Warwick) INVITED SPEAKERS Ugo Dal Lago (University of Bologna) Daniel Gra?a (University of Algarve) Ekaterina Komendantskaya (University of Southampton) Ng Keng Meng (Nanyang Technological University) Paulo Oliva (Queen Mary University of London) Ana Sokolova (University of Salzburg) SPECIAL SESSIONS * COMPUTABLE ANALYSIS AND TOPOLOGY - organized by Takayuki Kihara and Elvira Mayordomo; speakers are Djamel Amir (Universit? de Lorraine, LORIA), C?cilia Pradic (Swansea University), Emmanuel Rauzy (Universit?t der Bundeswehr, M?nchen), and Holger Thies (Kyoto University). * COMPUTABILITY ASPECTS OF DESCRIPTIVE SET THEORY - organized by Luca San Mauro and Dino Rossegger, speakers are Antonio Montalban (University of California, Berkeley), Noah Schweber (Proof School, San Francisco), Benjamin Siskind (Technische Universit?t Wien), and Dan Turetsky (Victoria University of Wellington). * HUMAN-CENTERED AI: FOUNDATIONAL AND HISTORICAL PERSPECTIVES - organized by Melissa Antonelli, Jean-Baptiste Joinet and Mattia Petrolo, speakers include Juan Manuel Duran (Delft University of Technology), Paolo Pistone (Universit? Claude Bernard Lyon 1), and Carina Prunkl (Utrecht University) * PROOF COMPLEXITY AND SAT - organized by Maria Luisa Bonet and Pavel Pudl?k, speakers are Albert Atserias (Technical University of Catalonia), Paul Beame (University of Washington), Sam Buss (University of California, San Diego), and Robert Robere (McGill University). * PROOF THEORY: PURE AND APPLIED - organized by Anton Freud and Pedro Pinto, speakers are Horatiu Cheval (University of Bucharest), Azza Gaysin (University of Passau), Morenikeji Neri (University of Bath), and Shuwei Wang (University of Leeds). * QUANTUM COMPUTING - organized by Georg Moser and Romain Pechoux, speakers are Alejandro Diaz-Caro (CONICET, Buenos Aires), Richard Kueng (Johannes Kepler University Linz), Subhasree Patro (Eindhoven University of Technology), and Simon Perdrix (Inria). CONFERENCE TOPICS The CiE conferences serve as an interdisciplinary forum for research in all aspects of computability, foundations of computer science, logic, and theoretical computer science, as well as the interplay of these areas with practical issues in computer science and with other disciplines such as biology, mathematics, philosophy, or physics. INFORMAL PRESENTATIONS Continuing the tradition of past CiE conferences, we invite researchers to present informal presentations of their recent work. A proposal for an informal presentation must be submitted via our submission link: https://easychair.org/my/conference?conf=cie2025, using the LNCS style file (available at https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines), and be 1 page long; a brief description of the results suffices and an abstract is not required. Informal presentations will not be published in the LNCS conference proceedings. Results presented as informal presentations at CiE 2025 may appear or may have appeared in other conferences with formal proceedings and/or in journals. STUDENTS TRAVEL AWARDS The Association for Symbolic Logic (ASL) offers modest student travel awards to attend CiE 2025. Students must be members of the ASL in order to apply, and applications must be received three months prior to the start of the conference. Applications should be sent to Shannon Miller at asl at uconn.edu. Further information in https://aslonline.org/student-travel-awards/. PROGRAM COMMITTEE Contributed papers will be selected from submissions received by the PROGRAM COMMITTEE consisting of: Arnold Beckmann (Swansea University) ? co-chair Laurent Bienvenu (University of Bordeaux) Christel Baier (Technische Universit?t Dresden) Giuseppa Castiglione (Universit? degli Studi di Palermo) Benjamin Doerr (?cole Polytechnique) Fernando Ferreira (University of Lisbon) Gilda Ferreira (Universidade Aberta) Ekaterina Fokina (Vienna University of Technology) Lorenzo Galeotti (Amsterdam University College) Jun Le Goh (National University of Singapore) Angeliki Koutsoukou-Argyraki (Royal Holloway, University of London and University of Cambridge) Ludovic Levy Patey (Mathematics Institute of Jussieu?Paris Rive Gauche) Zsuzsanna Lipt?k (University of Verona) Florin Manea (University of G?ttingen) Simone Martini (University of Bologna) Russell Miller (Queens College-CUNY) Georg Moser (University of Innsbruck) Isabel Oitavem (Universidade Nova de Lisboa) ? co-chair Romain P?choux (University of Lorraine) Paolo Pistone (Universit? Claude Bernard Lyon 1) Dino Rossegger (Vienna University of Technology) Stefan Vatev (Sofia University) Damien Woods (Maynooth University) WOMEN IN COMPUTABILITY We intend to run the Women in Computability program as in previous CiEs, details will be announced in due course. HOSTED BY The event will be held in the Faculdade de Ci?ncias buildings located at University of Lisbon. ORGANIZING COMMITTEE Bruno Dinis (University of ?vora / CIMA) Jos? Esp?rito Santo (University of Minho / CMAT) Gilda Ferreira (Universidade Aberta / CMAFcIO) - chair Manuel Martins (University of Aveiro / CIDMA) Isabel Oitavem (NOVA University of Lisbon / NOVAMath) Pedro Quaresma (University of Coimbra / CISUC) Jo?o Rasga (University of Lisbon / Instituto de Telecomunica??es) Alexandra Rodrigues (NOVA University of Lisbon) Paulo Guilherme Santos (Instituto Polit?cnico de Lisboa / CMAFcIO) Andr? Souto (University of Lisbon / LASIGE) Maria Manuel Torres (University of Lisbon / CMAFcIO) From jn at di.ku.dk Mon Mar 10 19:46:14 2025 From: jn at di.ku.dk (=?UTF-8?Q?Jakob_Nordstr=C3=B6m?=) Date: Mon, 10 Mar 2025 19:46:14 +0100 Subject: [Proof Complexity] MIAO seminar Tue Mar 18 at 14:00 CET with Haniel Barbosa: SMT proof production, checking and reconstruction Message-ID: Dear all, On Tuesday March 18 at 14:00 CET we will have the opportunity to listen to the MIAO seminar "SMT proof production, checking and reconstruction" given by Haniel Barbosa from Universidade Federal de Minas Gerais. You find the abstract at the bottom of this message. This will be a video seminar at https://lu-se.zoom.us/j/61925271827 . Please feel free to share this information with colleagues who you think might be interested. We are also hoping to record the seminar and post on the MIAO Research YouTube channel https://youtube.com/@MIAOresearch for people who would like to hear the talk but cannot attend. Most of our seminars consist of two parts: first a 50-55-minute regular talk, and then after a break a ca-1-hour in-depth technical presentation with (hopefully) a lot of interaction. The intention is that the first part of the seminar will give all listeners a self-contained overview of some exciting research results, and after the break people who have the time and interest will get an opportunity to really get into the technical details. (However, for those who feel that the first part was enough, it is perfectly fine to just discretely drop out during the break. No questions asked; no excuses needed.) More information about the MIAO seminar series can be found at https://jakobnordstrom.se/miao-seminars/ . If you do not wish to receive these announcements, or receive several copies of them, please send a message to jn at di.ku.dk. Best regards, Jakob Nordstr?m ********** /Tuesday Mar 18 at 14:00 on Zoom *SMT proof production, checking and reconstruction *(Haniel Barbosa, Universidade Federal de Minas Gerais) / Satisfiability modulo theories (SMT) solvers can be hard to trust, since it generally means assuming their large and complex codebases do not contain bugs leading to wrong results. Machine-checkable certificates, via proofs of the logical reasoning the solver has performed, address this issue by decoupling confidence in the results from the solver's implementation. In this talk we will describe the extensive proof infrastructure of the state-of-the-art SMT solver cvc5, which has enabled the production of proofs in a number of complex domains. We will also show how these proofs are checked or reconstructed in different formats by different systems, from ad-hoc high-performance proof checkers to proof assistants such as Lean. */Speaker bio: /*Haniel Barbosa is a tenured assistant professor in the Department of Computer Science at Universidade Federal de Minas Gerais (UFMG), in Belo Horizonte, Brazil. He fell in love with automated reasoning and its applications during his PhD at Inria Nancy, under the direction of Prof. Pascal Fontaine, and subsequently as a postdoctoral researcher at the University of Iowa. His research focuses on improving satisfiability modulo theories (SMT) solvers for formal verification and on making them more trustworthy via the production and checking of proof certificates. He is also a senior technical lead for the state-of-the-art SMT solver cvc5. Jakob Nordstr?m, Professor University of Copenhagen and Lund University Phone: +45 28 78 38 11 / +46 70 742 21 98 https://jakobnordstrom.se From essllipublicity at gmail.com Wed Mar 12 19:16:51 2025 From: essllipublicity at gmail.com (ESSLLI Publicity) Date: Wed, 12 Mar 2025 11:16:51 -0700 Subject: [Proof Complexity] CfParticipation: ESSLLI 2025, July 28 - August 8, 2025, Bochum (Germany) Message-ID: We invite you to participate in the 36th European Summer School in Logic, Language and Information (ESSLLI), taking place from 28 July - 8 August, 2025 at Ruhr University Bochum, Germany. https://2025.esslli.eu/ * Overview The European Summer School in Logic, Language and Information (ESSLLI) is a yearly recurring event, organized under the auspices of the Association for Logic, Language and Information (FoLLI), and has been running since 1989. The ESSLLI Summer School provides an interdisciplinary setting in which courses and workshops are offered in logic, linguistics and computer science, also from wider scientific, historical, and philosophical perspectives. ESSLLI attracts around 400 participants from Europe, the Middle East, Asia and Africa, as well as from North America and Latin America. ESSLLI has become the main meeting place for young researchers and students in logic, linguistics and computer science to discuss current research and to share knowledge. The event is unique in its interdisciplinary set-up, with no equivalents in Europe. * Programme The ESSLLI Summer School offers an exciting two-week programme, consisting of the following: - Foundational, introductory and advanced courses in three areas: Language and Computation, Logic and Computation, and Logic and Language - Workshops in logic, linguistics and computer science - Student session - Evening lectures - Social activities The full program can be found on the website. * Registration: Registration for attendees is now open. The early-registration deadline is Saturday, 31st May. https://2025.esslli.eu/registration/registration.html * Accommodation Various options for accommodation at special negotiated rates are listed on the website and available first-come, first-served. We have also set up a dedicated Discord server which can be used for coordinating shared apartments, etc. From jn at di.ku.dk Fri Mar 14 09:58:32 2025 From: jn at di.ku.dk (=?UTF-8?Q?Jakob_Nordstr=C3=B6m?=) Date: Fri, 14 Mar 2025 09:58:32 +0100 Subject: [Proof Complexity] Second call for papers for SAT 2025 Message-ID: <073f34c2-3ca6-4dcd-b17a-02bd40ca5f00@di.ku.dk> Dear colleagues, This message is to make you aware of the call for papers for the SAT 2025 conference, which will be co-located with CP, SoCS, and the SMT workshop. We would also like to inform you that SAT and CP will co-host a doctoral program that aims to bring together students in the field. More details on the doctoral program will follow later in the spring. We hope that as many PhD students as possible will consider submitting to the doctoral program and that more senior researchers will encourage their students to do so. Looking forward to seeing you in Glasgow! Best regards, Jeremias Berg & Jakob Nordstr?m PC chairs of SAT 2025 ********** *AT A GLANCE * 28th International Conference on Theory and Applications of Satisfiability Testing University of Glasgow, August 10-15, 2025 Abstract registration deadline: March 20, 2025 Submission deadline: March 27, 2025 Conference website: https://satisfiability.org/SAT25/ Submission link: https://easychair.org/conferences/?conf=sat2025 *SUMMARY OF CALL FOR PAPERS * Please note that this is just a summary --- see https://satisfiability.org/SAT25/cfp/ for the full call with all nitty-gritty details. */Scope/ * SAT 2025 is the 28th edition of the International Conference on Theory and Applications of Satisfiability Testing. The scope of SAT 2025 includes all aspects of the theory and applications of propositional satisfiability broadly construed. This includes paradigms such as Boolean optimization using, e.g., MaxSAT and pseudo-Boolean (PB) solving, quantified Boolean formulas (QBF), satisfiability modulo theories (SMT), model counting, constraint programming (CP), and integer linear programming (ILP) for problems with clear connections to Boolean-level reasoning. This year the 31st International Conference on Principles and Practice of Constraint Programming (CP) will be co-located with SAT and will have deadlines and reviewing process synchronized with SAT 2025. Topics of interest for the SAT 2025 conference include but are not limited to: - Theoretical advances (including algorithms, proof complexity, parameterized complexity, and other complexity issues) - Practical search algorithms - Knowledge compilation - Implementation-level details of SAT and SMT solving tools and SAT/SMT-based systems - Problem encodings and reformulations - Applications (including both novel applications domains and improvements to existing approaches) - Case studies and reports on scientific findings based on rigorous experimentation */Paper Categories/ * Submissions to SAT 2025 are invited in the following three categories: - Long papers (9 to 15 pages, excluding references and appendices) - Short papers (up to 8 pages, excluding references and appendices) - Tool papers (up to 8 pages, excluding references and appendices) */Submission/ * Submissions should not be under review or submitted elsewhere while under review for SAT 2025, and should not consist of previously published material. Submissions not consistent with these guidelines may be returned without review. The chairs reserve the right to coordinate with the chairs of other conferences to investigate suspected cases of concurrent submissions. Submissions should be made via EasyChair at https://easychair.org/conferences/?conf=sat2025 and papers must be formatted in the LIPIcs LaTeX style available at https://submission.dagstuhl.de/series/details/LIPIcs#author . */Important Dates/ * - Abstract registration: March 20, 2025 AoE - Full paper submission: March 27, 2025 AoE - Author response: May 5-9, 2025 AoE - Notification of decisions: May 29, 2025 AoE - Camera-ready version submission: Early June. - Workshops and Doctoral Program: August 10-11, 2024 - Conference: August 12-15, 2024 */Proceedings/ * Accepted papers will be published as conference proceedings in the Leibniz International Proceedings in Informatics (LIPIcs) as a free, open electronic archive with access to all. Authors will retain full rights over their work. The accepted papers will be published under a CC-BY license. */Full Call for Papers for SAT 2025/ * Please see https://satisfiability.org/SAT25/cfp/ for the full call for papers. The program committee for SAT 2025 is listed at https://satisfiability.org/SAT25/organizers/#program-committee . From jn at di.ku.dk Mon Mar 17 21:00:16 2025 From: jn at di.ku.dk (=?UTF-8?Q?Jakob_Nordstr=C3=B6m?=) Date: Mon, 17 Mar 2025 21:00:16 +0100 Subject: [Proof Complexity] MIAO seminar Wed Mar 19 at 15:30 CET with Antonina Kolokolova: Learning from proofs Message-ID: <84035e52-0d39-43ae-937b-6b80bab5a0a7@di.ku.dk> Dear all, With apologies for the short forward notice, this Wednesday March 19 at 15:30 CET (note the time!) we will have the opportunity to listen to Antonina Kolokolova from Memorial University presenting a seminar titled "Learning from proofs". You find the abstract at the bottom of this message. We will run this as a hybrid seminar at the University of Copenhagen. Local participants are warmly welcome to seminar room N116 at Universitetsparken 1, while other participants are equally warmly welcome to join virtually at https://lu-se.zoom.us/j/61925271827 . Please feel free to share this information with colleagues who you think might be interested. We are also hoping to record the seminar and post on the MIAO Research YouTube channel https://youtube.com/@MIAOresearch for people who would like to hear the talk but cannot attend. More information about the MIAO seminar series can be found at https://jakobnordstrom.se/miao-seminars/ . If you do not wish to receive these announcements, or receive several copies of them, please send a message to jn at di.ku.dk. Best regards, Jakob Nordstr?m ********** /Wednesday March 19 at 15:30 (note the time!) in seminar room N116, Universitetsparken 1, University of Copenhagen, and on Zoom *Learning from proofs *(Antonina Kolokolova, Memorial University) / A proof often gives us more than establishing a fact: it can give us algorithms. The hidden power of constructive proofs of both hardness and easiness of computational tasks is that they give us ways to construct circuits and other computational objects: they give us learning algorithms. In this talk, we will cover several ways in which proofs of upper and lower bounds in computational complexity lead to learning algorithms, both from constructive proofs of hardness of cryptographic primitives, and from formalizing complexity statements in bounded arithmetic. I will also talk about the existence of constructive proofs, with complexity-theoretic consequences for some notions of "constructive". Jakob Nordstr?m, Professor University of Copenhagen and Lund University Phone: +45 28 78 38 11 / +46 70 742 21 98 https://jakobnordstrom.se From jn at di.ku.dk Thu Mar 20 20:40:05 2025 From: jn at di.ku.dk (=?UTF-8?Q?Jakob_Nordstr=C3=B6m?=) Date: Thu, 20 Mar 2025 20:40:05 +0100 Subject: [Proof Complexity] Deadline extension for SAT 2025 submissions In-Reply-To: <073f34c2-3ca6-4dcd-b17a-02bd40ca5f00@di.ku.dk> References: <073f34c2-3ca6-4dcd-b17a-02bd40ca5f00@di.ku.dk> Message-ID: <06824dff-d7e3-4d5e-af9d-97a55b4665eb@di.ku.dk> Dear colleagues, Due to numerous requests, we have decided to extend the deadline for SAT 2025. We hope the extension will help everyone finalize their submissions. The new abstract registration deadline is March 24th AoE. Full papers are due April 3rd AoE. These deadlines are final; no further extensions will be granted. Best regards, Jeremias Berg & Jakob Nordstr?m PC chairs of SAT 2025 -------- Forwarded Message -------- Subject: Second call for papers for SAT 2025 Date: Fri, 14 Mar 2025 09:58:32 +0100 From: Jakob Nordstr?m To: Proof complexity mailing list Dear colleagues, This message is to make you aware of the call for papers for the SAT 2025 conference, which will be co-located with CP, SoCS, and the SMT workshop. We would also like to inform you that SAT and CP will co-host a doctoral program that aims to bring together students in the field. More details on the doctoral program will follow later in the spring. We hope that as many PhD students as possible will consider submitting to the doctoral program and that more senior researchers will encourage their students to do so. Looking forward to seeing you in Glasgow! Best regards, Jeremias Berg & Jakob Nordstr?m PC chairs of SAT 2025 ********** *AT A GLANCE * 28th International Conference on Theory and Applications of Satisfiability Testing University of Glasgow, August 10-15, 2025 Abstract registration deadline: March 20, 2025 Submission deadline: March 27, 2025 Conference website: https://satisfiability.org/SAT25/ Submission link: https://easychair.org/conferences/?conf=sat2025 *SUMMARY OF CALL FOR PAPERS * Please note that this is just a summary --- see https://satisfiability.org/SAT25/cfp/ for the full call with all nitty-gritty details. */Scope/ * SAT 2025 is the 28th edition of the International Conference on Theory and Applications of Satisfiability Testing. The scope of SAT 2025 includes all aspects of the theory and applications of propositional satisfiability broadly construed. This includes paradigms such as Boolean optimization using, e.g., MaxSAT and pseudo-Boolean (PB) solving, quantified Boolean formulas (QBF), satisfiability modulo theories (SMT), model counting, constraint programming (CP), and integer linear programming (ILP) for problems with clear connections to Boolean-level reasoning. This year the 31st International Conference on Principles and Practice of Constraint Programming (CP) will be co-located with SAT and will have deadlines and reviewing process synchronized with SAT 2025. Topics of interest for the SAT 2025 conference include but are not limited to: - Theoretical advances (including algorithms, proof complexity, parameterized complexity, and other complexity issues) - Practical search algorithms - Knowledge compilation - Implementation-level details of SAT and SMT solving tools and SAT/SMT-based systems - Problem encodings and reformulations - Applications (including both novel applications domains and improvements to existing approaches) - Case studies and reports on scientific findings based on rigorous experimentation */Paper Categories/ * Submissions to SAT 2025 are invited in the following three categories: - Long papers (9 to 15 pages, excluding references and appendices) - Short papers (up to 8 pages, excluding references and appendices) - Tool papers (up to 8 pages, excluding references and appendices) */Submission/ * Submissions should not be under review or submitted elsewhere while under review for SAT 2025, and should not consist of previously published material. Submissions not consistent with these guidelines may be returned without review. The chairs reserve the right to coordinate with the chairs of other conferences to investigate suspected cases of concurrent submissions. Submissions should be made via EasyChair at https://easychair.org/conferences/?conf=sat2025 and papers must be formatted in the LIPIcs LaTeX style available at https://submission.dagstuhl.de/series/details/LIPIcs#author . */Important Dates/ * - Abstract registration: March 20, 2025 AoE - Full paper submission: March 27, 2025 AoE - Author response: May 5-9, 2025 AoE - Notification of decisions: May 29, 2025 AoE - Camera-ready version submission: Early June. - Workshops and Doctoral Program: August 10-11, 2024 - Conference: August 12-15, 2024 */Proceedings/ * Accepted papers will be published as conference proceedings in the Leibniz International Proceedings in Informatics (LIPIcs) as a free, open electronic archive with access to all. Authors will retain full rights over their work. The accepted papers will be published under a CC-BY license. */Full Call for Papers for SAT 2025/ * Please see https://satisfiability.org/SAT25/cfp/ for the full call for papers. The program committee for SAT 2025 is listed at https://satisfiability.org/SAT25/organizers/#program-committee . From jn at di.ku.dk Tue Mar 25 10:03:52 2025 From: jn at di.ku.dk (=?UTF-8?Q?Jakob_Nordstr=C3=B6m?=) Date: Tue, 25 Mar 2025 10:03:52 +0100 Subject: [Proof Complexity] Position in Formal Verification of AI at Glasgow In-Reply-To: References: Message-ID: <65c4fe31-0c0d-4e8e-b4bd-677f38269681@di.ku.dk> Dear colleagues, On behalf of Ciaran McCreesh, I would like to share the information that the University of Glasgow is looking to recruit a lecturer / senior lecturer / reader in formal analysis of AI systems. The intention is for this research area to be interpreted quite broadly, and so this could certainly include automated reasoning, combinatorial solving, theorem proving, or computational complexity. Further details can be found in the job posting https://www.jobs.gla.ac.uk/job/lecturer-slash-senior-lecturer-slash-reader-in-foundational-ai . If you think this sounds potentially interesting and have any questions about the role, life in Scotland, or how your research might fit in with existing activities within the University of Glasgow, then you are more than welcome to contact Ciaran McCreesh at Ciaran.McCreesh at glasgow.ac.uk for an informal chat. Best regards, Jakob Nordstr?m Jakob Nordstr?m, Professor University of Copenhagen and Lund University Phone: +45 28 78 38 11 / +46 70 742 21 98 https://jakobnordstrom.se From thapen at math.cas.cz Fri Mar 28 15:35:21 2025 From: thapen at math.cas.cz (thapen) Date: Fri, 28 Mar 2025 15:35:21 +0100 Subject: [Proof Complexity] JAF44 In Prague this September Message-ID: Dear all, (apologies for multiple copies) This is a second announcement that the annual meeting Journ?es sur les Arithm?tiques Faibles / Weak Arithmetics Days (JAF) will take place in Prague this year, on 8-10 September. It deals with proof theory and model theory around weak systems of arithmetic, and related topics. A webpage with more information is https://workshop.math.cas.cz/JAF44/ Students are encouraged to come and we have some money to support student travel to the meeting. Please contact me if you are interested in this. The deadline to submit an abstract for a contributed talk is 2 June. Hope to see you this September, Neil Thapen