Branch at CLC of the IST Branch at CLC of the IST Library - Alameda

References

[1]
B. Werner, editor. Proceedings of the 18th IEEE Computer Security Foundations Workshop. IEEE, 2005.

[2]
M. Bugliesi, B. Preneel, V. Sassone, and I. Weneger, editors. Automata, Languages and Programming, volume 4051 of Lecture Notes in Computer Science. Springer, 2006.

[3]
S. Vimercati, P. Syverson, and D. Gollmann, editors. Computer Security - ESORICS 2005, volume 3679 of Lecture Notes in Computer Science. Springer, 2005.

[4]
M. Bugliesi, B. Preneel, V. Sassone, and I. Weneger, editors. Automata, Languages and Programming, volume 4052 of Lecture Notes in Computer Science. Springer, 2006.

[5]
R. Bilof, editor. Proceedings of the 19th IEEE Computer Security Foundations Workshop. IEEE, 2006.

[6]
S. Brookes and M. Mislove, editors. Mathematical Foundations of Programming Semantics, volume 158 of Encyclopedia of Mathematics and its Applications. Elsevier, 2006.

[7]
P. Johnstone. Sketches of an Elephant - Volume 2, volume 44 of Oxford Logic Guides. Oxford University Press, 2002.

[8]
P. Johnstone. Sketches of an Elephant - Volume 1, volume 43 of Oxford Logic Guides. Oxford University Press, 2002.

[9]
D. Gabbay and J. Woods, editors. Handbook of The History of Logic, volume 7. Elsevier, 2006.

[10]
O. Chateaubriand. Logical Forms - Part I, volume 34 of Colecção CLE. Centro de Lógica, Epistemologia e História da Ciência - UNICAMP, 2001.

[11]
F. T. Sautter and H. A. Feitosa. Lógica - Teoria, Aplicações e Reflexões, volume 39 of Colecção CLE. Centro de Lógica, Epistemologia e História da Ciência - UNICAMP, 2004.

[12]
O. Chateaubriand. Logical Forms - Part II, volume 42 of Colecção CLE. Centro de Lógica, Epistemologia e História da Ciência - UNICAMP, 2005.

[13]
W. Carnielli, editor. Logic and Philosophy of the Formal Sciences - A Festschrift for Itala M. Loffred D'Ottaviano. Centro de Lógica, Epistemologia e História da Ciência - UNICAMP, 2005. Manuscrito - Revista Internacional de Filosofia, 28(2).

[14]
M. Li and P. Vitányi. An Introduction to Kolmogorov Complexity and Its Applications, 2nd Edition. Graduate Texts in Computer Science. Springer, 1997.

[15]
K. Futatsugi, J.-P. Jouannaud, and J. Meseguer, editors. Algebra, Meaning, and Computation, volume 4060 of Lecture Notes in Computer Science. Springer, 2006.

[16]
S. Brookes and M. Mislove, editors. Mathematical Foundations of Programming Semantics, volume 158 of Encyclopedia of Mathematics and its Applications. Elsevier, 2006.

[17]
M. G. A. Paris and J. Rehacek, editors. Quantum State Estimation, volume 649 of Lecture Notes in Physics. Springer, 2004.

[18]
D. Kressner. Numerical Methods for General and Structured Eigenvalue Problems, volume 46 of Lecture Notes in Computational Science and Engineering. Springer, 2005.

[19]
D. Gabbay, S. Goncharov, and M. Zakharyaschev, editors. Mathematical Problems from Applied Logic I - Logics for the XXIst Century, volume 4 of International Mathematical Series. Springer, 2006.

[20]
W. Rautenberg. A Concise Introduction to Mathematical Logic, 2nd Edition. Springer, 2006.

[21]
M. Fitting. Types, Tableaus, and Gödel's God, volume 12 of Trends in Logic. Kluwer Academic Publishers, 2002.

[22]
A. McIver and C. Morgan. Abstraction, Refinment and Proof for Probabilistic Systems. Monographs in Computer Science. Springer, 2005.

[23]
D. Gabbay and J. Woods, editors. Handbook of The History of Logic, volume 3. Elsevier, 2004.

[24]
M. Rao. Conditional Measures and Applications, 2nd Edition, volume 271 of Pure and Applied Mathematics. Chapman & Hall/CRC, 2005.

[25]
L. Henkin, J. Monk, and A. Tarsky, editors. Cylindric Algebras, Part I. North-Holland, 1971.

[26]
G. Barthe, P. Dybjer, L. Pinto, and J. Saraiva, editors. Applied Semantics - Advanced Lectures, volume 2395 of Lecture Notes in Computer Science. Springer, 2002.

[27]
M. Reyes, G. Reyes, and H. Zolfaghari. Generic Figures and their Glueings. Polimetrica, 2004.

[28]
S. Lang. Algebra, Revised 3rd Edition, volume 211 of Graduate Texts in Mathematics. Springer, 2002.

[29]
O. Goldreich. Foundations of Cryptography - Vol. II. Cambridge University Press, 2004.

[30]
O. Goldreich. Foundations of Cryptography - Vol. I. Cambridge University Press, 2003.

[31]
D. Gabbay and L. Maksimova. Interpolation and Definability - Modal and Intuitionistic Logics, volume 46 of Oxford Logic Guides. Oxford University Press, 2005.

[32]
S. Artemov, H. Barringer, A. d'Avila Garcez, L. Lamb, and J. Woods, editors. We will show them! - Essays in honour of Dov Gabbay, volume 2. College Publications, 2005.

[33]
S. Artemov, H. Barringer, A. d'Avila Garcez, L. Lamb, and J. Woods, editors. We will show them! - Essays in honour of Dov Gabbay, volume 1. College Publications, 2005.

[34]
K. Gröchenig. Foundations of Time-Frequency Analysis. Birkhäuser, 2000.

[35]
R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.

[36]
S. B. Cooper. Computability Theory. Chapman & Hall/CRC, 2004.

[37]
M. Luby. Pseudorandomness and Cryptographic Applications. Princeton Computer Science Notes. Princeton University Press, 1996.

[38]
S. Basu, R. Pollack, and M.-F. Roy. Algorithms in Real Algebraic Geometry, volume 10 of Algorithms and Computation in Mathematics. Springer, 2003.

