You are not currently logged in.
Access your personal account or get JSTOR access through your library or other institution:
A Faithful Embedding of Parallel Computations in Star-Finite Models
E. J. Farkas
Studia Logica: An International Journal for Symbolic Logic
Vol. 47, No. 3 (1988), pp. 203-212
Published by: Springer
Stable URL: http://www.jstor.org/stable/20015375
Page Count: 10
Preview not available
The purpose of this paper is to show that there exist star-finite tree-structured sets in which the computations of parallel programs can be faithfully embedded, and that the theory of star-finite sets and relations therefore provides a new tool for the analysis of non-deterministic computations.
Studia Logica: An International Journal for Symbolic Logic © 1988 Springer