Kategoria BISAC: Mathematics >> Logic

Reverse mathematics studies the complexity of proving mathematical theorems and solving mathematical problems. Typical questions include: Can we prove this result without first proving that one? Can a computer solve this problem? A highly active part of mathematical logic and computability theory, the subject offers beautiful results as well as significant foundational insights.

This text provides a modern treatment of reverse mathematics that combines computability theoretic reductions and proofs in formal arithmetic to measure the complexity of theorems and problems from all...

It is not always clear what computer programs mean in the various languages in which they can be written, yet a picture can be worth 1000 words, a diagram 1000 instructions.

In this unique textbook/reference, programs are drawn as string diagrams in the language of categories, which display a universal syntax of mathematics (Computer scientists use them to analyze the program semantics; programmers to display the syntax of computations). Here, the string-diagrammatic depictions of computations are construed as programs in a single-instruction programming language.  Such...

How should we think about the meaning of the words that make up our language? How does reference of these terms work, and what is their referent when these are connected to abstract objects rather than to concrete ones? Can logic help to address these questions? This collection of papers aims to unify the questions of syntax and semantics of language, which span across the fields of logic, philosophy and ontology of language. The leading motif of the presented selection is the differentiation between linguistic tokens (material, concrete objects) on the one hand and linguistic types...