Search results
Results: 21
Number of items: 21
-
Rodenburg, P. (2022). Combinatorische volledigheid in partiële groepoïden. Instituut voor Informatica, Universiteit van Amsterdam. https://staff.fnwi.uva.nl/p.h.rodenburg/Varia/pca.pdf -
Bethke, I., Rodenburg, P., & Sevenster, A. (2015). The structure of finite meadows. Journal of Logical and Algebraic Methods in Programming, 84(2), 276-282. https://doi.org/10.1016/j.jlamp.2014.08.004
-
Bethke, I., Ponse, A., & Rodenburg, P. H. (2011). Preface: This issue is dedicated to Jan Bergstra on the occasion of his sixtieth birthday. Theoretical Computer Science, 412(28), 3033-3034. https://doi.org/10.1016/j.tcs.2011.04.016
-
Rodenburg, P. H., Klop, J. W., Koymans, K., & Vrancken, J. (2011). The free process algebra generated by δ, ε and τ. Theoretical Computer Science, 412(28), 3370-3377. https://doi.org/10.1016/j.tcs.2011.03.019
-
Bethke, I., & Rodenburg, P. (2011). Typability in partial applicative structures. Journal of Logic, Language and Information, 20(2), 161-168. https://doi.org/10.1007/s10849-010-9124-7
-
Bethke, I., & Rodenburg, P. (2010). The initial meadows. Journal of Symbolic Logic, 75(3), 888-895. https://doi.org/10.2178/jsl/1278682205
-
Rodenburg, P. H., & Bethke, I. (2009). Typability in partial groupoids. ArXiv. http://arxiv.org/abs/0901.0188
-
Bethke, I., Rodenburg, P., & Sevenster, A. (2009). The structure of finite meadows. ArXiv. http://arxiv.org/abs/0903.1196
-
-
Page 1 of 3