[39]
J. Buchmann. Introduction to Cryptography, 2nd Edition. Undergraduate Texts in Mathematics. Springer, 2004.

[40]
A. Tarski. Introduction to Logic and to the Methodology of Deductive Sciences, 4th Edition. Oxford University Press, 1994.

[41]
M. Nielsen and I. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000.

[42]
D. Gabbay and F. Guenthner, editors. Handbook of Philosophical Logic - Volume 13, 2nd Edition. Springer, 2005.

[43]
E. Adams. A Primer of Probability Logic. CSLI Publications, 1998.

[44]
K. Denecke and S. Wismath. Universal Algebra and Applications in Theoretical Computer Science. Chapman & Hall/CRC, 2002.

[45]
G. Restall. An Introduction to Substructural Logics. Routledge, 2000.

[46]
L. Caires, G. Italiano, L. Monteiro, C. Palamidessi, and M. Yung, editors. Automata, Languages and Programming - Proceedings of ICALP 2005, volume 3580 of Lecture Notes in Computer Science. Springer, 2005.

[47]
C. André and F. Ferreira. Matemática Finita. Universidade Aberta, 2000.

[48]
S. Gasiorowicz. Quantum Physics, 3rd Edition. John Wiley & Sons, 2003.

[49]
J. Hromkovic. Algorithms for Hard Problems, 2nd Edition. Texts in Theoretical Computer Science. Springer, 2004.

[50]
J. Hoffmann-Jø rgensen. Probability with a view toward Statistics - Volume II. Chapman & Hall Probability Series. Chapman & Hall/CRC, 1994.

[51]
J. Hoffmann-Jø rgensen. Probability with a view toward Statistics - Volume I. Chapman & Hall Probability Series. Chapman & Hall/CRC, 1994.

[52]
J.-Y. Béziau, editor. Logica Universalis. Birkhäuser, 2005.

[53]
J.-Y. Béziau, A. Costa Leite, and A. Fachini, editors. Aspects of Universal Logic, volume 17 of Travaux de Logique. Centre de Recherches Sémiologiques - Université de Neuchâtel, 2004.

[54]
D. Harel, D. Kozen, and J. Tiuryn. Dynamic Logic. The MIT Press, 2000.

[55]
D. Cox, J. Little, and D. O'Shea. Ideals, Varieties, and Algorithms, 2nd Edition. Springer, 1997.

[56]
C. Cohen-Tannoudji, B. Diu, and F. Laloë. Quantum Mechanics - Volume Two. John Wiley & Sons, 1977.

[57]
C. Cohen-Tannoudji, B. Diu, and F. Laloë. Quantum Mechanics - Volume One. John Wiley & Sons, 1977.

[58]
S. Burris. Logic for Mathematics and Computer Science. Prentice-Hall, 1998.

[59]
W. Kocay and D. Kreher. Graphs, Algorithms and Optimization. Discrete Mathematics and its Applications. Chapman & Hall/CRC, 2005.

[60]
S. B. Cooper and S. S. Goncharov, editors. Computability and Models. The University Series in Mathematics. Kluwer Academic/Plenum Publishers, 2003.

[61]
P. Bateman and H. Diamond. Analytic Number Theory. World Scientific, 2004.

[62]
M. Holz, K. Steffens, and E. Weitz. Introduction to Cardinal Arithmetic. Birkhäuser, 1999.

[63]
M. Mitzenmacher and E. Upfal. Probability and Computing. Cambridge University Press, 2005.

[64]
V. T. Paschos. Complexité et Approximation Polynomiale. Hermes Science, 2004.

[65]
S. A. Selesnick. Quanta, Logic and Spacetime, 2nd Edition. World Scientific, 2003.

[66]
B. Pierce, editor. Advanced Topics in Types and Programming Languages. The MIT Press, 2005.

[67]
B. Simon. Functional Integration and Quantum Physics, 2nd Edition. American Mathematical Society Chelsea, 2004.

[68]
C. Cohen-Tannoudji, B. Diu, and F. Laloë. Quantum Mechanics, Volume 2. Hermann and John Wiley & Sons, 1977.

[69]
C. Cohen-Tannoudji, B. Diu, and F. Laloë. Quantum Mechanics, Volume 1. Hermann and John Wiley & Sons, 1977.

[70]
J. J. Sakurai. Modern Quantum Mechanics. Addison-Wesley, 1994.

[71]
J. J. Alferes and J. Leite. Logics in Artificial Intelligence - JELIA'04. Springer, 2004.

[72]
M. Markl, S. Shnider, and J. Stasheff. Operads in Algebra, Topology and Physics. American Mathematical Society, 2002.

[73]
F. Byron Jr. and R. Fuller. Mathematics of Classical and Quantum Physics. Dover Publications Inc, 1992.

[74]
R. Shankar. Principles of Quantum Mechanics, 2nd Edition. Kluwer Academic/Plenum Publishers, 1994.

[75]
L. Ballentine. Quantum Mechanics: a Modern Development. World Scientific, 1998.

[76]
M. Golumbic. Algorithmic Graph Theory and Perfect Graphs, 2nd Edition. Elsevier, 2004.

[77]
D. Bressoud. Factorization and Primality Testing. Springer, 1989.

[78]
E. Coddington and N. Levinson. Theory of Ordinary Differential Equations. Krieger Publishing Company, 1984.

[79]
J. Doob. Measure Theory. Springer, 1993.

[80]
P. Malliavin. Integration and Probability. Springer, 1995.

[81]
P. Odifreddi. Classical Recursion Theory - Vol. II. Elsevier, 1999.

[82]
K. Kaarli and A. Pixley. Polynomial Completeness in Algebraic Systems. Chapman & Hall/CRC, 2000.

[83]
S. Cooper and S. Goncharov. Computability and Models: Perspectives East and West. Kluwer Academic/Plenum Publishers, 2002.

[84]
D. Bouwmeester, A. Ekert, and A. Zeilinger. The Physics of Quantum Information: Quantum Cryptography, Quantum Teleportation, Quantum Computation. Springer, 2000.

[85]
J. Carmo, A. Sernadas, C. Sernadas, F. M. Dionísio, and C. Caleiro. Introdução à Programação em Mathematica, Segunda Edição. IST Press, 2004. Oferta.

