Postdoctoral / Junior Scientist position in Computational Proof Theory

A postdoc position is available within the Computational Mathematics group under the project: “Proof analysis and Automated Deduction for recursive Structures” funded by the Czech Science Foundation. For more details please see the project website PANDAFOREST.

[ Ostatní příležitosti ]

Quick Info


  • Contract for up to 36 months is available.
  • Starting date: July 1st or later.
  • Applications will be reviewed on a rolling basis with the first cut-off point being July 1st 2022.
  • Full time position, part-time is negotiable.
  • Monthly gross salary: 40000 CZK. Cost Of Living Comparison
  • Bonuses depending on performance. Travel funding for both conference and research visits.
  • No teaching duties.
  • Applicants should:
    1. Hold a PhD in mathematics, computer science, or related subject.
    2. Has published in mathematical logic, computational logic, or automated/interactive theorem proving.
    3. Programming skills or the willingness to develop them.
    4. Fluent in English.
  • The applications are to be sent to and should contain:
    1. Curriculum Vitae.
    2. A publication of the applicant together with a description of their contribution and how it relates to the position (at most 1500 characters not counting spaces).
    3. Proof of degree (Or proof of fixed defense date).
    4. Two letters of recommendation, sent directly to
    5. Letter outlining the applicants research interest and how their interest fit the goals of the project (at most 3000 characters not counting spaces).

Do not hesitate to contact the principal investigator for informal inquiries concerning the position: David M. Cerna, Ph.D.,,