April 2021 - Categories - categories.org.au

Re: "First" use of 'Category theory' to describe our field
by David Roberts 24 Feb '24

24 Feb '24

Dear Ross, no, that's pretty good! It's mildly surprising that it took ~20 years for the name to 'stick', but maybe less so given that the field grew slowly to start. Thanks, David David Roberts Webpage: https://ncatlab.org/nlab/show/David+Roberts Blog: https://thehighergeometer.wordpress.com On Thu, 11 Jul 2019 at 08:21, Ross Street <ross.street(a)mq.edu.au> wrote: > > Dear David > > From memory, the Pure Mathematics Honours (USyd) course that Max Kelly taught in 1965 > was called ``Category Theory''. It concentrated on different kinds of morphisms > and factorizations in a category, and finished with adjoint functors. > Also John Gray's (UIllinois) 1968-69 graduate course had that name. > > From Eilenberg I heard that each person using categories should have their own category of expertise. > I told this to John Gray who said that was fine; the time had come for that category to be Cat. > > I would suggest that the first category theorists to think of themselves as such were Eilenberg's students at Columbia. > However, Mac Lane was definitely a category theorist. > > This is probably not the verifiable stuff you were seeking. > > Ross > > > On 10 Jul 2019, at 10:01 PM, David Roberts <droberts.65537(a)gmail.com> wrote: > > Hi all, > > the (idle) question is: when did the phrase 'category theory' catch on > for the field? Clearly it didn't leap from either of the heads of > Eilenberg or Mac Lane full-grown, since they used the phrase 'General > theory of natural equivalences'. There are the old 'Reports of the > Midwest Category Seminar' lecture notes (the first in 1967), which > hints that 'category theory' wasn't quite the name in use. > > Even more interesting: who was the first "category theorist", by that name? > > Answers referring to verifiable sources would be best. > > Thoughts? > > David > > > > David Roberts > Webpage: https://ncatlab.org/nlab/show/David+Roberts > Blog: https://thehighergeometer.wordpress.com > [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

3 4

Time correction for Bohemian L&P Café: Michael Shulman, May 4
by Steve Awodey 01 May '21

01 May '21

CAUTION: The Sender of this email is not from within Dalhousie. ~~~ Bohemian Logical & Philosophical Café ~~~ Speaker: Michael Shulman Title: The derivator of setoids. May 4 at 16.00 Prague time (GMT+2) The zoom link is on the page: https://bohemianlpc.github.io [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Bohemian L&P Café: Michael Shulman, May 4
by Steve Awodey 29 Apr '21

29 Apr '21

CAUTION: The Sender of this email is not from within Dalhousie. ~~~ Bohemian Logical & Philosophical Café ~~~ Speaker: Michael Shulman Title: The derivator of setoids. May 4 at 16.00 Prague time (GMT+1) The zoom link is on the page: https://bohemianlpc.github.io Abstract: Can homotopy theory be developed in constructive mathematics, or even in ZF set theory without the axiom of choice? Recent work inspired by homotopy type theory has yielded two constructive homotopy theories (simplicial sets and equivariant cubical sets) that are classically equivalent to that of spaces, but it is unknown if they are constructively equivalent to each other. If they are not, then which one is correct? Or are they both correct, or both incorrect? What do these questions even mean? I will propose one criterion for the correctness of a constructive homotopy theory of spaces: as a derivator, it should be the free cocompletion of a point. (A derivator is an enhancement of the homotopy category that remains 1-categorical, but can still express universal properties of this sort.) Then I will give some evidence that any such homotopy theory must have the curious property that its 1-truncation contains, not only sets, but also setoids. Specifically, the ex/lex completion of the category of sets defines a derivator that satisfies a relative version of the aforementioned universal property; thus it should be a localization of any derivator satisfying the absolute condition. This suggests that either setoids are an unavoidable aspect of constructive homotopy theory, or the criterion needs to be modified. [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

PPDP 2021 Second Call for Papers
by Tarmo Uustalu 29 Apr '21

29 Apr '21

