1. E. J. Farkas (1988). A Faithful Embedding of Parallel Computations in Star-Finite Models. Studia Logica 47 (3):203 - 212.
    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.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  2. E. J. Farkas & M. E. Szabo (1988). On the Programs-as-Formulas Interpretation of Parallel Programs in Peano Arithmetic. Annals of Pure and Applied Logic 37 (2):111-127.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  3. E. J. Farkas & M. E. Szabo (1984). “On the Plausibility of Nonstandard Proofs in Analysis”. Dialectica 38 (4):297-310.
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation