1  5
1. Boolean functions and computation models [2002]
 Clote, Peter.
 Berlin ; New York : Springer, c2002.
 Description
 Book — xiv, 601 p. : ill. ; 25 cm.
 Summary

 1. Boolean Functions
 2. Circuit Lower Bounds
 Circuit Upper Bounds
 4. Randomness and Satisfiability
 5. Propositional Proof Systems
 6. Machine Models and Function Algebras
 7. Higher Types
 References.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Online
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
QA267.7 .C58 2002  Available 
 Clote, Peter.
 Chichester ; New York : John Wiley, c2000.
 Description
 Book — ix, 286 p. : ill. ; 25 cm.
 Summary

 Series Preface
 Preface
 Molecular Biology
 Math Primer
 Sequence Alignment
 All About Eve
 Hidden Markov Models
 Structure Prediction
 Appendix A: Mathematical Background
 Appendix B: Resources
 References
 Index.
 (source: Nielsen Book Data)
 Molecular Biology
 Math Primer
 Sequence Alignment
 All About Eve
 Hidden Markov Models
 Structure Prediction
 Appendices
 References
 Index.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Online
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
QH438.4 .M3 C565 2000  Available 
 New York : Clarendon Press ; Oxford, England ; New York : Oxford University Press, 1993.
 Description
 Book — 428 p.
 Summary

 Preface
 1. Open Problems
 2. Note on the Existence of Most General Semiunifiers
 3. Kreisel's Conjecture for L31 (including a postscript by George Kreisel)
 4. Number of Symbols in Frege Proofs with and without the Deduction Rule
 5. Algorithm for Boolean Formula Evolution and for Tree Contraction
 6. Provably Total Functions in Bounded Arithmetic Theories Ri3, Ui2 and Vi2
 7. On Polynomial Size Frege Proofs of Certain Combinatorial Principles
 8. Interpretability and Fragments of arithmetic
 9. Abbreviating Proofs Using Metamathematical Rules
 10. Open Induction, Tennenbaum Phenomena, and Complexity Theory
 11. Using Herbrandtype Theorems to Separate Strong Fragments of Arithmetic
 12. An Equivalence between Second Order Bounded Domain Bounded Arithmetic and First Order Bounded Arithmetic
 13. Integer Parts of Real Closed Exponential Fields (extended abstract)
 14. Making Infinite Structures Finite in Models of Second Order Bounded Arithmetic
 15. Ordinal Arithmetic in I
 16. RSUV Isomorphism
 17. Feasible Interpretability.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Online
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
QA9.54 .A75 1992  Available 
4. Feasible mathematics II [1995]
 Boston : Birkhäuser, 1995.
 Description
 Book — viii, 447 p. : ill. ; 25 cm.
 Summary

 On the existence of modulo p cardinality functions, Miklos Ajtai
 predicative recursion and the polytime hierarchy, Stephen Bellantoni
 are there hard examples for Frege systems?, Maria Luisa Bonet et al
 Goedel's theorems on lengths of proofs II  lower bounds for recognizing k symbol provability, Samuel R. Buss
 feasibilty categorical Abelian groups, Douglas Cenzer and Jeffrey Remmel
 first order bounded arithmetic and small boolean circiut complexity classes, Peter Clote and Gaisi Takeuti
 parametized computational feasibility, Rodney G. Downey and Micheal R. Fellows
 on proving lower bounds for circuit size, Mauricio Karchmer
 effective properties of finitely generated RE algebras, Bakhadyr Khoussainov and Aail Nerode
 on Frege and extended Frege proof systems, Jan Krajicek
 ramified recurrence and computational complexity I  word recurrence and polytime, Daniel Leivant
 bounded arithmetic and lower bounds in boolean complexity, Alexander A. Razborov
 ordinal bounds for programs, Helmut Schwichtenberg and Stanley S. Wainer
 Turing machine characterizations of feasible functionals of all finite types, Anil Seth
 the complexity of feasible interpretability, Rineke Verbrugge.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
QA267.7 .F433 1995  Available 
 Workshop on Computer Science Logic (14th : 2000 : Fischbachau, Germany)
 Berlin ; New York : Springer, c2000.
 Description
 Book — xiii, 541 p. : ill. ; 24 cm.
 Summary

This book constitutes the refereed proceedings of the 13th International Workshop on Computer Science Logic, CSL 2000, held in Fischbachau, Germany as the 8th Annual Conference of the EACSL in August 2000. The 28 revised full papers presented together with eight invited papers were carefully reviewed and selected by the program committee. Among the topics covered are automated deduction, theorem proving, categorical logic, term rewriting, finite model theory, higher order logic, lambda and combinatory calculi, computational complexity, logic programing, constraints, linear logic, modal logic, temporal logic, model checking, formal specification, formal verification, program transformation, etc.
(source: Nielsen Book Data)
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
QA75.5 .W624 2000  Available 
Articles+
Journal articles, ebooks, & other eresources
Guides
Course and topicbased guides to collections, tools, and services.