Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book introduces the notions and methods of formal logic from a computer science standpoint, covering propositional logic, predicate logic, and foundations of logic programming. It presents applications and themes of computer science research such as resolution, automated deduction, and logic programming in a rigorous but readable way. The style and scope of the work, rounded out by the inclusion of exercises, make this an excellent textbook for an advanced undergraduate course in logic for computer scientists. This is a short introductory book on the topic of propositional and first-order logic, with a bias towards computer scientists…. Schöning decides to concentrate on computational issues, and gives us a short book (less than 170 pages) with a tight storyline…. I found this a nicely written book with many examples and exercises (126 of them). The presentation is natural and easy to follow…. This book seems suitable for a short course, a seminar series, or part of a larger course on Prolog and logic programming, probably at the advanced undergraduate level. — SIGACT News Contains examples and 126 interesting exercises which put the student in an active reading mode.... Would provide a good university short course introducing computer science students to theorem proving and logic programming. — Mathematical Reviews This book concentrates on those aspects of mathematical logic which have strong connections with different topics in computer science, especially automated deduction, logic programming, program verification and semantics of programming languages.... The numerous exercises and illustrative examples contribute a great extent to a better understanding of different concepts and results. The book can be successfully used as a handbook for an introductory course in artificial intelligence. — Zentralblatt MATH.

Programming --- Computer science --- Mathematical logic --- Logic, Symbolic and mathematical. --- Logic programming. --- Computer science. --- Mathematical Logic and Formal Languages. --- Mathematical Logic and Foundations. --- Algebra of logic --- Logic, Universal --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Informatics --- Science --- Mathematical logic. --- Logique mathématique --- Programmation logique --- Logique des prédicats

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Computability theory --- Functions, Computable --- Partial recursive functions --- Recursive functions, Partial --- Decidability (Mathematical logic) --- Computable functions --- Logic, symbolic and mathematical --- Logic, Symbolic and mathematical --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Constructive mathematics --- Logique mathématique --- Récursivité, Théorie de la --- Logique mathematique --- Calculabilite

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Lexicology. Semantics --- Grammar, Comparative and general --- Semantics (Philosophy) --- Logic, Symbolic and mathematical. --- Quantifiers. --- Grammar [Comparative and general ] --- Quantifiers --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Intension (Philosophy) --- Logical semantics --- Semantics (Logic) --- Semeiotics --- Significs --- Syntactics --- Unified science --- Language and languages --- Logic, Symbolic and mathematical --- Logical positivism --- Meaning (Psychology) --- Philosophy, Modern --- Semiotics --- Signs and symbols --- Symbolism --- Analysis (Philosophy) --- Definition (Philosophy) --- Quantifiers (Linguistics) --- Linguistics --- Philology --- Grammar, Comparative and general - Quantifiers.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

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, and to the theory of formal languages and complexity theory. Apart from considering the fundamental themes

Berekeningen [Ingewikkeldheid van ] --- Calcul [Complexité de ] --- Complexité de calcul --- Computable functions --- Computational complexity --- Fonctions recurrentes --- Functies [Rekenkundige ] --- Ingewikkeldheid van berekeningen --- Logic [Symbolic and mathematical ] --- Logica [Symbolische en wiskundige ] --- Logique symbolique et mathémathique --- Logic, Symbolic and mathematical --- Fonctions calculables --- Complexité de calcul (Informatique) --- Logique symbolique et mathématique --- Computational Complexity --- Logic, symbolic and mathematical --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Complexity, Computational --- Electronic data processing --- Machine theory --- Computability theory --- Functions, Computable --- Partial recursive functions --- Recursive functions, Partial --- Constructive mathematics --- Decidability (Mathematical logic) --- Computable functions. --- Computational complexity. --- Logic, Symbolic and mathematical.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This volume contains the papers which were presented at the second workshop "Computer Science Logic" held in Duisburg, FRG, October 3-7, 1988. These proceedings cover a wide range of topics both from theoretical and applied areas of computer science. More specifically, the papers deal with problems arising at the border of logic and computer science: e.g. in complexity, data base theory, logic programming, artificial intelligence, and concurrency. The volume should be of interest to all logicians and computer scientists working in the above fields.

Computer science --- 681.3*H2 --- 681.3*D3 --- 681.3*F --- 681.3*I1 --- 681.3*I2 --- Database management: security; integrity; protection--See also {?681.5*E5} --- Programming languages --- Theory of computation --- Algebraic manipulation (Computing methodologies) --- Artificial intelligence. AI --- 681.3*I2 Artificial intelligence. AI --- 681.3*I1 Algebraic manipulation (Computing methodologies) --- 681.3*F Theory of computation --- 681.3*D3 Programming languages --- 681.3*H2 Database management: security; integrity; protection--See also {?681.5*E5} --- Computer network architectures. --- Logic, Symbolic and mathematical. --- Computer science. --- Logic design. --- Combinatorics. --- Computer System Implementation. --- Mathematical Logic and Foundations. --- Programming Languages, Compilers, Interpreters. --- Logics and Meanings of Programs. --- Mathematical Logic and Formal Languages. --- Combinatorics --- Algebra --- Mathematical analysis --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Machine theory --- Switching theory --- Informatics --- Science --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Architectures, Computer network --- Network architectures, Computer --- Computer architecture