Search results for "Mathematical Foundations of Computer Science"
Items we need to order for you
Mathematical Foundations of Computer Science
Mathematical Foundations of Computer Science introduces students to the discrete mathematics needed later in their Computer Science coursework with theory of computation topics interleaved throughout. Students learn about mathematical concepts just in time to apply them to theory of computation ideas. For instance, sets motivate the study of finite automata, direct proof is practised using closure properties, induction is used to prove the language of an automaton, and contradiction is used to apply the pumping lemma. The main content of the book starts with primitive data types such as sets and strings and ends with showing the undecidability of the halting problem. There are also appendix chapters on combinatorics, probability, elementary number theory, asymptotic notation, graphs, loop invariants, and recurrences. The content is laid out concisely with a heavy reliance on worked examples, of which there are over 250 in the book. Each chapter has exercises, totalling 550. This class-tested textbook is targeted to intermediate Computer Science majors, and it is primarily intended for a discrete math / proofs course in a Computer Science major. It is also suitable for introductory theory of computation courses.
R 2,049.88
Mathematical Foundations of Computer Science
Mathematical Foundations of Computer Science, Volume I is the first of two volumes presenting topics from mathematics (mostly discrete mathematics) which have proven relevant and useful to computer science. This volume treats basic topics, mostly of a set-theoretical nature (sets, functions and relations, partially ordered sets, induction, enumerability, and diagonalization) and illustrates the usefulness of mathematical ideas by presenting applications to computer science. Readers will find useful applications in algorithms, databases, semantics of programming languages, formal languages, theory of computation, and program verification. The material is treated in a straightforward, systematic, and rigorous manner. The volume is organized by mathematical area, making the material easily accessible to the upper-undergraduate students in mathematics as well as in computer science and each chapter contains a large number of exercises. The volume can be used as a textbook, but it will also be useful to researchers and professionals who want a thorough presentation of the mathematical tools they need in a single source. In addition, the book can be used effectively as supplementary reading material in computer science courses, particularly those courses which involve the semantics of programming languages, formal languages and automata, and logic programming.
R 1,579.74
Mathematical Foundations of Computer Science
Mathematical Foundations of Computer Science introduces students to the discrete mathematics needed later in their Computer Science coursework with theory of computation topics interleaved throughout. Students learn about mathematical concepts just in time to apply them to theory of computation ideas. For instance, sets motivate the study of finite automata, direct proof is practised using closure properties, induction is used to prove the language of an automaton, and contradiction is used to apply the pumping lemma. The main content of the book starts with primitive data types such as sets and strings and ends with showing the undecidability of the halting problem. There are also appendix chapters on combinatorics, probability, elementary number theory, asymptotic notation, graphs, loop invariants, and recurrences. The content is laid out concisely with a heavy reliance on worked examples, of which there are over 250 in the book. Each chapter has exercises, totalling 550. This class-tested textbook is targeted to intermediate Computer Science majors, and it is primarily intended for a discrete math / proofs course in a Computer Science major. It is also suitable for introductory theory of computation courses.
R 5,860.02
Mathematical Foundations of Computer Science 1988
This volume contains 11 invited lectures and 42 communications presented at the 13th Conference on Mathematical Foundations of Computer Science, MFCS '88, held at Carlsbad, Czechoslovakia, August 29 - September 2, 1988. Most of the papers present material from the following four fields: - complexity theory, in particular structural complexity, - concurrency and parellelism, - formal language theory, - semantics. Other areas treated in the proceedings include functional programming, inductive syntactical synthesis, unification algorithms, relational databases and incremental attribute evaluation.
R 3,082.42
Mathematical Foundations of Computer Science 2015
This two volume set LNCS 9234 and 9235 constitutes the refereed conference proceedings of the 40th International Symposium on Mathematical Foundations of Computer Science, MFCS 2015, held in Milan, Italy, in August 2015. The 82 revised full papers presented together with 5 invited talks were carefully selected from 201 submissions. The papers feature high-quality research in all branches of theoretical computer science. They have been organized in the following topical main sections: logic, semantics, automata, and theory of programming (volume 1) and algorithms, complexity, and games (volume 2).
R 2,204.17
Mathematical Foundations of Computer Science 2012
This volume constitutes the refereed proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science, MFCS 2012, held in Bratislava, Slovakia, in August 2012. The 63 revised full papers presented together with 8 invited talks were carefully reviewed and selected from 162 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence.
R 4,744.07
Mathematical Foundations of Computer Science 2015
This two volume set LNCS 9234 and 9235 constitutes the refereed conference proceedings of the 40th International Symposium on Mathematical Foundations of Computer Science, MFCS 2015, held in Milan, Italy, in August 2015. The 82 revised full papers presented together with 5 invited talks were carefully selected from 201 submissions. The papers feature high-quality research in all branches of theoretical computer science. They have been organized in the following topical main sections: logic, semantics, automata, and theory of programming (volume 1) and algorithms, complexity, and games (volume 2).
R 2,227.82
Mathematical Foundations of Computer Science 1992
This volume contains 10 invited papers and 40 shortcommunications contributed for presentation at the 17thSymposium on Mathematical Foundations of Computer Science,held in Prague, Czechoslovakia, August 24-28, 1992.The series of MFCS symposia, organized alternately in Polandand Czechoslovakia since 1972, has a long and wellestablished tradition. The purpose of the series is toencourage high-quality research in all branches oftheoretical computer science and to bring togetherspecialists working actively in the area.Numerous topics are covered in this volume. The invitedpapers cover: range searching with semialgebraic sets, graphlayout problems, parallel recognition and ranking ofcontext-free languages, expansion of combinatorialpolytopes, neural networks and complexity theory, theory ofcomputation over stream algebras, methods in parallelalgorithms, the complexity of small descriptions, weakparallel machines, and the complexity of graph connectivity.
R 1,595.01
Mathematical Foundations of Computer Science 1998
This book constitutes the refereed proceedings of the 23rd International Symposium on the Mathematical Foundations of Computer Science, MFCS'98, held in Brno, Czech Republic, in August 1998.The 71 revised full papers presented were carefully reviewed and selected from a total of 168 submissions. Also included are 11 full invited surveys by prominent leaders in the area. The papers are organized in topical sections on problem complexity; logic, semantics, and automata; rewriting; automata and transducers; typing; concurrency, semantics, and logic; circuit complexity; programming; structural complexity; formal languages; graphs; Turing complexity and logic; binary decision diagrams, etc..
R 4,450.70
Mathematical Foundations of Computer Science 1995
This book presents the proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science, MFCS'95, held in Prague, Czech Republic in August/September 1995.The book contains eight invited papers and two abstracts of invited talks by outstanding scientists as well as 44 revised full research papers selected from a total of 104 submissions. All relevant aspects of theoretical computer science are addressed, particularly the mathematical foundations; the papers are organized in sections on structural complexity, algorithms, complexity theory, graphs in models of computation, lower bounds, formal languages, unification, rewriting and type theory, distributed computation, concurrency, semantics, model checking, and formal calculi.
R 3,088.91
Mathematical Foundations of Computer Science 2013
This book constitutes the thoroughly refereed conference proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013, held in Klosterneuburg, Austria, in August 2013. The 67 revised full papers presented together with six invited talks were carefully selected from 191 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence.
R 1,648.21
Mathematical Foundations of Computer Science 1993
This volume contains the proceedings of the 18thInternational Symposium on Mathematical Foundations ofComputer Science, MFCS '93, held in Gdansk, Poland,August-September 1993.The MFCS symposia, organized annually in Poland and theformer Czechoslovakia since 1972, have a long andwell-established tradition. Over the years they have servedas a meeting ground for specialists from all branches oftheoretical computer science, in particular- algorithms and complexity, automata theory and theory oflanguages,- concurrent, distributed and real-time systems,- the theory of functional, logic and object-orientedprogramming,- lambda calculus and type theory,- semantics and logics of programs,and others. The volume contains 12 invitedlectures and 56contributed papers selected from 133 submissions.
R 1,638.51
Mathematical Foundations of Computer Science 2008
This book constitutes the refereed proceedings of the 33rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2008, held in Torun, Poland, in August 2008. The 45 revised full papers presented together with 5 invited lectures were carefully reviewed and selected from 119 submissions. All current aspects in theoretical computer science and its mathematical foundations are addressed, ranging from algorithmic game theory, algorithms and data structures, artificial intelligence, automata and formal languages, bioinformatics, complexity, concurrency and petrinets, cryptography and security, logic and formal specifications, models of computations, parallel and distributed computing, semantics and verification.
R 4,144.86
Mathematical Foundations of Computer Science 2014
This two volume set LNCS 8634 and LNCS 8635 constitutes the refereed conference proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014, held in Budapest, Hungary, in August 2014. The 95 revised full papers presented together with 6 invited talks were carefully selected from 270 submissions. The focus of the conference was on following topics: Logic, Semantics, Automata, Theory of Programming, Algorithms, Complexity, Parallel and Distributed Computing, Quantum Computing, Automata, Grammars and Formal Languages, Combinatorics on Words, Trees and Games.
R 2,220.34
Mathematical Foundations of Computer Science 2000
This volume contains papers selected for presentation at the Silver Jubilee 25th Symposium on Mathematical Foundations of Computer Science | MFCS 2000, held in Bratislava, Slovakia, August 28 { September 1, 2000. MFCS 2000 was organized under the auspices of the Minister of Education of the Slovak Republic, Milan Ft a cnik, by the Slovak Society for Computer Science, and the Comenius University in Bratislava, in cooperation with other institu- ons in Slovakia. It was supported by the European Association for Theoretical Computer Science, the European Research Consortium for Informatics and - thematics, and the Slovak Research Consortium for Informatics and Mathe- tics. The series of MFCS symposia, organized alternately in the Czech Republic, Poland, and Slovakia since 1972, has a well-established tradition. The MFCS symposia encourage high-quality research in all branches of theoretical computer science. Their broad scope provides an opportunity of bringing together spec- lists who do not usually meet at specialized conferences.The previous meetings took place in Jablonna, 1972; Strbsk e Pleso, 1973; Jadwisin, 1974; Mari ansk e L azn e, 1975; Gdansk, 1976; Tatransk a Lomnica, 1977; Zakopane, 1978; Olomouc, 1979; Rydzina, 1980; Strbsk e Pleso, 1981; Prague, 1984; Bratislava, 1986; C- lsbad, 1988; Porabk a-Kozubnik, 1989; Bansk a Bystrica, 1990; Kazimierz Dolny, 1991; Prague, 1992; Gdansk, 1993, Ko sice, 1994; Prague, 1995; Krak ow, 1996; Bratislava, 1997; Brno, 1998; and Szklarska Poreba, 1999.
R 3,993.00
Mathematical Foundations of Computer Science 2001
This volume contains papers selected for presentation at the 26th International Symposium on Mathematical Foundations of Computer Science - MFCS 2001, held in Mari'ansk'eL'azn?e, Czech Republic, August 27 - 31, 2001. MFCS 2001 was organized by the Mathematical Institute (Academy of S- ences of the Czech Republic), the Institute for Theoretical Computer Science (Charles University, Faculty of Mathematics and Physics), the Institute of C- puter Science (Academy of Sciences of the Czech Republic), and Action M Agency. It was supported by the European Research Consortium for Informatics and Mathematics, the Czech Research Consortium for Informatics and Ma- ematics, and the European Association for Theoretical Computer Science. We gratefully acknowledge the support of all these institutions. The series of MFCS symposia, organized on a rotating basis in Poland, S- vakia, and the Czech Republic, has a well-established tradition. The aim is to encourage high-quality research in all branches of theoretical computer science and bring together specialists who do not usually meet at specialized confer- ? ences.Previous meetings tookplace in Jablonna, 1972; Strbsk'e Pleso, 1973; J- wisin, 1974; Marian ' sk'eL'azn?e, 1975; Gdan 'sk, 1976; Tatransk'a Lomnica, 1977; Za- ? kopane, 1978; Olomouc, 1979; Rydzina, 1980; Strbsk'e Pleso, 1981; Prague, 1984; Bratislava, 1986; Karlovy Vary, 1988; Porabk , a-Kozubnik, 1989; Bansk'aBystrica, 1990; Kazimierz Dolny, 1991; Prague, 1992; Gdan 'sk, 1993; Ko?sice, 1994; Prague, 1995; Krak'ow, 1996; Bratislava, 1997; Brno, 1998; Szklarska Por,eba, 1999; and Bratislava, 2000.
R 3,108.29
Mathematical Foundations of Computer Science 1996
This book constitutes the refereed proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science, MFCS '96, held in Crakow, Poland in September 1996.The volume presents 35 revised full papers selected from a total of 95 submissions together with 8 invited papers and 2 abstracts of invited talks. The papers included cover issues from the whole area of theoretical computer science, with a certain emphasis on mathematical and logical foundations. The 10 invited presentations are of particular value.
R 3,088.15
Mathematical Foundations of Computer Science 2006
This book constitutes the refereed proceedings of the 31st International Symposium on Mathematical Foundations of Computer Science, MFCS 2006. The book presents 62 revised full papers together with the full papers or abstracts of 7 invited talks. All current aspects in theoretical computer science and its mathematical foundations are addressed, from algorithms and data structures, to complexity, automata, semantics, logic, formal specifications, models of computation, concurrency theory, computational geometry and more.
R 3,124.31
Mathematical Foundations of Computer Science 2011
This volume constitutes the refereed proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science, MFCS 2011, held in Warsaw, Poland, in August 2011. The 48 revised full papers presented together with 6 invited talks were carefully reviewed and selected from 129 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, grammars and formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, cryptography and security, databases and knowledge-based systems, formal specifications and program development, foundations of computing, logic in computer science, mobile computing, models of computation, networks, parallel and distributed computing, quantum computing, semantics and verification of programs, and theoretical issues in artificial intelligence.
R 2,227.82
Mathematical Foundations of Computer Science 1997
This book constitutes the refereed proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science, MFCS '97, held in Bratislava, Slovakia, in August 1997.The 40 revised full papers presented were carefully selected from a total of 94 submissions. Also included are nine invited papers and two abstracts of invited talks. The papers cover the whole range of theoretical computer science including programming theory, complexity theory, mathematical logic, rewriting, grammars, formal languages, theory of algorithms, computational graph theory, etc.
R 1,594.28
Mathematical Foundations of Computer Science 2004
This volume contains the papers presented at the 29th Symposium on Mat- matical Foundations of Computer Science, MFCS 2004, held in Prague, Czech Republic, August 22–27, 2004. The conference was organized by the Institute for Theoretical Computer Science (ITI) and the Department of Theoretical Com- terScienceandMathematicalLogic(KTIML)oftheFacultyofMathematicsand Physics of Charles University in Prague. It was supported in part by the Eu- pean Association for Theoretical Computer Science (EATCS) and the European Research Consortium for Informatics and Mathematics (ERCIM). Traditionally, the MFCS symposia encourage high-quality research in all branches of theoretical computer science. Ranging in scope from automata, f- mal languages, data structures, algorithms and computational geometry to c- plexitytheory,modelsofcomputation,andapplicationsincludingcomputational biology, cryptography, security and arti?cial intelligence, the conference o?ers a unique opportunity to researchers from diverse areas to meet and present their results to a general audience. The scienti?c program of this year’s MFCS took place in the lecture halls of the recently reconstructed building of the Faculty of Mathematics and P- sics in the historical center of Prague, with the famous Prague Castle and other celebratedhistoricalmonumentsinsight.Theviewfromthewindowswasach- lengingcompetitionforthespeakersinthe?ghtfortheattentionoftheaudience. But we did not fear the result: Due to the unusually tough competition for this year’s MFCS, the admitted presentations certainly attracted considerable in- rest. The conference program (and the proceedings) consisted of 60 contributed papers selected by the Program Committee from a total of 167 submissions.
R 3,138.13
Mathematical Foundations of Computer Science 2007
This book constitutes the refereed proceedings of the 32nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2007, held in Ceský Krumlov, Czech Republic, August 2007.The 61 revised full papers presented together with the full papers or abstracts of five invited talks address all current aspects in theoretical computer science and its mathematical foundations.
R 3,116.39
Mathematical Foundations of Computer Science 1991
This volume contains the proceedings of the 16th International Symposium on Mathematical Foundations of Computer Science, MFCS '91, held in Kazimierz Dolny, Poland, September 9-13, 1991. The series of MFCS symposia, organized alternately in Poland and Czechoslovakia since 1972, has a long and well established tradition. The purpose of the series is to encourage high-quality research in all branches of theoretical computer science and to bring together specialists working actively in the area. Principal areas of interest in this symposium include: software specification and development, parallel and distributed computing, logic and semantics of programs, algorithms, automata and formal languages, complexity and computability theory, and others. The volume contains 5 invited papers by distinguished scientists and 38 contributions selected from a total of 109 submitted papers.
R 1,581.34
Mathematical Foundations of Computer Science 1990
This volume contains papers selected for presentation at the 15th Symposium on Mathematical Foundations of Computer Science, MFCS '90, held at Banská Bystrica, Czechoslovakia, August 27-31, 1990. Previous MFCS proceedings have also been published in the Lecture Notes in Computer Science. This symposium is the 15th in a series of international meetings which have taken place in Czechoslovakia and Poland. The aim of these symposia is to bring together specialists in theoretical fields of computer science from various countries and to stimulate mathematical research in theoretical computer science. These proceedings consist of 10 invited papers and 52 communications selected by the international Program Committee. The papers present the latest results in key areas of computer science by authors from Europe, USA, Japan and China.
R 1,597.51
Mathematical Foundations of Computer Science 1989
The present volume contains papers selected for presentation at the 14th Symposium on Mathematical Foundations of Computer Science - MFCS '89 held in Porabka-Kozubnik, Poland, from August 28 to September 1, 1989. Previous MFCs proceedings have also been published in the Lecture Notes in Computer Science. This volume presents investigations and results in theoretical computer science, in particular in the following areas: logics of programs, parallel and distributed computing, deductive databases, automata and formal languages, algorithms and data structures, software specification and validity, complexity and computability theory.
R 1,607.95
Mathematical Foundations of Computer Science 2014
This two volume set LNCS 8634 and LNCS 8635 constitutes the refereed conference proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014, held in Budapest, Hungary, in August 2014. The 95 revised full papers presented together with 6 invited talks were carefully selected from 270 submissions. The focus of the conference was on following topics: Logic, Semantics, Automata, Theory of Programming, Algorithms, Complexity, Parallel and Distributed Computing, Quantum Computing, Automata, Grammars and Formal Languages, Combinatorics on Words, Trees and Games.
R 2,232.52
Mathematical Foundations of Computer Science 1994
This volume constitutes the proceedings of the 19th International Symposium on Mathematical Foundations of Theoretical Computer Science, MFCS '94, held in Kosice, Slovakia in August 1994.MFCS '94 brought together specialists in theoretical fields of computer science from various countries in order to stimulate mathematical research in theoretical computer science. Besides 12 papers based on invited talks by renowned experts, the book contains 42 research contributions selected from a total of 112 submissions. All areas of theoretical computer science are presented, some from a particular mathematical point of view.
R 3,094.34
Mathematical Foundations of Computer Science 2005
This volume contains the papers presented at the 30th Symposium on Mat- matical Foundations of Computer Science (MFCS 2005)held in Gdansk, Poland fromAugust29thto September 2nd,2005.TakingplacealternatelyintheCzech Republic, Slovakia and Poland, this year the conference was organized by the Institute of Mathematics of Gdansk University. From the ?rst meeting in 1972 to this year's 30th event, the MFCS series has provided a basis for theoretical computer scientists to present their latest research results. The scope of the conference, consequently, covers all branches of theoretical computer science ranging from automata, algorithms, data str- tures, models of computation to complexity theory, also including arti?cial - telligence, computational biology, computational geometry and cryptography. The 137 submissions from 22 countries revealed a continued strong interest in the conference as well as the high-quality research results the MFCS series stands for. The Program Committee carefully selected 62 papers for presention at the conference complemented by 7 invited talks. The meeting took place at a conference hotel located on Sobieszewo Island, 15 km from Gdansk,o?ering both a beautiful landscapewith sandy beaches and forests and the possibility to explore the old Hanseatic city of Gdansk with its interesting history of over 1000 years.
R 4,030.00
Theoretical and Mathematical Foundations of Computer Science
This book constitutes the refereed post-proceedings of the Second International Conference on Theoretical and Mathematical Foundations of Computer Science, ICTMF 2011, held in Singapore in May 2011. The conference was held together with the Second International Conference on High Performance Networking, Computing, and Communication systems, ICHCC 2011, which proceedings are published in CCIS 163. The 84 revised selected papers presented were carefully reviewed and selected for inclusion in the book. The topics covered range from computational science, engineering and technology to digital signal processing, and computational biology to game theory, and other related topices.
R 4,326.16
Mathematical Foundations of Computer Science 1999
This volume contains papers selected for presentation during the 24th Interna tional Symposium on Mathematical Foundations of Computer Science held on September 6-10, 1999 in Szklarska Por^ba, Poland. The symposium, organized alternately in the Czech Republic, Slovakia, and Poland, focuses on theoretical aspects and mathematical foundations of computer science. The scientific program of the symposium consists of five invited talks given by Martin Dyer, Dexter Kozen, Giovanni Manzini, Sergio Rajsbaum, and Mads Tofte, and 37 accepted papers chosen out of 68 submissions. The volume contains all accepted contributed papers, and three invited papers. The contributed papers have been selected for presentation based on their scientific quality, novelty, and interest for the general audience of MFCS par ticipants. Each paper has been reviewed by at least three independent referees — PC members and/or sub-referees appointed by them. The papers were se lected for presentation during a fully electronic virtual meeting of the program committee on May 7, 1999. The virtual PC meeting was supported by software written by Artur Zgoda, Ph.D. student at the University of Wroclaw. The entire communication and access to quite a sensitive database at PC headquarters in Wroclaw was secured by cryptographic protocols based on technology of certificates.
R 1,584.57
Mathematical Foundations of Computer Science 2009
The 34th International Symposium on Mathematical Foundations of Computer Science, MFCS2009,washeld in Novy ' Smokovec,High Tatras(Slovakia)during August 24-28, 2009. This volume contains 7 invited and 56 contributed papers presented at the symposium. The contributed papers were selected by the P- gram Committee out of a total of 148 submissions. MFCS 2009 was organized by the Slovak Society for Computer Science and the Faculty of Mathematics, Physics and Informatics of the Comenius Univ- sity in Bratislava. It wassupported by the EuropeanAssociation for Theoretical Computer Science. We acknowledge with gratitude the support of all these - stitutions. The series of MFCS symposia has a well-established tradition dating back to 1972. The aim is to encourage high-quality research in all branches of th- retical computer science, and to bring together researchers who do not usually meet at specialized conferences. The symposium is organized on a rotating - sis in Poland, Czech Republic, and Slovakia.
R 3,115.51
Mathematical Foundations of Advanced Informatics
The books in this trilogy capture the foundational core of advanced informatics. The authors make the foundations accessible, enabling students to become effective problem solvers.This first volume establishes the inductive approach as a fundamental principle for system and domain analysis. After a brief introduction to the elementary mathematical structures, such as sets, propositional logic, relations, and functions, the authors focus on the separation between syntax (representation) and semantics (meaning), and on the advantages of the consistent and persistent use of inductive definitions. They identify compositionality as a feature that not only acts as a foundation for algebraic proofs but also as a key for more general scalability of modeling and analysis. A core principle throughout is invariance, which the authors consider a key for the mastery of change, whether in the form of extensions, transformations, or abstractions.This textbook is suitable for undergraduate and graduate courses in computer science and for self-study. Most chapters contain exercises and the content has been class-tested over many years in various universities.
R 1,465.00
Mathematical Foundations of Advanced Informatics
The books in this trilogy capture the foundational core of advanced informatics. The authors make the foundations accessible, enabling students to become effective problem solvers.This first volume establishes the inductive approach as a fundamental principle for system and domain analysis. After a brief introduction to the elementary mathematical structures, such as sets, propositional logic, relations, and functions, the authors focus on the separation between syntax (representation) and semantics (meaning), and on the advantages of the consistent and persistent use of inductive definitions. They identify compositionality as a feature that not only acts as a foundation for algebraic proofs but also as a key for more general scalability of modeling and analysis. A core principle throughout is invariance, which the authors consider a key for the mastery of change, whether in the form of extensions, transformations, or abstractions.This textbook is suitable for undergraduate and graduate courses in computer science and for self-study. Most chapters contain exercises and the content has been class-tested over many years in various universities.
R 1,465.00
Logical Foundations of Computer Science
This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2022, held in Deerfield Beach, FL, USA, in January 2022. The 23 revised full papers were carefully reviewed and selected from 35 submissions. The scope of the Symposium is broad and includes constructive mathematics and type theory; homotopy type theory; logic, automata, and automatic structures; computability and randomness; logical foundations of programming; logical aspects of computational complexity; parameterized complexity; logic programming and constraints; automated deduction and interactive theorem proving; logical methods in protocol and program verification; logical methods in program specification and extraction; domain theory logics; logical foundations of database theory; equational logic and term rewriting; lambda and combinatory calculi; categorical logic and topological semantics; linear logic; epistemic and temporal logics; intelligent and multiple-agent system logics; logics of proof and justification; non-monotonic reasoning; logic in game theory and social software; logic of hybrid systems; distributed system logics; mathematical fuzzy logic; system design logics; other logics in computer science.
R 3,332.94
Logical Foundations of Computer Science
This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2013, held in San Diego, CA, USA in January 2013. The volume presents 29 revised refereed papers carefully selected by the program committee. The scope of the Symposium is broad and includes constructive mathematics and type theory; logic, automata and automatic structures; computability and randomness; logical foundations of programming; logical aspects of computational complexity; logic programming and constraints; automated deduction and interactive theorem proving; logical methods in protocol and program verification; logical methods in program specification and extraction; domain theory logic; logical foundations of database theory; equational logic and term rewriting; lambda and combinatory calculi; categorical logic and topological semantics; linear logic; epistemic and temporal logics; intelligent and multiple agent system logics; logics of proof and justification; nonmonotonic reasoning; logic in game theory and social software; logic of hybrid systems; distributed system logics; mathematical fuzzy logic; system design logics; and other logics in computer science.
R 1,577.08
Logical Foundations of Computer Science
This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2018, held in Deerfield Beach, FL, USA, in January 2018.The 22 revised full papers were carefully reviewed and selected from 22 submissions. The scope of the Symposium is broad and includes constructive mathematics and type theory; homotopy type theory; logic, automata, and automatic structures; computability and randomness; logical foundations of programming; logical aspects of computational complexity; parameterized complexity; logic programming and constraints; automated deduction and interactive theorem proving; logical methods in protocol and program verification; logical methods in program specification and extraction; domain theory logics; logical foundations of database theory; equational logic and term rewriting; lambda andcombinatory calculi; categorical logic and topological semantics; linear logic; epistemic and temporal logics; intelligent and multiple-agent system logics; logics of proof and justification; non-monotonic reasoning; logic in game theory and social software; logic of hybrid systems; distributed system logics; mathematical fuzzy logic; system design logics; and other logics in computer science.
R 2,186.53
