Sciweavers

49 search results - page 1 / 10
» Uniform Heyting arithmetic
Sort
View
APAL
2005
107views more  APAL 2005»
13 years 10 months ago
Uniform Heyting arithmetic
We present an extension of Heyting Arithmetic in finite types called Uniform Heyting Arithmetic (HAu) that allows for the extraction of optimized programs from constructive and cla...
Ulrich Berger
JSYML
2008
109views more  JSYML 2008»
13 years 10 months ago
Closed fragments of provability logics of constructive theories
In this paper we give a new proof of the characterization of the closed fragment of the provability logic of Heyting's Arithmetic. We also provide a characterization of the c...
Albert Visser
AML
2002
69views more  AML 2002»
13 years 10 months ago
Transfer principles in nonstandard intuitionistic arithmetic
Using a slight generalization, due to Palmgren, of sheaf semantics, we present a term-model construction that assigns a model to any first-order intuitionistic theory. A modificat...
J. Avigad, Jeremy Helzner
JSYML
2007
88views more  JSYML 2007»
13 years 10 months ago
The basic intuitionistic logic of proofs
The language of the basic logic of proofs extends the usual propositional language by forming sentences of the sort x is a proof of F for any sentence F. In this paper a complete ...
Sergei N. Artëmov, Rosalie Iemhoff