CAUTION: The Sender of this email is not from within Dalhousie. =========================== PPDP 2021 Second Call for Papers =========================== 23rd International Symposium on Principles and Practice of Declarative Programming 6–8 September 2021, Tallinn, Estonia http://imft.ftn.uns.ac.rs/PPDP2021 Collocated with LOPSTR 2021 http://cs.ioc.ee/ppdp-lopstr21/ =================================== Important Dates --------------------- - 08.05.2021 title and abstract submission - 15.05.2021 paper submission - 29.06.2021 rebuttal period (48 hours) - 09.07.2021 notification - 23.07.2021 final paper - 06.09.2021 conference starts About PPDP ---------- The PPDP 2021 symposium brings together researchers from the declarative programming communities, including those working in the functional, logic, answer-set, and constraint handling programming paradigms. The goal is to stimulate research in the use of logical formalisms and methods for analyzing, performing, specifying, and reasoning about computations, including mechanisms for concurrency, security, static analysis, and verification. Scope ----- Submissions are invited on all topics related to declarative programming, from principles to practice, from foundations to applications. Topics of interest include, but are not limited to - Language Design: domain-specific languages; interoperability; concurrency, parallelism and distribution; modules; functional languages; reactive languages; languages with objects; languages for quantum computing; languages inspired by biological and chemical computation; metaprogramming. - Declarative languages in artificial intelligence: logic programming; database languages; knowledge representation languages; probabilistic languages; differentiable languages. - Implementations: abstract machines; interpreters; compilation; compile-time and run-time optimization; memory management. - Foundations: types; logical frameworks; monads and effects; semantics. - Analysis and Transformation: partial evaluation; abstract interpretation; control flow; data flow; information flow; termination analysis; resource analysis; type inference and type checking; verification; validation; debugging; testing. - Tools and Applications: programming and proof environments; verification tools; case studies in proof assistants or interactive theorem provers; certification; novel applications of declarative programming inside and outside of CS; declarative programming pearls; practical experience reports and industrial application; education. The PC chair will be happy to advise on the appropriateness of a topic. Submission web page --------------------- https://easychair.org/conferences/?conf=ppdp2021 Submission Categories --------------------- Submissions can be made in three categories: - Research Papers, - System Descriptions, - Experience Reports. Submissions of Research Papers must present original research which is unpublished and not submitted elsewhere. They must not exceed 12 pages ACM style 2-column (including figures, but excluding bibliography). Work that already appeared in unpublished or informally published workshop proceedings may be submitted (please contact the PC chair in case of questions). Research papers will be judged on originality, significance, correctness, clarity, and readability. Submission of System Descriptions must describe a working system whose description has not been published or submitted elsewhere. They must not exceed 10 pages and should contain a link to a working system. System Descriptions must be marked as such at the time of submission and will be judged on originality, significance, usefulness, clarity, and readability. Submissions of Experience Reports are meant to help create a body of published, refereed, citable evidence where declarative programming such as functional, logic, answer-set, constraint programming, etc., is used in practice. They must not exceed 5 pages **including references**. Experience Reports must be marked as such at the time of submission and need not report original research results. They will be judged on significance, usefulness, clarity, and readability. Supplementary material may be provided via a link to an extended version of the submission (recommended), or in a clearly marked appendix beyond the above-mentioned page limits. Reviewers are not required to study extended versions or any material beyond the respective page limit. Formating Guidelines ---------------------------- We plan to use the same publication arrangements as PPDP has had in previous years. For each paper category, you must use the most recent version of the "Current ACM Master Template" which is available at <https://www.acm.org/publications/proceedings-template>. The most recent version at the time of writing is 1.75. You must use the LaTeX sigconf proceedings template as the conference organizers are unable to process final submissions in other formats. In case of problems with the templates, contact ACM's TeX support team at Aptara <acmtexsupport(a)aptaracorp.com>. Authors should note ACM's statement on author's rights (http://authors.acm.org/) which apply to final papers. Submitted papers should meet the requirements of ACM's plagiarism policy (http://www.acm.org/publications/policies/plagiarism_policy) Requirements for Publication ---------------------------- At least one author of each accepted submission will be expected to attend and present the work at the conference. The PC chair may retract a paper that is not presented. The PC chair may also retract a paper if complaints about the paper's correctness are raised which cannot be resolved by the final paper deadline. Program Committee ----------------------------- Zena Ariola, University of Oregon, USA Nick Benton, Facebook, UK Małgorzata Biernacka, University of Wroclaw, Poland James Cheney, The University of Edinburgh, UK Stefania Dumbrava, ENSIIE Paris-Evry, France Silvia Ghilezan, University of Novi Sad & Mathematical Institute SASA, Serbia Hugo Herbelin, INRIA, France Cosimo Laneve, University of Bologna, Italy Pierre Lescanne, ENS de Lyon, France Ugo de’Liguoro, University of Torino, Italy Francesca A. Lisi, University of Bari, Italy Yanhong Annie Liu, Stony Brook University, USA Elaine Pimentel, Federal University of Rio Grande do Norte, Brazil Yukiyoshi Kameyama, University of Tsukuba, Japan Petar Maksimović, Imperial College, London, UK Yutaka Nagashima, Yale-NUS College, Singapore & University of Innsbruck, Austria Aleksandar Nanevski, IMDEA Software Institute, Spain Vivek Nigam, fortiss GmbH, Germany & Federal University of Paraíba, Brazil Jorge A. Pérez, University of Groningen, The Netherlands Sanjiva Prasad, Indian Institute of Technology Delhi, India Alexis Saurin, CNRS, Université de Paris & INRIA , France Tom Schrijvers , KU Leuven, The Netherlands Paul Tarau, University of North Texas, USA Tarmo Uustalu, Reykjavik University, Iceland & Tallinn University of Technology, Estonia ------------------------- -------------------- --------------------- Program committee co-chair: Nick Benton, Facebook, UK Program committee co-chair: Silvia Ghilezan, University of Novi Sad & Mathematical Institute SASA, Serbia Organising committee chair: Niccolò Veltri, Tallinn University of Technology, Estonia Steering committee chair: James Cheney, Edinburgh University, UK ------------------------- -------------------- --------------------- All questions about submissions should be emailed to the program chair Silvia Ghilezan <gsilvia(a)uns.ac.rs>. All questions about local information should be emailed to the local organiser Niccolò Veltri <niccolo(a)cs.ioc.ee>. [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