[86]
J. P. Martins and M. R. Cravo. Programação em Scheme - Introdução à Programação utilizando Múltiplos Paradigmas. IST Press, 2004. Oferta.

[87]
P. Guerreiro. Elementos de Programação com C. FCA, 2001. Oferta.

[88]
P. Guerreiro. Pascal - Técnicas de Programação. FCA, 1988. Oferta.

[89]
P. Guerreiro. Programação com Classes em C++. FCA, 2000. Oferta.

[90]
K.-I Ko. Complexity Theory of Real Functions. Birkhäuser, 1991.

[91]
C. H. Smith. A Recursive Introduction to the Theory of Computation. Springer-Verlag, 1994.

[92]
W. I. Gasarch and G. A. Martin. Bounded Queries in Recursion Theory. Birkhäuser, 1999.

[93]
P. B. Menezes. Matemática Discreta para Computação e Informática. Editora Sagra Luzzatto, 2004. Oferta.

[94]
P. B. Menezes and E. H. Haeusler. Teoria das Categorias para Ciência da Computação. Editora Sagra Luzzatto, 2001. Oferta.

[95]
T. A. Diverio and P. B. Menezes. Teoria da Computação: Máquinas Universais e Computabilidade. Editora Sagra Luzzatto, 2003. Oferta.

[96]
P. B. Menezes. Linguagens Formais e Autômatos. Editora Sagra Luzzatto, 2002. Oferta.

[97]
M. Dalla Chiara, R. Giuntini, and R. Greechie. Reasoning in Quantum Theory: Sharp and Unsharp Quantum Logics, volume 22 of Trends in Logic. Kluwer Academic Publishers, 2004.

[98]
J.-P. Allouche and J. Shallit. Automatic sequences: Theory, Applications, Generalizations. Cambridge University Press, 2003.

[99]
S. Pemmaraju and S. Skiena. Computational Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Cambridge University Press, 2003.

[100]
E. J. Barbeau. Polynomials. Problem Books in Mathematics. Springer, 2003.

[101]
Z.-X. Wan. Lectures on Finite Fields and Galois Rings. World Scientific, 2003.

[102]
D. M. Gabbay, A. Kurucz, F. Wolter, and M. Zakharyaschev. Many-Dimensional Modal Logics: Theory and Applications. Elsevier, 2003.

[103]
L. Bolc and P. Borowik. Many-Valued Logics 2: Automated Reasoning and Practical Applications. Springer, 2003.

[104]
J. M. Feagin. Quantum Methods with Mathematica. Springer-Verlag, 2002.

[105]
L. M. Blumenthal. A Modern View of Geometry. Dover Publications Inc, 1980.

[106]
G. Tourlakis. Lectures in Logic and Set Theory, volume 2: Set Theory, volume 83 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, 2003.

[107]
G. Tourlakis. Lectures in Logic and Set Theory, volume 1: Mathematical Logic, volume 82 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, 2003.

[108]
J. von zur Gathen and J. Gerhard. Modern Computer Algebra, 2nd Edition. Cambridge University Press, 2003.

[109]
J. A. Buchmann. Introduction to Cryptography. Undergraduate Texts in Mathematics. Springer, 2000.

[110]
D.-Z. Du and K.-I Ko. Theory of Computational Complexity. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons, 2000.

[111]
G. Gierz, K. H. Hofmann, K. Keimel, J. D. Lawson, M. W. Mislove, and D. S. Scott. Continuous Lattices and Domains, volume 93 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, 2002.

[112]
P. J. Cameron. Sets, Logic and Categories. Springer Undergraduate Mathematics Series. Springer, 1999.

[113]
D. Redfern and C. Campbell. The MATLAB 5 Handbook. Springer, 1997.

[114]
N. F. Britton. Essential Mathematical Biology. Springer Undergraduate Mathematics Series. Springer, 2003.

[115]
P. Clote and E. Kranakis. Boolean Functions and Computation Models. Texts in Theoretical Computer Science. Springer, 2002.

[116]
L. Lovász, J. Pelikán, and K. Vesztergombi. Discrete Mathematics - Elementary and Beyond. Undergraduate Texts in Mathematics. Springer, 2000.

[117]
J. Kohlas. Information Algebras - Generic Structures for Inference. Discrete Mathematics and Theoretical Computer Science. Springer, 2003.

[118]
J. C. M. Baeten, J. K. Lenstra, J. Parrow, and G. J. Woeginger, editors. Automata, Languages and Programming - Proceedings of ICALP 2003, volume 2719 of Lecture Notes in Computer Science. Springer, 2003.

[119]
S. Fajardo and H. J. Keisler. Model Theory of Stochastic Processes, volume 14 of Lecture Notes in Logic. Association for Symbolic Logic, 2002.

[120]
M. B. Feldman and E. B. Koffman. Ada - Problem Solving and Program Design. Addison-Wesley, 1993.

[121]
S. D. Conte and C. de Boor. Elementary Numerical Analysis - an algorithmic approach, 2nd dition. International Series in Pure and Applied Mathematics. McGraw-Hill, 1972.

[122]
D. Bert, C. Choppy, and P. Mosses, editors. Recent Trends in Algebraic Development Techniques - WADT'99, volume 1827 of Lecture Notes in Computer Science. Springer, 2000.

[123]
R. H. Möhring, editor. Graph-Theoretic Concepts in Computer Science - WG'90, volume 484 of Lecture Notes in Computer Science. Springer-Verlag, 1991.

[124]
T. Ibaraki, Y. Inagaki, K. Iwama, T. Nishizeki, and M. Yamashita, editors. Algorithms and Computation - ISAAC'92, volume 650 of Lecture Notes in Computer Science. Springer-Verlag, 1992.

[125]
S. Abramsky and T. S. E. Maibaum, editors. TAPSOFT'91 - part 2, volume 494 of Lecture Notes in Computer Science. Springer-Verlag, 1991.

[126]
J. M. E. Valença and J. B. Barros. Computação e Linguagem, volume 1 of Fundamentos de Computação. Universidade Aberta, 2000. Oferta.

[127]
J. M. E. Valença and J. B. Barros. Programação Funcional, volume 2 of Fundamentos de Computação. Universidade Aberta, 2000. Oferta.

