Search results
Results: 371
Number of items: 371
-
Bergstra, J. A., & Middelburg, C. A. (2016). A Hoare-Like Logic of Asserted Single-Pass Instruction Sequences. Scientific Annals of Computer Science, 26(2), 125-156. https://doi.org/10.7561/SACS.2016.2.125 -
Bergstra, J. A., & Middelburg, C. A. (2016). On instruction sets for Boolean registers in program algebra. Scientific Annals of Computer Science, 26(1), 1-26. https://doi.org/10.7561/SACS.2016.1.1
-
Bergstra, J. A. (2016). Conditional Values in Signed Meadow Based Axiomatic Probability Calculus. (3 ed.) Informatics Institute, University of Amsterdam. https://arxiv.org/abs/1609.02812v3
-
Bergstra, J. A., & Middelburg, C. A. (2015). On algorithmic equivalence of instruction sequences for computing bit string functions. Fundamenta Informaticae, 138(4), 411-434. https://doi.org/10.3233/FI-2015-1219
-
Bergstra, J. A., & Bethke, I. (2015). Note on paraconsistency and reasoning about fractions. Journal of Applied Non-Classical Logics, 25(2), 120-124. https://doi.org/10.1080/11663081.2015.1047232
-
Bergstra, J. A., & Middelburg, C. A. (2015). On instruction sets for Boolean registers in program algebra. ArXiv. https://arxiv.org/abs/1502.00238v1
-
Bergstra, J. A. (2015). Architectural Adequacy and Evolutionary Adequacy as Characteristics of a Candidate Informational Money. (1 ed.) Informatics Institute, University of Amsterdam. http://arxiv.org/abs/1504.07184
-
Bergstra, J. A., & Ponse, A. (2015). Evaluation trees for proposition algebra. Section Theory of Computer Science, University of Amsterdam. http://arxiv.org/abs/1504.08321
-
Bergstra, J. A., & Middelburg, C. A. (2015). Probabilistic thread algebra. Scientific Annals of Computer Science, 25(2), 211-243. https://doi.org/10.7561/SACS.2015.2.211
-
Bergstra, J. A., Bethke, I., & Ponse, A. (2015). Equations for formally real meadows. Journal of Applied Logic, 13(2, pt. B), 1-23. https://doi.org/10.1016/j.jal.2015.01.004
Page 6 of 38