Resultado de la búsqueda
117 búsqueda de la palabra clave 'logic'
Refinar búsqueda Generar rss de la búsqueda
Link de la búsquedaMathematical Problems from Applied Logic I / SpringerLink (Online service) ; Dov M. Gabbay ; Sergei S. Goncharov ; Michael Zakharyaschev (2006)
Título : Mathematical Problems from Applied Logic I : Logics for the XXIst Century Tipo de documento: documento electrónico Autores: SpringerLink (Online service) ; Dov M. Gabbay ; Sergei S. Goncharov ; Michael Zakharyaschev Editorial: New York, NY : Springer New York Fecha de publicación: 2006 Colección: International Mathematical Series, ISSN 1571-5485 num. 4 Número de páginas: XXVIII, 348 p. 50 illus Il.: online resource ISBN/ISSN/DL: 978-0-387-31072-5 Idioma : Inglés (eng) Palabras clave: Mathematics Logic Computer logic Mathematical science and Foundations Logics Meanings of Programs Formal Languages Computing Clasificación: 51 Matemáticas Resumen: Mathematical Problems from Applied Logic I presents chapters from selected, world renowned, logicians. Important topics of logic are discussed from the point of view of their further development in light of requirements arising from their successful application in areas such as Computer Science and AI language. An overview of the current state as well as open problems and perspectives are clarified in such fields as non-standard inferences in description logics, logic of provability, logical dynamics and computability theory. The book contains interesting contributions concerning the role of logic today, including some unexpected aspects of contemporary logic and the application of logic. This should be of interest to logicians and mathematicians in general. Contributors include: Franz Baader (Germany) and Ralf Küsters (Germany), Lev Beklemishev (The Netherlands/Russia) and Albert Visser (The Netherlands), Johan van Benthem (The Netherlands/USA), S Barry Cooper (UK), John N Crossley (Australia), Wilfrid A Hodges (UK), and Lawrence S Moss (USA) Nota de contenido: Nonstandard Inferences in Description Logics: The Story So Far -- Problems in the Logic of Provability -- Open Problems in Logical Dynamics -- Computability and Emergence -- Samsara -- Two Doors to Open -- Applied Logic: A Manifesto En línea: http://dx.doi.org/10.1007/0-387-31072-X Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=34779 Mathematical Problems from Applied Logic I : Logics for the XXIst Century [documento electrónico] / SpringerLink (Online service) ; Dov M. Gabbay ; Sergei S. Goncharov ; Michael Zakharyaschev . - New York, NY : Springer New York, 2006 . - XXVIII, 348 p. 50 illus : online resource. - (International Mathematical Series, ISSN 1571-5485; 4) .
ISBN : 978-0-387-31072-5
Idioma : Inglés (eng)
Palabras clave: Mathematics Logic Computer logic Mathematical science and Foundations Logics Meanings of Programs Formal Languages Computing Clasificación: 51 Matemáticas Resumen: Mathematical Problems from Applied Logic I presents chapters from selected, world renowned, logicians. Important topics of logic are discussed from the point of view of their further development in light of requirements arising from their successful application in areas such as Computer Science and AI language. An overview of the current state as well as open problems and perspectives are clarified in such fields as non-standard inferences in description logics, logic of provability, logical dynamics and computability theory. The book contains interesting contributions concerning the role of logic today, including some unexpected aspects of contemporary logic and the application of logic. This should be of interest to logicians and mathematicians in general. Contributors include: Franz Baader (Germany) and Ralf Küsters (Germany), Lev Beklemishev (The Netherlands/Russia) and Albert Visser (The Netherlands), Johan van Benthem (The Netherlands/USA), S Barry Cooper (UK), John N Crossley (Australia), Wilfrid A Hodges (UK), and Lawrence S Moss (USA) Nota de contenido: Nonstandard Inferences in Description Logics: The Story So Far -- Problems in the Logic of Provability -- Open Problems in Logical Dynamics -- Computability and Emergence -- Samsara -- Two Doors to Open -- Applied Logic: A Manifesto En línea: http://dx.doi.org/10.1007/0-387-31072-X Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=34779 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
Título : Logics in Computer Science : A Study on Extensions of Temporal and Strategic Logics Tipo de documento: documento electrónico Autores: Fabio Mogavero ; SpringerLink (Online service) Editorial: Paris : Atlantis Press Fecha de publicación: 2013 Colección: Atlantis Studies in Computing, ISSN 2212-8557 num. 3 Número de páginas: XVII, 149 p Il.: online resource ISBN/ISSN/DL: 978-94-91216-95-4 Idioma : Inglés (eng) Palabras clave: Computer science Algorithms logic Mathematical Science Logics and Meanings of Programs Logic Formal Languages Algorithm Analysis Problem Complexity Clasificación: 51 Matemáticas Resumen: In this monograph we introduce and examine four new temporal logic formalisms that can be used as specification languages for the automated verification of the reliability of hardware and software designs with respect to a desired behavior. The work is organized in two parts. In the first part two logics for computations, the graded computation tree logic and the computation tree logic with minimal model quantifiers are discussed. These have proved to be useful in describing correct executions of monolithic closed systems. The second part focuses on logics for strategies, strategy logic and memoryful alternating-time temporal logic, which have been successfully applied to formalize several properties of interactive plays in multi-entities systems modeled as multi-agent games Nota de contenido: Graded Computation Tree Logic -- Minimal Model Quantifiers -- Reasoning About Strategies -- Relentful Strategic Reasoning -- Appendix A Mathematical Notation En línea: http://dx.doi.org/10.2991/978-94-91216-95-4 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=32655 Logics in Computer Science : A Study on Extensions of Temporal and Strategic Logics [documento electrónico] / Fabio Mogavero ; SpringerLink (Online service) . - Paris : Atlantis Press, 2013 . - XVII, 149 p : online resource. - (Atlantis Studies in Computing, ISSN 2212-8557; 3) .
ISBN : 978-94-91216-95-4
Idioma : Inglés (eng)
Palabras clave: Computer science Algorithms logic Mathematical Science Logics and Meanings of Programs Logic Formal Languages Algorithm Analysis Problem Complexity Clasificación: 51 Matemáticas Resumen: In this monograph we introduce and examine four new temporal logic formalisms that can be used as specification languages for the automated verification of the reliability of hardware and software designs with respect to a desired behavior. The work is organized in two parts. In the first part two logics for computations, the graded computation tree logic and the computation tree logic with minimal model quantifiers are discussed. These have proved to be useful in describing correct executions of monolithic closed systems. The second part focuses on logics for strategies, strategy logic and memoryful alternating-time temporal logic, which have been successfully applied to formalize several properties of interactive plays in multi-entities systems modeled as multi-agent games Nota de contenido: Graded Computation Tree Logic -- Minimal Model Quantifiers -- Reasoning About Strategies -- Relentful Strategic Reasoning -- Appendix A Mathematical Notation En línea: http://dx.doi.org/10.2991/978-94-91216-95-4 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=32655 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
Título : Logic and Structure Tipo de documento: documento electrónico Autores: Dirk van Dalen ; SpringerLink (Online service) Editorial: London : Springer London Fecha de publicación: 2013 Otro editor: Imprint: Springer Colección: Universitext, ISSN 0172-5939 Número de páginas: X, 263 p. 27 illus Il.: online resource ISBN/ISSN/DL: 978-1-4471-4558-5 Idioma : Inglés (eng) Palabras clave: Mathematics Mathematical logic Logic and Foundations Clasificación: 51 Matemáticas Resumen: Dirk van Dalen’s popular textbook Logic and Structure, now in its fifth edition, provides a comprehensive introduction to the basics of classical and intuitionistic logic, model theory and Gödel’s famous incompleteness theorem. Propositional and predicate logic are presented in an easy-to-read style using Gentzen’s natural deduction. The book proceeds with some basic concepts and facts of model theory: a discussion on compactness, Skolem-Löwenheim, non-standard models and quantifier elimination. The discussion of classical logic is concluded with a concise exposition of second-order logic. In view of the growing recognition of constructive methods and principles, intuitionistic logic and Kripke semantics is carefully explored. A number of specific constructive features, such as apartness and equality, the Gödel translation, the disjunction and existence property are also included. The last chapter on Gödel's first incompleteness theorem is self-contained and provides a systematic exposition of the necessary recursion theory. This new edition has been properly revised and contains a new section on ultra-products Nota de contenido: Introduction -- Propositional Logic -- Predicate Logic -- Completeness and Applications -- Second Order Logic -- Intuitionistic Logic -- Normalization -- Gödel's theorem En línea: http://dx.doi.org/10.1007/978-1-4471-4558-5 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=32190 Logic and Structure [documento electrónico] / Dirk van Dalen ; SpringerLink (Online service) . - London : Springer London : Imprint: Springer, 2013 . - X, 263 p. 27 illus : online resource. - (Universitext, ISSN 0172-5939) .
ISBN : 978-1-4471-4558-5
Idioma : Inglés (eng)
Palabras clave: Mathematics Mathematical logic Logic and Foundations Clasificación: 51 Matemáticas Resumen: Dirk van Dalen’s popular textbook Logic and Structure, now in its fifth edition, provides a comprehensive introduction to the basics of classical and intuitionistic logic, model theory and Gödel’s famous incompleteness theorem. Propositional and predicate logic are presented in an easy-to-read style using Gentzen’s natural deduction. The book proceeds with some basic concepts and facts of model theory: a discussion on compactness, Skolem-Löwenheim, non-standard models and quantifier elimination. The discussion of classical logic is concluded with a concise exposition of second-order logic. In view of the growing recognition of constructive methods and principles, intuitionistic logic and Kripke semantics is carefully explored. A number of specific constructive features, such as apartness and equality, the Gödel translation, the disjunction and existence property are also included. The last chapter on Gödel's first incompleteness theorem is self-contained and provides a systematic exposition of the necessary recursion theory. This new edition has been properly revised and contains a new section on ultra-products Nota de contenido: Introduction -- Propositional Logic -- Predicate Logic -- Completeness and Applications -- Second Order Logic -- Intuitionistic Logic -- Normalization -- Gödel's theorem En línea: http://dx.doi.org/10.1007/978-1-4471-4558-5 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=32190 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
Título : Logic: A Brief Course Tipo de documento: documento electrónico Autores: Daniele Mundici ; SpringerLink (Online service) Editorial: Milano : Springer Milan Fecha de publicación: 2012 Otro editor: Imprint: Springer Colección: UNITEXT, ISSN 2038-5714 Número de páginas: XI, 130 p Il.: online resource ISBN/ISSN/DL: 978-88-470-2361-1 Idioma : Inglés (eng) Palabras clave: Mathematics Mathematical logic Semantics Logic and Foundations Formal Languages Clasificación: 51 Matemáticas Resumen: This short book, geared towards undergraduate students of computer science and mathematics, is specifically designed for a first course in mathematical logic. A proof of Gödel's completeness theorem and its main consequences is given using Robinson's completeness theorem and Gödel's compactness theorem for propositional logic. The reader will familiarize himself with many basic ideas and artifacts of mathematical logic: a non-ambiguous syntax, logical equivalence and consequence relation, the Davis-Putnam procedure, Tarski semantics, Herbrand models, the axioms of identity, Skolem normal forms, nonstandard models and, interestingly enough, proofs and refutations viewed as graphic objects. The mathematical prerequisites are minimal: the book is accessible to anybody having some familiarity with proofs by induction. Many exercises on the relationship between natural language and formal proofs make the book also interesting to a wide range of students of philosophy and linguistics Nota de contenido: Introduction -- Fundamental Logical Notions -- The Resolution Method -- Robinson Completeness Theorem -- Fast Classes for DPP -- Godel Compactness Theorem -- Propositional Logic: Syntax -- Propositional Logic: Semantics -- Normal Forms -- Recap: Expressivity and Efficiency -- The Quantifiers ‘There Exists’ and ‘For All’ -- Syntax of Predicate Logic -- The Meaning of Clauses -- Godel Completeness Theorem for the Logic of Clauses -- Equality Axioms -- The Predicate Logic L En línea: http://dx.doi.org/10.1007/978-88-470-2361-1 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=33034 Logic: A Brief Course [documento electrónico] / Daniele Mundici ; SpringerLink (Online service) . - Milano : Springer Milan : Imprint: Springer, 2012 . - XI, 130 p : online resource. - (UNITEXT, ISSN 2038-5714) .
ISBN : 978-88-470-2361-1
Idioma : Inglés (eng)
Palabras clave: Mathematics Mathematical logic Semantics Logic and Foundations Formal Languages Clasificación: 51 Matemáticas Resumen: This short book, geared towards undergraduate students of computer science and mathematics, is specifically designed for a first course in mathematical logic. A proof of Gödel's completeness theorem and its main consequences is given using Robinson's completeness theorem and Gödel's compactness theorem for propositional logic. The reader will familiarize himself with many basic ideas and artifacts of mathematical logic: a non-ambiguous syntax, logical equivalence and consequence relation, the Davis-Putnam procedure, Tarski semantics, Herbrand models, the axioms of identity, Skolem normal forms, nonstandard models and, interestingly enough, proofs and refutations viewed as graphic objects. The mathematical prerequisites are minimal: the book is accessible to anybody having some familiarity with proofs by induction. Many exercises on the relationship between natural language and formal proofs make the book also interesting to a wide range of students of philosophy and linguistics Nota de contenido: Introduction -- Fundamental Logical Notions -- The Resolution Method -- Robinson Completeness Theorem -- Fast Classes for DPP -- Godel Compactness Theorem -- Propositional Logic: Syntax -- Propositional Logic: Semantics -- Normal Forms -- Recap: Expressivity and Efficiency -- The Quantifiers ‘There Exists’ and ‘For All’ -- Syntax of Predicate Logic -- The Meaning of Clauses -- Godel Completeness Theorem for the Logic of Clauses -- Equality Axioms -- The Predicate Logic L En línea: http://dx.doi.org/10.1007/978-88-470-2361-1 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=33034 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
Título : Logic for Computer Scientists Tipo de documento: documento electrónico Autores: Schöning, Uwe ; SpringerLink (Online service) Editorial: Boston, MA : Birkhäuser Boston Fecha de publicación: 2008 Colección: Progress in Mathematics, Basler Lehrbücher, ISSN 2197-1803 num. 8 Número de páginas: IX, 168 p Il.: online resource ISBN/ISSN/DL: 978-0-8176-4763-6 Idioma : Inglés (eng) Palabras clave: Computer science Mathematical logic Science Logic and Formal Languages Foundations Clasificación: 51 Matemáticas Resumen: 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 Nota de contenido: Propositional Logic -- Predicate Logic -- Logic Programming En línea: http://dx.doi.org/10.1007/978-0-8176-4763-6 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=34285 Logic for Computer Scientists [documento electrónico] / Schöning, Uwe ; SpringerLink (Online service) . - Boston, MA : Birkhäuser Boston, 2008 . - IX, 168 p : online resource. - (Progress in Mathematics, Basler Lehrbücher, ISSN 2197-1803; 8) .
ISBN : 978-0-8176-4763-6
Idioma : Inglés (eng)
Palabras clave: Computer science Mathematical logic Science Logic and Formal Languages Foundations Clasificación: 51 Matemáticas Resumen: 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 Nota de contenido: Propositional Logic -- Predicate Logic -- Logic Programming En línea: http://dx.doi.org/10.1007/978-0-8176-4763-6 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=34285 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar PermalinkPermalink
PermalinkPermalinkPermalink
