Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Intensional FOL: Many-Sorted Extension

Zoran Majkic

TL;DR

The proposed version of many-sorted IFOL is just the completion of this conceptual feature of the IFOL.

Abstract

The concepts used in IFOL have associated to them a list of sorted attributes, and the sorts are the intensional concepts as well. The requirement to extend the unsorted IFOL (Intensional FOL) to many-sorted IFOL is mainly based on the fact that a natural language is implicitly many-sorted and that we intend to use IFOL to support applications that use natural languages. Thus, the proposed version of many-sorted IFOL is just the completion of this conceptual feature of the IFOL.

Intensional FOL: Many-Sorted Extension

TL;DR

The proposed version of many-sorted IFOL is just the completion of this conceptual feature of the IFOL.

Abstract

The concepts used in IFOL have associated to them a list of sorted attributes, and the sorts are the intensional concepts as well. The requirement to extend the unsorted IFOL (Intensional FOL) to many-sorted IFOL is mainly based on the fact that a natural language is implicitly many-sorted and that we intend to use IFOL to support applications that use natural languages. Thus, the proposed version of many-sorted IFOL is just the completion of this conceptual feature of the IFOL.
Paper Structure (1 section, 1 theorem, 8 equations)

This paper contains 1 section, 1 theorem, 8 equations.

Table of Contents

  1. Introduction to Unsorted Intensional FOL

Key Result

Proposition 1

Bealer-Montague relationshipMajk22: For any logic formula (a virtual predicate) $\phi(\textbf{x})$, with a tuple of free variables $\textbf{x}$, its extension in a possible world $w \in \mathcal{W}$ satisfies the following equation

Theorems & Definitions (5)

  • definition thmcounterdefinition
  • definition thmcounterdefinition
  • definition thmcounterdefinition
  • Proposition 1
  • definition thmcounterdefinition