PhD Student Opportunity in the Granule Project
by Harley D. Eades III 29 Apr '21

29 Apr '21

CAUTION: The Sender of this email is not from within Dalhousie. Dear Colleagues, The approach I'm taking in the following project is very categorical using various techniques and models of modal logic esp. adjoint logic. So if any of your students are interested their applications would be well received. I hope y'all are doing well! Harley ===PhD Student Ad=== Harley Eades of the Granule Project and Augusta University's ForML Lab is actively seeking applications for a PhD student starting Fall 2021. The successful applicant will be funded--including tuition, salary, and (international) conference travel--for the first three years of their appointment through a new NSF funded project: "Semantically and Practically Generalizing Graded Modal Types" A short overview of the main goals of this project is as follows: "We propose to investigate the theory and practice of graded modal types with the goal of combining and generalizing type-based software verification and data-usage tracking, thereby extending the verification abilities of type systems. To carry out this research we plan to: 1. investigate a new foundational theory for graded modal types based on the underlying theory of constructive modal logics that will support several new kinds of data-usage tracking making them more applicable to real-world problems. 2. design and implement Tenli; a general purpose functional programming language with graded modal types that supports general type-based software verification; 3. design new pedagogical materials for teaching resourceful software verification at both the undergraduate and graduate levels using Tenli, and other tools." The successful applicant will be advised by Harley Eades, but also collaborate with Dominic Orchard and his students in the Granule Project. In addition, they will have the opportunity to help mentor summer undergraduate research assistants through new collaborations with: - Clark Atlanta: A historically black university, and - Wesleyan College: An all womens school in Georgia. This is also an exciting time to join the ever growing Augusta University who has made Computer Science one of the main pillars of their university. We have successfully recruited ten new faculty (at all ranks) per year for the last three years. Fall 2021 marks the inaugural year of our PhD program (shorturl.at/gDTU9) and the successful applicant will be among the first PhD students in Computer Science at our university. Even though this is the inaugural year of our PhD program Harley Eades has mentored and collaborated with several PhD students over the course of the last six years. As part of a different NSF funded project Harley Eades recruited and collaborated with three PhD students from other universities through stipends. In addition, he actively collaborates with and has helped mentor PhD students working with Dominic Orchard. Finally, Harley Eades is an active SIGPLAN Mentor (https://www.sigplan.org/LongTermMentoring/) of one PhD student. Interested students should meet the following properties: - Be interested in the overall project as stated above. - Have or are about to complete a Bachelor of Science in Computer Science or a related field (Computer Engineering, Information Systems, Software Engineering, Mathematics, etc.). - Have a minimum cumulative GPA of 3.0 or better on a 4.0 scale. - Both national and International applicants are welcome. If you are interested in applying for this opportunity please begin by contacting Harley Eades (harley.eades(a)gmail.com) with the following information: - A brief introduction of yourself and if you've done any research already. - CV/Resume More information: - Harley Eades: https://metatheorem.org/ - Granule Project: https://granule-project.github.io/ - ForML Lab: https://the-au-forml-lab.github.io/index.html - AU PhD Program: https://www.augusta.edu/ccs/phd-ccs.php Thanks, Harley Eades [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

