Undefinability in Inquisitive Logic with Tensor

Ivano Ciardelli, Fausto Barbero

Tutkimustuotos: Artikkeli kirjassa/raportissa/konferenssijulkaisussaKonferenssiartikkeliTieteellinenvertaisarvioitu

Abstrakti

Logics based on team semantics, such as inquisitive logic and dependence logic, are not closed under uniform substitution. This leads to an interesting separation between expressive power and definability: it may be that an operator O can be added to a language without a gain in expressive power, yet O is not definable in that language. For instance, even though propositional inquisitive logic and propositional dependence logic have the same expressive power, inquisitive disjunction and implication are not definable in propositional dependence logic. A question that has been open for some time in this area is whether the tensor disjunction used in propositional dependence logic is definable in inquisitive logic. We settle this question in the negative. In fact, we show that extending the logical repertoire of inquisitive logic by means of tensor disjunction leads to an independent set of connectives; that is, no connective in the resulting logic is definable in terms of the others.
Alkuperäiskielienglanti
OtsikkoLogic, Rationality and Interaction : 7th International Workshop, LORI 2019, Chongqing, China, October 18–21, 2019, Proceedings
ToimittajatPatrick Blackburn, Emiliano Lorini, Meiyun Guo
Sivumäärä14
Vuosikerta11813
KustantajaSpringer
Julkaisupäivä2019
PainosLecture Notes in Computer Science
Sivut29-42
ISBN (painettu)9783662602911
ISBN (elektroninen)9783662602928
DOI - pysyväislinkit
TilaJulkaistu - 2019
OKM-julkaisutyyppiA4 Artikkeli konferenssijulkaisuussa
Tapahtuma7th International Workshop, LORI 2019 - Chongqing, Kiina
Kesto: 18 lokakuuta 201921 lokakuuta 2019
Konferenssinumero: 7

Julkaisusarja

NimiLecture Notes in Computer Science
KustantajaSpringer
Vuosikerta11813
ISSN (painettu)0302-9743
ISSN (elektroninen)1611-3349

Tieteenalat

  • 111 Matematiikka
  • 611 Filosofia

Siteeraa tätä