The Decidability of Dependency in Intuitionistic Propositional Logi

Journal of Symbolic Logic 60 (2):498 - 504 (1995)
A definition is given for formulae A 1 ,...,A n in some theory T which is formalized in a propositional calculus S to be (in)dependent with respect to S. It is shown that, for intuitionistic propositional logic IPC, dependency (with respect to IPC itself) is decidable. This is an almost immediate consequence of Pitts' uniform interpolation theorem for IPC. A reasonably simple infinite sequence of IPC-formulae F n (p, q) is given such that IPC-formulae A and B are dependent if and only if at least on the F n (A, B) is provable.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2275844
 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
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 25,687
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

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Completeness of S4 for the Lebesgue Measure Algebra.Tamar Lando - 2012 - Journal of Philosophical Logic 41 (2):287-316.

Monthly downloads

Added to index


Total downloads

5 ( #582,783 of 2,146,211 )

Recent downloads (6 months)

1 ( #387,123 of 2,146,211 )

How can I increase my downloads?

My notes
Sign in to use this feature

There  are no threads in this forum
Nothing in this forum yet.

Other forums