Many sorted languages are the natural way how to formalize mathematical theories. This text provides an introduction to many-sorted logic and models. Our main focus is to formulate and prove the most important theorems of mathematical logic: The Correctness, Completeness and Compactness Theorems. We will also present examples of common many-sorted languages along the way, including the language of modules over rings, of ring-extensions and that of sets and classes.Contents:1. What do we have...
This book is downloadable in PDF, ePub, Kindle and TXT format.
<div id="page-error">You currently don't have Adobe Reader installed. In order to view this file, please <a href="https://get.adobe.com/reader/" target="_blank">download Adobe Reader</a>.<br><br>Alternatively, you can try to <a href="https://www.free-ebooks.net/mathematics-textbooks/Many-Sorted-Logic/pdf?dl&preview" target="_blank">open the preview in a new tab or window</a>.</div>
