Search results

    Filter results

  • Full text

  • Document type

  • Publication year

  • Organisation

Results: 371
Number of items: 371
  • Open Access
    Bergstra, J. A., & Ponse, A. (2016). Probability functions in the context of signed involutive meadows. Informatics Institute, University of Amsterdam. https://arxiv.org/abs/1307.5173v3
  • Open Access
    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
  • Open Access
    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
  • Open Access
    Bergstra, J. A., & Ponse, A. (2015). Poly-infix operators and operator families. Section Theory of Computer Science, University of Amsterdam. http://arxiv.org/abs/1505.01087
  • Open Access
    Bergstra, J. A., & Middelburg, C. A. (2015). On instruction sets for Boolean registers in program algebra. ArXiv. https://arxiv.org/abs/1502.00238v1
  • Open Access
    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
  • Open Access
    Bergstra, J. A., & Ponse, A. (2015). Division by zero in common meadows. In R. De Nicola, & R. Hennicker (Eds.), Software, Services, and Systems: essays dedicated to Martin Wirsing on the occasion of his retirement from the Chair of Programming and Software Engineering (pp. 46-61). (Lecture Notes in Computer Science; No. 8950). Springer. https://doi.org/10.1007/978-3-319-15545-6_6
  • Open Access
    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
Page 6 of 38