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)
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
The Review of Modern Logic