122 research outputs found
Constructive set theory and Brouwerian principles
The paper furnishes realizability models of constructive Zermelo-Fraenkel set theory, CZF, which also validate Brouwerian principles such as the axiom of continuous choice (CC), the fan theorem (FT), and monotone bar induction (BIM), and thereby determines the proof-theoretic strength of CZF augmented by these principles. The upshot is that CZF+CC+FT possesses the same strength as CZF, or more precisely, that CZF+CC+FTis conservative over CZF for 02 statements of arithmetic, whereas the addition of a restricted version of bar induction to CZF (called decidable bar induction, BID) leads to greater proof-theoretic strength in that CZF+BID proves the consistency of CZF
A semantic approach to conservativity
The aim of this paper is to describe from a semantic perspective the problem of conservativity of classical first-order theories over their intuitionistic counterparts. In particular, we describe a class of formulae for which such conservativity results can be proven in case of any intuitionistic theory T which is complete with respect to a class of T-normal Kripke models. We also prove conservativity results for intuitionistic theories which are closed under the Friedman translation and complete with respect to a class of conversely well-founded Kripke models. The results can be applied to a wide class of intuitionistic theories and can be viewed as generalization of the results obtained by syntactic methods
Mathematical Logic: Proof Theory, Constructive Mathematics
[no abstract available
- …