Logic: Mathematics, Language, Computer Science and Philosophy: Vol. II Logic and Computer Science - Couverture souple
Synopsis
In Logic Programming (25 and 26) the language of logic is used as a declarative programming language. Prolog uses resolution as its underlying proof mechanism. The logical structure of relational databases is explained (27) in set theoretical terms and it is shown how the language of set theory can be used as a Structured Query Language (SQL). Computability, Undecidability and Complexity are treated in sections 28, 29, and 30, respectively, in terms of Turing machines. The undecidability of the validity problem for predicate logic and the NP-completeness of the satisfiability problem for propositional logic are shown in a similiar way. Chomsky's notion of grammar and its relation to the notion of automation is presented in section 31. Both untyped and typed lambda calculus are treated in sections 32 and 33, respectively. The role epistemic logic can play in the description of distributed systems is explained (34). In section 35 and 36, temporal logic is used both for verification by hand and for automatic verification. A tableaux-based automated theorem prover for classical logic is elaborated in the Appendix. Each section ends with a number of exercises ; the answers can be found at the end of this book.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
À propos de l?auteur
The Author : H.C.M. de Swart, born in 1944, studied Mathematics and Physics at Nijmegen University. His Ph.D. thesis was on intuitionistic Logic (1976). He spent the academic year 1976/1977 as a Visiting Fellow at Princeton University. His appointment as professor in Logic and Philosophy of language at Tilburg University followed in 1980. He is author or co-author of several books in Dutch : Sets (1975), Symbolic Logic (1976), Philosophy of Mathematics (1989) and The Theory of Social Choice (1992). He has published in several international journals on, among other subjets, intuitionism, tableaux and orderings.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Résultats de recherche pour Logic: Mathematics, Language, Computer Science and...
Image fournie par le vendeur
Logic: Mathematics, Language, Computer-Science and Philosophy. Vol. II: Logic and Computer Science.
Edité par
Frankfurt am Main, Lang, 1994
ISBN 10 : 363145435X
ISBN 13 : 9783631454350
Ancien ou d'occasion
Couverture rigide
Vendeur : Antiquariat Thomas Haker GmbH & Co. KG, Berlin, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. XII, 337 S.; with figures. Ex.-Libr., Good condition. Additional cover folation. Sprache: Englisch Gewicht in Gramm: 695. N° de réf. du vendeur 808141
Acheter D'occasion
EUR 14,08
Frais de port :
EUR 75
De Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Logic: Mathematics, Language, Computer-Science and Philosophy. Vol. I: Mathematics, Language and Philosophy.
Edité par
Frankfurt am Main, Lang, 1993
ISBN 10 : 363145435X
ISBN 13 : 9783631454350
Ancien ou d'occasion
Couverture rigide
Vendeur : Antiquariat Thomas Haker GmbH & Co. KG, Berlin, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. 577 S.; with figures. Ex.-Libr., Good condition. Additional cover folation. Sprache: Englisch Gewicht in Gramm: 970. N° de réf. du vendeur 808142
Acheter D'occasion
EUR 19,12
Frais de port :
EUR 75
De Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Logic: Mathematics, Language, Computer Science and Philosophy
impression à la demandeVendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -In Logic Programming ( 25 and 26) the language of logic is used as a declarative programming language. Prolog uses resolution as its underlying proof mechanism. The logical structure of relational databases is explained ( 27) in set theoretical terms and it is shown how the language of set theory can be used as a Structured Query Language (SQL). Computability, Undecidability and Complexity are treated in sections 28, 29, and 30, respectively, in terms of Turing machines. The undecidability of the validity problem for predicate logic and the NP-completeness of the satisfiability problem for propositional logic are shown in a similiar way. Chomsky's notion of grammar and its relation to the notion of automation is presented in section 31. Both untyped and typed lambda calculus are treated in sections 32 and 33, respectively. The role epistemic logic can play in the description of distributed systems is explained ( 34). In section 35 and 36, temporal logic is used both for verification by hand and for automatic verification. A tableaux-based automated theorem prover for classical logic is elaborated in the Appendix. Each section ends with a number of exercises; the answers can be found at the end of this book. 337 pp. Englisch. N° de réf. du vendeur 9783631454350
Acheter neuf
EUR 78,95
Frais de port :
EUR 23
De Allemagne vers Etats-Unis
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Logic: Mathematics, Language, Computer Science and Philosophy
impression à la demandeVendeur : moluna, Greven, Allemagne
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. In Logic Programming ( 25 and 26) the language of logic is used as a declarative programming language. Prolog uses resolution as its underlying proof mechanism. The logical structure of relational databases is explained ( 27) in set theoretical terms and it. N° de réf. du vendeur 133219877
Acheter neuf
EUR 78,95
Frais de port :
EUR 48,99
De Allemagne vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Logic: Mathematics, Language, Computer Science and Philosophy
Edité par
Peter Lang, Peter Lang Mai 1994, 1994
ISBN 10 : 363145435X
ISBN 13 : 9783631454350
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -In Logic Programming ( 25 and 26) the language of logic is used as a declarative programming language. Prolog uses resolution as its underlying proof mechanism. The logical structure of relational databases is explained ( 27) in set theoretical terms and it is shown how the language of set theory can be used as a Structured Query Language (SQL). Computability, Undecidability and Complexity are treated in sections 28, 29, and 30, respectively, in terms of Turing machines. The undecidability of the validity problem for predicate logic and the NP-completeness of the satisfiability problem for propositional logic are shown in a similiar way. Chomsky's notion of grammar and its relation to the notion of automation is presented in section 31. Both untyped and typed lambda calculus are treated in sections 32 and 33, respectively. The role epistemic logic can play in the description of distributed systems is explained ( 34). In section 35 and 36, temporal logic is used both for verification by hand and for automatic verification. A tableaux-based automated theorem prover for classical logic is elaborated in the Appendix. Each section ends with a number of exercises; the answers can be found at the end of this book.Lang, Peter GmbH, Gontardstraße 11, 10178 Berlin 352 pp. Englisch. N° de réf. du vendeur 9783631454350
Acheter neuf
EUR 78,95
Frais de port :
EUR 60
De Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Logic: Mathematics, Language, Computer Science and Philosophy : Vol. II Logic and Computer Science
Edité par
Peter Lang, Peter Lang, 1994
ISBN 10 : 363145435X
ISBN 13 : 9783631454350
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - In Logic Programming ( 25 and 26) the language of logic is used as a declarative programming language. Prolog uses resolution as its underlying proof mechanism. The logical structure of relational databases is explained ( 27) in set theoretical terms and it is shown how the language of set theory can be used as a Structured Query Language (SQL). Computability, Undecidability and Complexity are treated in sections 28, 29, and 30, respectively, in terms of Turing machines. The undecidability of the validity problem for predicate logic and the NP-completeness of the satisfiability problem for propositional logic are shown in a similiar way. Chomsky's notion of grammar and its relation to the notion of automation is presented in section 31. Both untyped and typed lambda calculus are treated in sections 32 and 33, respectively. The role epistemic logic can play in the description of distributed systems is explained ( 34). In section 35 and 36, temporal logic is used both for verification by hand and for automatic verification. A tableaux-based automated theorem prover for classical logic is elaborated in the Appendix. Each section ends with a number of exercises; the answers can be found at the end of this book. N° de réf. du vendeur 9783631454350
Acheter neuf
EUR 78,95
Frais de port :
EUR 62,28
De Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)