Kategoria BISAC: Mathematics >> Logic

Computer Science: The Hardware, Software and Heart of It focuses on the deeper aspects of the two recognized subdivisions of Computer Science, Software and Hardware. These subdivisions are shown to be closely interrelated as a result of the stored-program concept. Computer Science: The Hardware, Software and Heart of It includes certain classical theoretical computer science topics such as Unsolvability (e.g. the halting problem) and Undecidability (e.g. Godel's incompleteness theorem) that treat problems that exist under the Church-Turing thesis of computation. These problem topics...

The Semantic Web is characterized by the existence of a very large number of distributed semantic resources, which together define a network of ontologies. These ontologies in turn are interlinked through a variety of different meta-relationships such as versioning, inclusion, and many more. This scenario is radically different from the relatively narrow contexts in which ontologies have been traditionally developed and applied, and thus calls for new methods and tools to effectively support the development of novel network-oriented semantic applications.

This book by Suarez-Figueroa...

The focus of this book is on bridging the gap between two extreme methods for developing software. On the one hand, there are texts and approaches that are so formal that they scare off all but the most dedicated theoretical computer scientists. On the other, there are some who believe that any measure of formality is a waste of time, resulting in software that is developed by following gut feelings and intuitions.

Kourie and Watson advocate an approach known as "correctness-by-construction," a technique to derive algorithms that relies on formal theory, but that requires such theory...

Combinatorial Algebra: Syntax and Semantics provides comprehensive account of many areas of combinatorial algebra. It contains self-contained proofs of more than 20 fundamental results, both classical and modern. This includes Golod-Shafarevich and Olshanskii's solutions of Burnside problems, Shirshov's solution of Kurosh's problem for PI rings, Belov's solution of Specht's problem for varieties of rings, Grigorchuk's solution of Milnor's problem, Bass-Guivarc'h theorem about growth of nilpotent groups, Kleiman's solution of Hanna Neumann's problem for varieties of groups, Adian's...

Ranging from Alan Turing s seminal 1936 paper to the latest work on Kolmogorov complexity and linear logic, this comprehensive new work clarifies the relationship between computability on the one hand and constructivity on the other. The authors argue that even though constructivists have largely shed Brouwer s solipsistic attitude to logic, there remain points of disagreement to this day.

Focusing on the growing pains computability experienced as it was forced to address the demands of rapidly expanding applications, the content maps the developments following Turing s...

This book constitutes the refereed proceedings of the 19th
International Conference on Implementation and Application of Automata, CIAA 2014, held in Giessen, Germany, in July/August 2014.
The 21 revised full papers presented together with 4 invited papers were carefully selected from 36 submissions. The papers cover all aspects of implementation, application, and theory of automata and related structures such as algorithms on automata, automata and logic, bioinformatics, complexity of automata operations, compilers,
computer-aided verification, concurrency, data structure...

Introduction to Mathematical Proofs helps students develop the necessary skills to write clear, correct, and concise proofs.

Unlike similar textbooks, this one begins with logic since it is the underlying language of mathematics and the basis of reasoned arguments. The text then discusses deductive mathematical systems and the systems of natural numbers, integers, rational numbers, and real numbers.

It also covers elementary topics in set theory, explores various properties of relations and functions, and proves several theorems using induction. The final...