Abstract
In the paper, we examine tableau systems for R. Epstein’s logics of content relationship: \(\mathbf {D}\) (Dependence Logic), \(\mathbf {DD}\) (Dual Dependence Logic), \(\mathbf {Eq}\) (Logic of Equality of Content), \(\mathbf {S}\) (Symmetric Relatedness Logic) and \(\mathbf {R}\) (Nonsymmetric Relatedness Logic) (Epstein in The semantic foundations of Logic, Springer Science + Business Media, Dordrecht, (1990), cf. Epstein in Philos Stud 36:137–173, 1979, Epstein in Rep. Math. Logic 21:19–34, 1987, Klonowski in Logic Log Philos, accepted for publication, Krajewski in J Non Class Logic 8:7–33, 1991). The first tableau systems for those logics were defined by Carnielli (Rep Math Logic 21:35–46, 1987). However, his approach has some limitations, for example, it requires a proof of functional completeness and axiomatization. Notwithstanding the first two constraints, it does not include all Epstein logics, e.g., logic \(\mathbf {Eq}\). Unlike Carnielli’s approach, here we use setassignment semantics to determine those logics. Since syntax and semantics of a given logic usually determine a minimal syntax and structure of a tableau system for the logic along with other properties, we propose a uniform tableau framework for the logics determined by setassignment semantics. What distinguishes our tableau systems is that they combine the features of tableaux for propositional logics and syllogistic logics when the problem of content of propositions is analysed in tableau proofs. To denote the content of propositions in the proofs, we use generalised labels (explored in the syllogistic context in Jarmużek and Goré (In: Fitting (ed.) Landscapes in Logic, College Publications, London, accepted)).
Introduction
The aim of this paper is to introduce tableau systems for some logics of content relationship that were proposed by R. Epstein ([6], cf. [4, 5, 16, 17]); these logics are: \(\mathbf {D}\) (Dependence Logic), \(\mathbf {DD}\) (Dual Dependence Logic), \(\mathbf {Eq}\) (Logic of Equality of Content), \(\mathbf {S}\) (Symmetric Relatedness Logic), and \(\mathbf {R}\) (Nonsymmetric Relatedness Logic).
The significance of the paper lies in the fact that, while some tableau systems for Epstein logics have been previously proposed by W. Carnielli [1], his approach faces serious limitations.^{Footnote 1} For starters, it requires a proof of functional completeness and axiomatization. Furthermore, Carnielli’s approach does not include logic \(\mathbf {Eq}\). And, in the case of tableau rules for \(\mathbf {D}\), there are some problems regarding completeness.^{Footnote 2}
In order to avoid these issues, here, we propose to examine Epstein’s logics from the perspective of his setassignment semantics. Since syntax and semantics of a given logic usually determine a minimal syntax and structure of a tableau system for the logic along with other properties, we propose a uniform tableau framework. What would be characteristic of the tableau systems that we present in this paper is that, when the problem of content of propositions is analysed in tableau proofs, our systems can combine the features of tableaux for propositional logics and syllogistic logics. In proofs, we use generalised labels (explored in the syllogistic context in [14]) to denote content of propositions. The combination of these features makes our proposal more robust and stronger than Carnielli’s and other alternatives.
The paper consists of three parts. In the first one, we present Epstein’s logics of content relationship. In the second part, we propose tableau systems for all considered logics and we provide the proof of the adequacy of each system. In the appendix, we consider some examples of tableau proofs to illustrate the applications of the introduced rules.
Epstein’s Logics of Content Relationship
The interest in the problem of how to interpret the implication connective was already present in ancient times; but, nowadays, such an interest has increased to the point in which the formal analysis of conditional sentences constitutes the basis of many nonclassical logics. The formal analysis of the implication often begins with the examination of a particular instance of this connective, the material implication and its paradoxical laws or properties; and it moves forward onto the many (nonclassical) attempts to block or remove these paradoxes. It is worth noticing that the large majority of enterprises that pursue this are motivated by phenomena other than the way in which classical logical values might influence the logical value of the implication.
An instance of these phenomena would be the content relationship of sentences. Take for example the case of a conditional sentence, it seems sensible to say that for such a sentence to be true it is not enough for either the antecedent to be false or the consequent to be true. As a matter of fact, we would expect that the truth of the sentence depends, at least partially, on the antecedent being related to the consequent content wise. And while this intuition has been wellaccepted among contemporary logicians, there has been a significant discussion regarding how to formally represent and analyse this content relationship. We will focus on Richard Epstein’s [6] formal approach to content relationship (cf. [4, 5, 16, 17]).
Language and Semantics
Let \(\mathbb {N}\) be the set of natural numbers. The language of Epstein’s logic is the following propositional language \(\mathcal {L}\):
where \(\mathsf {Var}= \{p^{i} :i \in \mathbb {N} \}\) is a set of propositional variables. (Sometimes we will use simply the letters: \(p, q, r,\ldots \).)
The set of formulas is defined in a standard way and denoted by \(\mathsf {For}\). We will use the following abbreviation for any \({A},{B}\in \mathsf {For}\):
We will also use some standard notations:

the set of all subsets of \(\Sigma \) (the power set of \(\Sigma \)) will be denoted by \(\mathcal {P}(\Sigma )\)

the set of propositional variables of formula \({A}\in \mathsf {For}\) will be denoted by \(\mathsf {var}({A})\).
Moreover, let \(\mathsf {n}\) be a function from \(\mathcal {P}(\mathsf {Var})\) to \(\mathcal {P}(\mathbb {N})\) defined as follows: \(i \in \mathsf {n}(\Sigma )\) iff for some \(p^{i} \in \mathsf {Var}\), \(p^{i} \in \Sigma \), for all \(\Sigma \subseteq \mathsf {Var}\), \(i \in \mathbb {N}\).
In what follows, we define five Epstein’s content relationship logics: three dependence logics (\(\mathbf {D}\), \(\mathbf {DD}\), \(\mathbf {Eq}\)) and two relatedness logics (\(\mathbf {S}\) and \(\mathbf {R}\)) (see [6], cf. [4, 5, 16, 17]). These formal systems can be defined in two ways: by means of setassignment semantics (see [6], cf. [4, 5, 16, 17]) and by means of relating semantics (see [7], cf. [10,11,12, 16, 19]).^{Footnote 3} We focus, however, on the first approach.
A setassignment structure is an ordered pair \(\langle v,s\rangle \) such that \(v:\mathsf {Var}\longrightarrow \{1,0\}\) is a classical valuation of propositional variables and \(s:\mathsf {For}\longrightarrow \mathcal {P}(\Sigma )\), where \(\Sigma \) is any set, is the socalled setassignment.^{Footnote 4} For the definition of logics \(\mathbf {D}\), \(\mathbf {DD}\), \(\mathbf {Eq}\), the set \(\Sigma \) might be empty but for the definition of relatedness logic \(\mathbf {S}\), we have to assume nonemptiness of \(s({A})\), for any variable \({A}\in \mathsf {Var}\), so nonemptiness of \(\Sigma \) as well.^{Footnote 5} For both cases, we use a union setassignment, i.e., a setassignment \(s:\mathsf {For}\longrightarrow \mathcal {P}(\Sigma )\) such that for any \({A}\in \mathsf {For}\), we have:
By means of setassignments, Epstein proposes to formally represent contents of sentences. In the truthcondition for implication in addition to the classical condition, it is required that some, a priori assumed, relation holds between the formal representations of contents.
Having a structure \(\langle v,s\rangle \), in order to determine Epstein’s logics, we assume the following definitions of \({R}_{\Lambda }\subseteq \mathsf {For}\times \mathsf {For}\), where \(\Lambda \in \{ \mathbf {D},\mathbf {DD},\mathbf {Eq},\mathbf {S}, \mathbf {R}\}\). For any \({A},{B}\in \mathsf {For}\):

for logic \(\mathbf {D}\), \({R}_{\mathbf {D}}({A},{B}) \text { iff }s({B})\subseteq s({A})\)

for logic \(\mathbf {DD}\), \({R}_{\mathbf {DD}}({A},{B})\text { iff }s({A})\subseteq s({B})\)

for logic \(\mathbf {Eq}\), \({R}_{\mathbf {Eq}}({A},{B})\text { iff }s({A})=s({B})\)

for logic \(\mathbf {S}\), \({R}_{\mathbf {S}}({A},{B})\text { iff }s({A})\cap s({B})\ne \emptyset \)