[128]
S. Abramsky and T. S. E. Maibaum, editors. TAPSOFT'91 - part 1, volume 493 of Lecture Notes in Computer Science. Springer-Verlag, 1991.

[129]
F. Pichler and R. M. Díaz, editors. Computer Aided Systems Theory - EUROCAST'93, volume 763 of Lecture Notes in Computer Science. Springer-Verlag, 1994.

[130]
J. Zwiers. Compositionality, Concurrency and Partial Correctness - Proof Theories for Networks of Processes, and Their Relationship, volume 321 of Lecture Notes in Computer Science. Springer-Verlag, 1989.

[131]
G. Coletti and R. Scozzafava. Probabilistic Logic in a Coherent Setting, volume 15 of Trends in Logic. Kluwer Academic Publishers, 2002.

[132]
I. Lavrov, L. Maksimova, and G. Corsi. Problems in Set Theory, Mathematical Logic and the Theory of Algorithms. University Series in Mathematica. Kluwer Academic/Plenum Publishers, 2003.

[133]
J. L. Fiadeiro, editor. Recent Trends in Algebraic Development Techniques - WADT'98, volume 1589 of Lecture Notes in Computer Science. Springer, 1999.

[134]
D. Sannella and A. Tarlecki, editors. Recent Trends in Data Type Specification, volume 332 of Lecture Notes in Computer Science. Springer-Verlag, 1988.

[135]
A. M. Tenenbaum and M. J. Augenstein. Data Structures using Pascal, 2nd Edition. Prentice-Hall, 1986.

[136]
D. E. Knuth. The TEXbook. Addison-Wesley, 1986.

[137]
L. Lamport. LATEX: A Document Preparation System. Addison-Wesley, 1986.

[138]
L. P. Meissner. Essential Fortran 90 & 95: Common Subset Edition. Unicomp, 1997.

[139]
W. S. Brainerd, C. H. Goldberg, and J. C. Adams. Programmer's Guide to F. The Fortran Company, 2001.

[140]
J. N. Silva, M. Ramos, and L. Trabucho, editors. 2000 Matemática {radical}, volume 16 of Textos de Matemática. Universidade de Lisboa, 2002. Oferta.

[141]
J. C. Adams, W. S. Brainerd, J. T. Martin, and B. T. Smith. Key Features of F. Unicomp, 1996.

[142]
J. Oikkonen and J. Väänänen, editors. Logic Colloquium'90. Association for Symbolic Logic, 1993.

[143]
K. B. Bruce. Foundations of Object-Oriented Languages: Types and Semantics. The MIT Press, 2002.

[144]
S. Ghilardi and M. Zawadowski. Sheaves, Games and Model Completions. Kluwer Academic Publishers, 2002.

[145]
D. J. Pym. The Semantics and Proof Theory of the Logic of Bunched Implications. Kluwer Academic Publishers, 2002.

[146]
V. Arnold. Chapitres Supplémentaires de la Théorie des Équations Différentielles Ordinaires. Éditions Mir, 1984.

[147]
F. Paoli. Substructural Logics: A Primer. Kluwer Academic Publishers, 2002.

[148]
C. S. Calude. Information and Randomness. Springer-Verlag, 2002.

[149]
P. Blackburn, M. de Rijke, and Y. Venema. Modal Logic. Cambridge University Press, 2001.

[150]
F. Wright. Computing with Maple. Chapman & Hall/CRC, 2002.

[151]
M. Metcalf and J. Reid. Fortran 90/95 Explained. Oxford University Press, 2002.

[152]
D. Gries and F. B. Schneider. A Logical Approach to Discrete Mathematics. Springer-Verlag, 1993.

[153]
M. E. Herniter. Programming in MatLab. Brooks/Cole, 2001.

[154]
M. Netcalf and J. Reid. The Fortran Programming Language. Oxford University Press, 1996.

[155]
I. Chivers and J. Sleightholme. Introducing Fortran 95. Springer-Verlag, 2000.

[156]
R. L. Graham, D. E. Knuth, and O. Patashnick. Concrete Mathematics: a Foundation for Computer Science. Addison-Wesley, 1994.

[157]
C. N. Fischer and R. J. LeBlanc Jr. Crafting a Compiler with C. The Benjamin/Cummings Publishing Company, Inc, 1991.

[158]
E. M. Clarke Jr., O. Grumberg, and D. A. Peled. Model Checking. The MIT Press, 2001.

[159]
M. R. A. Huth and M. D. Ryan. Logic in Computer Science: Modelling and Reasoning about Systems. Cambridge University Press, 2002.

[160]
H. R. Arabnia, editor. Proceedings of the 2001 International Conference on Artificial Intelligence: IC-AI'2001. CSREA Press, 2001.

[161]
J. L. Fiadeiro, editor. Recent Trends in Algebraic Development Techniques: Selected Papers of WADT'98. Springer-Verlag, 1999.

[162]
A. Carbone and S. Semmes. A Graphic Apology for Symmetry and Implicitness. Oxford University Press, 2000.

[163]
D. Sangiorgi and D. Walker. The p-calculus. A Theory of Mobile Processes. Cambridge University Press, 2001.

[164]
A. Armando, editor. Frontiers of Combining Systems - FROCOS 2002. Springer-Verlag, 2002.

[165]
D. Fensel, F. Giunchiglia, D. McGuinness, and M.-A. Williams, editors. Principles of Knowledge Representation and Reasoning: Proceedings of KR2002. Morgan Kaufmann, 2002.

[166]
H. Pina. Métodos Numéricos. McGraw-Hill, 1995.

[167]
M. Bicknell and V. E. Hoggatt. A Primer for the Fibonacci Numbers. The Fibonacci Association, 1973.

[168]
B. U. Alfred. An Introduction to Fibonacci Discovery. The Fibonacci Association, 1965.

[169]
M. Bicknell and V. E. Hoggatt. Fibonacci's Problem Book. The Fibonacci Association, 1974.

[170]
V. E. Hoggatt. Fibonacci and Luca Numbers. The Fibonacci Association, 1969.

[171]
E. Lucas. The Theory of Simply Periodic Numerical Functions. The Fibonacci Association, 1969.

[172]
B. A. Brousseau. Linear Recursion and Fibonacci Sequences. The Fibonacci Association, 1971.

