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.
Citation
Wim Ruitenburg. "Very intuitionistic theories and quantifier elimination." Rev. Mod. Log. 10 (1-2) 99 - 112, September 2004 - February 2005.
Information
Published: September 2004 - February 2005
First available in Project Euclid: 19 February 2008
zbMATH: 1303.03070
MathSciNet: MR2238775
Rights: Copyright © 2005 The Review of Modern Logic
