On maximal intermediate logics with the disjunction property

Studia Logica 45 (1):69 - 75 (1986)

Abstract

For intermediate logics, there is obtained in the paper an algebraic equivalent of the disjunction propertyDP. It is proved that the logic of finite binary trees is not maximal among intermediate logics withDP. Introduced is a logicND, which has the only maximal extension withDP, namely, the logicML of finite problems.

Download options

PhilArchive



    Upload a copy of this work     Papers currently archived: 72,805

External links

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

Through your library

Analytics

Added to PP
2009-01-28

Downloads
19 (#588,168)

6 months
1 (#386,031)

Historical graph of downloads
How can I increase my downloads?

References found in this work

A Result on Propositional Logics Having the Disjunction Property.Robert E. Kirk - 1982 - Notre Dame Journal of Formal Logic 23 (1):71-74.

Add more references

Citations of this work

Inquisitive Logic.Ivano Ciardelli & Floris Roelofsen - 2011 - Journal of Philosophical Logic 40 (1):55-94.
Propositional Logics of Dependence.Fan Yang & Jouko Väänänen - 2016 - Annals of Pure and Applied Logic 167 (7):557-589.
A Generalization of Inquisitive Semantics.Vít Punčochář - 2016 - Journal of Philosophical Logic 45 (4):399-428.
Conditionals, Probability, and Nontriviality.Charles G. Morgan & Edwin D. Mares - 1995 - Journal of Philosophical Logic 24 (5):455-467.

View all 29 citations / Add more citations