[173]
M. Cerioli and G. Reggio. Recent Trends in Algebraic Development Techniques - LNCS 2267. Springer-Verlag, 2001.

[174]
C. Miyaji and P. Abbott. MathLink - Network Programming with Mathematica. Cambridge University Press, 2001.

[175]
L. T. Magalhães. Álgebra Linear como Introdução a Matemática Aplicada. Texto Editora, 2001.

[176]
R. David, K. Nour, and C. Raffalli. Introduction à la Logique, Théorie de la démonstration, Cours et exercices corrigés. Dunod, 2001.

[177]
E. Don. Schaum's Outline of Theory and Problems of Mathematica. McGraw-Hill, 2000.

[178]
C. P. Williams and S. H. Clearwater. Explorations in Quantum Computing. Springer-Verlag, 1998.

[179]
K. Dosen. Cut Elimination in Categories. Kluwer Academic Publishers, 1999.

[180]
R. Cori and D. Lascar. Mathematical Logic: A Course With Exercises - Recursion Theory, Godel's Theorems, Set Theory, Model Theory. Oxford University Press, 2001.

[181]
R. Cori and D. Lascar. Mathematical Logic: A Course With Exercises - Propositional Calculus, Boolean Algebras, Predicate Calculus. Oxford University Press, 2000.

[182]
C. Jacob. Illustrating Evolutionary Computation with Mathematica. Morgan Kaufmann, 2001.

[183]
R. E. Maeder. Computer Science with Mathematica. Cambridge University Press, 2000.

[184]
M. Kracht. Tools and Techniques in Modal Logic. Elsevier, 1999.

[185]
B. Jacobs. Categorical Logic and Type Theory. Elsevier, 1999.

[186]
R. K. Dybvig. The SCHEME Programming Language, 2nd Edition. Prentice-Hall, 1996.

[187]
M. Hofmann, D. Pavlovic, and P. Rosolini. Proceedings of the Eighth Conference on Category Theory and Computer Science. University of Edinburgh, 1999.

[188]
R. Maeder. The Mathematica Programmer II. Academic Press, 1996.

[189]
S. R. Buss. Handbook of Proof Theory. Elsevier, 1998.

[190]
M. Hirvensalo. Quantum Computing. Springer-Verlag, 2001.

[191]
J. Carmo, A. Sernadas, C. Sernadas, F. M. Dionísio, and C. Caleiro. Introdução à Programação em Mathematica. IST Press, 1999. Oferta.

[192]
C. Sernadas. Introdução à Teoria da Computação. Editorial Presença, 1993. Oferta.

[193]
H. Abelson, G. J. Sussman, and J. Sussman. Structure and Interpretation of Computer Programs (2/e). The MIT Press, 1996.

[194]
S. Gottwald. A Treatise on Many-Valued Logics. Research Studies Press, 2001.

[195]
M. Zakharyaschev, K. Segerberg, M. de Rijke, and H. Wansing. Advances in Modal Logic - Volume 2. CSLI Publications, 2001.

[196]
S. Schulze-Kremer. Molecular Bioinformatics - Algorithms and Applications. Walter de Gruyter, 1995.

[197]
B. Jacobs. Categorical Logic and Type Theory. Elsevier, 1999.

[198]
O. Grillmeyer. Exploring Computer Science with Scheme. Springer-Verlag, 1998.

[199]
J. Chazarain. Programmer avec Scheme - de la Pratique à la Théorie. Thomson Publishing, 1996.

[200]
M. Watson. Programming in Scheme - Learn Scheme through Artificial Intelligence Programs. Springer-Verlag, 1996.

[201]
R. L. O. Cignoli, I. M. L. D'Ottaviano, and D. Mundici. Algebraic Foundations of Many-Valued Reasoning. Kluwer Academic Publishers, 2000.

[202]
M. Huisman. Reasoning about JAVA Programs in Higher Order Logic with PVS and Isabelle. IPA, 2001.

[203]
J. E. Hopcroft, R. Motwani, and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 2001.

[204]
D. Bressoud and S. Wagon. A Course in Computational Number Theory. Key College Publishing, 2000.

[205]
J. L. Bell. A Primer of Infinitesimal Analysis. Cambridge University Press, 1998.

[206]
N. Koblitz. A Course in Number Theory and Cryptography. Springer-Verlag, 1994.

[207]
M. K. Inan and R. P. Kurshan. Verification of Digital and Hybrid Systems. Springer-Verlag, 2000.

[208]
O. Goldreich. Modern Cryptography, Probabilistic Proofs and Pseudorandomness. Springer-Verlag, 1999.

[209]
N. Koblitz. Algebraic Aspects of Cryptography. Springer-Verlag, 1998.

[210]
B. Poizat. A Course in Model Theory. Springer-Verlag, 2000.

[211]
K. Weihrauch. Computable Analysis - an Introduction. Springer-Verlag, 2000.

[212]
B. Poizat. A Course in Model Theory. Springer-Verlag, 2000.

[213]
F. L. Bauer. Decrypted Secrets. Springer-Verlag, 2000.

[214]
P. Bürgisser. Completeness and Reduction in Algebraic Complexity Theory. Springer-Verlag, 2000.

[215]
S. Wagon. Mathematica in Action. Springer-Verlag, 2000.

[216]
D. van Dalen. Logic and Structure. Springer-Verlag, 1997.

[217]
G. A. Jones and J. M. Jones. Elementary Number Theory. Springer-Verlag, 2001.

[218]
G. Budzban, P. Feinsilver, and A. Mukherjea. Probability on Algebraic Structures. American Mathematical Society, 2000.

[219]
I. Blake, G. Seroussi, and N. Smart. Elliptic Curves in Cryptography. Cambridge University Press, 2000.

[220]
B. Engquist and W. Schmid. Mathematics Unlimited - 2001 and Beyond. Springer-Verlag, 2001.

[221]
A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone. Handbook of Applied Cryptography. CRC Press, 1997.

[222]
D. R. Stinson. Cryptography Theory and Practice. CRC Press, 1995.

[223]
E. Mendelson. Introduction to Mathematical Logic. Chapman & Hall, 1997.

[224]
E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. The MIT Press, 2000.