A seminar talk on Logical Relations As Types
by Harley D. Eades III 28 Apr '21

28 Apr '21

CAUTION: The Sender of this email is not from within Dalhousie. Hi, everyone. On Friday, April 30, 2021 between 1pm and 2pm EDT (5pm - 6pm UTC), Jon Sterling will be giving a presentation as part of the CS Colloquium Series at Augusta University. Presentation details can be found here: https://the-au-forml-lab.github.io/colloquium_talks/Sterling.html Jon will be discussing his recent work on a new "synthetic way to understand and interact with logical relations." I'm super excited to learn more about this. These talks are open to the general public via Zoom and Youtube. I'll be live streaming it on Youtube. If you are interested in attending the Zoom meeting please RSVP with me before the talk. Questions will be taken from those on Zoom and YouTube. If you care to watch via YouTube, please use the following link: https://youtu.be/AEthjg2k718 Feel free to share this message with everyone you know. I hope all of you, your family and friends are doing well! Very best, Harley [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Re: Invitation: GReTA Special Event, featuring Stephen Wolfram, April 28 at 18:00 CET
by Heckel, Reiko (Prof.) 26 Apr '21

26 Apr '21

CAUTION: The Sender of this email is not from within Dalhousie. Dear colleagues, It is our great pleasure to invite you to a *special event* of the “GReTA - Graph Transformation Theory and Applications” online series: Wednesday, April 28, 18:00 CEST (note the unusual day and time!) “Graph Rewriting as a Foundation for Science and Technology (and the Universe)”, Stephen Wolfram Please refer to http://www.irif.fr/~greta<https://eur03.safelinks.protection.outlook.com/?url=http:%2F%2Fwww.irif.fr%…> for further information on how to register for this Zoom meeting, or alternatively on how to attend the meeting via a YouTube live stream! The GReTA seminar series aims to serve as a platform for the international graph rewriting community, to promote recent developments and trends in the field, and to permit a regular networking and interaction between members of this community. Seminars are scheduled twice a month (cf. https://www.irif.fr/~greta/#talks<https://eur03.safelinks.protection.outlook.com/?url=https:%2F%2Fwww.irif.fr…> for a list of upcoming events). With best regards, Nicolas Behr, Jean Krivine and Reiko Heckel (GReTA organisers) ___________________________________________________ Date and time: Wednesday, April 28, 18:00 CEST Title: Graph Rewriting as a Foundation for Science and Technology (and the Universe) Speaker: Stephen Wolfram (Wolfram Research, Champaign, USA) About the speaker: Stephen Wolfram is the creator of Mathematica, Wolfram|Alpha and the Wolfram Language; the author of "A New Kind of Science"; the originator of the Wolfram Physics Project; and the founder and CEO of Wolfram Research. Over the course of more than four decades, he has been a pioneer in the development and application of computational thinking—and has been responsible for many discoveries, inventions and innovations in science, technology and business. Zoom registration link: https://zoom.us/meeting/register/tJcrcuipqjoqEtVlOUZXdaCvjXaXWJfVtQpg<https://eur03.safelinks.protection.outlook.com/?url=https%3A%2F%2Fzoom.us%2…> Link to YouTube live stream: https://youtu.be/CLXyDCISsUY<https://eur03.safelinks.protection.outlook.com/?url=https%3A%2F%2Fyoutu.be%…> ___________________________________________________ ---------------------------------------------------------------------------- GReTA - Graph TRansformation Theory and Applications International Online Seminar Series ---------------------------------------------------------------------------- Contact: greta(a)irif.fr<mailto:greta@irif.fr> Webpage: www.irif.fr/~greta<https://eur03.safelinks.protection.outlook.com/?url=http:%2F%2Fwww.irif.fr%…> YouTube: https://www.youtube.com/channel/UC6j-G6oPmkqCgOx6UQOUhSQ<https://eur03.safelinks.protection.outlook.com/?url=https%3A%2F%2Fwww.youtu…> Twitter: https://twitter.com/GReTAseminars<https://eur03.safelinks.protection.outlook.com/?url=https%3A%2F%2Ftwitter.c…> [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Deadline Extension: VCLA International Student Awards 2021 for Outstanding Master and Bachelor Theses in Logic and Computer Science
by Traxler, Alexandra 23 Apr '21

