ManySortedFirst-orderLogic-McMasterUniversity.pptVIP

Many Sorted First-order Logic Student: Liuxing Kan Instructor: William Farmer Dept. of Computing and Software McMaster University, Hamilton, CA Contents Introduction: What is many sorted FOL Syntax: Languages of many sorted FOL Syntax: Terms and Formulas of many sorted FOL Example of Many-sorted FOL Semantics Semantics of many sorted FOL Proof Theory of Many-sorted FOL The completeness of many-sorted logic Reduction many-sorted logic to one-sorted logic Reference Introduction: what is many-sorted FOL Sometimes people want to express properties of structures of different sorts (types). There are plenty of examples of subjects where the semantics of formulas are many-sorted structures. For instance, in geometry, to take a simple and ancient example, we use universes of pointes, lines, angles, triangles, rectangles, polygons, etc. By adding to the formalism of first-order logic the notion of sort, we can obtain a flexible and convenient logic called many-sorted first order logic, which has the same properties as first order logic. In contrast to FOL, in many-sorted FOL, the arguments of function and predicate symbols may have different sorts, and constant and function symbols also have some sorts. Uses of many-sorted logic: abstract data types, semantics and program verification, definition of programming languages, algebras for logic, databases, dynamic logic, semantics of natural languages, computer-aided problem solving, knowledge representation of design, logic programming and automated deduction. Syntax: Languages of many sorted FOL In contrast to standard first-order languages, in many-sorted first order languages, the argument of function and predicate symbols may have different sorts, and constant and function symbols also have some sort. Technically, this means that a many-sorted alphabet is a many-sorted ranked alphabet. (An S-ranked alphabet is pair(Σ,r) consisting of a set Σ together with a function r: Σ→S*×S assigning a rank (u, s) to each symbol f