Studia Logica 47 (3):203 - 212 (1988)
|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.|
|Keywords||No keywords specified (fix it)|
|Through your library||Configure|
Similar books and articles
M. Krynicki & K. Zdanowski (2005). Theories of Arithmetics in Finite Models. Journal of Symbolic Logic 70 (1):1-28.
Klaus Sutner (1990). The Ordertype of Β-R.E. Sets. Journal of Symbolic Logic 55 (2):573-576.
Wojciech Buszkowski & Ewa Palka (2008). Infinitary Action Logic: Complexity, Models and Grammars. Studia Logica 89 (1):1 - 18.
Yaroslav D. Sergeyev (2008). A New Applied Approach for Executing Computations with Infinite and Infinitesimal Quantities. Informatica 19 (4):567-596.
Joachim Lambek (2010). Exploring Feature Agreement in French with Parallel Pregroup Computations. Journal of Logic, Language and Information 19 (1).
T. S. Blyth & J. Fang (2011). On Endomorphisms of Ockham Algebras with Pseudocomplementation. Studia Logica 98 (1-2):237-250.
Yaroslav Sergeyev (2009). Numerical Computations and Mathematical Modelling with Infinite and Infinitesimal Numbers. Journal of Applied Mathematics and Computing 29:177-195.
Till Tantau (2005). Weak Cardinality Theorems. Journal of Symbolic Logic 70 (3):861 - 878.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads1 ( #275,053 of 549,699 )
Recent downloads (6 months)0
How can I increase my downloads?