Very intuitionistic theories and quantifier elimination



The Review of Modern Logic

Very intuitionistic theories and quantifier elimination

Wim Ruitenburg

Source: Rev. Mod. Log. Volume 10, Number 1-2 (2005), 99-112.

Abstract

We show methods to construct, and give examples of, consistent intuitionistic theories that admit quantifier elimination. The examples are very intuitionistic in the sense that they prove the negation of the schema of linearity.

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber.
If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text
Links and Identifiers

Permanent link to this document: http://projecteuclid.org/euclid.rml/1203432183
Mathematical Reviews number (MathSciNet): MR2238775


2008 © Marquette University, Department of Mathematics, Statistics and Computer Science