49 search results - page 2 / 10 » Uniform Heyting arithmetic |
AML
2011
13 years 2 months ago
2011
We prove that all extensions of Heyting Arithmetic with a logic that has the finite frame property possess the de Jongh property. Dedicated to Petr H´ajek, on the occasion of his...
ITA
2006
13 years 7 months ago
2006
Arithmetical complexity of a sequence is the number of words of length n that can be extracted from it according to arithmetic progressions. We study uniformly recurrent words of l...
TLCA
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
AML
2002
13 years 7 months ago
2002
For a classical theory T, H(T) denotes the intuitionistic theory of T-normal (i.e. locally T) Kripke structures. S. Buss has asked for a characterization of the theories in the ra...
JUCS
2010
13 years 2 months ago
2010
: Veldman proved that the contrapositive of countable binary choice is a theorem of full-fledged intuitionism, to which end he used a principle of continuous choice and the fan the...