All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Inquisitive split and structural completeness

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985955%3A_____%2F25%3A00635847" target="_blank" >RIV/67985955:_____/25:00635847 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1017/S0960129525000118" target="_blank" >https://doi.org/10.1017/S0960129525000118</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1017/S0960129525000118" target="_blank" >10.1017/S0960129525000118</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Inquisitive split and structural completeness

  • Original language description

    In this paper, the notion of structural completeness is explored in the context of a generalized class of superintuitionistic logics involving also systems that are not closed under uniform substitution. We just require that each logic must be closed under D-substitutions assigning to atomic formulas only ∨-free formulas. For these systems we introduce four different notions of structural completeness and study how they are related. We focus on superintuitionistic inquisitive logics that validate a schema called Split and have the disjunction property. In these logics disjunction can be interpreted in the sense of inquisitive semantics as a question forming operator. It is shown that a logic is structurally complete with respect to D-substitutions if and only if it includes the weakest superintuitionistic inquisitive logic. Various consequences of this result are explored. For example, it is shown that every superintuitionistic inquisitive logic can be characterized by a Kripke model built up from D-substitutions. Additionally, we resolve a conjecture concerning superintuitionistic inquisitive logics due to Miglioli et al. and show that a false conjecture about superintuitionistic logics due to Minari and Wroński. becomes true in the broader space of regular generalized superintuitionistic logics.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    60301 - Philosophy, History and Philosophy of science and technology

Result continuities

  • Project

    <a href="/en/project/GM21-23610M" target="_blank" >GM21-23610M: Logical Structure of Information Channels</a><br>

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2025

  • Confidentiality

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

Data specific for result type

  • Name of the periodical

    Mathematical Structures in Computer Science

  • ISSN

    0960-1295

  • e-ISSN

    1469-8072

  • Volume of the periodical

  • Issue of the periodical within the volume

    35

  • Country of publishing house

    GB - UNITED KINGDOM

  • Number of pages

    18

  • Pages from-to

    e12

  • UT code for WoS article

    001498096100001

  • EID of the result in the Scopus database

    2-s2.0-105007136721