Fibring semantic tableaux (Q3838804)
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 1189097
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fibring semantic tableaux |
scientific article; zbMATH DE number 1189097 |
Statements
13 August 1998
0 references
combination of logics
0 references
semantic tableaux calculi
0 references
first-order logic
0 references
modal logic
0 references
0.8227475881576538
0 references
Fibring semantic tableaux (English)
0 references
In previous work the second author of this article developed fibring as a methodology for combining logics by combining their semantics. In other words, given two logics \(L_1\) and \(L_2\), fibring is a systematic way for generating from an interpretation of \(L_1\) and an interpretation of \(L_2\) an interpretation of their combination. This paper addresses the problem of extending such a methodology from the realm of models to the realm of proof calculi, hence proofs. The chosen calculi are semantic tableaux calculi. Thus, given a calculus for \(L_1\) and one of \(L_2\), one can form a calculus for a logic that mixes freely formulae of \(L_1\) and \(L_2\). The first part of the paper studies the conditions that logics and calculi need to satisfy for the combination to succeed. It is emphasized that these conditions are neither too strong nor too weak, and this claim appears justified. Then, the technique is applied to the specific case of combining a semantic tableaux calculus for first-order logic (FOL) with a semantic tableaux calculus for the modal logic \(K\). The paper is very clear, pleasant to read, and as self-contained as a conference paper can be. The only weakness in this respect is that the notion of restricting relation among models of logics to be combined by fibring (Defs. 13 and 14) remains somewhat obscure, partly because the only relevant example (Example 4) is trivial, and the final combination of FOL and K does not need this notion. Considering that this article was presented at an automated theorem proving conference, it remains the question of the practical impact of this technique. One would need first efficient semantic tableaux procedures for the distinct logics, and then a realization of fibring that produces an efficient procedure for the combined logic. Most likely, some design from scratch of the more powerful procedure will also be required. These issues are not studied in this paper, leaving the potential for a stream of subsequent research on efficient realizations of fibring. For the entire collection see [Zbl 0888.00018].
0 references