• Axiomatic Set Theory à la Dijkstra and Scholten 

      Acosta, Ernesto; Aldana, Bernarda; Bohórquez, Jaime; Rocha, Camilo (Springer NatureSuiza, 2017)
      The algebraic approach by E.W. Dijkstra and C.S. Scholten to formal logic is a proof calculus, where the notion of proof is a sequence of equivalences proved – mainly – by using substitution of ‘equals for equals’. This ...
    • Axiomatic Set Theory à la Dijkstra and Scholten 

      Acosta, Ernesto; Aldana, Bernarda; Bohórquez, Jaime; Rocha, Camilo (Springer NatureUSA., 2017)
      The algebraic approach by E.W. Dijkstra and C.S. Scholten to formal logic is a proof calculus, where the notion of proof is a sequence of equivalences proved – mainly – by using substitution of ‘equals for equals’. This ...
    • An elementary and unified approach to program correctness 

      Bohórquez, Jaime (Springer, 2009)
      We present through the algorithmic language DHL (Dijkstra-Hehner language), a practical approach to a simple first order theory based on calculational logic, unifying Hoare and Dijkstra’s iterative style of programming ...
    • Intuitionistic Logic according to Dijkstra’s Calculus of Equational Deduction 

      Bohórquez, Jaime (University of Notre Dame, 2008)
      Dijkstra and Scholten have proposed a formalization of classical predicate logic on a novel deductive system as an alternative to Hilbert’s style of proof and Gentzen’s deductive systems. In this context we call it CED ...