A Recursively Axiomatizable Subsystem of Levesque’s Logic of Only Knowing

Ho Ngoc Duc

doi:10.20965/jaciii.2003.p0283

single-jc.php

« previous

JACIII Vol.7 No.3 pp. 283-288

doi: 10.20965/jaciii.2003.p0283

(2003)

Paper:

Views over last 60 days: 536

A Recursively Axiomatizable Subsystem of Levesque’s Logic of Only Knowing

Ho Ngoc Duc

Institute for Information Systems, University of Luebeck, Ratzeburger Allee 160, 23562 Luebeck, Germany

Received:

August 26, 2003

Accepted:

September 1, 2003

Published:

October 20, 2003

Keywords:

only-knowing, non-monotonic reasoning, knowledge representation

Abstract

A complete, recursive axiomatization of a subsystem of Levesque’s only-knowing logic is given. The sublogic is obtained by relaxing some of Levesque’s semantic conditions while keeping the most important definitions unchanged. The axiom system is obtained by adding an axiom of Humberstone to a subset of the set of Levesque’s axioms. The completeness result is proved using the subordination method of Hughes and Cresswell.

Cite this article as:

H. Duc, “A Recursively Axiomatizable Subsystem of Levesque’s Logic of Only Knowing,” J. Adv. Comput. Intell. Intell. Inform., Vol.7, No.3, pp. 283-288, 2003.

Data files:

This article is published under a Creative Commons Attribution-NoDerivatives 4.0 Internationa License.