Search Results for ""

Let X be an infinite set of urelements, and let V(^*X) be an enlargement of the superstructure V(X). Let A,B in V(X) be finitary algebras with finitely many operations, and ...

Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. If h is one-to-one and is a join-homomorphism, then it is a join-embedding.

Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. If K=L and h is a join-homomorphism, then we call h a join-endomorphism.

Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. Then the mapping h is a join-homomorphism provided that for any x,y in L, h(x v y)=h(x) v h(y). It is also ...

Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. If h is one-to-one and onto, then it is a join-isomorphism if it preserves joins.

Let phi_x^((k)) denote the recursive function of k variables with Gödel number x, where (1) is normally omitted. Then if g is a partial recursive function, there exists an ...

A theorem, also called the iteration theorem, that makes use of the lambda notation introduced by Church. Let phi_x^((k)) denote the recursive function of k variables with ...

A tree with a finite number of branches at each fork and with a finite number of leaves at the end of each branch is called a finitely branching tree. König's lemma states ...

Landau (1911) proved that for any fixed x>1, sum_(0<|I[rho]|<=T)x^rho=-T/(2pi)Lambda(x)+O(lnT) as T->infty, where the sum runs over the nontrivial Riemann zeta function zeros ...

A lattice automorphism is a lattice endomorphism that is also a lattice isomorphism.