The bounded functional interpretation of arithmetic in all finite types is able to interpret principles like weak König’s lemma without the need of any form of bar recursion. This interpretation requires the use of intensional (rule-governed) majorizability relations. This is a somewhat unusual feature. The main purpose of this paper is to show that if the base domain of the natural numbers is ...

In this paper we show how hierarchical reasoning can be used to verify properties of complex systems. Chains of local theory extensions are used to model a case study taken from the European Train Control System (ETCS) standard, but considerably simplified. We show how testing invariants and bounded model checking can automatically be reduced to checking satisfiability of ground formulae over a...

We prove that in theories without the tree property of the second kind (which include dependent and simple theories) forking and dividing over models are the same, and in fact over any extension base. As an application we show that dependence is equivalent to bounded forking assuming NTP2.

A Riemannian manifold resp. a complex space X is called Liouville if it carries no nonconstant bounded harmonic resp. holomorphic functions. It is called Carathéodory, or Carathéodory hyperbolic, if bounded harmonic resp. holomorphic functions separate the points of X . The problems which we discuss in this paper arise from the following question: When a Galois covering X with Galois group G ov...

We discuss Fσ filters and show that the minimum size of a filter base generating an undiagonalizable filter included in some Fσ filter is the better known bounded evasion number eubd. An application to N -sets from trigonometric series is given by showing that if A is an N -set and B has size less eubd, then A ∪ B is again an N -set.

In this paper, first we define the notion of involutive operator on bounded involutive equality algebras and by using it, we introduce a new class of equality algebras that we called it a tense like equality algebra. Then we investigate some properties of tense like equality algebra. For two involutive bounded equality algebras and an equality homomorphism between them, we prove that the tense ...

Checking whether a committed integer lies in a specific interval has many cryptographic applications. In Eurocrypt’98, Chan et al. proposed an instantiation (CFT for short). Based on CFT, Boudot presented an efficient range-bounded commitment scheme in Eurocrypt’2000. Both CFT proof and Boudot proof are based on the encryption E(x, r) = gxhr mod n, where n is an RSA modulus whose factorization ...

in the present paper, we rst modify the concepts of weakly fuzzy boundedness, strongly fuzzy boundedness, fuzzy continuity, strongly fuzzy continuity and weakly fuzzy continuity. then, we try to nd some relations by making a comparative study of the fuzzy norms of linear operators.