Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Jaap van der Woude"'
Publikováno v:
Journal of Logical and Algebraic Methods in Programming. 124:100730
Central to algorithmic graph theory are the concepts of acyclicity and strongly connected components of a graph, and the related search algorithms. This article is about combining mathematical precision and concision in the presentation of these conc
Publikováno v:
Theoretical Computer Science, 179(1-2), 103-135. Elsevier
Several concise formulations of mathematical induction are presented and proved equivalent. The formulations are expressed in variable-free relation algebra and thus are in terms of relations only, without mentioning the related objects. It is shown
Publikováno v:
Mathematical Structures in Computer Science, 3(4), 417-433. Cambridge University Press
This paper tackles the problem of constructing a compact, point-free proof of the associativity of demonic composition of binary relations and its distributivity through demonic choice. In order to achieve this goal, a definition of demonic compositi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3bddc276410687fa0a936b322f1a87ed
https://research.tue.nl/nl/publications/08e05c09-d5ee-4313-9ba5-e7f59caa77ca
https://research.tue.nl/nl/publications/08e05c09-d5ee-4313-9ba5-e7f59caa77ca
Publikováno v:
Ergodic Theory and Dynamical Systems. 4:323-351
We discuss weak disjointness of homomorphisms of minimal transformation groups and use the techniques involved to deepen our knowledge of the equicontinuous structure relation.
Autor:
Joseph Auslander, Jaap van der Woude
Publikováno v:
Ergodic Theory and Dynamical Systems. 1:389-412
We study minimal flows and their extensions by means of the associated maximally highly proximal flows. These, in turn, can be represented by highly proximal generators, which are certain subsets of the universal minimal flow. From this point of view