Studia Logica 47 (3):203 - 212 (1988)
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.
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
References found in this work BETA
On the Programs-as-Formulas Interpretation of Parallel Programs in Peano Arithmetic.E. J. Farkas & M. E. Szabo - 1988 - Annals of Pure and Applied Logic 37 (2):111-127.
Citations of this work BETA
No citations found.
Similar books and articles
Theories of Arithmetics in Finite Models.M. Krynicki & K. Zdanowski - 2005 - Journal of Symbolic Logic 70 (1):1-28.
A New Applied Approach for Executing Computations with Infinite and Infinitesimal Quantities.Yaroslav D. Sergeyev - 2008 - Informatica 19 (4):567-596.
Exploring Feature Agreement in French with Parallel Pregroup Computations.Joachim Lambek - 2010 - Journal of Logic, Language and Information 19 (1):75-88.
On Endomorphisms of Ockham Algebras with Pseudocomplementation.T. S. Blyth & J. Fang - 2011 - Studia Logica 98 (1-2):237-250.
Numerical Computations and Mathematical Modelling with Infinite and Infinitesimal Numbers.Yaroslav Sergeyev - 2009 - Journal of Applied Mathematics and Computing 29:177-195.
Added to index2009-01-28
Total downloads3 ( #700,506 of 2,171,877 )
Recent downloads (6 months)1 ( #326,614 of 2,171,877 )
How can I increase my downloads?