| Shelfclass |
Sortkey |
Title |
| 3.D.1 |
AHO, ALFRED V |
Currents in the Theory of Computing |
| 3.D.1 |
AHO, ALFRED V |
Foundations of Computer Science |
| 3.D.1 |
AIGNER, MARTIN |
Combinatorial Theory |
| 3.D.1 |
ALAGIC, SUAD |
The Design of Well-Structured and Correct Programs |
| 3.D.1 |
ARBIB, MICHAEL A |
A Basis for Theoretical Computer Science |
| 3.D.1 |
ATALLAH, MIKHAIL J |
Algorithms and Theory of Computation Handbook |
| 3.D.1 |
BAUMSLAG, GILBERT |
Algorithms and Classification in Combinatorial Group Theory |
| 3.D.1 |
BEST, EIKE |
Nonsequential Processes: A Petri Net View |
| 3.D.1 |
BEST, EIKE |
Petri Net Algebra |
| 3.D.1 |
BOLLOBAS, BELA |
Combinatorics: Set Systems, Hypergraphs, Families of Vectors, and Combinatorial Probability |
| 3.D.1 |
BRAINERD, WALTER S |
Theory of Computation |
| 3.D.1 |
BUTLER, GREGORY |
Fundamental Algorithms for Permutation Groups |
| 3.D.1 |
CASPARD, NATHALIE |
Finite Ordered Sets: Concepts, Results and Uses |
| 3.D.1 |
COHEN, DANIEL I. A. |
Introduction to Computer Theory |
| 3.D.1 |
CURRY, HASKELL B |
Combinatory Logic: Volume 1 |
| 3.D.1 |
CURRY, HASKELL B |
Combinatory Logic: Volume 2 |
| 3.D.1 |
DAVIS, MARTIN |
Computability & Unsolvability |
| 3.D.1 |
DIEKERT, VOLKER |
Combinatorics on Traces |
| 3.D.1 |
DIJKSTRA, EDSGER W |
Formal Development of Programs and Proofs |
| 3.D.1 |
EDALAT, A |
Advances in Theory and Formal Methods of Computing: Proceedings of the Third Imperial College Workshop: Christ Church, Oxford, 1-3 April 1996 |
| 3.D.1 |
EEF |
EEF 2000: Lectures on Formal Methods and Performance Analysis: First EEF/Euro Summer School on Trends in Computer Science, Berg en Dal, The Netherlands, July 3-7, 2000, Revised Lectures |
| 3.D.1 |
EHRIG, HARTMUT |
Categorical Methods in Computer Science: With Aspects from Topology |
| 3.D.1 |
ENGELER, ERWIN |
Introduction to the Theory of Computation |
| 3.D.1 |
ERSHOV, YU. L |
Handbook of Recursive Mathematics: Volume 1: Recursive Model Theory |
| 3.D.1 |
ERSHOV, YU. L |
Handbook of Recursive Mathematics: Volume 2: Recursive Algebra, Analysis and Combinatorics |
| 3.D.1 |
FASEL, JOSEPH H |
Graph Reduction: Proceedings of a Aorkshop, Santa Fe, New Mexico, USA, September 29-October 1, 1986 |
| 3.D.1 |
FORD, NEVILLE J |
Introducing Formal Methods: A Less Mathematical Approach |
| 3.D.1 |
FRANCEZ, NISSIM |
Program Verification |
| 3.D.1 |
FRITSCH, RUDOLF |
The Four Color Theorem: History, Topological Foundations, and Idea of Proof |
| 3.D.1 |
GEURTS, FRÉDÉRIC |
Abstract Compositional Analysis of Iterated Relations: A Structural Approach to Complex State Transition Systems |
| 3.D.1 |
GILL, ARTHUR |
Applied Algebra for the Computer Sciences |
| 3.D.1 |
GODEL |
First International Symposium on Gödel's Theorems: Paris, 27-29 May 1991 |
| 3.D.1 |
GÖDEL, KURT |
On Formally Undecidable Propositions of Principia Mathematica and Related Systems |
| 3.D.1 |
GORENSTEIN, DANIEL |
The Classification of the Finite Simple Groups: Number 3 |
| 3.D.1 |
GRAHAM, RONALD L |
Handbook of Combinatorics: Volume I |
| 3.D.1 |
GRAHAM, RONALD L |
Handbook of Combinatorics: Volume II |
| 3.D.1 |
GRIES, DAVID |
The Science of Programming |
| 3.D.1 |
GURARI, EITAN M |
An Introduction to the Theory of Computation |
| 3.D.1 |
HAREL, DAVID |
Dynamic Logic |
| 3.D.1 |
HARRY, ANDREW |
Formal Methods Fact File: VDM and Z |
| 3.D.1 |
HONG, JIA-WEI |
Computation: Computability, Similarity and Duality |
| 3.D.1 |
HUSSMANN, HEINRICH |
Nondeterminism in Algebraic Specifications and Algebraic Programs |
| 3.D.1 |
HUTH, MICHAEL R. A |
Logic in Computer Science: Modelling and Reasoning about Systems |
| 3.D.1 |
INCE, D. C |
An Introduction to Discrete Mathematics, Formal System Specification, and Z |
| 3.D.1 |
JONES, NEIL D |
Logic, Language and Computation: Festschrift in Honor of Satoru Takasu |
| 3.D.1 |
KAPPS, CHARLES A |
Introduction to the Theory of Computing |
| 3.D.1 |
KLEENE, STEPHEN COLE |
Introduction to Metamathematics |
| 3.D.1 |
KOOPMAN, PHILIP JOHN |
An Architecture for Combinator Graph Reduction |
| 3.D.1 |
KREHER, DONALD L. |
Combinatorial Algorithms: Generation, Enumeration, and Search |
| 3.D.1 |
KRÖGER, FRED |
Temporal Logic and State Systems |
| 3.D.1 |
LEECH, JOHN |
Computational Problems in Abstract Algebra: Proceedings of a conference held at Oxford under the auspices of the Science Research Council Atlas Computer Laboratory |
| 3.D.1 |
LEVY, LEON S |
Discrete Structures of Computer Science |
| 3.D.1 |
LEWIS, HARRY R |
Elements of the Theory of Computation |
| 3.D.1 |
LEWIS, HARRY R. |
Elements of the Theory of Computation |
| 3.D.1 |
LIU, C. L |
Elements of Discrete Mathematics |
| 3.D.1 |
MANDRIOLI, DINO |
Theoretical Foundations of Computer Science |
| 3.D.1 |
MANNA, ZOHAR |
Mathematical Theory of Computation |
| 3.D.1 |
MCGETTRICK, ANDREW D. |
Program Verification using Ada |
| 3.D.1 |
MCNAUGHTON, ROBERT |
Elementary Computability, Formal Languages, and Automata |
| 3.D.1 |
NAGEL, ERNEST |
Gödel's Proof |
| 3.D.1 |
NORRIS, FLETCHER R |
Discrete Structures: An Introduction to Mathematics for Computer Science |
| 3.D.1 |
PAGE, E. S |
An Introduction to Computational Combinatorics |
| 3.D.1 |
PAUN, GHEORGHE |
Current Trends in Theoretical Computer Science: The Challenge of the New Century: Volume 1: Algorithms and Complexity |
| 3.D.1 |
PAUN, GHEORGHE |
Current Trends in Theoretical Computer Science: The Challenge of the New Century: Volume 2: Formal Models and Semantics |
| 3.D.1 |
REISIG, WOLFGANG |
Petri Nets: An Introduction |
| 3.D.1 |
ROBBIANO, LORENZO |
Computational Aspects of Commutative Algebra |
| 3.D.1 |
ROZENBERG, G |
Current Trends in Theoretical Computer Science: Essays and Tutorials |
| 3.D.1 |
SAHNI, SARTAJ |
Concepts in Discrete Mathematics |
| 3.D.1 |
SALOMAA, ARTO |
On Basis Groups for the Set of Functions Over a Finite Domain |
| 3.D.1 |
SCHRÖDER, BERND |
Ordered Sets: An Introduction with Connections from Combinatorics to Topology |
| 3.D.1 |
SELDIN, J.P |
To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism |
| 3.D.1 |
SIMS, CHARLES C |
Computation with Finitely Presented Groups |
| 3.D.1 |
SIPSER, MICHAEL |
Introduction to the Theory of Computation |
| 3.D.1 |
SMULLYAN, RAYMOND M |
Gödel's Incompleteness Theorems |
| 3.D.1 |
SOMMERHALDER, R |
The Theory of Computability: Programs, Machines, Effectiveness and Feasibility |
| 3.D.1 |
SORBI, ANDREA |
Complexity, Logic, and Recursion Theory |
| 3.D.1 |
STANAT, DONALD F. |
Discrete Mathematics in Computer Science |
| 3.D.1 |
STOLTENBERG-HANSEN, VIGGO |
Mathematical Theory of Domains |
| 3.D.1 |
STUART, TOM |
Understanding Computation: From Simple Machines to Impossible Programs |
| 3.D.1 |
TIMMONS, DANIEL |
Fundamentals of Algebraic Modeling: An Introduction to Mathematical Modeling with Algebra and Statistics |
| 3.D.1 |
TREMBLAY, JEAN-PAUL |
Discrete Mathematical Structures with Applications to Computer Science |
| 3.D.1 |
USPENSKY, V. A |
Gödel's Incompleteness Theorem |
| 3.D.1 |
USPENSKY, V. A |
Post's Machine |
| 3.D.1 |
VAN LEEUWEN, J. |
Handbook of Theoretical Computer Science: Volume A: Algorithms and Complexity |
| 3.D.1 |
VAN LEEUWEN, J. |
Handbook of Theoretical Computer Science: Volume B: Formal Models and Semantics |
| 3.D.1 |
VOGLER, WALTER |
Modular Construction and Partial Order Semantics of Petri Nets |
| 3.D.1 |
WAND, MITCHELL |
Induction, Recursion, and Programming |
| 3.D.1 |
WOOD, DERICK |
Theory of Computation |