Conferences and Meetings on Mathematical Logic and Foundations

The goal of this conference is to investigate the role of mathematics as a heuristic device for analogical reasoning in science and philosophy. ​ Empirical science relies heavily on mathematics. Mathematical models enable physicists to simulate dynamical ‘dumb hole’ analogues to gravitational black holes (Curiel 2019; Dardashti, Thébault, and Winsberg 2017; Gryb, Palacios, and Thébault 2019), chemists to study the behaviour of molecules, medical researchers to examine the spreading rate of diseases, and biologists to understand changes in animal populations. There is no doubt that mathematics is an indispensable scientific tool.

University of Pisa, Department of Mathematics

This is the second edition of “UltraMath”, after the one held in Pisa in 2008: http://people.dm.unipi.it/ultramath. After two years of postponement, we are strongly committed to holding this 2022 edition with the physical presence of lecturers and participants. We will make every effort to ensure that this is done safely; in the unfortunate case of a new emergency due to the pandemic, UltraMath 2022 will take place anyway as a hybrid or as an online event, depending on the situation.

Email: ultramath2022@cs.dm.unipi.it

Ultrafilters, ultraproducts, combinatorial number theory, Ramsey theory, topology, ergodic theory, set theory

We are pleased to invite you to participate in the Petersburg Positivity 2022. This time it will be held as a satellite to the International Congress of Mathematicians (ICM, July 6-14). Visa-free entry will be supported by ICM. Please, subscribe to future updates on the conference website. The research subject "positivity" is the area in mathematics that is devoted to order structures and their applications. Some of the topics included: ordered algebraic & topological structures, Banach lattices, Banach spaces, function spaces, positive and order bounded operators, operator algebras, non-standard analysis, and Boolean valued models, Boolean algebras and stochastic processes, applications to mathematical finance.

Algebra,    Analysis

The Panhellenic Logic Symposium is a biennial scientific event that was established in 1997. It aims to promote interaction and cross-fertilization among different areas of logic. Originally conceived as a way of bringing together the many logicians of Hellenic descent throughout the world, the PLS has evolved into an international forum for the communication of state-of-the-art advances in logic. The symposium is open to researchers worldwide who work in logic broadly conceived.

The Eighth Federated Logic Conference (FLoC 2022) will host the following ten conferences and affiliated workshops:
LICS (37th Annual ACM/IEEE Symposium on Logic in Computer Science)
FSCD (7th International Conference on Formal Structures for Computation and Deduction)
ITP (13th International Conference on Interactive Theorem Proving)
IJCAR (International Joint Conference on Automated Reasoning)
CSF (35th IEEE Computer Security Foundations Symposium)
CAV (34th International Conference on Computer Aided Verification)
KR (19th International Conference on Principles of Knowledge Representation and Reasoning)
ICLP (38th International Conference on Logic Programming)
SAT (25th International Conference on Theory and Applications of Satisfiability Testing)
CP (25th International Conference on Principles and Practice of Constraint Programming)

FLoC 2022

Information Theory, Foundations of Computer Science,    Automated Theorem Proving

FLoC 2022

The FSCD conference includes all research of the inter-related formal areas of researchers in formal structures for computation and deduction in general, and in particular all subjects that were previously covered by the RTA and TLCA conferences. The name of the new conference comes from an unpublished but important book by Gérard Huet that has been a strong influence on many researchers in our area. We are grateful to Gérard for allowing us to reuse the name. We look very much forward to serve the scientific community with this new conference, which inherits as well as updates and modernizes the scope of the conferences it replaces. The call for papers for the next FSCD, below, give further details on the subjects of the conference.

FLoC 2022

The ITP conference series is concerned with all aspects of interactive theorem proving, ranging from theoretical foundations to implementation aspects and applications in program verification, security, and the formalization of mathematics. ITP 2022 is the thirteenth conference on Interactive Theorem Proving. It will be part of the Federated Logic Conference (FLoC). It will take place in Haifa, Israel, July 31 – August 12, 2022.

Scientific Computing and Data Science,    Automated Theorem Proving

FLoC 2022

IJCAR is the premier international joint conference on all aspects of automated reasoning, including foundations, implementations, and applications, comprising several leading conferences and workshops.

Information Theory, Foundations of Computer Science,    Automated Theorem Proving

FLoC 2022

CAV is the premier international conference on computer-aided verification. It provides a forum for a broad range of advanced research in areas ranging model checking and automated theorem proving to testing, synthesis and related fields. Research reported in CAV includes the application of formal methods to many kinds of systems,including hardware, software and communication protocols. It covers many system models, including finite-state and infinite state systems, hybrid systems and probabilistic systems. It encompasses both theory and industrial case studies. The common thread is the use of automation to help designers build more reliable systems.

Information Theory, Foundations of Computer Science,    Automated Theorem Proving

National University of Ireland Galway

The main focus of ESSLLI is the interface between linguistics, logic and computation, with special emphasis in human linguistic and cognitive ability. Courses, both introductory and advanced, cover a wide variety of topics within the combined areas of interest: Logic and Computation, Computation and Language, and Language and Logic. Workshops are also organized, providing opportunities for in-depth discussion of issues at the forefront of research, as well as a series of invited evening lectures.

Natural Language Processing, Computational Linguistics,    Linguistics

American Institute of Mathematics (AIM)

This workshop, sponsored by AIM and the NSF, will be devoted to effective approaches to geometric measure theory. Algorithmic Randomness and Effective Descriptive Set Theory provide a novel perspective to many concepts that are classically measure-based, such as randomness and Hausdorff dimension. A core feature of this perspective is that it links the geometric properties of a set to the logical and computational complexity of its points. The new techniques have been successfully applied to extend previous results in the area to larger classes of sets (beyond analytic), and also to shed new light on why in other cases such an extension is impossible. Examples include Marstrand's projection theorem and the capacitability of sets of real numbers. The goal of this workshop is to bring together researchers with expertise in computability, set theory, geometric measure theory, and related areas to further develop these new approaches.

American Institute of Mathematics (AIM)

This workshop, sponsored by AIM and the NSF, will be devoted to connecting two parallel approaches towards the study of the complexity of equivalence relations. On the one hand, a popular tool for classifying equivalence relations on standard Borel spaces is Borel reducibility. Invariant descriptive set theory, centered around this notion, is a vibrant field which shows deep connections with topology, group theory, combinatorics, and ergodic theory. On the other hand, a natural effectivization of Borel reducibility, named computable reducibility, appears in computability theory. Computable reducibility has proven to be a key notion for measuring the complexity of equivalence relations on the natural numbers, with fruitful applications in a variety of fields, such as: the metamathematics of arithmetic, the study of word problems for groups, the theory of numberings, and computable model theory. Despite the analogy between Borel and computable reducibility, there has been so far little effort to directly connect techniques, knowledge, and researchers of these separate fields. To counter this lack of communication, the proposed workshop will assemble a diverse group of mathematical logicians - drawn from both experts in invariant descriptive set theory and experts in computability theory working on computable reduction - to discuss on how their tools can align.

The Fields Institute

This workshop will be less focused in nature and will bring together small groups of experts centered around emerging applications of set theory. This will include applications of set-theory in algebraic topology and homological algebra, operator algebras (for instance Koszmider's solution to Anderson's conjecture), Keisler's order in model theory, and the geometry of Banach spaces.