Narrow your search

Library

ULiège (5)

UCLouvain (3)

KU Leuven (2)

UGent (2)

ULB (2)

UAntwerpen (1)

UHasselt (1)

UMons (1)

UNamur (1)


Resource type

book (5)


Language

English (5)


Year
From To Submit

2004 (5)

Listing 1 - 5 of 5
Sort by
Mass terms : some philosophical problems
Author:
ISBN: 9781402032653 Year: 2004 Publisher: New-York : Springer-Verlag,

A first course in logic : an introduction to model theory, proof theory, computability, and complexity
Author:
ISBN: 0198529805 0198529813 9780198529811 Year: 2004 Publisher: Oxford ; New York : Oxford University Press,

Loading...
Export citation

Choose an application

Bookmark

Abstract

The ability to reason and think in a logical manner forms the basis of learning for most mathematics, computer science, philosophy and logic students. Based on the author's teaching notes at the University of Maryland and aimed at a broad audience, this text covers the fundamental topics in classical logic in an extremely clear, thorough and accurate style that is accessible to all the above. Covering propositional logic, first-order logic, and second-order logic, as well as proof theory, computability theory, and model theory, the text also contains numerous carefully graded exercises and is ideal for a first or refresher course.


Book
Complexity of computations and proofs
Author:
ISBN: 8879994131 Year: 2004 Publisher: Roma : Aracne,

Logics in Artificial Intelligence : 9th European Conference, JELIA 2004, Lisbon, Portugal, September 27-30, 2004, Proceedings
Authors: --- --- ---
ISSN: 03029743 ISBN: 3540232427 3540302271 9783540232421 Year: 2004 Volume: 3229 Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Keywords

Artificial intelligence --- Logic, Symbolic and mathematical --- Intelligence artificielle --- Logique mathématique --- Computer Science --- Engineering & Applied Sciences --- 681.3*I20 --- Artificial intelligence (AI) in general; cognitive simulation; philosophical foundations --- 681.3*I20 Artificial intelligence (AI) in general; cognitive simulation; philosophical foundations --- Computer science. --- Computer programming. --- Mathematical logic. --- Artificial intelligence. --- Computer Science. --- Artificial Intelligence (incl. Robotics). --- Programming Techniques. --- Mathematical Logic and Formal Languages. --- Computers --- Electronic computer programming --- Electronic data processing --- Electronic digital computers --- Programming (Electronic computers) --- Coding theory --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Logic machines --- Machine theory --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Informatics --- Science --- Programming --- Artificial Intelligence. --- Logique mathématique. --- Artificial intelligence - Congresses --- Logic, Symbolic and mathematical - Congresses

Logic in computer science : modelling and reasoning about systems
Authors: ---
ISBN: 052154310X 9780521543101 Year: 2004 Publisher: Cambridge : Cambridge University Press,

Loading...
Export citation

Choose an application

Bookmark

Abstract

The second edition of this successful textbook continues to provide a clear introduction to formal reasoning relevant to the needs of modern computer science and sufficiently exacting for practical applications. Improvements have been made throughout with many new and expanded text sections. The coverage of model-checking has been substantially updated and additional exercises are included. Internet support includes worked solutions for teacher exercises and model solutions to some student exercises. First Edition Hb (2000): 0-521-65200-6 First Edition Pb (2000): 0-521-65602-8

Keywords

Computer logic --- Logic programming (Computer science) --- Computer logic. --- Logic programming. --- Logic programming (Computer science). --- Logique informatique --- 681.3*F11 <043> --- Models of computation: automata bounded action devices computability theory relations among models self-modifying machines unbounded-action devices--See also {681.3*F41}--Dissertaties --- 681.3*F11 <043> Models of computation: automata bounded action devices computability theory relations among models self-modifying machines unbounded-action devices--See also {681.3*F41}--Dissertaties --- 681.3*F41 Mathematical logic: computability theory computational logic lambda calculus logic programming mechanical theorem proving model theory proof theoryrecursive function theory--See also {681.3*F11} {681.3*I22} {681.3*I23} --- Mathematical logic: computability theory computational logic lambda calculus logic programming mechanical theorem proving model theory proof theoryrecursive function theory--See also {681.3*F11} {681.3*I22} {681.3*I23} --- 681.3*F11 Models of computation: automata bounded action devices computability theory relations among models self-modifying machines unbounded-action devices--See also {681.3*F41} --- Models of computation: automata bounded action devices computability theory relations among models self-modifying machines unbounded-action devices--See also {681.3*F41} --- computermodel --- 681.3*F41 Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- 681.3*F11 Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Logic programming --- 681.3*F11 <043> Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41}--Dissertaties --- Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41}--Dissertaties --- Computer programming --- Computer science logic --- Logic, Symbolic and mathematical --- 681.3*F11 --- 681.3*F41 --- computerarchitectuur --- kunstmatige intelligentie (artificiële intelligentie) --- Computer science --- Mathematical logic --- Computer programs --- Logiciels --- Verification --- Vérification --- Informatique --- Logique mathématique --- Logique mathématique --- Vérification

Listing 1 - 5 of 5
Sort by