JUCS
2010
12 years 11 months ago
2010
: Veldman proved that the contrapositive of countable binary choice is a theorem of full-fledged intuitionism, to which end he used a principle of continuous choice and the fan the...
ENTCS
2006
13 years 4 months ago
2006
Computability theory, which investigates computable functions and computable sets, lies at the foundation of computer science. Its classical presentations usually involve a fair a...
FM
2001
Springer
13 years 9 months ago
2001
Springer
The Irish School of Constructive Mathematics (M♣ c ), which extends the VDM, exploits an algebraic notation based upon monoids and their morphisms for the purposes of abstract mo...
CIE
2007
Springer
13 years 10 months ago
2007
Springer
Realizability theory is not just a fundamental tool in logic and computability. It also has direct application to the design and implementation of programs, since it can produce co...