23 Apr '21

CAUTION: The Sender of this email is not from within Dalhousie. We are pleased to announce that the deadline for the Call for Nominations for the VCLA International Student Awards 2021 for Outstanding Master and Bachelor Theses in Logic and Computer Science has been extended to *May 7, 2021* (Anywhere on Earth). The full, updated Call for Applications is available below. The Vienna Center for Logic and Algorithms of TU Wien (Vienna University of Technology), calls for the nomination of authors of outstanding theses and scientific works in the field of Logic and Computer Science, in the following two categories: -Outstanding Master Thesis Award* -Outstanding Undergraduate Thesis Award (Bachelor thesis or equivalent, 1st cycle of the Bologna process)* *The degree must have been awarded between November 15th, 2019 and December 31st, 2020 (inclusive). ---------------------------------- The main areas of interest are: ---------------------------------- -Computational Logic, covering theoretical and mathematical foundations such as proof theory, model theory, computability theory, Boolean satisfiability (SAT), QBF, constraint satisfaction, satisfiability modulo theories, automated deduction (resolution, refutation, theorem proving), non-classical logics (substructural logics, multi-valued logics, deontic logics, modal and temporal logics). -Algorithms and Computational Complexity, including design and analysis of discrete algorithms, complexity analysis, algorithmic lower bounds, parameterized and exact algorithms, decomposition methods, approximation algorithms, randomized algorithms, algorithm engineering, as well as algorithmic game theory, computational social choice, parallel algorithms, graph drawing algorithms, and distributed algorithms. -Databases and Artificial Intelligence, concerned with logical methods for modeling, storing, and drawing inferences from data and knowledge. This includes subjects like query languages based on logical concepts (Datalog, variants of SQL, XML, and SPARQL), novel database-theoretical methods (schema mappings, information extraction and integration), logic programming, knowledge representation and reasoning (ontologies, answer-set programming, belief change, inconsistency handling, argumentation, planning). -Verification, concerned with logical methods and automated tools for reasoning about the behavior and correctness of complex state-based systems such as software and hardware designs as well as hybrid systems. This ranges from model checking, program analysis and abstraction to new interdisciplinary areas such as fault localization, program repair, program synthesis, and the analysis of biological systems. ---------------------------------- Awards ---------------------------------- -The Outstanding Master Thesis Award: 1200 EUR -The Outstanding Undergraduate Thesis Award: 800 EUR -The winners will be invited to present their work at an award ceremony in Vienna, if the situation allows ---------------------------------- Eligibility ---------------------------------- -The degree must have been awarded between November 15th, 2019 and December 31st, 2020 (inclusive). -Submissions already submitted to the VCLA Awards 2020 cannot be re-submitted. -Students who obtained their degree at TU Wien are not eligible. ---------------------------------- Nomination Requirements ---------------------------------- Nominations must include: -A cover page that contains the name and contact details of the nominated person, the title of the work for which the person is being nominated, award category, the date on which the degree was awarded, and the name of the university -An English summary of the thesis of maximum 3 pages, excluding references (A4 or letter page size, 11pt font min). The summary must clearly state the main contribution of the work, its novelty, and its relevance to some of the aforementioned areas of interest -The CV of the nominated person, including publication list (if applicable) -An endorsement letter from a supervisor or another proposing person. The letter must clearly state the independent and novel contribution of the student, and why the proposer believes the student deserves the award. The endorsement letter may be provided after the submission deadline, and emailed directly to award (AT) logic-cs.at. -The full thesis All documents should be in English, with the exception of the thesis. In case the thesis is in a different language, it must be accompanied by a research report in English of at least 10 pages that should be sufficient for the committee to evaluate the merit and quality of the submitted work. ---------------------------------- Instructions for submitting self-nominations ---------------------------------- -Nominations should be submitted electronically by the applicants using the following link to EasyChair here<https://easychair.org/conferences/?conf=vclaawards2021> -Submissions consist of two pdf files. The first is a single pdf file containing all documents for the nomination except the full thesis; the documents should appear in the order they are listed above. The second pdf file is the full thesis -The endorsement letter may optionally be sent by email by the endorser and omitted from the Easychair submission. In this case, please email the letter as a pdf file, including the name of the nominated person in the subject, to award (AT) logic-cs DOT at -The submission must be accompanied by a plain text electronic abstract of the thesis of at most 400 words, and three keywords. -The nominated student must be listed as the only author in the submission form. ---------------------------------- Important dates ---------------------------------- -Extended submission deadline: May 7, 2021 (anywhere on Earth) -Notification of decision: After July 15th, 2021 -Award ceremony: Depending on the COVID-19 situation ---------------------------------- Contact ---------------------------------- Please send all inquiries to award(a)logic-cs.at ---------------------------------- Website with the information on the award committee, and the previous awardees ---------------------------------- https://logic-cs.at/vcla-international-student-awards-2021 ? [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Second Announcement: Em-Cats Virtual Seminar
by Brendan Fong 23 Apr '21

