Logic for Computer Science
The book "Logic for Computer Science" by Andrzej Szalas provides an in-depth discussion of several logical systems located at the heart of computer science. This in-depth PDF gives the basics—introducing the reader to some logics—leading to a very solid foundation on the Propositional Calculus and the Predicate Calculus. It goes on to show the application of these logics to automated deduction as both Propositional and Predicate Calculus. The text by this token goes further to illustrate advanced topics, including Second-Order Logic, Second-Order Quantifier Elimination, and Modal Logics. This text also goes on to consider Temporal Logic, Logics of Programs, and Fixpoint Calculus and demonstrates how these notions are used both theoretically and practically in the area of computing. With its breadth, this resource is invaluable in understanding the theoretical underpinnings of computer science and their practical applications in the areas of software development and automated reasoning.
Author(s): Andrzej Szalas
125 Pages 
Introduction to Theoretical Computer Science
Introduction to Theoretical Computer Science by Boaz Barak provides an overview of some basic notions. This voluminous note starts with serious foundational mathematics needed to understand the intricacies of computation. Among several models of computation and their representations, he deals with finite and uniform computations. Key topics: It presents efficient algorithms which are essential in solving practical problems and randomized computation, one of whose important features is to bring probabilistic methods into the design of algorithms. Advanced topics broaden the knowledge further towards recent research and trends. This note is intended for students and professionals at large who wish to have a rigorous introduction to theoretical aspects and their practical applications in computer science.
Author(s): Boaz Barak
656 Pages
Logic for Computer Science Lecture Notes
This lecture note provides a thorough introduction to the principles of propositional logic, an essential component of computer science. It begins with informal propositional logic and then delves into formal syntax, covering functions defined recursively and their semantics. The notes explore logical connectives and their roles in constructing and evaluating logical statements. Key topics include natural deduction, normal forms, and resolution methods, which are crucial for reasoning about logical propositions and solving logical problems. This resource is ideal for students seeking a solid foundation in propositional logic and its applications in computer science.
Author(s): Alexandru Ioan Cuza University
84 Pages
General computer science Lecture notes
These lecture notes provide broad coverage of general issues in computer science, with an emphasis on discrete mathematics and programming. The topics taught in this course range from representational issues and computation of information, Standard ML, recursion, imperative programming, and encoding of programs as strings. These notes uniquely combine Boolean algebra and propositional logic with the description of machine-oriented calculi such as analytical tableaux and resolution for a wholesome understanding of both the theoretical and practical aspects of computer science.
Author(s): Michael Kohlhase
179 Pages
Mathematics for Computer Science
This is a comprehensive textbook, covering some fundamental mathematical concepts underlying computer science. It starts with basic proofs, induction, and recursion; it proceeds to infinite sets, number theory, and graph theory. Further, it outlines the practical usage in the area of communication networks, along with some aspects of probability theory involving random variables and random walks. This merge of mathematical theory with computer science applications provides an excellent framework upon which students can base their study of algorithms, data structures, and other computational concepts.
Author(s): Eric Lehman, F. Thomson Leighton, Alberty R. Meyer
427 Pages
Computer Science by Dr. Chris Bourke
Dr. Chris Bourke's book provides an extended textbook introduction to many core areas of computer science. It covers the basics of programming: conditionals, loops, functions, and error handling. More advanced topics concern dynamic memory, collections, and file I/ using both procedural and object-oriented approaches. There are chapters on searching and sorting algorithms, graphical user interface design, and database connectivity. This resource serves well as a starting point, either for beginners or intermediate learners, in terms of providing overall depth regarding key concepts and best practices in the subject of programming.
Author(s): Dr. Chris Bourke, Department of Computer Science and Engineering, University of Nebraska
647 Pages
Introduction To Computer System by Tilak Maharashtra Vidyapeeth
Introduction to Computer Systems by Tilak Maharashtra Vidyapeeth presents the fundamental concepts of the computer system. This above PDF describes some important aspects of the computer system: input and output devices, primary and secondary storage devices constituting it. The number system and Boolean algebra have also been explained, which form the basis of logic circuits. It also deals with computer software, programming languages, and program development. It also gives an overview of some popular operating systems, hence enabling the readers to have a broader view on both the hardware and software aspects of computing. This note thus targets serving as an introductory guide for students and individuals that are entering computer systems, hence helping them to develop a solid background in both the theoretical and practical aspects of computing.
Author(s): Tilak Maharashtra Vidyapeeth
109 Pages
