RECORD
On the Definition of Non-deterministic Mechanisms
Logic in Computer Science · Submitted 23 Jun 2009
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim We then show that all the three mathematical concepts are equivalent to one another.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
We present here three different approaches to the problem of modeling mathematically the concept of a non-deterministic mechanism. Each of these three approaches leads to a mathematical definition. We then show that all the three mathematical concepts are equivalent to one another. This insight gives us the option of approaching the wp-formalism of Dijkstra from a different viewpoint that is easier to understand and to teach.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | We present here three different approaches to the problem of modeling mathematically the concept of a non-deterministic mechanism. | contribution 1.00 | 0.90 | 0.04 | asserted 0.99 |
| s1 | Each of these three approaches leads to a mathematical definition. | contribution 0.67 | 0.86 | 0.08 | asserted 1.00 |
| s2 | We then show that all the three mathematical concepts are equivalent to one another. | result 0.98 | 0.94 | 0.67 | asserted 1.00 |
| s3 | This insight gives us the option of approaching the wp-formalism of Dijkstra from a different viewpoint that is easier to understand and to teach. | interpretation 0.99 | 0.63 | 0.21 | asserted 0.61 |
What was examined, and what was not
- arXiv listing abstract v1
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
We present here three different approaches to the problem of modeling mathematically the concept of a non-deterministic mechanism. Each of these three approaches leads to a mathematical definition. We then show that all the three mathematical concepts are equivalent to one another. This insight gives us the option of approaching the wp-formalism of Dijkstra from a different viewpoint that is easier to understand and to teach.
Human review
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.