Jan Aldert Bergstra
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Jan Aldert Bergstra has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Cornelis A. Middelburg
Informatics Institute Faculty of Science University of Amsterdam Science Park 900 1098 XH Amsterdam the Netherlands
70 shared publications - John Vivian Tucker
Swansea University
15 shared publications - Alban Ponse
University of Amsterdam
9 shared publications - Inge Bethke
Informatics Institute University of Amsterdam
3 shared publications - Marcus Düwell
Institute for Philosophy, Technical University of Darmstadt, Germany
3 shared publications - Karl de Leeuw
Informatics Institute University of Amsterdam
2 shared publications
Latest Publications
- Open Access
- 8 October 2026
- Published by Qeios Ltd
Review of: "Type Declarations and Typed Substitution in School Algebra"
The paper is well-motivated and fairly easy to read. The issues and unclarities which the author mentions and is concerned about abound in educational texts on elementary arithmetic. Nevertheless, it is not easy to understand what precisely is the no...
- 8 October 2026
- Published by Qeios Ltd
Open AccessReview of: "Type Declarations and Typed Substitution in School Algebra"
The paper is well-motivated and fairly easy to read. The issues and unclarities which the author mentions and is concerned about abound in educational texts on elementary arithmetic. Nevertheless, it is not easy to understand what precisely is the no...
- 12 August 2026
- Published by Elsevier in Science of Computer Programming
- Vol. 255
Extending the data type of common meadows: The case of specifying entropy
- 12 August 2026
- Published by Elsevier in Science of Computer Programming
- Vol. 255
Extending the data type of common meadows: The case of specifying entropy
- Open Access
- 12 January 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (2) , 280
Evaluation Trees and Normalisation for Proposition Algebra
Proposition algebra is based on Hoare’s conditional, a ternary connective comparable to if–then–else and used in the context of propositional logic. Conditional statements are composed from atomic propositions (propositional variables), constants for the Boolean truth values, and the conditional. In previous work, various equational axiomatisations have been defined, each of which leads to a so-called valuation congruence. The weakest of these is “free valuation congruence” and the strongest is “static valuation congruence”, which is equivalent to propositional logic. Free valuation congruence is axiomatised by four simple equational axioms, and we use evaluation trees to give a simple semantics: two conditional statements are free valuation congruent if, and only if, they have equal evaluation trees. Increasingly stronger valuation congruences arise by adding axioms to the four that define free valuation congruence: repetition-proof, contractive, memorising, and static valuation congruence. We prove that each such valuation congruence C can be characterised using a transformation on evaluation trees: two conditional statements are C-valuation congruent if, and only if, their C-transformed evaluation trees are equal. In order to prove that these transformations preserve the congruence property, we use normalisation functions: two conditional statements are C-valuation congruent if, and only if, the C-normalisation function returns equal images. Our framework provides the first comprehensive tree-based semantics that unifies all major valuation congruences in proposition algebra, offering both conceptual clarity and practical decision procedures.
- 12 January 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (2) , 280
Open AccessEvaluation Trees and Normalisation for Proposition Algebra
Proposition algebra is based on Hoare’s conditional, a ternary connective comparable to if–then–else and used in the context of propositional logic. Conditional statements are composed from atomic propositions (propositional variables), constants for the Boolean truth values, and the conditional. In previous work, various equational axiomatisations have been defined, each of which leads to a so-called valuation congruence. The weakest of these is “free valuation congruence” and the strongest is “static valuation congruence”, which is equivalent to propositional logic. Free valuation congruence is axiomatised by four simple equational axioms, and we use evaluation trees to give a simple semantics: two conditional statements are free valuation congruent if, and only if, they have equal evaluation trees. Increasingly stronger valuation congruences arise by adding axioms to the four that define free valuation congruence: repetition-proof, contractive, memorising, and static valuation congruence. We prove that each such valuation congruence C can be characterised using a transformation on evaluation trees: two conditional statements are C-valuation congruent if, and only if, their C-transformed evaluation trees are equal. In order to prove that these transformations preserve the congruence property, we use normalisation functions: two conditional statements are C-valuation congruent if, and only if, the C-normalisation function returns equal images. Our framework provides the first comprehensive tree-based semantics that unifies all major valuation congruences in proposition algebra, offering both conceptual clarity and practical decision procedures.
- Open Access
- 30 September 2025
- Published by Transmathematica in Transmathematica
Categorial Gender Theory:
Categorial gender theory is concerned with frameworks for categorizing human individuals in terms of gender and gender-related notions. A survey of gender frameworks is presented. We observe two alternative ways of conveying similar information: one via features and the other via process algebraic descriptions of gender lifecycles. The development of categorial gender theory is compared with the Formal Gender Theory that was previously developed in collaboration with Laurens Buijs.
- 30 September 2025
- Published by Transmathematica in Transmathematica
Open AccessCategorial Gender Theory:
Categorial gender theory is concerned with frameworks for categorizing human individuals in terms of gender and gender-related notions. A survey of gender frameworks is presented. We observe two alternative ways of conveying similar information: one via features and the other via process algebraic descriptions of gender lifecycles. The development of categorial gender theory is compared with the Formal Gender Theory that was previously developed in collaboration with Laurens Buijs.
- Open Access
- 20 June 2025
- Published by Springer Nature in Journal of Logic, Language and Information
- Vol. 34 (3-4) , 371-393
Logical models of mathematical texts II: Legality conventions for division by zero in inconsistent contexts
To avoid the risk of problems to do with division by zero (DbZ), arithmetical texts involving division use what may be called traditional conventions on DbZ. Earlier, we developed a method for exploring these conventions using informal notions of legal and illegal texts, which are used to analyse simple fragments of arithmetical texts. We showed how these texts can be transformed into logical formulae over special total algebras, called common meadows, that are able to approximate partiality but in a total world. The subtleties of the legal/illegal distinction call for further development of these mathematical methods. Here we examine a more complex type of text, namely proof by contradiction, in which inconsistent assumptions can coexist with DbZ. We formulate more advanced criteria of legality for this case. We introduce a three-valued logic to capture the resulting semiformal conventions that is based on a notion we call frugal equality for partial operators. We apply the method to a proof of the Bayes-Price Theorem in probability theory, whose proof has DbZ issues.
- 20 June 2025
- Published by Springer Nature in Journal of Logic, Language and Information
- Vol. 34 (3-4) , 371-393
Open AccessLogical models of mathematical texts II: Legality conventions for division by zero in inconsistent contexts
To avoid the risk of problems to do with division by zero (DbZ), arithmetical texts involving division use what may be called traditional conventions on DbZ. Earlier, we developed a method for exploring these conventions using informal notions of legal and illegal texts, which are used to analyse simple fragments of arithmetical texts. We showed how these texts can be transformed into logical formulae over special total algebras, called common meadows, that are able to approximate partiality but in a total world. The subtleties of the legal/illegal distinction call for further development of these mathematical methods. Here we examine a more complex type of text, namely proof by contradiction, in which inconsistent assumptions can coexist with DbZ. We formulate more advanced criteria of legality for this case. We introduce a three-valued logic to capture the resulting semiformal conventions that is based on a notion we call frugal equality for partial operators. We apply the method to a proof of the Bayes-Price Theorem in probability theory, whose proof has DbZ issues.
- 16 May 2025
- Published by Springer Nature
- p. 3-22
Finite Approximations of the Common Meadow of Rational Numbers
- 16 May 2025
- Published by Springer Nature
- p. 3-22
Finite Approximations of the Common Meadow of Rational Numbers
- Open Access
- 15 April 2025
- Published by Transmathematica in Transmathematica
Genocide Accusations and the Logic of Genocide
Following earlier work we proceed with a detailed investigation of genocide accusations which we consider to constitute a particular class of extreme accusations. We focus on controversial real-time accusations of episodal genocide. We find that the logic of genocide and the logic of genocide accusations interact in complicated ways, and that there is a plausible use for a new term: tribocide. Tribocide entails the visible and often detrimental effect of genocide on the victims, while abstracting from the perpetrator's plans, motives, and intentions, as well as from side-effects which may be advantageous from the perpetrator's perspective. Importantly, validating a tribocide accusation is simpler than validating a genocide accusation because the focus is exclusively on the victim's perspectives.
- 15 April 2025
- Published by Transmathematica in Transmathematica
Open AccessGenocide Accusations and the Logic of Genocide
Following earlier work we proceed with a detailed investigation of genocide accusations which we consider to constitute a particular class of extreme accusations. We focus on controversial real-time accusations of episodal genocide. We find that the logic of genocide and the logic of genocide accusations interact in complicated ways, and that there is a plausible use for a new term: tribocide. Tribocide entails the visible and often detrimental effect of genocide on the victims, while abstracting from the perpetrator's plans, motives, and intentions, as well as from side-effects which may be advantageous from the perpetrator's perspective. Importantly, validating a tribocide accusation is simpler than validating a genocide accusation because the focus is exclusively on the victim's perspectives.
- Open Access
Expressing entropy and cross-entropy in expansions of common meadows
A common meadow is an enrichment of a field with a partial division operation that is made total by assuming that division by zero takes the a default value, a special element $\bot$ adjoined to the field. To a common meadow of real numbers we add a binary logarithm $\log_2(-)$, which we also assume to be total with $\log_2(p) = \bot$ for $p \leq 0$. With these and other auxiliary operations, such as a sign function, we form algebras over which entropy and cross entropy can be defined for probability mass functions on a finite sample space by algebraic formulae that are simple terms built from the operations of the algebras and without case distinctions or conventions to avoid partiality. The discuss the advantages of algebras based on common meadows, whose theory is established, and alternate methods to define entropy and other information measures completely for all arguments using single terms.Open AccessExpressing entropy and cross-entropy in expansions of common meadows
A common meadow is an enrichment of a field with a partial division operation that is made total by assuming that division by zero takes the a default value, a special element $\bot$ adjoined to the field. To a common meadow of real numbers we add a binary logarithm $\log_2(-)$, which we also assume to be total with $\log_2(p) = \bot$ for $p \leq 0$. With these and other auxiliary operations, such as a sign function, we form algebras over which entropy and cross entropy can be defined for probability mass functions on a finite sample space by algebraic formulae that are simple terms built from the operations of the algebras and without case distinctions or conventions to avoid partiality. The discuss the advantages of algebras based on common meadows, whose theory is established, and alternate methods to define entropy and other information measures completely for all arguments using single terms. - Open Access
- 8 January 2025
- Published by Transmathematica in Transmathematica
Extreme Accusations II
Following up earlier work on accusations, we proceed with a detailed investigation of a particular class of extreme accusations called genocide accusations. We focus on real time accusations of episodal genocide, meant to bring the target behaviour of the accusee to an end, or to contribute to its termination. We derive conditions under which issuing such accusations may be justified.
- 8 January 2025
- Published by Transmathematica in Transmathematica
Open AccessExtreme Accusations II
Following up earlier work on accusations, we proceed with a detailed investigation of a particular class of extreme accusations called genocide accusations. We focus on real time accusations of episodal genocide, meant to bring the target behaviour of the accusee to an end, or to contribute to its termination. We derive conditions under which issuing such accusations may be justified.