10 found
Sort by:
Disambiguations:
Egon Börger [8]E. Börger [2]
  1. Egon Börger (2005). Abstract State Machines: A Unifying View of Models of Computation and of System Design Frameworks. Annals of Pure and Applied Logic 133 (1-3):149-171.
    We capture the principal models of computation and specification in the literature by a uniform set of transparent mathematical descriptions which—starting from scratch—provide the conceptual basis for a comparative study.1.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  2. Egon Borger (1994). Review: Edsger W. Dijkstra, Carel S. Scholten, Predicate Calculus and Program Semantics. [REVIEW] Journal of Symbolic Logic 59 (2):673-678.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  3. Egon Börger (1994). Dijkstra Edsger W. And Scholten Carel S.. Predicate Calculus and Program Semantics. Texts and Monographs in Computer Science. Springer-Verlag, New York, Berlin, Heidelberg, Etc., 1990, Xi+ 220 Pp. [REVIEW] Journal of Symbolic Logic 59 (2):673-678.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  4. E. Börger (1989). Computability, Complexity, Logic. New York, N.Y., U.S.A.Elsevier Science Pub. Co..
    The theme of this book is formed by a pair of concepts: the concept of formal language as carrier of the precise expression of meaning, facts and problems, and the concept of algorithm or calculus, i.e. a formally operating procedure for the solution of precisely described questions and problems. The book is a unified introduction to the modern theory of these concepts, to the way in which they developed first in mathematical logic and computability theory and later in automata theory, (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  5. K. Kunen, A. Nerode, A. Prestel, P. Aczel, Hp Barendregt, E. Borger, Jn Crossley, E. Engeler, P. Hajek & Ba Kushner (1984). Managing Editors D. Van Dalen Y. Gurevich J. Hartmanis. Annals of Pure and Applied Logic 26:101.
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  6. Stål O. Aanderaa, Egon Börger & Harry R. Lewis (1982). Conservative Reduction Classes of Krom Formulas. Journal of Symbolic Logic 47 (1):110-130.
    A Krom formula of pure quantification theory is a formula in conjunctive normal form such that each conjunct is a disjunction of at most two atomic formulas or negations of atomic formulas. Every class of Krom formulas that is determined by the form of their quantifier prefixes and which is known to have an unsolvable decision problem for satisfiability is here shown to be a conservative reduction class. Therefore both the general satisfiability problem, and the problem of satisfiability in finite (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  7. Egon Börger & Hans Kleine Büning (1980). The R. E. Complexity of Decision Problems for Commutative Semi-Thue Systems With Recursive Rule Set. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 26 (28-30):459-469.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  8. Egon Börger (1979). A New General Approach to the Theory of the Many‐One Equivalence of Decision Problems for Algorithmic Systems. Mathematical Logic Quarterly 25 (7‐12):135-162.
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  9. Egon Borger (1975). Review: Maria Luisa Dalla Chiara Scabia, Modelli Sintattici e Semantici delle Teorie Elementari. [REVIEW] Journal of Symbolic Logic 40 (2):236-237.
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  10. Egon Börger (1973). Eine Entscheidbare Klasse Von Kromformeln. Mathematical Logic Quarterly 19 (8‐10):117-120.
    No categories
    Translate to English
    | Direct download (3 more)  
     
    My bibliography  
     
    Export citation