You must enable JavaScript to use this site
  • NatFoM 2025: Workshop on Natural Formal Mathematics

    18th Conference on Intelligent Computer Mathematics
    — CICM 2025 —
    October 6-10, 2025 (precise date: tentatively October 6)
    Brasilia, Brazil

    ROOM: Auditorium CIC/EST

    Program

    Time Presenter Title Slides
    14:00 – 14:30 Peter Koepke Formalizing and Autoformalizing Euclid's Lemma in Naproche Link
    14:30 – 15:00 Patrick Schäfer Formalization of an Ideology Link
    15:00 – 15:30 Marcel Schütz Managing Naproche Formalizations with STEX and FLAMS Link
    15:30 – 16:00 Atle Hahn Autoformalization with Naproche-ZF Link

    Abstracts

    Formalizing and Autoformalizing Euclid's Lemma in Naproche

    Peter Koepke

    Euclid's lemma is a simple, yet fundamental result and tool in elementary number theory. In the English Wikipedia it is stated as: If a prime p divides the product a b of two integers a and b , then p must divide at least one of those integers a or b .

    For our formalization of perfectoid rings in the natural language proof checker Naproche we needed a proof of the lemma which only employs non-negative integers. In the Wikipedia article we found such a proof, which we translated by hand, staying close to the original language and proof structure.

    In our talk we will present the proof and use it to demonstrate some Naproche principles. We shall then report how ChatGPT was able to produce a similar proof automatically from the Wikipedia text after being tought sufficiently many Naproche principles in an interactive "conversation".

    Formalization of an Ideology

    Patrick Schäfer

    This work presents a formalization of the ideology Social Darwinism using Naproche, a controlled natural language proof-checking system. The ideology is translated into a precise mathematical model, with assumptions made explicit and conclusions derived unambiguously. The study demonstrates how formalization, a practice common in economic theory and mathematics, can enhance transparency, verifiability, and reproducibility in the analysis of conceptual systems.

    Naproche combines natural mathematical language with automated reason-ing. Definitions, theorems, and proofs are interpreted in first-order logic and checked by automated provers. This preserves the readability of conventional mathematical exposition while enabling formal verification, without requiring extensive prior experience with proof assistants. As a result, it opens formalization to a wider audience beyond mathematicians, including economists and related researchers.

    The rationale for formalizing ideologies is that coherent worldviews can, in principle, be expressed in formal terms. Once formalized, they can be analyzed systematically, with assumptions exposed to structured critique and conclusions verified independently of rhetoric or intuition. In this work, such a critique of Social Darwinism is carried out, showing how formalization not only clarifies the logical structure of an ideology but also provides a rigorous framework for its critical evaluation.

    Future research may extend this framework to additional ideologies, enabling systematic comparison and advancing a formalized approach to complex sociopolitical thought. The results indicate that formal methods are not confined to mathematics but can be applied more broadly, yielding objective, verifiable models and facilitating critical engagement.

    Managing Naproche Formalizations with STEX and FLAMS

    Marcel Schütz

    Naproche is a proof assistant that accepts formalizations written in LATEX. This allows the source files of those formalizations on the one hand to be passed to Naproche to be checked for logical correctness (the "logical level") and on the other hand to be passed to a TEX engine to be rendered as, e.g., PDF or HTML (the "presentational level"). However, this poses the challenge that several language a Naproche formalization can make use of must be specified both on the logical and the presentational level. Examples of such language features are:

    • referencing formal statements across formalizations;
    • reusing symbolic notations across formalizations;
    • including formalizations into each other.
    Whereas the features listed above are already supported on the logical level of Naproche, they are currently all lacking proper support on the presentational level.

    In this talk, we will present how STEX [2] (a LATEX package to create semantically annotated documents) can be integrated into the Naproche ecosystem to provide presentational support for all three language features from the above list.

    Moreover, we will demonstrate how FLAMS [1] (a framework for managing semantically annotated documents) can be integrated in the Naproche workflow to manage and facilitate the build process of both PDF and HTML presentations of formalizations – which is also currently lacking proper support in the Naproche ecosystem.

    Scope

    In (pure) mathematics there has always been a strong informal sense of “naturality” of topics and methods. Generally, “natural” theories, notions, properties, or proofs are preferred over technical, convoluted, or counterintuitive approaches. If formal mathematics is to become part of mainstream mathematics, its formalizations and usage have to become more “natural”, and thus closer to informal mathematics.

    This workshop broadly addresses the issue of naturality in formal mathematics. It will take place in the context of the CICM conference, tentatively on Monday, Oct. 6, 2025 (to be confirmed). We plan to hold open discussions on naturalness in formal mathematics.

    Topics of interest include (but are not limited to):

    • The notion of naturality in mathematics generally
    • Natural mathematical language
    • Translations between informal and formal mathematics using statistical or symbolic techniques
    • Natural input and output languages for formal mathematics systems
    • Controlled natural languages (CNL) for mathematics
    • Making formal mathematics documents readable
    • Naturality of foundational theories (type theory, set theory, HOL, etc.)
    • Naturality of proof methods
    • Natural proof structures and granularities
    • Natural structurings of formalized mathematical texts and libraries
    • Mathematical typesetting (LaTeX) and formal mathematics
    • Natural formalizations

    Previous instances of the workshop: 2020 | 2021 | 2023

    Call for abstracts

    We invite you to submit extended abstracts or demonstration proposals (up to 500 words).

    At least one author of each accepted extended abstract or demonstration proposal is expected to present their submission (preferably in person) at the workshop. Accepted abstracts will be made available online. Accepted abstracts can optionally be extended to a full paper (5–15 pages) after the workshop. We are considering publication on CEUR-WS, so please use their LaTeX format.

    Please send your abstract/demonstration proposal as a PDF via email to both Frederik (jan.frederik.schaefer@fau.de) and Marcel (marcel.schuetz@fau.de).

    Rolling submission until September 7 September 24 (earlier submissions will receive earlier notifications).

    Program Committee:

    • Adrian De Lon, Bonn, Germany (co-chair)
    • Peter Koepke, Bonn, Germany (co-chair)
    • Marcel Schütz, Erlangen, Germany (co-chair)
    • Jan Frederik Schaefer, Erlangen, Germany (co-chair)
    • TBD

  • News

    • Proceedings available!
    • New venue link!
    • Doctoral Programme deadline extension!
    • Registration is now open!
    • Links for online booking
    • Workshops and Tutorials
    • Further and final deadline extensions: May 12 and May 19
    • Call for Workshops
    • 1st Call for Papers/Workshops out
    • Important dates online
    • Invited Speakers announced
    • Easychair in place
    • Initial website online

    Sponsors















Privacy policy and legal information
Last modified: November 10 2025 15:32:27 CET