Cargando…
Fork Algebras in Algebra, Logic and Computer Science.
Fork algebras are a formalism based on the relational calculus, with interesting algebraic and metalogical properties. Their representability is especially appealing in computer science, since it allows a closer relationship between their language and models. This book gives a careful account of the...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Singapore :
World Scientific Publishing Company,
2002.
|
| Colección: | Advances in logic.
|
| Temas: | |
| Acceso en línea: | Texto completo |
MARC
| LEADER | 00000cam a2200000Mu 4500 | ||
|---|---|---|---|
| 001 | EBOOKCENTRAL_ocn881611050 | ||
| 003 | OCoLC | ||
| 005 | 20240329122006.0 | ||
| 006 | m o d | ||
| 007 | cr |n||||||||| | ||
| 008 | 140623s2002 si o 000 0 eng d | ||
| 040 | |a EBLCP |b eng |e pn |c EBLCP |d OCLCO |d OCLCQ |d ZCU |d MERUC |d ICG |d OCLCF |d AU@ |d OCLCO |d OCLCQ |d WYU |d DKC |d OCLCQ |d OCLCO |d OCLCQ |d OCLCO | ||
| 020 | |a 9789812777928 | ||
| 020 | |a 981277792X | ||
| 029 | 1 | |a AU@ |b 000055988749 | |
| 029 | 1 | |a DEBBG |b BV044178748 | |
| 035 | |a (OCoLC)881611050 | ||
| 050 | 4 | |a QA76.9.M35 |b F75 2002 | |
| 082 | 0 | 4 | |a 004.01512 |
| 049 | |a UAMI | ||
| 100 | 1 | |a Frias, Marcelo Fabián. | |
| 245 | 1 | 0 | |a Fork Algebras in Algebra, Logic and Computer Science. |
| 260 | |a Singapore : |b World Scientific Publishing Company, |c 2002. | ||
| 300 | |a 1 online resource (232 pages) | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a Advances in Logic ; |v v. 2 | |
| 588 | 0 | |a Print version record. | |
| 505 | 0 | |a Preface; Contents; Chapter 1 Introduction and Motivations; 1.1 Software Specification Binary Relations and Fork; Chapter 2 Algebras of Binary Relations and Relation Algebras; 2.1 History and Definitions; 2.2 Arithmetical Properties; Chapter 3 Proper and Abstract Fork Algebras; 3.1 On the Origin of Fork Algebras; 3.2 Definition of the Classes; 3.3 Arithmetical Properties; Chapter 4 Representability and Independence; 4.1 Representability of Abstract Fork Algebras; 4.2 Independence of the Axiomatization of Fork; Chapter 5 Interpretability of Classical First-Order Logic; 5.1 Basic Definitions. | |
| 505 | 8 | |a 5.2 Interpreting FOLEChapter 6 Algebraization of Non-Classical Logics; 6.1 Basic Definitions and Properties; 6.2 The Fork Logic FL; 6.3 Modal Logics; 6.4 Representation of Constraints in FL; 6.5 Interpretability of Modal Logics in FL; 6.6 A Proof Theoretical Approach; 6.7 Interpretability of Propositional Dynamic Logic in FL; 6.8 The Fork Logic FL'; 6.8.1 Syntax of FL'; 6.8.2 Semantics of FL'; 6.9 A Rasiowa-Sikorski Calculus for FL'; 6.9.1 The Deduction System for FL'; 6.9.2 Soundness and Completeness of the Calculus FLC; 6.9.3 Examples of Proofs in the Calculus FLC. | |
| 505 | 8 | |a 6.10 A Relational Proof System for Intuitionistic Logic6.10.1 Intuitionistic Logic; 6.10.2 Interpretability of Intuitionistic Logic in FL'; 6.10.3 A Fork Logic Calculus for Intuitionistic Logic; 6.10.3.1 Example; 6.11 A Relational Proof System for Minimal Intuitionistic Logic; 6.12 Relational Reasoning in Intermediate Logics; 6.12.1 Method 1; 6.12.2 Method 2; 6.12.3 Method 3; Chapter 7 A Calculus for Program Construction; 7.1 Introduction; 7.2 Filters and Sets; 7.3 The Relational Implication; 7.4 Representability and Expressiveness in Program Construction. | |
| 505 | 8 | |a 7.5 A Methodology for Program Construction7.6 Examples; 7.6.1 First Example; 7.6.1.1 Finding the Minimum Element in a List; 7.6.1.2 Finding the Minimum Common Ancestor; 7.6.2 Second Example; 7.6.2.1 Finding the Contiguous Sublists of Maximum Sum; 7.6.2.2 Finding the Longest Plateau; 7.7 A D & C Algorithm for MAXSTA; 7.8 Comparison with Previous Work; Bibliography; Index. | |
| 520 | |a Fork algebras are a formalism based on the relational calculus, with interesting algebraic and metalogical properties. Their representability is especially appealing in computer science, since it allows a closer relationship between their language and models. This book gives a careful account of the results and presents some applications of Fork algebras in computer science, particularly in system specification and program construction. Many applications of Fork algebras in formal methods can be applied in many ways, and the book covers all the essentials in order to provide the reader with a. | ||
| 590 | |a ProQuest Ebook Central |b Ebook Central Academic Complete | ||
| 650 | 0 | |a Computer science |x Mathematics. | |
| 650 | 0 | |a Logic, Symbolic and mathematical. | |
| 650 | 6 | |a Informatique |x Mathématiques. | |
| 650 | 6 | |a Logique symbolique et mathématique. | |
| 650 | 7 | |a Computer science |x Mathematics |2 fast | |
| 650 | 7 | |a Logic, Symbolic and mathematical |2 fast | |
| 776 | 0 | 8 | |i Print version: |a Frias, Marcelo Fabián. |t Fork Algebras in Algebra, Logic and Computer Science. |d Singapore : World Scientific Publishing Company, ©2002 |z 9789810248765 |
| 830 | 0 | |a Advances in logic. | |
| 856 | 4 | 0 | |u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=1679319 |z Texto completo |
| 938 | |a EBL - Ebook Library |b EBLB |n EBL1679319 | ||
| 994 | |a 92 |b IZTAP | ||