[225]
B. Schneier. Applied Cryptography. John Wiley & Sons, 1996.

[226]
G. S. Shedler. Regenerative Stochastic Simulation. Academic Press, 1993.

[227]
A. S. Troelstra and H. Schwichtenberg. Basic Proof Theory. Cambridge University Press, 2000.

[228]
C. G. Cassandras and S. Lafortune. Introduction to Discrete Event Systems. Kluwer Academic Publishers, 1999.

[229]
C. Pidgeon. Advanced Tutorials for the Biomedical Sciences. Wiley - UCH, 1996.

[230]
L. C. Paulson. ML for the Working Programmer. Cambridge University Press, 2000.

[231]
D. M. Gabbay and M. de Rijke. Frontiers of Combining Systems 2. Research Studies Press, 2000.

[232]
V. Arnold. Mathematics: Frontiers and Perspectives. American Mathematical Society, 2000.

[233]
R. L. Epstein and W. A. Carnielli. Computability: Computable Functions, Logic and the Foundations of Mathematics. Wadsworth, 2000.

[234]
W. A. Carnielli and I. M. L. D'Ottaviano. Advances in Contemporary Logic and Computer Science. American Mathematical Society, 1999.

[235]
R. Bird and O. de Moor. Algebra of Programming. Prentice-Hall, 1997.

[236]
L. Viganò. Labelled Non-Classical Logics. Kluwer Academic Publishers, 2000.

[237]
R. Greenlaw and J. H. Hoover. Fundamentals of the Theory of Computation - Principles and Practice. Morgan Kaufmann, 1998.

[238]
E. Behrends. Introduction to Markov Chains. Vieweg, 2000.

[239]
J. Tiuryn. Foundations of Software Science and Computation Structures. Springer-Verlag, 2000.

[240]
G. Smolka. Programming Languages and Systems. Springer-Verlag, 2000.

[241]
M. Downward. Logic and Declarative Language. Taylor & Francis, 1998.

[242]
D. M. Clark and B. A. Davey. Natural Dualities for the Working Algebraist. Cambridge University Press, 1998.

[243]
G. F. Lawler and L. N. Coyle. Lectures on Contemporary Probability. American Mathematical Society, 1999.

[244]
G. Hommel. Communication-based Systems. Kluwer Academic Publishers, 2000.

[245]
K.-I Ko. Complexity Theory of Real Functions. Birkhäuser, 1991.

[246]
G. Paun, G. Rozenberg, and A. Salomaa. DNA Computing. Springer-Verlag, 1998.

[247]
E. Bach and J. Shallit. Algorithmic Number Theory - Volume 1. The MIT Press, 1996.

[248]
L. Blum, F. Cucker, M. Shub, and S. Smale. Complexity and Real Computation. Springer-Verlag, 1998.

[249]
M. S. Waterman. Introduction to Computational Biology - Maps, Sequences and Genomes. Chapman & Hall/CRC, 2000.

[250]
I. Claßen, H. Ehrig, and D. Wolz. Algebraic Specification Techniques and Tools for Software Development. World Scientific, 1993.

[251]
M. R. Garey and D. S. Johnson. Computers and Intractability - A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1999.

[252]
A. S. Troelstra and H. Schwichtenberg. Basic Proof Theory. Cambridge University Press, 1996.

[253]
s.n. O livro Branco do Desenvolvimento Científico e Tecnológico Português. Ministério da Ciência e da Tecnologia, 1999.

[254]
H. F. Cervone. Solaris Performance Administration. McGraw-Hill, 1998.

[255]
K. G. Larsen, S. Skyum, and G. Winskel. Automata, Languages and Programming. Springer-Verlag, 1998.

[256]
F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.

[257]
H. Wansing. Displaying Modal Logic. Kluwer Academic Publishers, 1998.

[258]
M. Marx, L. Pólos, and M. Masuch. Arrow Logic and Multi-Modal Logic. CSLI Publications, 1996.

[259]
R. Sedgewick. Algorithms Third Edition in C. Addison-Wesley, 1998.

[260]
E. S. Roberts. The Art and Science of C. Addison-Wesley, 1995.

[261]
H. Gould and J. Tobochnick. An Introduction to Computer Simulation Methods. Addison-Wesley, 1996.

[262]
D. C. Kozen. Automata and Computability. Springer-Verlag, 1997.

[263]
R. V. Kadison and J. R. Ringrose. Fundamentals of the Theory of Operator Algebras - Volume II: Advanced Theory. American Mathematical Society, 1997.

[264]
R. V. Kadison and J. R. Ringrose. Fundamentals of the Theory of Operator Algebras - Volume I: Elementary Theory. American Mathematical Society, 1997.

[265]
D. Harel. Algorithmics - The Spirit of Computing. Addison-Wesley, 1992.

[266]
S. de Harrie. Automated Reasoning with Analytic Tableaux and Related Methods. Springer-Verlag, 1998.

[267]
M. R. Holmes. Elementary Set Theory with a Universal Set. Bruylant-Academia, 1998.

[268]
M. Mitchell. An Introduction to Genetic Algorithms. The MIT Press, 1996.

[269]
K. Truemper. Effective Logic Computation. John Wiley & Sons, 1998.

[270]
R. Milner. Communication and Concurrency. Prentice-Hall, 1989.

[271]
M. Li and P. Vitányi. An Introduction to Kolmogorov Complexity and its Applications. Springer-Verlag, 1997.

[272]
D. C. Kozen. The Design and Analysis of Algorithms. Springer-Verlag, 1992.

[273]
L. Blum, F. Cucker, M. Shub, and S. Smale. Complexity and Real Computation. Springer-Verlag, 1998.

[274]
O. Burkart. Automatic Verification of Sequential Infinite-State Processes. Springer-Verlag, 1997.

[275]
G. L. Steele JR. Common Lisp. Digital Press, 1990.

[276]
J. Barwise and L. Moss. Vicious Circles. CSLI Publications, 1996.

[277]
G. Boolos. The Logic of Provability. Cambridge University Press, 1996.

[278]
P. T. Johnstone. Notes on Logic and Set Theory. Cambridge University Press, 1992.

[279]
D. Lind and B. Marcus. An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, 1995.

[280]
A. A. Fraenkel, Y. Bar-Hillel, and A. Levy. Foundations of Set Theory. North-Holland, 1984.