for logic \(\mathbf {R}\), \({R}_{\mathbf {R}}({A},{B}) \text { iff }{\left\{ \begin{array}{ll} {A}= {B}\text { or } \mathsf {n}({A}) \in s({B}), &{} \text { if } {A}, {B}\in \mathsf {Var}\\ \exists _{x \in \mathsf {var}({A})} \exists _{y \in \mathsf {var}({B})} {R}_{\mathbf {R}}(x, y), &{} \text { otherwise. } \end{array}\right. }\)
We would like to make two comments on the logic \(\mathbf {R}\). First, for the relating approach to the logic \(\mathbf {R}\), Epstein defined the set of reflexive relations constructed in the following way. He defined reflexive relations on \(\mathsf {Var}\times \mathsf {Var}\), and then extended them to \({R}\subseteq \mathsf {For}\times \mathsf {For}\) by the condition: \({R}({A}, {B})\) iff \(\exists _{x \in \mathsf {var}({A})} \exists _{y \in \mathsf {var}({B})} {R}(x,y)\). We can call the relations relatedness relations of content (see [16]). It is quite easy to see that: (a) the relation \({R}_{\mathbf {R}}\) is a relatedness relation of content; (b) for any relatedness relation of content \({R}\subseteq \mathsf {For}\times \mathsf {For}\), there exists such a union setassignment \(s:\mathsf {For}\longrightarrow \mathcal {P}(\Sigma )\) that \({R}={R}_{\mathbf {R}}\). We can consider \(s:\mathsf {For}\longrightarrow \mathcal {P}(\mathbb {N})\) defined in the following way, for any \({B}\in \mathsf {Var}\), \(s(B)=\{i\in \mathbb {N}:{R}(p^{i}, {B}) \}\). We extend the function on the whole set of formulas in the following way: \(s({A})=\bigcup \{s({B})\in \mathcal {P}(\mathbb {N}):{B}\in \mathsf {var}({A})\}\). This is a special case of (uSA), when \(\Sigma = \mathbb {N}\).
Second, in the considerations on the content relationship, it is assumed by Epstein that \({R}_{\mathbf {S}}({A},{B})\text { iff }s({A})\cap s({B})\ne \emptyset \). Also for the logic \(\mathbf {R}\) it is assumed that two propositions should share the content but it requires introducing two setassignments (see [6, 16, 17]). In the approach we propose, for two different variables \({A}\), \({B}\), \({R}_{\mathbf {R}}({A},{B})\) does not have to imply \(s({A})\cap s({B})\ne \emptyset \). It is because it is possible that, \(\mathsf {n}({A}) \in s({B})\), but \(\mathsf {n}({A}) \not \in s({A})\), when \({A}\), \({B}\) are different. For the moment we might think what happens if we also assume that \(\mathsf {n}({A}) \in s({A})\). So instead of the definition that we have proposed:
\({R}_{\mathbf {R}}({A},{B}) \text { iff }{\left\{ \begin{array}{ll} {A}= {B}\text { or } \mathsf {n}({A}) \in s({B}), &{} \text { if } {A}, {B}\in \mathsf {Var}\\ \exists _{x \in \mathsf {var}({A})} \exists _{y \in \mathsf {var}({B})} {R}_{\mathbf {R}}(x, y), &{} \text { otherwise, } \end{array}\right. }\)
we could alternatively assume the following one:
\({R}'_{\mathbf {R}}({A},{B}) \text { iff }{\left\{ \begin{array}{ll} {A}= {B}\text { or } [\mathsf {n}({A}) \in s({B}) \text { and } \mathsf {n}({A}) \in s(A)], &{} \text { if } {A}, {B}\in \mathsf {Var}\\ \exists _{x \in \mathsf {var}({A})} \exists _{y \in \mathsf {var}({B})} {R}'_{\mathbf {R}}(x, y), &{} \text { otherwise.} \end{array}\right. }\)
Both definitions, of \({R}_{\mathbf {R}}\) and \({R}_{\mathbf {R}}'\), are inductive. They differ only in the initial case for variables. Let us check this case. We take the structure: \(\langle v,s\rangle \) and assume that we consider two different variables \({A}, {B}\in \mathsf {Var}\). Clearly, if \({R}_{\mathbf {R}}'({A},{B})\), then \({R}_{\mathbf {R}}({A},{B})\). The inverse side is much more interesting. Let us assume that it is not that \({R}_{\mathbf {R}}'({A},{B})\) and simultaneously \(\mathsf {n}({A}) \in s({B})\), but \(\mathsf {n}({A}) \not \in s(A)\). Since we assumed that \({A}\) and \({B}\) are different, so it does not matter if \(\mathsf {n}({A}) \in s(A)\). For both relations, \({R}_{\mathbf {R}}({A},{B})\) and \({R}_{\mathbf {R}}'({A},{B})\), if \(A = B\).
Let us make a conclusion on the base of the last remark. From the logical point of view, whether we assume the first definition or the second one, it does not matter. Both provide the same logic. But it is worth noting that \({R}_{\mathbf {R}}'({A},{B})\) implies \(s({A})\cap s({B})\ne \emptyset \), and this results in the fact that \({R}_{\mathbf {R}}' \subseteq {R}_{\mathbf {S}}\). Independently, we know, however, that the logic \(\mathbf {R}\) is a sublogic of \(\mathbf {S}\) (see [4, 6, 16]).
Knowing these relationships, we want to simplify the approach to tableaux. So, in the further tableau analysis of \(\mathbf {R}\), we assume the first definition, i.e., the definition of \({R}_{\mathbf {R}}\).
A set of structures becomes a set of models only if some special relation is set between them. It is usually a binary relation of satisfiability between a structure and any formula \(A\in \mathsf {For}\).
Definition 2.1
(\(\Lambda \)–model). Let \(\mathfrak {M}= \langle v,s\rangle \) be a structure. Let \(\Lambda \in \{\mathbf {D},\mathbf {DD},\mathbf {Eq},\mathbf {S}, \mathbf {R}\}\). \(\mathfrak {M}\) is a model of \(\Lambda \) (in short: \(\Lambda \)–model) iff for any \({A}, {B}\in \mathsf {For}\):
We have the standard definition of semantic consequence and validity.
Definition 2.2
(Semantic consequence in \(\Lambda \)). Let \(\Lambda \in \{\mathbf {D},\mathbf {DD},\mathbf {Eq},\mathbf {S}, \mathbf {R}\}\) and \(\Sigma \cup \{{A}\}\subseteq \mathsf {For}\):

\({A}\) is a semantic consequence of \(\Sigma \) in \(\Lambda \) (in symb.: \(\Sigma \models _{\Lambda }{A}\)) iff for any \(\Lambda \)model \(\mathfrak {M}\), if for any \({B}\in \Sigma \), \(\mathfrak {M}\models {B}\), then \(\mathfrak {M}\models {A}\)

\({A}\) is a valid formula of \(\Lambda \) (in symb.: \(\models _{\Lambda }{A}\)) iff \(\emptyset \models _{\Lambda }{A}\).
As we noticed above the logic \(\mathbf {R}\) is a sublogic of the logic \(\mathbf {S}\). Excluding the logic \(\mathbf {S}\) or the logic \(\mathbf {R}\) we get logics that are independent. To show such independence let us consider the following formulas:
The following table specifies which formulas are valid (\(+\)) and which are not (−) for a given logic:
Variable Sharing and Paradoxes of Implication
Let us notice that Epstein’s logics satisfy the variable sharing property, i.e., for any \(\Lambda \in \{\mathbf {D},\mathbf {DD},\mathbf {Eq},\mathbf {S}, \mathbf {R}\}\) and any \({A},{B}\in \mathsf {For}\), if \(\models _{\Lambda }{A}\rightarrow {B}\), then \(\mathsf {var}({A})\cap \mathsf {var}({B})\ne \emptyset \). Indeed, if \(\mathsf {var}({A})\cap \mathsf {var}({B})=\emptyset \), then \(\mathsf {var}({B})\not \subseteq \mathsf {var}({A})\), \(\mathsf {var}({A})\not \subseteq \mathsf {var}({B})\), \(\mathsf {var}({A})\ne \mathsf {var}({B})\) and obviously \(\mathsf {var}({A})\cap \mathsf {var}({B})=\emptyset \). Also for all variables \(x \in \mathsf {var}(A), y \in \mathsf {var}(B)\), \(\mathsf {n}(x) \not \in \mathsf {var}(y)\).
Clearly, \(\mathsf {var}:\mathsf {For}\longrightarrow \mathcal {P}(\mathsf {Var})\) is a union setassignment, so with that, we can define \(\Lambda \)model \(\mathfrak {M}\) such that \(\mathfrak {M}\not \models {A}\rightarrow {B}\).
The variable sharing property enables us to see that if a formula is not true in the model of the form \(\langle v,\mathsf {var}\rangle \), then it is not valid in any of Epstein’s logics. However in order to determine the analysed logics, we cannot consider only setassignment structures of the form \(\langle v,\mathsf {var}\rangle \). As Epstein noticed in [6], structures with \(\mathsf {var}\) validate too much; for instance, consider the law of importation and the law of exportation.^{Footnote 6}
Let us also notice that for any of the analysed logics, none of the following paradoxes of implication is valid:
In order to prove that neither (6) nor (7) is valid, it is enough to notice that the truth of q and the truth of \(\lnot p\) respectively do not entail that for any union setassignment s, any of the considered relations between s(p) and s(q) hold. However, in order to prove that (8) and (9) are not valid, we can make use of a variable sharing property.
Proof Theory
In the previous section, we used the abbreviation of the form \({A}\looparrowright {B}\). For all Epstein’s logics, it enables one to express in the language that a proper relation between outputs of setassignments holds. More specifically, for any \({A},{B}\in \mathsf {For}\) and any setassignment structure \(\mathfrak {M}=\langle v,s\rangle \) and any \(\Lambda \in \{\mathbf {D},\mathbf {DD},\mathbf {Eq},\mathbf {S},\mathbf {R}\}\), if \(\mathfrak {M}\) is \(\Lambda \)model, then \(\mathfrak {M}\models {A}\looparrowright {B}\) iff \({R}_{\Lambda }({A},{B})\).
This is the basis of Epstein’s axiomatic systems of \(\mathbf {D}\), \(\mathbf {DD}\), \(\mathbf {Eq}\), \(\mathbf {S}\), and \(\mathbf {R}\) (see [6], cf. [4]). Indeed, formulas (1), (2), (3), (4) and (5) are examples of the axioms of the analysed logics: (1) of logic \(\mathbf {D}\), (2) of logics \(\mathbf {DD}\), \(\mathbf {S}\) and \(\mathbf {R}\), (3) of logic \(\mathbf {Eq}\), but it is also a thesis of \(\mathbf {D}\) and \(\mathbf {DD}\), (4) of logics \(\mathbf {S}\) and \(\mathbf {Eq}\), (5) of logics \(\mathbf {D}\), \(\mathbf {S}\) and \(\mathbf {R}\).^{Footnote 7}
In the 1980s and 1990s, other proof methods were specified for Epstein’s logics and some of their modifications. Luis Fari\(\tilde{\text {n}}\)as del Cerro and Valérie Lugardon [3] defined sequent systems for certain modification of Epstein’s dependence logics, specifically for modifications of \(\mathbf {D}\), \(\mathbf {DD}\) and \(\mathbf {Eq}\), determined by setassignment structures defined over a selected union setassignment. In [2], logics of this kind were extended onto a first order language and sequent systems for these extensions were defined. Other interesting results were presented by Francesco Paoli, who focused on FDEfragments of Epstein’s logics.^{Footnote 8} In [20], Paoli presented the FDEfragment of \(\mathbf {S}\) from the algebraic, matrices, and axiomatic points of view. This analysis was extended onto other FDEfragments of Epstein’s logics in [22]. In that paper Paoli, also discussed tableaux for these FDEfragments. In contrast to these approaches, in what follows, we focus on tableau systems that can account for the whole logics \(\mathbf {D}\), \(\mathbf {DD}\), \(\mathbf {Eq}\), \(\mathbf {S}\) and \(\mathbf {R}\).
Tableaux
The first tableau systems for selected Epstein logics – being examples of relating logics – were introduced by W. Carnielli [1]. Carnielli in his paper focused on the relatedness logic \(\mathbf {S}\) and suggested how one can modify the presented approach to get tableau systems for the relatedness logic \(\mathbf {R}\), the dependence logic \(\mathbf {D}\), and its dual version the logic \(\mathbf {DD}\). However, this approach, as we wrote in the introduction, has a number of limitations.^{Footnote 9}
But Carnielli’s was not the only attempt to provide tableau systems for the logics of the considered type. Other tableau systems for a few relating logics, weaker than Epstein’s logics, were given by Jarmużek and Klonowski in [11] (a tableau system for even weaker logic was presented in [9]). Furthermore, tableau systems for certain connexive logics defined on the basis of relating logics were defined by Jarmużek and Malinowski [12] (cf. [13]).
In what follows, we present a tableau approach that allows to define adequate tableau systems for various logics determined by setassignment semantics. We focus on logics: \(\mathbf {D}\), \(\mathbf {DD}\), \(\mathbf {Eq}\), \(\mathbf {S}\) and \(\mathbf {R}\).
Tableau Language
The language of tableau system is the language of \(\mathcal {L}\) extended by auxiliary expressions. We assume an additional symbol: \(\mathord {\sim }\) (negation for new expressions). The set of auxiliary expressions \(\mathsf {Ae}\) is the union of the following sets:

\(\mathbb {N}\times \mathsf {For}\)

\(\{\langle \mathord {\sim }i, A \rangle :\langle i, A \rangle \in \mathbb {N}\times \mathsf {For}\}\).
Expressions of the form \(\langle i, A \rangle \) and \(\langle \mathord {\sim }i, A \rangle \) are supposed to represent that object i belongs to the content of A or i does not belong to the content of A, respectively. If it is not misleading, we will omit the brackets: \(\langle \, \, \, \, \rangle \). So for example, instead of \(\langle \mathord {\sim }i, A\rangle \) or \(\langle i, A \rangle \), we will just write i, A, and \(\mathord {\sim }i, A\), etc.
You can see, we are using labels here to denote the content of the sentences. This is part of the tableaux strategy for syllogistic logic, where generalized labels can denote many different things [14].
The set of tableau expressions is the set \(\mathsf {Ex}= \mathsf {For}\cup \mathsf {Ae}\). This is a language we conduct tableau proofs in it. Finally, we define a branch inconsistent set of expressions.
Definition 3.1
(Branch inconsistent set of expressions). Let \(\Sigma \subseteq \mathsf {Ex}\).

\(\Sigma \) is branch inconsistent iff it contains at least two expressions that form a complementary pair of any of the following forms:

\({A},\lnot {A}\)

\(\langle i,{A}\rangle ,\langle \mathord {\sim }i,{A}\rangle \),
for any \({A}\in \mathsf {For}\), \(i \in \mathbb {N}\).


\(\Sigma \) is branch consistent iff \(\Sigma \) is not branch inconsistent.
Tableau Rules
We assume some general set of tableau rules for all logics we examine here. For the elimination of connectives, we have:
The above rules do not need any comments. They reflect the classical truth conditions for \(\wedge \), \(\lnot \) and partially \(\rightarrow \). For particular logics, we will complete the rule for implication. For the reduction of auxiliary expressions, we assume the general rules:
Both rules correspond to the uniform set assignment condition (uSA). \((\text {R}_{i})\) says that if object i belongs to the content of formula \({A}\), then object i belongs to the content of at least one variable of \({A}\). In turn, \((\text {R}_{\mathord {\sim }i})\) postulates that if object i does not belong to the content of \({A}\), then object i does not belong to the content of any atomic proposition of \({A}\).^{Footnote 10}
Now we introduce specific rules for the particular logics. For logic \(\mathbf {D}\), we assume:
Both presented tableau rules reflect the truthcondition for implication in logic \(\mathbf {D}\). In case of \((\text {R}_{\mathbf {D}\rightarrow })\), the content of consequence is included in the content of antecedent. In case of \((\text {R}_{\mathbf {D}\lnot \rightarrow })\), A is true, but B false, or the content of consequence is not included in the content of antecedent.^{Footnote 11}
The specific tableau rules for logic \(\mathbf {DD}\) are:
The ideas behind \((\text {R}_{\mathbf {DD}\rightarrow })\) and \((\text {R}_{\mathbf {DD}\lnot \rightarrow })\) are similar to the latter tableau rules. However, now inversely, the content of antecedent is included in the content of consequence.
For logic \(\mathbf {Eq}\) we assume the tableau rules \((\text {R}_{\mathbf {D}\rightarrow })\) and \((\text {R}_{\mathbf {DD}\rightarrow })\), since the content of antecedent is equal to the content of consequence. But for negation of implication, we combine the rules \((\text {R}_{\mathbf {D}\lnot \rightarrow })\) and \((\text {R}_{\mathbf {DD}\lnot \rightarrow })\) into one rule^{Footnote 12}:
For logic \(\mathbf {S}\), we assume specific tableau rules:
Both rules (without and with negation) introduce new labels since content of propositions is possibly supposed to be nonempty for \(\mathbf {S}\). However, while in the case of \((\text {R}_{\mathbf {S}\rightarrow })\) both propositions have the same content, in \((\text {R}_{\mathbf {S}\lnot \rightarrow })\), the content is different and so the labels must be different. Additionally, we assume the tableau rule \((\text {R}_{\mathbf {S}})\):
The rule \((\text {R}_{{\mathbf {S}}})\) guarantees that two propositions do not share any label if they have labels introduced by application of \((\text {R}_{\mathbf {S}\lnot \rightarrow })\). All the rules correspond to the truth condition for implication in \(\mathbf {S}\): the intersection of the content of antecedent and the content of consequence is nonempty.^{Footnote 13}
Finally, for logic \(\mathbf {R}\), we assume specific tableau rules:
The rule \((\text {R}_{\mathbf {R}\rightarrow })\) is applicable when \(\mathsf {var}(A) \cap \mathsf {var}(B) = \emptyset \). This rule expresses this part of the truthcondition for relating implication which requires that for some \({A}_{i} \in \mathsf {var}({A})\), \(\mathsf {n}({A}_{i}) \in s({B}_{j})\), for some \({B}_{j} \in \mathsf {var}({B})\). When \(\mathsf {var}(A) \cap \mathsf {var}(B) \not = \emptyset \), it is only needed to use the rule \((\text {R}_{\rightarrow })\), since \({A}\) and \({B}\) share at least one variable.
The rule \((\text {R}_{\mathbf {R}\lnot \rightarrow }(1))\) is applicable when \(\mathsf {var}(A) \cap \mathsf {var}(B) = \emptyset \). This rule splits a proof. The left side corresponds to the traditional negative condition for implication: so the antecedent is true, while the consequence is false. The right side negatively expresses this part of the truthcondition for relating implication, which requires that for some \({A}_{i} \in \mathsf {var}({A})\), \(\mathsf {n}({A}_{i}) \in s({B}_{j})\), for some \({B}_{j} \in \mathsf {var}({B})\). So we have a string: \(\mathord {\sim }k_{1},{B}_{1}, \dots , \mathord {\sim }k_{m},{B}_{1}, \dots , \mathord {\sim }k_{1},{B}_{n}, \dots ,\mathord {\sim }k_{m},{B}_{n}\), where \(\mathsf {n}(\mathsf {var}(A)) = \{k_{1}, \dots , k_{m}\}\) and \(\mathsf {var}(B) = \{B_{1}, \dots , B_{n} \}\). In the tableau language, it just states that for all \({A}_{i} \in \mathsf {var}({A})\), \(\mathsf {n}({A}_{i}) \not \in s({B}_{j})\), for all \({B}_{j} \in \mathsf {var}({B})\).
When \(\mathsf {var}(A) \cap \mathsf {var}(B) \not = \emptyset \), the rule \((\text {R}_{\mathbf {R}\lnot \rightarrow }(1))\) is not applicable, since \({A}\) and \({B}\) share at least one variable. In this case, we have only the left side of \((\text {R}_{\mathbf {R}\lnot \rightarrow }(1))\), so we must use the rule \((\text {R}_{\lnot \rightarrow } (2))\)^{Footnote 14}:
It is worth underlining that in our formulation of tableau rules for the logic \(\mathbf {R}\), we do not need to use the rules \((\text {R}_{i})\) and \((\text {R}_{\mathord {\sim }i})\). All rules we have defined for the relating implication in \(\mathbf {R}\) just reduce the indexes to the level of variables.
By \(\mathsf {tr}(\Lambda )\) we will denote the set of tableau rules for logic \(\Lambda \), where \(\Lambda \in \{\mathbf {D},\mathbf {DD},\mathbf {Eq},\mathbf {S}, \mathbf {R}\}\).
For any tableau rules expressions, in the numerator will be called input, while expressions from the denominator will be called output. As an example, let us take the rule: (\(\text {R}_{\wedge }\)). One of its inputs is \(\{p \wedge q \}\) and then the corresponding output is set \(\{p, q\}\). Notice that this rule is a nonbranching one, i.e., for any input, it has got only one output (one set of formulas). On the other hand, (\(\text {R}_{\mathbf {D}\lnot \rightarrow }\)) is a branching rule and in this case we have two outputs, for example: \(\{p,\lnot q\}\), and \(\{\langle i, \mathord {\sim }p \rangle , \langle i, q \rangle )\}\) for some new i, if the input is \(\{ \lnot (p \rightarrow q) \}\).
Once we have the notion of input, we can define the notion of applicability of a rule. Let (R) be a tableau rule and \(\Sigma \in \mathsf {Ex}\). (R) is applicable to \(\Sigma \) iff an input of the (R) is a subset of \(\Sigma \) and \(\Sigma \) is a branch consistent set.
It is worth noting that our rules for setassignment semantics combine two aspects. On the one hand, these are rules that contain the classic truth aspect: it takes place in case of pure formulas in the tableau rules. However, on the other hand, we have a syllogistic aspect. In case of expressions with labels, we treat formulas as names and labels as denotation. Thus, formula \({A}\) is treated as a name of the content in expressions like \(\langle \mathord {\sim }i,{A}\rangle \) or \(\langle i,{A}\rangle \) (cf. [14]).
Tableau Consequence Relation
We define the relation of tableau consequence by referring to the concept of closure under tableau rules.^{Footnote 15} This is the equivalent of \(\models _{\Lambda }\) for the individual logics \(\Lambda \) we are considering. Of course, any particular tableau consequence relation depends on the rules for a given logic used in the proof.
Definition 3.2
(Closure under tableau rules). Let \(\Lambda \in \{\mathbf {D},\mathbf {DD},\mathbf {Eq}, \mathbf {S}, \mathbf {R}\}\) and \(\Sigma ,\Gamma \subseteq \mathsf {Ex}\). \(\Gamma \) is a closure of \(\Sigma \) under tableau rules of \(\mathsf {tr}(\Lambda )\) (for short: \(\mathsf {tr}(\Lambda )\)closure of \(\Sigma \)) iff there exists such a subset of natural numbers K that:

