Topic Transparency and Variable Sharing in Weak Relevant Logics

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F25%3A00604123" target="_blank" >RIV/67985807:_____/25:00604123 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1007/s10670-023-00748-6" target="_blank" >https://doi.org/10.1007/s10670-023-00748-6</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s10670-023-00748-6" target="_blank" >10.1007/s10670-023-00748-6</a>

Result language
angličtina
Original language name
Topic Transparency and Variable Sharing in Weak Relevant Logics
Original language description
In this paper, we examine a number of relevant logics’ variable sharing properties from the perspective of theories of topic or subject-matter. We take cues from Franz Berto’s recent work on topic to show an alignment between families of variable sharing properties and responses to the topic transparency of relevant implication and negation. We then introduce and defend novel variable sharing properties stronger than strong depth relevance—which we call cn-relevance and lossless cn-relevance—showing that the properties are satisfied by the weak relevant logics B and BM, respectively. We argue that such properties address a sort of semantic lossiness of strong depth relevance.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics

Project
<a href="/en/project/GA22-01137S" target="_blank" >GA22-01137S: Metamathematics of substructural modal logics</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2025
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)