[281]
V. W. Marek and M. Truszczynski. Nonmonotonic Logic: Context - Dependent Reasoning. Springer-Verlag, 1993.

[282]
K. Itô. Encyclopedic Dictionary of Mathematics Volume II. The MIT Press, 1996.

[283]
K. Itô. Encyclopedic Dictionary of Mathematics Volume I. The MIT Press, 1996.

[284]
T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. The MIT Press, 1994.

[285]
s.n. MathLink Reference Guide. Wolfram Research, 1993.

[286]
s.n. Guide to Standard Mathematica Packages - Version 2.2. Wolfram Research, 1993.

[287]
R. Wójcicki. Theory of Logical Calculi. Kluwer Academic Publishers, 1988.

[288]
V. J. Rayward-Smith. A First Course in Computability. McGraw-Hill, 1995.

[289]
R. Fraïssé. Course of Mathematical Logic Volume 2. D. Reidel Publishing Company, 1974.

[290]
R. Fraïssé. Course of Mathematical Logic Volume 1. D. Reidel Publishing Company, 1974.

[291]
L. Bolc and A. Szaas. Time & Logic. UCL Press, 1995.

[292]
J. V. Guttag and J. J. Horning. Larch: Languages and Tools for Formal Specification. Springer-Verlag, 1993.

[293]
J. R. Norris. Markov Chains. Cambridge University Press, 1997.

[294]
F. W. Lawvere and S. H. Schanuel. Conceptual Mathematics - A First Introduction to Categories. Cambridge University Press, 1997.

[295]
R. Fagin, J. Y. Halpern, Y. Moses, and M. Y. Vardi. Reasoning about Knowledge. The MIT Press, 1995.

[296]
J. R. Shoenfield. Recursion Theory. Springer-Verlag, 1993.

[297]
H. Wansing. Proof Theory of Modal Logic. Kluwer Academic Publishers, 1996.

[298]
V. Stoltenberg-Hansen, I. Lindström, and E. R. Griffor. Mathematical Theory of Domains. Cambridge University Press, 1994.

[299]
Z. Adamowicz and P. Zbierski. Logic of Mathematics. John Wiley & Sons, 1997.

[300]
C. Schumacher. Chapter Zero - Fundamental Notions of Abstract Mathematics. Addison-Wesley, 1996.

[301]
J. Krajícek. Bounded Arithmetic, Propositional Logic, and Complexity Theory. Cambridge University Press, 1995.

[302]
M. Haveraaen, O. Owe, and O.-J. Dahl. Recent Trends in Data Type Specification. Springer-Verlag, 1995.

[303]
D. H. Pitt, A. Poigné, and D. E. Rydeheard. Category Theory and Computer Science. Springer-Verlag, 1987.

[304]
L. C. Paulson. Isabelle - A Generic Theorem Prover. Springer-Verlag, 1994.

[305]
J. A. C. P. Leite. Logic Program Updates. Universidade Nova de Lisboa - Departamento de Informática, 1997.

[306]
K. Doets. Basic Model Theory. CSLI Publications, 1996.

[307]
V. V. Rybakov. Admissibility of Logical Inference Rules. Elsevier, 1997.

[308]
P. Odifreddi. Classical Recursion Theory. North-Holland, 1992.

[309]
D. Solow. How to Read and Do Proofs. John Wiley & Sons, 1990.

[310]
G. Rozenberg and A. Salomaa. Cornerstones of Undecidability. Prentice-Hall, 1994.

[311]
J. Kelly. The Essence of Logic. Prentice-Hall, 1997.

[312]
J. P. Cleave. A Study of Logics. Oxford University Press, 1991.

[313]
S. N. Burris. Logic for Mathematics and Computer Science. Prentice-Hall, 1998.

[314]
M. Nivat. Foundations of Software Science and Computation Structures. Springer-Verlag, 1998.

[315]
M. G. Peretyat'kin. Finitely Axiomatizable Theories. Plenum Publishing Corporation, 1997.

[316]
s.n. Mathematica: User's Guide for the Macintosh. Wolfram Research, 1994.

[317]
S. Wolfram. The Mathematica Book. Wolfram Research, 1996.

[318]
I. S. Graham. The Html Sourcebook. John Wiley & Sons, 1995.

[319]
C. Smith and N. Blachman. The Mathematica Graphics Guidebook. Addison-Wesley, 1995.

[320]
R. E. Crandall. Mathematica for the Sciences. Addison-Wesley, 1991.

[321]
J. A. Goguen and G. Malcolm. Algebraic Semantics of Imperative Programs. The MIT Press, 1996.

[322]
L. E. Sanchis. Set Theory - An Operational Approach. Gordon and Breach Science Publishers, 1996.

[323]
H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer-Verlag, 1995.

[324]
M. D. P. M. Marques. Differential Inclusions in Nonsmooth Mechanical Problems. Birkhäuser, 1993.

[325]
A. M. Ungar. Normalization, Cut-Elimination and the Theory of Proofs. CSLI Publications, 1992.

[326]
P. Bürgisser, M. Clausen, and M. A. Shokrollahi. Algebraic Complexity Theory. Springer-Verlag, 1997.

[327]
M. Fitting. First-Order Logic and Automated Theorem Proving. Springer-Verlag, 1996.

[328]
J. Adámek and V. Trnková. Automata and Algebras in Categories. Kluwer Academic Publishers, 1990.

[329]
J. Chomicki and G. Saake. Logics for Databases and Information Systems. Kluwer Academic Publishers, 1998.

[330]
C. Lengauer, M. Griebl, and S. Gorlatch. Euro-Par'97 - Parallel Processing. Springer-Verlag, 1997.

[331]
P. Cointe. ECOOP'96 - Object-Oriented Programming. Springer-Verlag, 1996.

[332]
V. Diekert and G. Rozenberg. The Book of Traces. World Scientific, 1995.

[333]
N. A. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996.

[334]
E. Best. Semantics of Sequential and Parallel Programs. Prentice-Hall, 1996.

[335]
C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.

[336]
J. C. Bradfield. Verifying Temporal Properties of Systems. Birkhäuser, 1992.

[337]
N. M. Martin and S. Pollard. Closure Spaces and Logic. Kluwer Academic Publishers, 1996.