\(K = \mathbb {N}\) or \(K = \{1, \dots , n \}\) for some \(n \in \mathbb {N}\)

there exists such an injective sequence \(f :K \longrightarrow \mathcal {P}(\mathsf {Ex})\) that:

\(X_{1} = \Sigma \)

for all \(i, i+1 \in K\), there exists such a tableau rule (R) of \(\mathsf {tr}(\Lambda )\) that its input is included in \(X_{i}\), while one of its corresponding outputs is equal to \(X_{i+1} \setminus X_{i}\)

for all \(i, i+1 \in K\), for any tableau rule (R) of \(\mathsf {tr}(\Lambda )\), if (R)’s input is included in \(X_{i}\) and one of (R)’s corresponding outputs is equal to \(X_{i+1} \setminus X_{i}\), then there are no such \(j, j+1 \in K\) that \(j > i\) and one of the remaining outputs of (R) is equal to \(X_{j+1} \setminus X_{j}\)

for any tableau rule (R) of \(\mathsf {tr}(\Lambda )\), if (R)’s input is included in \(\bigcup _{i \in K}X_{i}\), then one of the (R)’s corresponding outputs is in \(\bigcup _{i \in K}X_{i}\)


\(\Gamma = \bigcup _{i \in K}X_{i}\).
In practice, we can treat the notion of closure given in the definition of the closure as the notion of a complete branch (closed or open). In fact, it is the union of all elements that are on a complete branch.
Definition 3.3
(Tableau consequence relation). Let \(\Lambda \in \{\mathbf {D},\mathbf {DD},\mathbf {Eq}, \mathbf {S}, \mathbf {R}\}\) and \(\Sigma \mathrel {\cup }\{{A}\}\subseteq \mathsf {For}\).

