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,\ldots,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 $\mathbf{IPC}$, dependency (with respect to $\mathbf{IPC}$ itself) is decidable. This is an almost immediate consequence of Pitts' uniform interpolation theorem for $\mathbf{IPC}$. A reasonably simple infinite sequence of $\mathbf{IPC}$-formulae $F_n(p, q)$ is given such that $\mathbf{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: 28,824
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
Logical Relations.Lloyd Humberstone - 2013 - Philosophical Perspectives 27 (1):175-230.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

9 ( #466,435 of 2,178,142 )

Recent downloads (6 months)

2 ( #166,129 of 2,178,142 )

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