activity
20152026
most citedExtracting verified decision procedures: DPLL and Resolution

33 citations · 59 across the 12 of their papers we have counts for

collaborators

15 papers

cs.LO2026

Generalized Decidability via Brouwer Trees

Tom de Jong, Nicolai Kraus, Aref Mohammadzadeh +1

In the setting of constructive mathematics, we suggest and study a framework for decidability of properties, which allows for finer distinctions than just "decidable, semidecidable…

cs.LO2025

Constructive Ordinal Exponentiation

Tom de Jong, Nicolai Kraus, Fredrik Nordvall Forsberg +1

Cantor's ordinal numbers, a powerful extension of the natural numbers, are a cornerstone of set theory. They can be used to reason about the termination of processes, prove the con…

cs.SE2023

Responsible Composition and Optimization of Integration Processes under Correctness Preserving Guarantees

Daniel Ritter, Fredrik Nordvall Forsberg, Stefanie Rinderle-Ma

Enterprise Application Integration deals with the problem of connecting heterogeneous applications, and is the centerpiece of current on-premise, cloud and device integration scena…

cs.LO2023★ 4 cited

Set-Theoretic and Type-Theoretic Ordinals Coincide

Tom de Jong, Nicolai Kraus, Fredrik Nordvall Forsberg +1

In constructive set theory, an ordinal is a hereditarily transitive set. In homotopy type theory (HoTT), an ordinal is a type with a transitive, wellfounded, and extensional binary…

cs.LO2022★ 5 cited

Type-Theoretic Approaches to Ordinals

Nicolai Kraus, Fredrik Nordvall Forsberg, Chuangjie Xu

In a constructive setting, no concrete formulation of ordinal numbers can simultaneously have all the properties one might be interested in; for example, being able to calculate li…

cs.GT2021★ 7 cited

Translating Extensive Form Games to Open Games with Agency

Matteo Capucci, Neil Ghani, Jérémy Ledent +1

We show open games cover extensive form games with both perfect and imperfect information. Doing so forces us to address two current weaknesses in open games: the lack of a notion…