\({A}\) is a tableau consequence of \(\Sigma \) in \(\Lambda \) (in symb.: \(\Sigma \rhd _{\Lambda }\,{A}\)) iff there is a finite set \(\Gamma \subseteq \Sigma \) such that any \(\mathsf {tr}(\Lambda )\)closure of \(\Gamma \cup \{\lnot {A}\}\) is branch inconsistent.

\({A}\) is a thesis of \(\Lambda \) (in symb.: \(\rhd _{\Lambda }\,{A}\)) iff \(\emptyset \rhd _{\Lambda }{A}\).
Here we have proposed a quite formal definition of tableau proof, reduced to the notion of closure under the set of tableau rules. However, in Appendix we present the examples of tableau proofs written in the standard, less formal way.
Soundness, Completeness and Decidability
Now, we would like to be able to select labels from sets of expressions. We define a function:
Definition 3.4
(Function choosing labels). The function choosing labels is the function \(\circ :\mathsf {Ex}\cup \mathcal {P}(\mathsf {Ex}) \longrightarrow \mathcal {P}(\mathbb {N})\) defined by conditions:

\(\circ (A) = \emptyset \)

\(\circ (\langle i, A \rangle ) = \circ (\langle \mathord {\sim }i, A \rangle ) = \{ i \}\)

\(\circ (\Sigma ) = \bigcup \{\circ (x) :x \in \Sigma \}\)
for all \({A}\in \mathsf {For}\), \(\Sigma \subseteq \mathsf {For}\), and \(i \in \mathbb {N}\).
We can now generalize the notion of interpretation of a set of expressions in a model.
Definition 3.5
(Model suitable for a set of expressions). Let \(\Lambda \in \{\mathbf {D},\mathbf {DD},\mathbf {Eq},\mathbf {S}, \mathbf {R}\}\), \(\mathfrak {M}=\langle v,s\rangle \) be \(\Lambda \)model with the domain \(\Gamma \) for the set assignment function \(s\), \(\Sigma \subseteq \mathsf {Ex}\), and let \(\Gamma \subseteq \Gamma '\). \(\mathfrak {M}\) is suitable for \(\Sigma \) iff there exists a function \(\mathsf {f}:\circ (\Sigma ) \longrightarrow \Gamma '\) such that:

if \({A}\in \Sigma \) then \(\mathfrak {M}\models {A}\)

if \(\langle i, {A}\rangle \in \Sigma \) then \(\mathsf {f}(i) \in s({A})\)

