Jonas Bayer

Orcid: 0009-0006-2500-3146

According to our database1, Jonas Bayer authored at least 16 papers between 2019 and 2026.

Collaborative distances:
  • Dijkstra number2 of two.
  • Erdős number3 of three.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Teaching LLMs Program Semantics via Symbolic Execution Traces.
CoRR, May, 2026

2025

Diophantine Equations over ℤ: Universal Bounds and Parallel Formalization.
CoRR, June, 2025

CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics.
CoRR, May, 2025

Kimina-Prover Preview: Towards Large Formal Reasoning Models with Reinforcement Learning.
CoRR, April, 2025

Universal Pairs for Diophantine Equations.
Arch. Formal Proofs, 2025

A Formal Proof of Complexity Bounds on Diophantine Equations.
Proceedings of the 16th International Conference on Interactive Theorem Proving, 2025

Studying Mathematical Reasoning through the Gadget Game.
Proceedings of the 47th Annual Meeting of the Cognitive Science Society, 2025

2024
Data for Mathematical Copilots: Better Ways of Presenting Proofs for Machine Learning.
CoRR, 2024

2023
Category Theory in Isabelle/HOL as a Basis for Meta-logical Investigation.
CoRR, 2023

Category Theory in Isabelle/HOL as a Basis for Meta-logical Investigation.
Proceedings of the Intelligent Computer Mathematics - 16th International Conference, 2023

2022
Mathematical Proof Between Generations.
CoRR, 2022

Diophantine Equations and the DPRM Theorem.
Arch. Formal Proofs, 2022

Digit Expansions.
Arch. Formal Proofs, 2022

2019
Beginners' Quest to Formalize Mathematics: A Feasibility Study in Isabelle.
Proceedings of the Intelligent Computer Mathematics - 12th International Conference, 2019

The DPRM Theorem in Isabelle (Short Paper).
Proceedings of the 10th International Conference on Interactive Theorem Proving, 2019


  Loading...