23 Apr '21

CAUTION: The Sender of this email is not from within Dalhousie. Dear categories list, I'd like to make a second announcement of the Emerging Researchers in Category Theory (Em-Cats) Virtual Seminar, which will comprise talks given by graduate students in Category Theory around the world. We invite students to apply to speak in the seminar. We also would appreciate any efforts from thesis advisors and other mentors to encourage their less self-confident students to apply. The first round of applications closes next week, on April 30th, 2021. The aims of the seminar are, broadly: 1. Help the next generation of category theorists become wonderful speakers. 2. Make use of the virtual possibilities, and give opportunities to graduate students in places where there is not a category theory group or local seminar they can usefully speak in. 3. Give an opportunity to graduate students to have a global audience, especially giving more visibility to students from less famous/large groups. 4. Make a general opportunity for community among category theorists who are more isolated than those with local groups. 5. Make a series of truly intelligible talks, which we hope students and researchers around the world will enjoy and appreciate. Eugenia Cheng leads the seminar, and will assist each speaker in the preparation of their talk, to ensure that all talks are excellent. We expect to plan one talk per month initially, starting in August or September 2021. More information, including the application form, can be found on the seminar website: https://topos.site/em-cats/. With kind regards, Brendan [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Interdisciplinary Conference on Foundations of Mathematics, Mathematical Cognition and Fundamental Science
by ZAPATA-CARRATALA Carlos 23 Apr '21

23 Apr '21

CAUTION: The Sender of this email is not from within Dalhousie. Numerous Numerosity: an interdisciplinary conference on mathematical cognition, fundamental science, and philosophy of mathematics Numbers: we use them every day, science relies on their precision, entire mathematical theories are built from them, they are the lifeblood of our technological ecosystem, even animals and plants show some numerical competency… but, what are numbers? Held online May 24-28, Numerous Numerosity is an interdisciplinary conference aimed at answering this seemingly naive question in the most comprehensive way possible. http://semf.org.es/numerosity/ We are delighted to announce a list of world-class plenary speakers: Stephen Wolfram (Wolfram Research) Jessica Flack (Santa Fe Institute) Rafael Núñez (University of California - San Diego) Regina Fabry (Ruhr University - Bochum) David Krakauer (Santa Fe Institute) Nicolas Gisin (University of Geneva, Schaffhausen Institute of Technology) Karenleigh A. Overmann (University of Colorado - Colorado Springs) Andrea Sereni (University School for Advanced Studies Pavia) Grace W. Lindsay (Columbia University) Kevin Buzzard (Imperial College London) Menachem Magidor (Hebrew University of Jerusalem) Participants from any background are welcome to attend, but we expect that this event will be of particular interest to researchers in the fields of mathematical cognition, complexity science, foundations of mathematics, neuroscience, fundamental physics, computer science and philosophy of mathematics. Those wishing to attend the online conference by joining the virtual meetings must click the button “Attend” on the event website before May 16. The event will also be live-streamed on YouTube. Following the main event there will be a small-scale three-day workshop aimed primarily at young researchers. Applications to participate in the workshop are open until May 16: http://semf.org.es/numerosity/#workshop [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0