3 papers
cs.LO2026
On an ordinary expansion of first-order Belnap-Dunn logic
C. A. Middelburg
This paper concerns an expansion of first-order Belnap-Dunn logic whose connectives and quantifiers all have a counterpart in classical logic. The language and logical consequence…
cs.CC2025
On the formalization of the notion of a concurrent algorithm
C. A. Middelburg
Previous papers give accounts of quests for satisfactory formalizations of the classical informal notion of an algorithm and the contemporary informal notion of an interactive algo…
cs.LO2025
A classical-logic view on a paraconsistent logic
C. A. Middelburg
This paper is concerned with the paraconsistent first-order logic LPQ, Priest's LPQ enriched with an implication connective and a falsity constant. A sequent…