Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-18T01:10:35.812Z Has data issue: false hasContentIssue false

The decidability of dependency in intuitionistic propositional logic

Published online by Cambridge University Press:  12 March 2014

Dick de Jongh
Affiliation:
Department of Mathematics and Computer Science, University of Amsterdam, 1018 TV Amsterdam, The Netherlands, E-mail: dickdj@fwi.uva.nl
L. A. Chagrova
Affiliation:
Tver State University, 170013 Tver, Russia

Abstract

A definition is given for formulae A1, …, An 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 Fn (p, q) is given such that IPC-formulae A and B are dependent if and only if at least on of the Fn (A, B) is provable.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1995

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable