Buscar
Mostrando ítems 1-5 de 5
Axiomatic Set Theory à la Dijkstra and Scholten
(Springer Nature, 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 ...
Intuitionistic Logic according to Dijkstra’s Calculus of Equational Deduction
(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 ...
Axiomatic Set Theory à la Dijkstra and Scholten
(Springer Nature, 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
(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 ...
An Inductive Theorem on the Correctness of General Recursive Programs
(Oxford University Press, 2007)
We prove a relatively simple inductive theorem (analogous to Floyd and Dijkstra's Invariance Theorem for iterative programs) to verify the correctness of an ample class of non-deterministic general recursive programs. This ...