[338]
J. W. de Bakker, C. Huizing, W. P. de Roever, and G. Rozenberg. Real-Time: Theory in Practice. Springer-Verlag, 1992.

[339]
M. Metcalf and J. Reid. Fortran 90/95 Explained. Oxford University Press, 1996.

[340]
R. Turner. Constructive Foundations for Functional Languages. McGraw-Hill, 1991.

[341]
s.n. Microsoft Excel - Funções e Macros. Microsoft Corporation, 1990.

[342]
C. McLarty. Elementary Categories, Elementary Toposes. Oxford University Press, 1995.

[343]
P. B. Andrews. An Introduction to Mathematical Logic and Type Theory: to Truth through Proof. Academic Press, 1986.

[344]
H.-D. Ebbinghaus, J. Flum, and W. Thomas. Mathematical Logic. Springer-Verlag, 1996.

[345]
E. Börger, E. Grädel, and Y. Gurevich. The Classical Decision Problem. Springer-Verlag, 1997.

[346]
D. M. Gabbay. What is a Logical System? Oxford University Press, 1994.

[347]
C. A. Gunter and J. C. Mitchell. Theoretical Aspects of Object-Oriented Programming. The MIT Press, 1994.

[348]
G. Agha, P. Wegner, and A. Yonezawa. Research Directions in Concurrent Object-Oriented Programming. The MIT Press, 1993.

[349]
R. Maeder. Programming in Mathematica. Addison-Wesley, 1991.

[350]
R. J. Gaylord, S. N. Kamin, and P. R. Wellin. An Introduction to Programming with Mathematica. Springer-Verlag, 1996.

[351]
S. Wolfram. Mathematica - A system for Doing Mathematics by Computer. Addison-Wesley, 1993.

[352]
M. Manzano. Extensions of First Order Logic. Cambridge University Press, 1996.

[353]
I. Parberry. Circuit Complexity and Neural Networks. The MIT Press, 1994.

[354]
L. Aceto. Action refinement in process algebras. Cambridge University Press, 1992.

[355]
Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems. Springer-Verlag, 1995.

[356]
F. Baader and K. U. Schulz. Frontiers of Combining Systems. Kluwer Academic Publishers, 1996.

[357]
T. B. Bahder. Mathematica for Scientists and Engineers. Addison-Wesley, 1995.

[358]
S. Cook and J. Daniels. Designing Object Systems. Prentice-Hall, 1994.

[359]
C. Morgan. Programming from Specifications. Prentice-Hall, 1994.

[360]
C. Morgan and T. Vickers. On the Refinement Calculus. Springer-Verlag, 1994.

[361]
J. G. Oxley. Matroid Theory. Oxford University Press, 1992.

[362]
A. Kanamori. The Higher Infinite. Springer-Verlag, 1997.

[363]
D. P. Friedman and M. Felleisen. The Little Lisper. McMillan Publishing Company, 1989.

[364]
M. Shanahan. Solving the Frame Problem. The MIT Press, 1997.

[365]
Z. Luo. Computation and Reasoning. Oxford University Press, 1994.

[366]
J. W. Gray. Mastering Mathematica. Academic Press, 1994.

[367]
R. J. Wieringa and R. B. Feenstra. Information Systems - Correctness and Reusability. World Scientific, 1995.

[368]
R. Maeder. The Mathematica Programmer. Academic Press, 1994.

[369]
G. Baumann. Mathematica in Theoretical Physics. Springer-Verlag, 1996.

[370]
R. J. Gaylord and P. R. Wellin. Computer Simulations with Mathematica. Springer-Verlag, 1995.

[371]
V. W. Marek and M. Truszczynski. Nonmonotonic Logic - Context Dependent Reasoning. Springer-Verlag, 1993.

[372]
M. Johnson. Algebraic Methodology and Software Technology. Springer-Verlag, 1997.

[373]
J. M. Font and R. Jansana. A General Algebraic Semantics for Sentencial Logics. Springer-Verlag, 1996.

[374]
A. Grzegorczyk. An Outline of Mathematical Logic. D. Reidel Publishing Company, 1974.

[375]
J.-L. Krivine. Introduction to Axiomatic Set Theory. D. Reidel Publishing Company, 1971.

[376]
W. Pohlers. Proof Theory - An Introduction. Springer-Verlag, 1994.

[377]
G. E. Hughes and M. J. Cresswell. A New Introduction to Modal Logic. Routledge, 1996.

[378]
Z. Michalewicz. Genetic Algorithms+Data Structures=Evolution Programs. Springer-Verlag, 1996.

[379]
E. Burke and E. Foxley. Logic and its Applications. Prentice-Hall, 1996.

[380]
A. Robinson. Non-Standard Analysis. Princeton University Press, 1996.

[381]
R. F. C. Walters. Categories and Computer Science. Cambridge University Press, 1991.

[382]
M. Makkai. Duality and Definability in First Order Logic. American Mathematical Society, 1993.

[383]
R. Hähnle. Automated Deduction in Multiple Logics. Oxford University Press, 1993.

[384]
G. R. R. R. Gill. Deducibility & Decidability. Routledge, 1990.

[385]
J. T. Baldwin. Fundamentals of Stability Theory. Springer-Verlag, 1988.

[386]
P. Antsaklis, W. Kohn, A. Nerode, and S. Sastry. Hybrid Systems IV. Springer-Verlag, 1997.

[387]
R. Alur, T. A. Henzinger, and E. D. Sontag. Hybrid Systems III. Springer-Verlag, 1996.

[388]
P. Antsaklis, W. Kohn, A. Nerode, and S. Sastry. Hybrid Systems II. Springer-Verlag, 1995.

[389]
R. L. Grossman, A. Nerode, A. P. Ravn, and H. Rischel. Hybrid Systems. Springer-Verlag, 1993.

[390]
R. I. Soare. Recursively Enumerable Sets and Degrees. Springer-Verlag, 1987.

[391]
A. Chagrov and M. Zakharyaschev. Modal Logic. Oxford University Press, 1997.

[392]
N. D. Jones. Computability and Complexity from a Programming Perspective. The MIT Press, 1997.




File translated from TEX by TTH, version 2.78.
On 6 Dec 2006, 16:47.