Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T14:30:25.719Z Has data issue: false hasContentIssue false

On weak completeness of intuitionistic predicate logic

Published online by Cambridge University Press:  12 March 2014

G. Kreisel*
Affiliation:
Université De Paris

Extract

Suppose the ri-placed relation symbols Pi, 1 ≦ i ≦ k, are all the non-logical constants occurring in the closed formula , also written as , of Heyting's predicate calculus (HPC). Then HPC is called complete for provided , i.e.

Here D ranges over arbitrary species, and over arbitrary (possibly incompletely defined) subspecies of ;

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1962

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