Many-Sorted Logic

Many-Sorted Logic

Author:

Downloads: 222

Visits: 1

Pages: 72

Published: 3 years ago

Rating: Rated: 0 times

  • 1 star
  • 2 stars
  • 3 stars
  • 4 stars
  • 5 stars

Read One Book Free!

Become a member of Free-Ebooks.net and you can download one free book.

Already a member? Login here

Membership requires a valid email address. We DO NOT spam and do not allow others access to your private information.

Book Description

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 here?2. Defining Many-Sorted Languages3. Examples of Many-Sorted Languages4. Formal Deduction5. First Results6. Defining Many-Sorted Models7. The Theory of Proofs8. Henkin's Theory

Reader Reviews
loading comments
Add a comment: (You need to login to post a comment)
Rate this title: