Structural completeness in propositional logics of dependence

&
Archive for Mathematical Logic 55 (7-8):955-975 (2016)
  Copy   BIBTEX

Abstract

In this paper we prove that three of the main propositional logics of dependence, none of which is structural, are structurally complete with respect to a class of substitutions under which the logics are closed. We obtain an analogous result with respect to stable substitutions, for the negative variants of some well-known intermediate logics, which are intermediate theories that are closely related to inquisitive logic.

Categories

Add categories

Keywords

Reprint years

DOI

10.1007/s00153-016-0505-8

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 99,410

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Structural Completeness and Superintuitionistic Inquisitive Logics.Thomas Ferguson & Vít Punčochář - 2023 - In Helle Hvid Hansen, Andre Scedrov & Ruy J. G. B. De Queiroz (eds.), Logic, Language, Information, and Computation: 29th International Workshop, WoLLIC 2023, Halifax, NS, Canada, July 11–14, 2023, Proceedings. Springer Nature Switzerland. pp. 194-210.
Intermediate Logics Admitting a Structural Hypersequent Calculus.Frederik M. Lauridsen - 2019 - Studia Logica 107 (2):247-282.
Propositional Logics of Closed and Open Substitutions over Heyting's Arithmetic.Albert Visser - 2006 - Notre Dame Journal of Formal Logic 47 (3):299-309.
Hypercanonicity, Extensive Canonicity, Canonicity And Strong Completeness Of Intermediate Propositional Logics.Camillo Fiorentini - 2001 - Reports on Mathematical Logic:3-46.
A note on admissible rules and the disjunction property in intermediate logics.Alexander Citkin - 2012 - Archive for Mathematical Logic 51 (1):1-14.
On completeness of intermediate predicate logics with respect to {K}ripke semantics.T. Shimura - 1995 - Bulletin of the Section of Logic 24:41-45.
Polyhedral Completeness of Intermediate Logics: The Nerve Criterion.Sam Adam-day, Nick Bezhanishvili, David Gabelaia & Vincenzo Marra - 2024 - Journal of Symbolic Logic 89 (1):342-382.
An infinite class of maximal intermediate propositional logics with the disjunction property.Pierangelo Miglioli - 1992 - Archive for Mathematical Logic 31 (6):415-432.
An Algebraic Approach to Inquisitive and -Logics.Nick Bezhanishvili, Gianluca Grilletti & Davide Emilio Quadrellaro - 2022 - Review of Symbolic Logic 15 (4):950-990.
Completeness with respect to a chain and universal models in fuzzy logic.Franco Montagna - 2011 - Archive for Mathematical Logic 50 (1-2):161-183.

Analytics

Added to PP
2017-11-06

Downloads
56 (#314,219)

6 months
18 (#141,306)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Citations of this work

Propositional team logics.Fan Yang & Jouko Väänänen - 2017 - Annals of Pure and Applied Logic 168 (7):1406-1441.
Embedding causal team languages into predicate logic.Fausto Barbero & Pietro Galliani - 2022 - Annals of Pure and Applied Logic 173 (10):103159.
Propositional union closed team logics.Fan Yang - 2022 - Annals of Pure and Applied Logic 173 (6):103102.
Inquisitive Heyting Algebras.Vít Punčochář - 2021 - Studia Logica 109 (5):995-1017.

View all 6 citations / Add more citations

References found in this work

The Principles of Mathematics Revisited.Jaakko Hintikka - 1996 - New York: Cambridge University Press.
Compositional semantics for a language of imperfect information.W. Hodges - 1997 - Logic Journal of the IGPL 5 (4):539-563.
Some remarks on infinitely long formulas.L. Henkin - 1961 - Journal of Symbolic Logic 30 (1):167--183.
Inquisitive Logic.Ivano Ciardelli & Floris Roelofsen - 2011 - Journal of Philosophical Logic 40 (1):55-94.

View all 15 references / Add more references