Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your 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
  • Download ($43.95)
  • Cite this Item
A Faithful Embedding of Parallel Computations in Star-Finite Models
Preview not available

Abstract

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.

Page Thumbnails

  • Thumbnail: Page 
[203]
    [203]
  • Thumbnail: Page 
204
    204
  • Thumbnail: Page 
205
    205
  • Thumbnail: Page 
206
    206
  • Thumbnail: Page 
207
    207
  • Thumbnail: Page 
208
    208
  • Thumbnail: Page 
209
    209
  • Thumbnail: Page 
210
    210
  • Thumbnail: Page 
211
    211
  • Thumbnail: Page 
212
    212