05063nam 22006494a 450 991045124060332120200520144314.0981-277-792-X(CKB)1000000000405429(EBL)1679319(OCoLC)881611050(SSID)ssj0000156378(PQKBManifestationID)11946843(PQKBTitleCode)TC0000156378(PQKBWorkID)10123778(PQKB)11727454(MiAaPQ)EBC1679319(WSP)00004899(Au-PeEL)EBL1679319(CaPaEBR)ebr10201237(CaONFJC)MIL505423(EXLCZ)99100000000040542920020328d2002 uy 0engur|n|---|||||txtccrFolk algebras in algebra[electronic resource] logic and computer science /Marcelo Fabián FriasRiver Edge, NJ World Scientific20021 online resource (230 p.)Advances in logic ;v. 2Description based upon print version of record.981-02-4876-8 Includes bibliographical references (p. 207-213) and index.Contents ; Preface ; 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 Algebras3.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 ForkChapter 5 Interpretability of Classical First-Order Logic 5.1 Basic Definitions ; 5.2 Interpreting FOLE ; Chapter 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 FL6.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 ; 6.10 A Relational Proof System for Intuitionistic Logic ; 6.10.1 Intuitionistic Logic ; 6.10.2 Interpretability of Intuitionistic Logic in FL'6.10.3 A Fork Logic Calculus for Intuitionistic Logic 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 aAdvances in logic ;v. 2.Computer scienceMathematicsLogic, Symbolic and mathematicalElectronic books.Computer scienceMathematics.Logic, Symbolic and mathematical.004/.01/51Frias Marcelo Fabián1968-863340MiAaPQMiAaPQMiAaPQBOOK9910451240603321Folk algebras in algebra1927145UNINA