Disjunctive Multiple-Conclusion Consequence Relations
Marek Nowak
Abstract
Open-access reader
Marek Nowak
Abstract
Open-access reader
The concept of multiple-conclusion consequence relation from [8] and [7] is considered. The closure operation C assigning to any binary relation r (dened on the power set of a set of all formulas of a given language) the least multiple-conclusion consequence relation containing r, is dened on the grounds of a natural Galois connection. It is shown that the very closure C is an isomorphism from the power set algebra of a simple binary relation to the Boolean algebra of all multiple-conclusion consequence relations.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The concept of multiple-conclusion consequence relation from [8] and [7] is considered. The closure operation C assigning to any binary relation r (dened on the power set of a set of all formulas of a given language) the least multiple-conclusion consequence relation containing r, is dened on the grounds of a natural Galois connection. It is shown that the very closure C is an isomorphism from the power set algebra of a simple binary relation to the Boolean algebra of all multiple-conclusion consequence relations.
Key concepts: Binary relation, Relation (database), Closure (psychology), Isomorphism (crystallography), Relation algebra, Mathematics, Galois connection, Power set