our aim in this paper is to prove an analog of younis's theorem on the image under the jacobi transform of a class functions satisfying a generalized dini-lipschitz condition in the space $mathrm{l}_{(alpha,beta)}^{p}(mathbb{r}^{+})$, $(1< pleq 2)$. it is a version of titchmarsh's theorem on the description of the image under the fourier transform of a class of functions satisfying the dini-lip...

In this paper is introduced a new type of generalization of metric spaces called $S_b$ metric space. For this new kind of spaces it has been proved a common fixed point theorem for four mappings which satisfy generalized contractive condition. We also present example to confirm our theorem.

Researchers in Automated Reasoning often complain that there are sparse applications of the techniques they develop. One reason might be that implementation-oriented research favors huge and highly complex systems and that this does not suit the needs of many applications.1 It is hard to see how to apply these systems – besides using them as a black box. Adaptability, however, is an important c...

The Stratiied Foundations are a restriction of naive set theory where the comprehension scheme is restricted to stratiiable propositions. It is known that this theory is consistent and that proofs strongly normalize in this theory. Deduction modulo is a formulation of rst-order logic with a general notion of cut. It is known that proofs normalize in a theory modulo if it has some kind of many-v...

n this article, we prove an lp-lq-version of morgan’s theorem for the generalized bessel transform.

Semantically guided hierarchical deduction prover is a resolution-based theorem-proving procedure which is capable of using the domain dependent knowledge presented in well designed examples. This paper gives an overview of the basic deduction components of the prover, investigates some rules for human design of examples, and demonstrates their usage in proving several non-trivial theorems.

In this short paper we present a finer analysis of the variants of Local Deduction Theorem in contraction-free logics. We define some natural generalisations called Implicational Deduction Theorems and study their basic properties. The hierarchy of classes of logics defined by these theorems is presented.

in this paper we define weak $f$-contractions on a‎ ‎metric space into itself by extending $f$-contractions‎ ‎introduced by d‎. ‎wardowski (2012) and provide some fixed point‎ ‎results in complete metric spaces and in partially ordered complete ‎generalized metric spaces‎. ‎some relationships between weak‎ ‎$f$-contractions and $fi$-contractions are highlighted‎. ‎we also ‎give some application...

This is an exposition of Lambek’s strengthening and generalization of the deduction theorem in categories related to intuitionistic propositional logic. Essential notions of category theory are introduced so as to yield a simple reformulation of Lambek’s Functional Completeness Theorem, from which its main consequences can be readily drawn. The connections of the theoremwith combinatory logic, ...

Researchers in Automated Reasoning often complain that there are sparse applications of the techniques they develop. One reason might be that implementation-oriented research favors huge and highly complex systems and that this does not suit the needs of many applications.1 It is hard to see how to apply these systems – besides using them as a black box. Adaptability, however, is an important c...