On maximal intermediate logics with the disjunction property

Studia Logica 45 (1):69 - 75 (1986)
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.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/20015248
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 15,904
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

Add more references

Citations of this work BETA

View all 12 citations / Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

4 ( #405,485 of 1,725,471 )

Recent downloads (6 months)

2 ( #268,753 of 1,725,471 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.