Resultado de la búsqueda
28 búsqueda de la palabra clave 'Formal'
Refinar búsqueda Generar rss de la búsqueda
Link de la búsqueda
Título : A Course in Formal Languages, Automata and Groups Tipo de documento: documento electrónico Autores: Ian M. Chiswell ; SpringerLink (Online service) Editorial: London : Springer London Fecha de publicación: 2009 Colección: Universitext, ISSN 0172-5939 Número de páginas: IX, 157 p. 30 illus Il.: online resource ISBN/ISSN/DL: 978-1-84800-940-0 Idioma : Inglés (eng) Palabras clave: Mathematics Mathematical logic Category theory (Mathematics) Homological algebra Group Algebraic topology Manifolds Complex manifolds Theory and Generalizations Logic Formal Languages Topology Cell Complexes (incl. Diff.Topology) Theory, Algebra Clasificación: 51 Matemáticas Resumen: Based on the author’s lecture notes for an MSc course, this text combines formal language and automata theory and group theory, a thriving research area that has developed extensively over the last twenty-five years. The aim of the first three chapters is to give a rigorous proof that various notions of recursively enumerable language are equivalent. Chapter One begins with languages defined by Chomsky grammars and the idea of machine recognition, contains a discussion of Turing Machines, and includes work on finite state automata and the languages they recognise. The following chapters then focus on topics such as recursive functions and predicates; recursively enumerable sets of natural numbers; and the group-theoretic connections of language theory, including a brief introduction to automatic groups. Highlights include: A comprehensive study of context-free languages and pushdown automata in Chapter Four, in particular a clear and complete account of the connection between LR(k) languages and deterministic context-free languages. A self-contained discussion of the significant Muller-Schupp result on context-free groups. Enriched with precise definitions, clear and succinct proofs and worked examples, the book is aimed primarily at postgraduate students in mathematics but will also be of great interest to researchers in mathematics and computer science who want to learn more about the interplay between group theory and formal languages. A solutions manual is available to instructors via www.springer.com Nota de contenido: Preface -- Contents -- 1. Grammars and Machine Recognition -- 2. Recursive Functions -- 3. Recursively Enumerable Sets and Languages -- 4. Context-free language -- 5. Connections with Group Theory -- A. Results and Proofs Omitted in the Text -- B. The Halting Problem and Universal Turing Machines -- C. Cantor's Diagonal Argument -- D. Solutions to Selected Exercises -- References -- Index En línea: http://dx.doi.org/10.1007/978-1-84800-940-0 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=33981 A Course in Formal Languages, Automata and Groups [documento electrónico] / Ian M. Chiswell ; SpringerLink (Online service) . - London : Springer London, 2009 . - IX, 157 p. 30 illus : online resource. - (Universitext, ISSN 0172-5939) .
ISBN : 978-1-84800-940-0
Idioma : Inglés (eng)
Palabras clave: Mathematics Mathematical logic Category theory (Mathematics) Homological algebra Group Algebraic topology Manifolds Complex manifolds Theory and Generalizations Logic Formal Languages Topology Cell Complexes (incl. Diff.Topology) Theory, Algebra Clasificación: 51 Matemáticas Resumen: Based on the author’s lecture notes for an MSc course, this text combines formal language and automata theory and group theory, a thriving research area that has developed extensively over the last twenty-five years. The aim of the first three chapters is to give a rigorous proof that various notions of recursively enumerable language are equivalent. Chapter One begins with languages defined by Chomsky grammars and the idea of machine recognition, contains a discussion of Turing Machines, and includes work on finite state automata and the languages they recognise. The following chapters then focus on topics such as recursive functions and predicates; recursively enumerable sets of natural numbers; and the group-theoretic connections of language theory, including a brief introduction to automatic groups. Highlights include: A comprehensive study of context-free languages and pushdown automata in Chapter Four, in particular a clear and complete account of the connection between LR(k) languages and deterministic context-free languages. A self-contained discussion of the significant Muller-Schupp result on context-free groups. Enriched with precise definitions, clear and succinct proofs and worked examples, the book is aimed primarily at postgraduate students in mathematics but will also be of great interest to researchers in mathematics and computer science who want to learn more about the interplay between group theory and formal languages. A solutions manual is available to instructors via www.springer.com Nota de contenido: Preface -- Contents -- 1. Grammars and Machine Recognition -- 2. Recursive Functions -- 3. Recursively Enumerable Sets and Languages -- 4. Context-free language -- 5. Connections with Group Theory -- A. Results and Proofs Omitted in the Text -- B. The Halting Problem and Universal Turing Machines -- C. Cantor's Diagonal Argument -- D. Solutions to Selected Exercises -- References -- Index En línea: http://dx.doi.org/10.1007/978-1-84800-940-0 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=33981 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
Título : Dual Tableaux: Foundations, Methodology, Case Studies Tipo de documento: documento electrónico Autores: Ewa Orlowska ; SpringerLink (Online service) ; Joanna Golinska Pilarek Editorial: Dordrecht : Springer Netherlands Fecha de publicación: 2011 Otro editor: Imprint: Springer Colección: Trends in Logic num. 33 Número de páginas: XVI, 523 p Il.: online resource ISBN/ISSN/DL: 978-94-007-0005-5 Idioma : Inglés (eng) Palabras clave: Mathematics Logic Mathematical logic and Foundations Formal Languages Clasificación: 51 Matemáticas Resumen: The book presents logical foundations of dual tableaux together with a number of their applications both to logics traditionally dealt with in mathematics and philosophy (such as modal, intuitionistic, relevant, and many-valued logics) and to various applied theories of computational logic (such as temporal reasoning, spatial reasoning, fuzzy-set-based reasoning, rough-set-based reasoning, order-of magnitude reasoning, reasoning about programs, threshold logics, logics of conditional decisions). The distinguishing feature of most of these applications is that the corresponding dual tableaux are built in a relational language which provides useful means of presentation of the theories. In this way modularity of dual tableaux is ensured. We do not need to develop and implement each dual tableau from scratch, we should only extend the relational core common to many theories with the rules specific for a particular theory Nota de contenido: 1. Dual Tableau for Classical First-Order Logic -- 2. Dual Tableaux for Logics of Classical Algebras of Binary -- 3. Theories of Point Relations and Relational Model Checking -- 4. Dual Tableaux for Peirce Algebras -- 5. Dual Tableaux for Fork Algebras -- 6. Dual Tableaux for Relational Databases -- Part III. Relational Reasoning in Traditional Non-classical Logics -- 7. Dual Tableaux for Classical Modal Logics -- 8. Dual Tableaux for Some Logics Based on Intuitionism -- 9. Dual Tableaux for Relevant Logics -- 10. Dual Tableaux for Many-valued Logics -- Part IV. Relational Reasoning in Logics of Information and Data -- Analysis -- 11. Dual Tableaux for Information Logics of Plain Frames -- 12. Dual Tableaux for Information Logics of Relative Frames -- 13. Dual Tableau for Formal Concept Analysis -- 14. Dual Tableau for a Fuzzy Logic -- 15. Dual Tableaux for Logics of Order of Magnitude Reasoning -- Part V. Relational Reasoning about Time, Space, and Action -- 16. Dual Tableaux for Temporal Logics -- 17. Dual Tableaux for Interval Temporal Logics -- 18. Dual Tableaux for Spatial Reasoning -- 19. Dual Tableaux for Logics of Programs -- Part VI. Beyond Relational Theories -- 20. Dual Tableaux for Threshold Logics -- 21. Signed Dual Tableau for G¨odel-Dummett Logic -- 22. Dual Tableaux for First-Order Post Logics -- 23. Dual Tableau for Propositional Logic with Identity -- 24. Dual Tableaux for Logics of Conditional Decisions -- 25. Methodological Principles of Dual Tableaux -- References -- Index En línea: http://dx.doi.org/10.1007/978-94-007-0005-5 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=33486 Dual Tableaux: Foundations, Methodology, Case Studies [documento electrónico] / Ewa Orlowska ; SpringerLink (Online service) ; Joanna Golinska Pilarek . - Dordrecht : Springer Netherlands : Imprint: Springer, 2011 . - XVI, 523 p : online resource. - (Trends in Logic; 33) .
ISBN : 978-94-007-0005-5
Idioma : Inglés (eng)
Palabras clave: Mathematics Logic Mathematical logic and Foundations Formal Languages Clasificación: 51 Matemáticas Resumen: The book presents logical foundations of dual tableaux together with a number of their applications both to logics traditionally dealt with in mathematics and philosophy (such as modal, intuitionistic, relevant, and many-valued logics) and to various applied theories of computational logic (such as temporal reasoning, spatial reasoning, fuzzy-set-based reasoning, rough-set-based reasoning, order-of magnitude reasoning, reasoning about programs, threshold logics, logics of conditional decisions). The distinguishing feature of most of these applications is that the corresponding dual tableaux are built in a relational language which provides useful means of presentation of the theories. In this way modularity of dual tableaux is ensured. We do not need to develop and implement each dual tableau from scratch, we should only extend the relational core common to many theories with the rules specific for a particular theory Nota de contenido: 1. Dual Tableau for Classical First-Order Logic -- 2. Dual Tableaux for Logics of Classical Algebras of Binary -- 3. Theories of Point Relations and Relational Model Checking -- 4. Dual Tableaux for Peirce Algebras -- 5. Dual Tableaux for Fork Algebras -- 6. Dual Tableaux for Relational Databases -- Part III. Relational Reasoning in Traditional Non-classical Logics -- 7. Dual Tableaux for Classical Modal Logics -- 8. Dual Tableaux for Some Logics Based on Intuitionism -- 9. Dual Tableaux for Relevant Logics -- 10. Dual Tableaux for Many-valued Logics -- Part IV. Relational Reasoning in Logics of Information and Data -- Analysis -- 11. Dual Tableaux for Information Logics of Plain Frames -- 12. Dual Tableaux for Information Logics of Relative Frames -- 13. Dual Tableau for Formal Concept Analysis -- 14. Dual Tableau for a Fuzzy Logic -- 15. Dual Tableaux for Logics of Order of Magnitude Reasoning -- Part V. Relational Reasoning about Time, Space, and Action -- 16. Dual Tableaux for Temporal Logics -- 17. Dual Tableaux for Interval Temporal Logics -- 18. Dual Tableaux for Spatial Reasoning -- 19. Dual Tableaux for Logics of Programs -- Part VI. Beyond Relational Theories -- 20. Dual Tableaux for Threshold Logics -- 21. Signed Dual Tableau for G¨odel-Dummett Logic -- 22. Dual Tableaux for First-Order Post Logics -- 23. Dual Tableau for Propositional Logic with Identity -- 24. Dual Tableaux for Logics of Conditional Decisions -- 25. Methodological Principles of Dual Tableaux -- References -- Index En línea: http://dx.doi.org/10.1007/978-94-007-0005-5 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=33486 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
Título : Verification and Control of Hybrid Systems : A Symbolic Approach Tipo de documento: documento electrónico Autores: Paulo Tabuada ; SpringerLink (Online service) Editorial: Boston, MA : Springer US Fecha de publicación: 2009 Número de páginas: XV, 202 p. 200 illus Il.: online resource ISBN/ISSN/DL: 978-1-4419-0224-5 Idioma : Inglés (eng) Palabras clave: Mathematics Mathematical logic Computers System theory Control engineering Systems Theory, Models and Principles Logic Formal Languages Clasificación: 51 Matemáticas Resumen: Hybrid systems describe the interaction of software, modeled by finite-state systems such as finite-state machines, with the physical world, described by infinite-state systems such as differential equations. Verification and Control of Hybrid Systems provides a unique systematic exposition of several classes of hybrid systems, admitting symbolic models along with the relationships between them. The text outlines several key verification and control synthesis results for hybrid systems, guided by the concept of bisimulation, and illustrated by numerous examples. The book is divided into four parts: Part I presents basic concepts centered on a notion of system that is general enough to describe finite-state, infinite-state, and hybrid systems. Part II discusses the ways in which systems relate to other systems, such as behavioral inclusion/equivalence and simulation/bisimulation, using these relationships to study verification and control synthesis problems for finite-state systems. Part III draws inspiration from timed automata to present several classes of hybrid systems, with richer continuous dynamics, that can be related to finite-state symbolic systems. Once such relationships are established, verification and control synthesis problems for these hybrid systems can be immediately solved by resorting to the techniques described in Part II for finite-state systems. Part IV follows the same strategy by generalizing simulation/bisimulation relationships to approximate simulation/bisimulation relationships that can be used for a wider class of hybrid systems. This comprehensive treatment will appeal to researchers, engineers, computer scientists, and graduate students in the areas of formal methods, verification, model checking, and control and will undoubtedly inspire further study of the specialized literature Nota de contenido: Basic concepts -- Systems -- Verifcation problems -- Control problems -- Finite systems -- Exact system relationships -- Verification -- Control -- Infinite Systems Exact symbolic models -- Exact symbolic models for verification -- Exact symbolic models for control -- Infinite Systems Approximate symbolic models -- Approximate system relationships -- Approximate symbolic models for verification -- Approximate symbolic models for control En línea: http://dx.doi.org/10.1007/978-1-4419-0224-5 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=33967 Verification and Control of Hybrid Systems : A Symbolic Approach [documento electrónico] / Paulo Tabuada ; SpringerLink (Online service) . - Boston, MA : Springer US, 2009 . - XV, 202 p. 200 illus : online resource.
ISBN : 978-1-4419-0224-5
Idioma : Inglés (eng)
Palabras clave: Mathematics Mathematical logic Computers System theory Control engineering Systems Theory, Models and Principles Logic Formal Languages Clasificación: 51 Matemáticas Resumen: Hybrid systems describe the interaction of software, modeled by finite-state systems such as finite-state machines, with the physical world, described by infinite-state systems such as differential equations. Verification and Control of Hybrid Systems provides a unique systematic exposition of several classes of hybrid systems, admitting symbolic models along with the relationships between them. The text outlines several key verification and control synthesis results for hybrid systems, guided by the concept of bisimulation, and illustrated by numerous examples. The book is divided into four parts: Part I presents basic concepts centered on a notion of system that is general enough to describe finite-state, infinite-state, and hybrid systems. Part II discusses the ways in which systems relate to other systems, such as behavioral inclusion/equivalence and simulation/bisimulation, using these relationships to study verification and control synthesis problems for finite-state systems. Part III draws inspiration from timed automata to present several classes of hybrid systems, with richer continuous dynamics, that can be related to finite-state symbolic systems. Once such relationships are established, verification and control synthesis problems for these hybrid systems can be immediately solved by resorting to the techniques described in Part II for finite-state systems. Part IV follows the same strategy by generalizing simulation/bisimulation relationships to approximate simulation/bisimulation relationships that can be used for a wider class of hybrid systems. This comprehensive treatment will appeal to researchers, engineers, computer scientists, and graduate students in the areas of formal methods, verification, model checking, and control and will undoubtedly inspire further study of the specialized literature Nota de contenido: Basic concepts -- Systems -- Verifcation problems -- Control problems -- Finite systems -- Exact system relationships -- Verification -- Control -- Infinite Systems Exact symbolic models -- Exact symbolic models for verification -- Exact symbolic models for control -- Infinite Systems Approximate symbolic models -- Approximate system relationships -- Approximate symbolic models for verification -- Approximate symbolic models for control En línea: http://dx.doi.org/10.1007/978-1-4419-0224-5 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=33967 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar PermalinkPermalinkCylindric-like Algebras and Algebraic Logic / SpringerLink (Online service) ; Hajnal Andréka ; Miklós Ferenczi ; István Németi (2013)
PermalinkPermalink
Permalink