if \(\langle \mathord {\sim }i, {A}\rangle \in \Sigma \) then \(\mathsf {f}(i) \not \in s({A})\)
for all \({A},{B}\in \mathsf {For}\) and \(i \in \mathbb {N}\).
One comment to the definition is needed. We assume the extended domain \(\Gamma '\) for the case of logic \(\mathbf {R}\) where we use the superscripts of variables as the part of content (see the part of the proof of the Lemma 3.6 for the logic \(\mathbf {R}\), the case for the rule \((\text {R}_{\mathbf {R}\lnot \rightarrow }(1))\)).
It is clear that for a branch inconsistent set of expressions no model is suitable.
The following lemma enables us to prove soundness theorems for considered logics.
Lemma 3.6
(Soundness lemma.) Let \(\Lambda \in \{\mathbf {D},\mathbf {DD},\mathbf {Eq},\mathbf {S}, \mathbf {R}\}\), \(\Sigma \subseteq \mathsf {Ex}\) and \(\mathfrak {M}=\langle v,s\rangle \) be a model \(\Lambda \)model suitable for \(\Sigma \). For any tableau rule (R) of \(\mathsf {tr}(\Lambda )\), if (R) has been applied to \(\Sigma \), then \(\mathfrak {M}\) is suitable for the union of \(\Sigma \) and at least one output obtained by the application of rule (R).
Proof
Assume all the hypotheses. For the cases in which the general elimination rules for connectives (\((\text {R}_{\wedge })\), \((\text {R}_{\rightarrow })\), \((\text {R}_{\lnot \wedge })\), \((\text {R}_{\lnot \lnot })\)) are applied, the proof is obvious because they behave classically. We consider only two general cases for connectives.

Suppose \((\text {R}_{\wedge })\) has been applied to \(\Sigma \) . Then, \({A}\wedge {B}\in \Sigma \) and we get output \(\{{A}, {B}\}\). Because the model \(\mathfrak {M}\) is suitable for \(\Sigma \), by Definition 3.5 of suitable model, \(\mathfrak {M}\models {A}\wedge {B}\). Thus, by Definition 2.1 of \(\Lambda \)model, \(\mathfrak {M}\models {A}\) and \(\mathfrak {M}\models {B}\). Hence, by Definition 3.5 of suitable model, the model \(\mathfrak {M}\) is suitable for the set \(\Sigma \cup \{{A}, {B}\}\).

Suppose \((\text {R}_{\rightarrow })\) has been applied to \(\Sigma \). Then, \({A}\rightarrow {B}\in \Sigma \) and we get two outputs \(\{\lnot {A}\}\) and \(\{{B}\}\) . Because the model \(\mathfrak {M}\) is suitable for \(\Sigma \), by Definition 3.5 of suitable model, \(\mathfrak {M}\models {A}\rightarrow {B}\). Thus, by Definition 2.1 of \(\Lambda \)model, \(\mathfrak {M}\models \lnot {A}\) or \(\mathfrak {M}\models {B}\). Hence, by Definition 3.5 of suitable model, the model \(\mathfrak {M}\) is suitable for the set \(\Sigma \cup \{\lnot {A}\}\) or for the set \(\Sigma \cup \{ {B}\}\).
Now we examine general cases of the tableau rules for reduction of auxiliary expressions. We have two cases \((\text {R}_{i})\) and \((\text {R}_{\mathord {\sim }i})\):

Suppose \((\text {R}_{i})\) has been applied to \(\Sigma \). Then, \(\langle i, {A}\rangle \in \Sigma \) and we get noutputs \(\{\langle i, {A}_{1} \rangle \}\), ..., \(\{\langle i, {A}_{n} \rangle \}\), where \(\mathsf {var}(A) = \{{A}_{1}, \dots , {A}_{n} \}\). Because the model \(\mathfrak {M}\) is suitable for \(\Sigma \), by Definition 3.5 of suitable model, there exists a function \(\mathsf {f}:\circ (\Sigma ) \longrightarrow \Gamma '\) such that \(\mathsf {f}(i) \in s({A})\). But by the uniform set assignment condition (uSA), it means that \(\mathsf {f}(i) \in s({A}_{k})\), for some \(1 \le k \le n\). So, by Definition 3.5 of suitable model, the model \(\mathfrak {M}\) is suitable for the set \(\Sigma \cup \{\langle i, {A}_{k} \rangle \}\).

Suppose \((\text {R}_{\mathord {\sim }i})\) has been applied to \(\Sigma \). Then, \(\langle \mathord {\sim }i, {A}\rangle \in \Sigma \) and we get the output \(\{\langle \mathord {\sim }i, {A}_{1} \rangle , \dots , \langle \mathord {\sim }i, {A}_{n} \rangle \}\), where \(\mathsf {var}(A) = \{{A}_{1}, \dots , {A}_{n} \}\). Because the model \(\mathfrak {M}\) is suitable for \(\Sigma \), by Definition 3.5 of suitable model, there exists a function \(\mathsf {f}:\circ (\Sigma ) \longrightarrow \Gamma '\) such that \(\mathsf {f}(i) \not \in s({A})\). But by the uniform set assignment condition (uSA), it means that \(\mathsf {f}(i) \not \in s(A_{k})\), for all \(1 \le k \le n\). So, by Definition 3.5 of suitable model, the model \(\mathfrak {M}\) is suitable for the set \(\Sigma \cup \{\langle \mathord {\sim }i, A_{1} \rangle , \dots , \langle \mathord {\sim }i, A_{n} \rangle \}\).
Let us assume that \(\Lambda = \mathbf {D}\). We must consider two cases: \((\text {R}_{\mathbf {D}\rightarrow })\) and \((\text {R}_{\mathbf {D}\lnot \rightarrow })\).

Suppose \((\text {R}_{\mathbf {D}\rightarrow })\) has been applied to \(\Sigma \). Then, \({A}\rightarrow {B}\) and \(\langle C, i \rangle \) \(\in \Sigma \), where \(\mathsf {var}({C}) \subseteq \mathsf {var}(B)\), and we get output \(\{\langle i, {A}\rangle \}\). Because the model \(\mathfrak {M}\) is suitable for \(\Sigma \), by Definition 3.5 of suitable model, \(\mathfrak {M}\models {A}\rightarrow {B}\) and \(s({B}) \subseteq s({A})\) (\(\mathfrak {M}\) is \(\mathbf {D}\)model). Moreover, there exists a function \(\mathsf {f}:\circ (\Sigma ) \longrightarrow \Gamma '\) such that \(\mathsf {f}(i) \in s({C})\). But by the uniform set assignment condition (uSA), it means that \(\mathsf {f}(i) \in \bigcup s( \mathsf {var}({C}))\) and, since \(\mathsf {var}({C}) \subseteq \mathsf {var}(B)\), \(\mathsf {f}(i) \in s({A})\). Hence, by Definition 3.5 of suitable model, the model \(\mathfrak {M}\) is suitable for the set \(\Sigma \cup \{\langle i, {A}\rangle \}\).

Suppose \((\text {R}_{\mathbf {D}\lnot \rightarrow })\) has been applied to \(\Sigma \). Then, \(\lnot ({A}\rightarrow {B}) \in \Sigma \), and we get two outputs \(\{{A}, \lnot {B}\}\) and \(\{\langle \mathord {\sim }i, {A}\rangle , \langle i, {B}\rangle \}\), where i is a new label on the branch. Because the model \(\mathfrak {M}\) is suitable for \(\Sigma \), by Definition 3.5 of suitable model, (1) \(\mathfrak {M}\not \models {A}\) and \(\mathfrak {M}\models {B}\), or (2) \(s({B}) \not \subseteq s({A})\) (\(\mathfrak {M}\) is \(\mathbf {D}\)model). If (1) happens, by Definition of 2.1 and Definition 3.5 of suitable model, the model \(\mathfrak {M}\) is suitable for the set \(\Sigma \cup \{{A}, \lnot {B}\}\). If (2) happens, there exists such \(a \in \Gamma '\) that \(a \in s(B)\) and \(a \not \in s(A)\). Additionally, by Definition 3.5 of suitable model, there exists a function \(\mathsf {f}:\circ (\Sigma ) \longrightarrow \Gamma '\). However, i is a new label on the branch. So we define the extension of \(\mathsf {f}\), the function \(\mathsf {f}' :\circ (\Sigma )\cup \{ i \} \longrightarrow \Gamma '\) with \(\mathsf {f}'(i) = a\). Thus, by Definition 3.5 of suitable model, the model \(\mathfrak {M}\) is suitable for the set \(\Sigma \cup \{\langle \mathord {\sim }i, {A}\rangle , \langle i, {B}\rangle \}\).
Let us assume that \(\Lambda = \mathbf {DD}\). The cases are similar to the former ones. In models for \(\mathbf {DD}\), we have just the inverse inclusion and in \(\mathsf {tr}(\mathbf {DD})\), inverse tableau rules \((\text {R}_{\mathbf {DD}\rightarrow })\) and \((\text {R}_{\mathbf {DD}\lnot \rightarrow })\).
Let us assume that \(\Lambda = \mathbf {Eq}\). The cases are also similar to the former ones. In models for \(\mathbf {Eq}\), we have just both inclusions and in \(\mathsf {tr}(\mathbf {Eq})\), the tableau rules \((\text {R}_{\mathbf {D}\rightarrow })\) and \((\text {R}_{\mathbf {DD}\rightarrow })\). The tableau rule \((\text {R}_{\mathbf {Eq}\lnot \rightarrow })\) is a combination of the rules: \((\text {R}_{\mathbf {D}\lnot \rightarrow })\) and \((\text {R}_{\mathbf {DD}\lnot \rightarrow })\), which were checked for the proper inclusions.
Let us assume that \(\Lambda = \mathbf {S}\). We must consider three cases: \((\text {R}_{\mathbf {S}\rightarrow })\), \((\text {R}_{\mathbf {S}\lnot \rightarrow })\), and \((\text {R}_{\mathbf {S}})\).

Suppose \((\text {R}_{\mathbf {S}\rightarrow })\) has been applied to \(\Sigma \). Then, \({A}\rightarrow {B}\in \Sigma \), \(\mathsf {var}({A}) \cap \mathsf {var}({B}) = \emptyset \), and we get output \(\{\langle i, {A}\rangle , \langle i, {B}\rangle \}\), where i is new on the branch. Because the model \(\mathfrak {M}\) is suitable for \(\Sigma \), by Definition 3.5 of suitable model, \(\mathfrak {M}\models {A}\rightarrow {B}\) and \(s({B}) \cap s({A}) \not = \emptyset \) (\(\mathfrak {M}\) is \(\mathbf {S}\)model). So, there is some \(a \in s({B}) \cap s({A})\). Moreover, there exists a function \(\mathsf {f}:\circ (\Sigma ) \longrightarrow \Gamma '\). Since i is a new label on the branch, we define the extension of \(\mathsf {f}\), the function \(\mathsf {f}' :\circ (\Sigma )\cup \{ i \} \longrightarrow \Gamma '\) with \(\mathsf {f}'(i) = a\). Thus, by Definition 3.5 of suitable model, the model \(\mathfrak {M}\) is suitable for the set \(\Sigma \cup \{\langle i, {A}\rangle , \langle i, {B}\rangle \}\).

Suppose \((\text {R}_{\mathbf {S}\lnot \rightarrow })\) has been applied to \(\Sigma \). Then, \(\lnot ({A}\rightarrow {B}) \in \Sigma \) and we get two outputs \(\{{A}, \lnot {B}\}\) and \(\{\langle i, {A}\rangle , \langle j, {B}\rangle \}\), where i, j are new labels on the branch and are different. Because the model \(\mathfrak {M}\) is suitable for \(\Sigma \), by Definition 3.5 of suitable model, (1) \(\mathfrak {M}\not \models {A}\) and \(\mathfrak {M}\models {B}\), or (2) \(s({B}) \cap s({A}) = \emptyset \) (\(\mathfrak {M}\) is \(\mathbf {S}\)model). If (1) happens, by definition of 2.1 and Definition 3.5 of suitable model, the model \(\mathfrak {M}\) is suitable for the set \(\Sigma \cup \{{A}, \lnot {B}\}\). If (2) happens, there exist such \(a, b \in \Gamma '\) that \(a \in s(A)\), \(a \not \in s(B)\), and \(b \not \in s(A)\), \(b \in s(B)\), \(s({B}) \cap s({A}) = \emptyset \) and in \(\mathbf {S}\)models the content of propositions is assumed to be nonempty. Additionally, by Definition 3.5 of suitable model, there exists a function \(\mathsf {f}:\circ (\Sigma ) \longrightarrow \Gamma '\). However, i, j are new labels on the branch. So we define the extension of \(\mathsf {f}\), the function \(\mathsf {f}' :\circ (\Sigma )\cup \{ i, j \} \longrightarrow \Gamma '\) with \(\mathsf {f}'(i) = a\), \(\mathsf {f}'(j) = b\). Thus, by Definition 3.5 of suitable model, the model \(\mathfrak {M}\) is suitable for the set \(\Sigma \cup \{\langle i, {A}\rangle , \langle j, {B}\rangle \}\).

Suppose \((\text {R}_{\mathbf {S}})\) has been applied to \(\Sigma \). Then, \(\lnot ({A}\rightarrow {B}), \langle i,{A}\rangle , \langle j,{B}\rangle , \langle k,{A}\rangle \in \Sigma \), where i, j are introduced by the rule (\(\text {R}_{\mathbf {S}\lnot \rightarrow }\)), we get the output \(\{\langle \mathord {\sim }k,{B}\rangle \}\) and thus, i and j are different. Because the model \(\mathfrak {M}\) is suitable for \(\Sigma \), by Definition 3.5 of suitable model, \(s({B}) \cap s({A}) = \emptyset \) (\(\mathfrak {M}\) is \(\mathbf {S}\)model) and there exists a function \(\mathsf {f}:\circ (\Sigma ) \longrightarrow \Gamma '\) with \(\mathsf {f}(i) \in s(A)\), \(\mathsf {f}(i) \not \in s(B)\), \(\mathsf {f}(j) \not \in s(A)\), \(\mathsf {f}(j) \in s(B)\), \(\mathsf {f}(k) \in s(A)\), \(\mathsf {f}(k) \not \in s(B)\). Thus, by Definition 3.5 of suitable model, the model \(\mathfrak {M}\) is suitable for the set \(\Sigma \cup \{\langle \mathord {\sim }k, {B}\rangle \}\).
Let us finally assume that \(\Lambda = \mathbf {R}\). We must consider three cases: \((\text {R}_{\mathbf {R}\rightarrow })\), \((\text {R}_{\mathbf {R}\lnot \rightarrow }(1))\), and \((\text {R}_{\mathbf {R}\lnot \rightarrow }(2))\).

Suppose \((\text {R}_{\mathbf {R}\rightarrow })\) has been applied to \(\Sigma \). Then, \({A}\rightarrow {B}\in \Sigma \), and we get the number of outputs equal to: m multiplied by n, where \(\mathsf {n}(\mathsf {var}(A)) = \{k_{1}, \dots , k_{m}\}\) and \(\mathsf {var}({B}) = \{{B}_{1}, \dots , {B}_{n}\}\). Because the model \(\mathfrak {M}\) is suitable for \(\Sigma \), by Definition 3.5 of suitable model, \(\mathfrak {M}\models {A}\rightarrow {B}\) and for some \({A}_{i} \in \mathsf {var}({A})\), \(\mathsf {n}({A}_{i}) \in s({B}_{j})\), for some \({B}_{j} \in \mathsf {var}({B})\), since \(\mathsf {var}(A) \cap \mathsf {var}(B) = \emptyset \) (\(\mathfrak {M}\) is \(\mathbf {R}\)model). Let us assume than \(k_{i} \in s({B}_{j})\). If \(k_{i}\) is a new label on the branch, we define the extension of \(\mathsf {f}\), the function \(\mathsf {f}' :\circ (\Sigma )\cup \{ k_{i} \} \longrightarrow \Gamma '\) with \(\mathsf {f}'(k_{i}) = k_{i}\) and then \(\mathsf {f}'(k_{i}) \in s({B}_{j})\). If for some reasons \(k_{i}\) is not a new label on the branch, the function \(\mathsf {f}\) is sufficient to state that \(\mathsf {f}(k_{i}) \in s({B}_{j})\). In both cases, by Definition 3.5 of suitable model, the model \(\mathfrak {M}\) is suitable for the set \(\Sigma \cup \{\langle k_{i}, {B}_{j} \rangle \}\).

Suppose \((\text {R}_{\mathbf {R}\lnot \rightarrow }(1))\) has been applied to \(\Sigma \). Then, \(\lnot ({A}\rightarrow {B}) \in \Sigma \), \(\mathsf {var}(A) \cap \mathsf {var}(B) = \emptyset \), and we get two outputs: (a) \(\{ {A}, \lnot {B}\}\) and (b) \(\{ \mathord {\sim }k_{1},{B}_{1}\), ..., \(\mathord {\sim }k_{m},{B}_{1}\), ..., \(\mathord {\sim }k_{1},{B}_{n}\), ..., \(\mathord {\sim }k_{m},{B}_{n} \}\), where \(\mathsf {n}(\mathsf {var}(A)) = \{k_{1}, \dots , k_{m}\}\) and \(\mathsf {var}(B) = \{B_{1}, \dots , B_{n} \}\). Because the model \(\mathfrak {M}\) is suitable for \(\Sigma \), by Definition 3.5 of suitable model, either (a)’ \(\mathfrak {M}\models {A}\) and \(\mathfrak {M}\models \lnot {B}\) or (b)’ for all \({A}_{i} \in \mathsf {var}({A})\), \(\mathsf {n}({A}_{i}) \not \in s({B}_{j})\), for all \({B}_{j} \in \mathsf {var}({B})\), since \(\mathsf {var}(A) \cap \mathsf {var}(B) = \emptyset \) (\(\mathfrak {M}\) is \(\mathbf {R}\)model). If (a)’ happens, by Definition 3.5 of suitable model, the model \(\mathfrak {M}\) is suitable for the set \(\Sigma \cup \{{A}, \lnot B\}\). If (b)’ happens, by Definition 3.5 of suitable model, the model \(\mathfrak {M}\) is suitable for the set \(\Sigma \cup \{\mathord {\sim }k_{1},{B}_{1}\), ..., \(\mathord {\sim }k_{m},{B}_{1}\), ..., \(\mathord {\sim }k_{1},{B}_{n}\), ..., \(\mathord {\sim }k_{m},{B}_{n}\}\), since either we use the existing function \(\mathsf {f}:\circ (\Sigma ) \longrightarrow \Gamma '\) and then \( \mathsf {f}(k_{1}) \not \in s(B_{1})\), ..., \(\mathsf {f}(k_{m}) \not \in s({B}_{1})\), ..., \(\mathsf {f}(k_{1}) \not \in s({B}_{n})\), ..., \(\mathsf {f}(k_{m}) \not \in s({B}_{n})\), or we extend it to the function \(\mathsf {f}':\circ (\Sigma ) \cup \{k_{1}, \dots , k_{m}\} \longrightarrow \Gamma '\), under which \(\mathsf {f}'(k_{1}) = k_{1}, \dots , \mathsf {f}'(k_{m}) = k_{m}\), and then \( \mathsf {f}'(k_{1}) \not \in s(B_{1})\), ..., \(\mathsf {f}'(k_{m}) \not \in s({B}_{1})\), ..., \(\mathsf {f}'(k_{1}) \not \in s({B}_{n})\), ..., \(\mathsf {f}'(k_{m}) \not \in s({B}_{n})\).

Suppose \((\text {R}_{\mathbf {R}\lnot \rightarrow }(2))\) has been applied to \(\Sigma \). Then, \(\lnot ({A}\rightarrow {B}) \in \Sigma \), \(\mathsf {var}(A) \cap \mathsf {var}(B) = \emptyset \), and we get one output \(\{ {A}, \lnot {B}\}\). Since the model \(\mathfrak {M}\) is suitable to \(\{ \lnot ({A}\rightarrow {B}) \}\) and \(\mathsf {var}(A) \cap \mathsf {var}(B) \not = \emptyset \) (\(\mathfrak {M}\) is \(\mathbf {R}\)model), by Definition 3.5 of suitable model, \(\mathfrak {M}\) is also suitable to the set \(\Sigma \cup \{{A}, \lnot B\}\).
\(\square \)
When we have a closure under \(\mathsf {tr}(\Lambda )\) tableau rules, we can try to generate \(\Lambda \)model. Here we introduce the definition of generated structure.
Definition 3.7
(Structure generated) Let \(\Sigma \subseteq \mathsf {Ex}\). A structure generated by \(\Sigma \) (for short: \(\Sigma \) structure) is \(\langle v_{\Sigma },s_{\Sigma }\rangle \) such that:

\(v_{\Sigma }(A) = 1\) iff \(A \in \Sigma \), for any \({A}\in \mathsf {Var}\)

\(s_{\Sigma }:\mathsf {For}\longrightarrow \mathcal {P}(\{i :\langle i, A \rangle \in \Sigma \} )\)

\(i \in s_{\Sigma }(A)\) iff for some \({B}\in \mathsf {var}({A})\): \(\langle i, {B}\rangle \in \Sigma \), for any \({A}\in \mathsf {For}\).
In the case of \(\Lambda \in \{\mathbf {D},\mathbf {DD},\mathbf {Eq}\}\) a structure can be a model, if \(\Sigma \) is a branch consistent \(\mathsf {tr}(\Lambda )\)closure, but the case of \(\mathbf {S}\) needs a little modification.
Corollary 3.8
Let \(\Sigma \subseteq \mathsf {Ex}\) be a branch consistent \(\mathsf {tr}(\Lambda )\)closure, where \(\Lambda \in \{\mathbf {D},\mathbf {DD},\mathbf {Eq}, \mathbf {S}, \mathbf {R}\}\). Then there exists a structure \(\langle v_{\Sigma },s_{\Sigma }\rangle \) that is a \(\Lambda \)model.
Proof
If \(\Sigma \subseteq \mathsf {Ex}\) is a \(\mathsf {tr}(\Lambda )\)closure of some set, where \(\Lambda \in \{\mathbf {D},\mathbf {DD},\mathbf {Eq}, \mathbf {R}\}\), and \(\Sigma \) is branch consistent, then the structure \(\langle v_{\Sigma },s_{\Sigma }\rangle \) is a \(\Lambda \)model. It is because truth conditions for \(\mathbf {D},\mathbf {DD},\mathbf {Eq}, \mathbf {R}\) require only settheoretical relations/operations (Definition 2.1). Also the condition (uSA) is satisfied, which is a result of application of the tableau rules \((\text {R}_{i})\) and \((\text {R}_{\mathord {\sim }i})\) in cases of \(\mathbf {D},\mathbf {DD},\mathbf {Eq}\). One exception is logic \(\mathbf {S}\), because the \(\mathbf {S}\)models require nonempti
ness of assigned sets. So in this case, we add to the set \(\{i :\langle i, A \rangle \in \Sigma \}\) a new object a and redefine function \(s_{\Sigma }\) to function \(s'_{\Sigma }:\mathsf {For}\longrightarrow \mathcal {P}(\{i :\langle i, A \rangle \in \Sigma \} \cup \{a \})\) in the following way:
Then, the structure \(\langle v_{\Sigma },s'_{\Sigma }\rangle \) is an \(\mathbf {S}\)model. \(\square \)
The following lemma enables us to prove completeness theorems for considered logics.
Lemma 3.9
(Completeness lemma.) Let \(\Lambda \in \{\mathbf {D},\mathbf {DD},\mathbf {Eq}, \mathbf {S}, \mathbf {R}\}\) and \(\Sigma \) be a branch consistent closure under \(\mathsf {tr}(\Lambda )\). Then there is a \(\Lambda \)model such that for any \(A \in \mathsf {For}\), if \({A}\in \Sigma \), then \(\mathfrak {M}\models {A}\).
Proof
Assume all the hypotheses. For \(\Lambda \in \{\mathbf {D},\mathbf {DD},\mathbf {Eq}, \mathbf {S}, \mathbf {R}\}\) there exists a structure \(= \langle v_{\Sigma },s_{\Sigma }\rangle \) that is a \(\Lambda \)model \(\mathfrak {M}\) (Corollary 3.8). We make an inductive proof of the thesis.
Base case. Let \(A \in \mathsf {Var}\). Suppose \(A \in \Sigma \). Then, by Definition 3.7\(\mathfrak {M}\models A\). Suppose that \(\lnot A \in \Sigma \). Then, by Definition 3.7\(\mathfrak {M}\not \models A\), since \(\Sigma \) is branch consistent. So \(\mathfrak {M}\models \lnot A\).
Inductive hypothesis. Let \(n \in \mathbb {N}\). Let \(\mathsf {c}\) be a function of the complexity of formulas. Suppose that for any \(A \in \mathsf {For}\) such that \(\mathsf {c}(A) \le n\), if \({A}\in \Sigma \), then \(\mathfrak {M}\models {A}\).
Inductive step. Let \({A}\in \mathsf {For}\) and and \(\mathsf {c}(A) = n + 1\).
The cases for formulas built by means of classical connectives and their negations, i.e., \({B}\wedge {C}\), \(\lnot ({B}\wedge {C})\), \(\lnot \lnot {B}\), follow from the inductive hypothesis and applications of the tableau rules \((\text {R}_{\wedge })\), \((\text {R}_{\lnot \wedge })\), \((\text {R}_{\lnot \lnot })\), since \(\Sigma \) is a closure under tableau rules \(\mathsf {tr}(\Lambda )\). The cases for implication and negation depends on the logic \(\Lambda \).
Let us assume \(\Lambda = \mathbf {DD}\).
Let \({A}: = {B}\rightarrow {C}\). Since \(\Sigma \) is a closure under tableau rules, \((\text {R}_{\rightarrow })\) was applied and (1) \(\lnot {B}\) or (2) \({C}\in \Sigma \). If (1) happens, by the inductive hypothesis \(\mathfrak {M}\models \lnot {B}\). If (2) happens, then by the inductive hypothesis \(\mathfrak {M}\models {C}\). Regardless of whether (1) or (2) happens, we have: \(\mathfrak {M}\models {B}\) implies \(\mathfrak {M}\models {C}\). However, the rule \((\text {R}_{\mathbf {DD}\rightarrow })\) still could be applied to \({B}\rightarrow {C}\), if some \(\langle i, D \rangle \in \Sigma \), where \(\mathsf {var}(D) \subseteq \mathsf {var}(B)\). If there is no such expression, then \(s_{\Sigma }(B) = \emptyset \) and \(s_{\Sigma }(B) \subseteq s_{\Sigma }(C)\). If there is such expression, then \(i \in s_{\Sigma }(B)\), and by the rule \((\text {R}_{\mathbf {DD}\rightarrow })\), \(i \in s_{\Sigma }(C)\), so \(s_{\Sigma }(B) \subseteq s_{\Sigma }(C)\). Both by the definition of generated model 3.7. Putting these together with: \(\mathfrak {M}\models {B}\) implies \(\mathfrak {M}\models {C}\), we get \(\mathfrak {M}\models {B}\rightarrow {C}\).
Let \({A}: = \lnot ({B}\rightarrow {C})\). Since \(\Sigma \) is a closure under rules, so the rule \((\text {R}_{\mathbf {DD}\lnot \rightarrow })\) was applied. So (1) \({B}, \lnot {C}\in \Sigma \) or (2) \(\langle i, B \rangle , \langle \mathord {\sim }i, C \rangle \in \Sigma \) where i is a new label on the branch. If (1) happens, then by the inductive hypothesis \(\mathfrak {M}\models {B}\) and \(\mathfrak {M}\models \lnot {C}\). So, \(\mathfrak {M}\models \lnot ({B}\rightarrow {C})\). If (2) happens, then by the inductive hypothesis \(i \in s_{\Sigma }(C)\) and \(i \not \in s_{\Sigma }(B)\), so \(s_{\Sigma }(B) \not \subseteq s_{\Sigma }(C)\). Thus in both cases \(\mathfrak {M}\models \lnot ({B}\rightarrow {C})\), by the definition of model 2.1.
Let us assume \(\Lambda = \mathbf {D}\). The proofs of the cases for implication and negated implication are similar to the proofs for \(\Lambda = \mathbf {DD}\). We examine the tableau rules \((\text {R}_{\rightarrow })\), \((\text {R}_{\mathbf {DD}\rightarrow })\), and \((\text {R}_{\mathbf {DD}\lnot \rightarrow })\), under assumption that in the \(\mathbf {D}\)models we have the condition of the inverse inclusion of contents for the implication.
Let us assume \(\Lambda = \mathbf {Eq}\). The case for implication in \(\mathbf {Eq}\) includes cases for \(\mathbf {D}\) and \(\mathbf {DD}\). In \(\mathbf {Eq}\)models, in the truth condition for implication we have the identity of contents, so two inclusions. So, we would have to check rules: \((\text {R}_{\mathbf {D}\rightarrow })\) and \((\text {R}_{\mathbf {DD}\rightarrow })\). For the case of negated implication, we have the tableau rule \((\text {R}_{\mathbf {Eq}\lnot \rightarrow })\). The checking of the tree possibilities reduces to what we have already done for the negated implication case in \(\mathbf {DD}\) plus the inverse rule (and the inverse inclusion) in the case of \(\mathbf {D}\).
Let us assume \(\Lambda = \mathbf {S}\).
Let \({A}: = {B}\rightarrow {C}\). Since \(\Sigma \) is a closure under tableau rules, \((\text {R}_{\mathbf {S}\rightarrow })\) was applied and \(\langle i, {B}\rangle , \langle i, {C}\rangle \in \Sigma \), where i is new on the branch. By the definition of generated model 3.7, \(i \in s_{\Sigma } ({B})\) and \(i \in s_{\Sigma } ({C})\), so \(i \in s_{\Sigma } ({B}) \cap s_{\Sigma } ({C})\) which fulfills one part of the truth condition for the implication in \(\mathbf {S}\)models: \(s_{\Sigma } ({B}) \cap s_{\Sigma } ({C}) \ne \emptyset \). Since \(\Sigma \) is a closure under tableau rules, so also \((\text {R}_{\rightarrow })\) was also applied and (1) \(\lnot {B}\) or (2) \({C}\in \Sigma \). If (1) happens, then by the inductive hypothesis \(\mathfrak {M}\models \lnot {B}\). If (2) happens, then by the inductive hypothesis \(\mathfrak {M}\models {C}\). Regardless of whether (1) or (2) happens, putting all facts together, we have \(\mathfrak {M}\models {B}\rightarrow {C}\).
Let \({A}: = \lnot ({B}\rightarrow {C})\). Since \(\Sigma \) is a closure under tableau rules, \((\text {R}_{\mathbf {S}\lnot \rightarrow })\) was applied and (1) \({B}, \lnot {C}\in \Sigma \) or (2) \(\langle i, {B}\rangle , \langle j, \lnot C \rangle \in \Sigma \), where i, j are new on the branch and \(i\ne j\). The case (1) was examined for \(\mathbf {DD}\). For case (2) let us notice that i and j are different and if \(\langle k, {B}\rangle \in \Sigma \) (or \(\langle k, {C}\rangle \in \Sigma \)) then \(\langle \mathord {\sim }k, {C}\rangle \in \Sigma \) (or \(\langle k, \mathord {\sim }{B}\rangle \in \Sigma \)), by the tableau rule \((\text {R}_{\mathbf {S}})\). So, by the definition of generated model 3.7, \(s_{\Sigma } ({B}) \cap s_{\Sigma } ({C}) = \emptyset \). Whether (1) or (2), \(\mathfrak {M}\models \lnot ({B}\rightarrow {C})\).
Let us assume \(\Lambda = \mathbf {R}\).
Let \({A}: = {B}\rightarrow {C}\) and \(\mathsf {var}(A) \cap \mathsf {var}(B) = \emptyset \) (if \(\mathsf {var}(A) \cap \mathsf {var}(B) = \emptyset \) then the case is similar to the former logics, since then \((\text {R}_{\rightarrow })\) was applied). Since \(\Sigma \) is a closure under tableau rules, \((\text {R}_{\mathbf {R}\rightarrow })\) was applied and \(\langle k_{i}, {C}_{j} \rangle \in \Sigma \), where \(k_{i} \in \mathsf {n}(\mathsf {var}(A))\) and \(B_{j} \in \mathsf {var}({C})\). By the definition of generated model 3.7, \(k_{i} \in s_{\Sigma } ({C})\), which fulfills one part of the truth condition for the implication in \(\mathbf {R}\)models. Since \(\Sigma \) is a closure under tableau rules, so also \((\text {R}_{\rightarrow })\) was also applied and (1) \(\lnot {B}\) or (2) \({C}\in \Sigma \). If (1) happens, then by the inductive hypothesis \(\mathfrak {M}\models \lnot {B}\). If (2) happens, then by the inductive hypothesis \(\mathfrak {M}\models {C}\). Regardless of whether (1) or (2) happens, putting all facts together, we have \(\mathfrak {M}\models {B}\rightarrow {C}\).
Let \({A}: = \lnot ({B}\rightarrow {C})\). We have two possibilities: (a) \(\mathsf {var}(A) \cap \mathsf {var}(B) = \emptyset \) and the rule \((\text {R}_{\mathbf {R}\lnot \rightarrow }(1))\) was applied, (b) \(\mathsf {var}(A) \cap \mathsf {var}(B) \not = \emptyset \) and the rule \((\text {R}_{\mathbf {R}\lnot \rightarrow }(2))\) was applied, since \(\Sigma \) is a closure under rules. In case of (a) we have two outputs: (a1) \({B}\), \(\lnot {C}\) and (a2) \(\mathord {\sim }k_{1},{C}_{1}\), ...\(\mathord {\sim }k_{m},{C}_{1}\), ...\(\mathord {\sim }k_{1},{C}_{n}\), ...\(\mathord {\sim }k_{m},{C}_{n}\), where \(\mathsf {n}(\mathsf {var}(B)) = \{k_{1}, \dots , k_{m}\}\) and \(\mathsf {var}(C) = \{C_{1}, \dots , C_{n} \}\). In case of (a1), by the inductive hypothesis, \(\mathfrak {M}\models {B}\) and \(\mathfrak {M}\models \lnot {C}\). So, \(\mathfrak {M}\models \lnot ({B}\rightarrow {C})\). In case of (a2), by the definition of generated model 3.7, \(k_{i} \not \in s_{\Sigma } ({C})\), for all \(k_{i} \in \mathsf {n}(\mathsf {var}(B))\), so it is not that \({R}_{\mathbf {R}}({B}, {C})\). Thus, \(\mathfrak {M}\models \lnot ({B}\rightarrow {C})\). In case of (b) by the inductive hypothesis \(\mathfrak {M}\models {B}\) and \(\mathfrak {M}\models \lnot {C}\). So, \(\mathfrak {M}\models \lnot ({B}\rightarrow {C})\). Hence, in all cases \(\mathfrak {M}\models \lnot ({B}\rightarrow {C})\), by the definition of model 2.1. \(\square \)
Finally, we can prove the main theorem.
Theorem 3.10
(Adequacy theorem). Let \(\Sigma \cup \{{A}\}\subseteq \mathsf {For}\) and \(\Lambda \in \{\mathbf {D},\mathbf {DD},\mathbf {Eq}, \mathbf {S},\) \( \mathbf {R}\}\). Then, \(\Sigma \rhd _{\Lambda }{A}\) iff \(\Sigma \models _{\Lambda }{A}\).
Proof
Assume all the hypotheses.
(\(\Rightarrow \)) Suppose \(\Sigma \rhd _{\Lambda }{A}\). Hence, by Definition 3.3, there is a finite \(\Gamma \subseteq \Sigma \) such that any \(\mathsf {tr}(\Lambda )\)closure of \(\Gamma \cup \{ \lnot {A}\}\) is branch inconsistent. Suppose there is a \(\Lambda \)model \(\mathfrak {M}= \langle v, s\rangle \) such that \(\mathfrak {M}\models \Sigma \) and \(\mathfrak {M}\models \lnot {A}\). By Definition 3.5, \(\mathfrak {M}\) is suitable for \(\Gamma \cup \{ \lnot {A}\}\). By Lemma 3.6 there is \(\mathsf {tr}(\Lambda )\)closure \(\Delta \) of \(\Gamma \cup \{ \lnot {A}\}\) for which \(\mathfrak {M}\) is suitable. However, such a closure must be branch inconsistent. Thus in the closure either there is \({B}\in \mathsf {For}\) such that \(\mathfrak {M}\models {B}\) and \(\mathfrak {M}\not \models {B}\) or there are \(\langle i, B \rangle \), \(\langle \mathord {\sim }i, B \rangle \in \mathsf {Ae}\) and under some function \(\mathsf {f}\) – since \(\mathfrak {M}\) is suitable to \(\Delta \) (Definition 3.5) – \(\mathsf {f}(i) \in s({B})\) and \(\mathsf {f}(i) \not \in s({B})\). Hence, for any \(\Lambda \)model \(\mathfrak {M}\): \(\mathfrak {M}\models \Sigma \) implies \(\mathfrak {M}\models {A}\).
(\(\Leftarrow \)) Suppose \(\Sigma \not \! \! \rhd _{\Lambda }{A}\). So, for any finite \(\Gamma \subseteq \Sigma \) there is a branch consistent \(\mathsf {tr}(\Lambda )\)closure \(\Delta \) of \(\Gamma \cup \{\lnot {A}\}\), such that \(\Gamma \cup \{ \lnot {A}\} \subseteq \Delta \). Hence, there is a branch consistent \(\mathsf {tr}(\Lambda )\)closure \(\Delta '\) such that \(\Sigma \cup \{\lnot {A}\} \subseteq \Delta '\). Otherwise, any of such a closure would consist some branch inconsistency. But by Definition 3.3 this would mean that for some finite \(\Gamma \subseteq \Sigma \) no \(\mathsf {tr}(\Lambda )\)closure of \(\Gamma \cup \{\lnot {A}\}\) is branch consistent. As a consequence, by Lemma 3.9, there is a \(\Gamma \)model for \(\Lambda \) such that \(\mathfrak {M}\models \Sigma \cup \{\lnot {A}\}\). Therefore, by Definition 2.1, \(\Sigma \models _{\Lambda } {A}\). \(\square \)
Applying the previous theorem, we can obtain the decidability of the logics under study. Since a logic \(\Lambda \in \{\mathbf {D},\mathbf {DD},\mathbf {Eq},\mathbf {S},\mathbf {R}\}\) is adequate to the tableau system defined by \(\mathsf {tr}(\Lambda )\) (Theorem 3.11), it is sufficient to prove that \(\rhd _{\Lambda }\) is decidable. Assuming that the \(\Lambda \)logic tableau rules can be applied a finite number of times, we get only finite closures under these rules that need to be examined. So, we have the theorem.
Theorem 3.11
(Decidability theorem). Let \(\Lambda \in \{\mathbf {D},\mathbf {DD},\mathbf {Eq},\mathbf {S},\mathbf {R}\}\). Then \(\Lambda \) is decidable.
Conclusion
We proposed tableau systems for five logical systems defined by setassignment semantics. Our approach combines two aspects: the classic truth aspect and a syllogistic aspect. In case of expressions with labels we treat formulas as names and labels as denotations. Additionally, our tableaux are finite. But different nonclassical logics, like modal logics \(\mathbf{K}\), \(\mathbf{T}\), \(\mathbf{KTB}\), \(\mathbf{S4}\), \(\mathbf{S5}\) and \(\mathbf{S4Grz}\); intuitionistic logics \(\mathbf{IPL}\) and Johansson’s \(\mathbf{MIL}\); paraconsistent logic \(\mathbf{J}_{3}\); and manyvalued logics Ł\(_\mathbf{3}\), Ł\(_{n}\), Ł\(_{\aleph _{0}}\), \(\mathbf{K}_{3}\), \(\mathbf{G}_{3}\) and \(\mathbf{G}_{\aleph _{0}}\) have setassignment semantics as well (see [6, 16, 17]). Thus, the question of future research is to extend the proposed framework to these systems and to face the problem of infinite tableaux, which, for example, occurs in the case of transitivity of accessibility relation.
Notes
Epstein’s logics of content are also the logic \(\mathbf {DPC}\) (ClassicallyDependent Logic) and logics defined based on the \(\mathbf {DPC}\) consequence relation.
Let us also note that for our definition of \(\mathbf {R}\) the set \(\Sigma \) might be empty.
Let us emphasize that axioms introduced by Epstein are founded on relational properties presented within the second approach based on relating semantics.
It is important to notice that Paoli also presented results concerning not only the fragments of Epstein’s logics. In [21], he presented the constructive completeness of \(\mathbf {S}\) (for an alternative proof see [15]) and determined the limited principle of substitution of equivalent formulas for \(\mathbf {S}\). In cooperation with Antonio Ledda and Michele Pra Baldi, he examined in [18] various algebraic interpretations of a demodalized analytic implication understood as an implication of the logic \(\mathbf {D}\) (cf. [5]).
References
Carnielli, W.A.: Methods of proofs of relatedness and dependence logic. Rep. Math. Logic 21, 35–46 (1987)
Del Cerro, L.F., Lugardon, V.: Quantification and dependence logics. In: Akama, S. (ed.) Logic, Language and Computation. Applied Logic Series, vol. 5, pp. 179–190. Springer Science+Business Media, Dordrecht (1997)
Del Cerro, L.F., Lugardon, V.: Sequents for dependence logics. Logique Anal. 133/134, 57–71 (1991)
Epstein, R.L.: Relatedness and implication. Philos. Stud. 36, 137–173 (1979)
Epstein, R.L.: The algebra of dependence logic. Rep. Math. Logic 21, 19–34 (1987)
Epstein, R.L.: The Semantic Foundations of Logic. Volume 1: Propositional Logics. Springer Science+Business Media, Dordrecht (1990)
Jarmużek, T.: Relating semantics as finegrained semantics for intensional propositional logics. In: Giordani, A., Malinowski, J. (eds.) Logic in High Definition, Trends in Logical Semantics, vol. 56, pp. 13–30. Springer, Cham (2021)
Jarmużek, T.: Tableau Methods for Propositional Logic and Term Logic. Peter Lang GmbH Internationaler Verlag der Wissenschaften, Berlin (2020)
Jarmużek, T., Kaczkowski, B.: On some logic with a relation imposed on formulae: Tableau system \(\cal{F}\). Bull. Sect. Logic 43(1/2), 53–72 (2014)
Jarmużek, T., Klonowski, M.: On logics of strictlydeontic modalities. A semantic and Tableau approach. Logic Log. Philos. 29(3), 335–380 (2020)
Jarmużek, T., Klonowski, M.: Some intensional logics defined by relating semantics and tableau systems. In: Giordani, A., Malinowski, J. (eds.) Logic in High Definition, Trends in Logical Semantics, vol. 56, pp. 31–48. Springer, Cham (2021)
Jarmużek, T., Malinowski, J.: Boolean connexive logics: semantics and tableau approach. Logic Log. Philos. 28(3), 427–448 (2019)
Jarmużek, T., Malinowski, J.: Modal Boolean connexive logics: semantics and tableau approach. Bull Sect. Logic 48(3), 213–243 (2019)
Jarmużek, T., Goré, R.: Tableau metatheory for syllogistic logics. In: Fitting, M. (ed.) Selected topics from contemporary logics, pp. 539–582. College Publications, London (2021)
Klonowski, M.: A Poststyle proof of completeness theorem for Symmetric Relatedness Logic S. Bull. Sect. Logic 47(3), 201–214 (2018)
Klonowski, M.: History of relating logic. The origin and research directions. Logic Log. Philos. 30(4), 579–629 (2021)
Krajewski, S.: One or many logics? (Epstein’s setassignement semantics for logical calculi). J. NonClassical Logic 8(1), 7–33 (1991)
Ledda, A., Paoli, F., Baldi, M.P.: Algebraic analysis of demodalised analytic implication. J. Philos. Log. 48, 957–979 (2019)
Malinowski, J., Palczewski, R.: Relating semantics for connexive logic. In: Giordani, A., Malinowski, J. (eds.) Logic in High Definition, Trends in Logical Semantics, vol. 56, pp. 49–65. Springer, Cham (2021)
Paoli, F.: Semantics for first degree relatedness logic. Rep. Math. Logic 27, 81–94 (1993)
Paoli, F.: S is constructively complete. Rep. Math. Logic 30, 31–47 (1996)
Paoli, F.: Tautological entailments and their rivals. In: Béziau, J.Y., Carnielli, W.A., Gabbay, D.M. (eds.) Handbook of Paraconsistency, pp. 153–175. College Publications, London (2007)
Open Access
This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
The part of research made by Tomasz Jarmużek presented in the following article was financed by National Science Centre, Poland, number of grant: 2015/19/B/HS1/02478. The authors also would like to thank Maria MartinezOrdaz for her remarks and suggestions.
Appendix
Appendix
In Appendix we would like to present examples of tableau proofs for the considered logics. Let us focus on the formulas (1) and (4) introduced in the section devoted to semantic presentation of Epstein’s logics. For starters, let us note that any formula of the form \({A}\rightarrow {A}\) is a valid formula for any of Epstein’s logic. We can easily check that any time we get \(\lnot ({A}\rightarrow {A})\) on the branch we can close it. We consider this situation only for \(\mathbf {Eq}\), \(\mathbf {S}\) and \(\mathbf {R}\) (see Figs. 1, 2 and 3).
In what follows we present tableaux:

for (1): Figs. 4, 6, 8 and 10 (we can read off the tableau proof in the system of \(\mathbf {DD}\) from the tableau proof in the system of \(\mathbf {Eq}\))

for (4): Figs. 5, 7, 9 and 11 (the tableau proof in the system of \(\mathbf {DD}\) is similar to the tableau proof in the system of \(\mathbf {D}\)).
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Jarmużek, T., Klonowski, M. Tableaux for Logics of Content Relationship and SetAssignment Semantics. Log. Univers. 16, 195–219 (2022). https://doi.org/10.1007/s1178702200293w
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s1178702200293w
Keywords
 Generalized labels
 Logic of content relationship
 Relating semantics
 Setassignment semantics
 Tableaux for syllogistic
 Uniform tableau framework
Mathematics Subject Classification
 Primary 0302
 Secondary 03B20
 03B60
 03C50
 03C90
 03F03