Notes on Set Theory
This is introduction to axiomatic set theory, viewed both as a foundation of mathematics and as a branch of mathematics with its own subject matter, basic results, open problems.
Integrable Hamiltonian Hierarchies : Spectral and Geometric Methods
This book presents a detailed derivation of the spectral properties of the Recursion Operators allowing one to derive all the fundamental properties of the soliton equations and to study their Hamiltonian hierarchies. Thus it is demonstrated that the inverse scattering method for solving soliton equations is a nonlinear generalization of the Fourier transform. The book brings together the spectral and the geometric approaches and as such will be useful to a wide readership: from researchers in the field of nonlinear completely integrable evolution equations to graduate and post-graduate students.
Implementation and Applications of Automata ; 13th International Conference, CIAA 2008, San Francisco, California, USA, July 21-24, 2008. Proceedings
This book constitutes the thoroughly refereed post-proceedings of the 13th International Conference on Implementation and Application of Automata, CIAA 2008, held in San Francisco, USA, in July 2008.The 26 revised full papers togehter with 4 invited papers were carefully reviewed and selected from 40 submissions and have gone through two rounds of reviewing and improvement. The papers cover various topics in the theory, implementation, and applications of automata and related structures.
Discrete Mathematics Using a Computer
Discrete Mathematics Using a Computer offers a new, "hands-on" approach to teaching Discrete Mathematics. Using software that is freely available on Mac, PC and Unix platforms, the functional language Haskell allows students to experiment with mathematical notations and concepts -- a practical approach that provides students with instant feedback and allows lecturers to monitor progress easily.
Logic and Theory of Algorithms ; 4th Conference on Computability in Europe, CiE 2008, Athens, Greece, June 15-20, 2008 Proceedings
Constitutes the refereed proceedings of the 4th International Conference on Computability in Europe, CiE 2008, held in Athens, Greece, in June 2008.The 36 revised full papers presented together with 25 invited tutorials and lectures were carefully reviewed and selected from 108 submissions. Among them are papers of 6 special sessions entitled algorithms in the history of mathematics, formalising mathematics and extracting algorithms from proofs, higher-type recursion and applications, algorithmic game theory, quantum algorithms and complexity, and biology and computation.
Java Challenges 100+ : Proven Tasks that Will Prepare You for Anything
Expand your knowledge of Java with this entertaining learning guide, which features 100+ exercises and programming challenges. Java Challenges will prepare you for your next exam or job interview, and covers many practical topics, such as strings, arrays, data structures, recursion, and date and time. The APIs and other material included in this book are Java 17 compatible. You will: Improve your Java knowledge by solving enjoyable but challenging programming puzzles / Solve mathematical problems, recursions, strings, arrays and more / Manage data processing and data structures like lists, sets, maps / Handle advanced recursion as well as binary trees, sorting and searching / Gamify key fundamentals for fun and easier reinforcement
Java : how to program. Late objects : Introducing Jshell
Introduction to Computers, the Internet and Java / Introduction to Java Applications; Input/Output and Operators / Control Statements: Part 1; Assignment, ++ and Operators / Control Statements: Part 2; Logical Operators / Methods / Arrays and ArrayLists / Introduction to Classes and Objects / Classes and Objects: A Deeper Look / Object-Oriented Programming: Inheritance / Object-Oriented Programming: Polymorphism and Interfaces / Exception Handling: A Deeper Look / JavaFX Graphical User Interfaces / JavaFX GUI / Strings, Characters and Regular Expressions / Files, Input/Output Streams, NIO and XML Serialization / Generic Collections / Lambdas and Streams / Recursion / Searching, Sorting and Big O / Generic Classes and Methods: A Deeper Look / Custom Generic Data Structures / JavaFX Graphics and Multimedia / Concurrency / Accessing Databases with JDBC / Introduction to JShell: Java 9's REPL for Interactive Java
Central European Functional Programming School ; 1st Central European Summer School, CEFP 2005, Budapest, Hungary, July 4-15, 2005, Revised Selected Lectures
This volume presents eight carefully revised texts of selected lectures given by leading researchers of the field at the first Central European Functional Programming School, CEFP 2005, held in Budapest, Hungary, in July 2005. The eight revised full papers presented were carefully selected during two rounds of reviewing and improvement for inclusion in the book. The lectures cover a wide range of topics such as new programming language concepts for subtyping.
Algorithms and Programming : Problems and Solutions
This book containing classical and well-known problems supplemented by clear and in-depth explanations. The material covered includes such topics as combinatorics, sorting, searching, queues, grammar and parsing, selected well-known algorithms and much more.
Advanced functional programming ; 5th International School, AFP 2004, Tartu, Estonia, August 14-21, 2004, Revised Lectures
Contains the revised lecture notes corresponding to nine of thelecture courses presented at the 5th International School on Advanced Functional Programming, AFP 2004, held in Tartu, Estonia, August 14–21, 2004. The goal of the AFP schools is to inform the wide international communitiesof computer science students and software production professionals about thenew and important developments in the area of functional programming. The schools put a special emphasis on practical applications of advanced techniques.
A Course on Mathematical Logic
This is a short, distinctive, modern, and motivated introduction to mathematical logic for senior undergraduate and beginning graduate students in mathematics and computer science. Any mathematician who is interested in knowing what logic is concerned with and who would like to learn Gödel’s incompleteness theorems should find this book particularly convenient. The treatment is thoroughly mathematical, and the entire subject has been approached like a branch of mathematics. Serious efforts have been made to make the book suitable for the classroom as well as for self-reading. The book does not strive to be a comprehensive encyclopedia of logic. Still, it gives essentially all the basic concepts and results in mathematical logic. The book prepares students to branch out in several areas of mathematics related to foundations and computability such as logic, axiomatic set theory, model theory, recursion theory, and computability.
A Concise Introduction to Mathematical Logic
This book is unique in that it is more concise than most others; the material is treated in a streamlined fashion. This allows the lecturer to select the material for a one-semester course on a topic more easily. These initial chapters cover just the material for an introductory course on mathematical logic combined with the necessary material from set theory. Chapter 3 is partly of a descriptive nature, providing a view towards decision problems, automated theorem proving, non-standard models and related subjects. The other chapters contain material on logic programming for computer scientists, model theory, recursion theory, Gödel's Incompleteness Theorems, and applications of mathematical logic. Philosophical and foundational problems of mathematics are discussed where appropriate.











