2005•Journal of Shaanxi Normal UniversityRequires access

Notes on proving of (strong) completeness theorem of L

Hongjun Zhou

Open publisher page 0 citations

Abstract

The details of proving the completeness theorem of formula system L~*, which is given by Prof. Wang, are reviewed, and the proving of strong completeness about L~* is analyzed and revised. In addition, an equivalent description of representation theorem on strong negation operator is given, moreover, the generalized tautology on infinite valued logic based on different strong negation operators w.r.t. R_0-implication is studied, and a new partition based on fixed point of a strong negation is also obtained.

About this research paper

What this paper is about

The details of proving the completeness theorem of formula system L~*, which is given by Prof. Wang, are reviewed, and the proving of strong completeness about L~* is analyzed and revised. In addition, an equivalent description of representation theorem on strong negation operator is given, moreover, the generalized tautology on infinite valued logic based on different strong negation operators w.r.t. R_0-implication is studied, and a new partition based on fixed point of a strong negation is also obtained.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The details of proving the completeness theorem of formula system L~*, which is given by Prof. Wang, are reviewed, and the proving of strong completeness about L~* is analyzed and revised. In addition, an equivalent description of representation theorem on strong negation operator is given, moreover, the generalized tautology on infinite valued logic based on different strong negation operators w.r.t. R_0-implication is studied, and a new partition based on fixed point of a strong negation is also obtained.

Key concepts: Negation, Gödel's completeness theorem, Completeness (order theory), Mathematics, Negation as failure, Tautology (logic), Discrete mathematics, Operator (biology)

Related papers

Back to paper searchBrowse research topicsOriginal source
Notes on proving of (strong) completeness theorem of L — Research Paper | ScholarLens