Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-17T04:19:07.845Z Has data issue: false hasContentIssue false

The decidability of the Kreisel-Putnam system1

Published online by Cambridge University Press:  12 March 2014

Dov M. Gabbay*
Affiliation:
Hebrew University of Jerusalem

Extract

The intuitionistic propositional logic I has the following disjunction property

This property does not characterize intuitionistic logic. For example Kreisel and Putnam [5] showed that the extension of I with the axiom

has the disjunction property. Another known system with this propery is due to Scott [5], and is obtained by adding to I the following axiom:

In the present paper we shall prove, using methods originally introduced by Segerberg [10], that the Kreisel-Putnam logic is decidable. In fact we shall show that it has the finite model property, and since it is finitely axiomatizable, it is decidable by [4]. The decidability of Scott's system was proved by J. G. Anderson in his thesis in 1966.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1971

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