No label defined (Q4395552)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1163928
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1163928

      Statements

      0 references
      3 December 1998
      0 references
      axiomatic rejection
      0 references
      Axiomatic rejection is a method to recursively enumerate all the formulas not provable in the given formal system. In this paper the author develops the theory of axiomatic rejection in connection with the tableau method restricted to the classical propositional logic. The axioms and rules for axiomatic rejection are: \(\dashv D\) for any propositional variable \(D\); if \(\dashv B\) and \(\vdash A \supset B\), then \(\dashv A\); if \(\dashv A\) and \(A\) is obtained from \(B\) by uniform substitution for propositional variables, then \(\dashv B\). The author uses \(\vee\) and \(\sim\) as the only connectives and is able to formulate just one tableau rule for formulas of the form \(A \vee B\), occurring negatively in a formula \(G\). A branch in a tableau is closed if it ends with a formula \(F\) containing a formula \(A\) both positively and negatively. A Hintikka formula \(A\) is a formula satisfying: 1. it does not contain a formula \(B\) both positively and negatively; 2. if \(B \vee C\) occurs in \(A\) as a negative part, then \(B\) or \(C\) occurs in \(A\) as a negative part. The main result is that given a formula by application of the only tableau rule one obtains only branches that are closed or one obtains a branch in which no fresh formulas can be employed as the principal formula of an application of the tableau rule. Such a branch ends with a Hintikka formula. Next it is shown that every formula which belongs to a branch ending with a Hintikka formula, is axiomatically rejected. The author also proves a normal form theorem and a theorem related to Negation as Failure. Unfortunately, the English employed in the paper is poor and should have been improved. For the entire collection see [Zbl 0885.00036].
      0 references

      Identifiers