Strong storage operators and data types

The storage operators were introduced by J.L. Krivine ([6]); they are closed -terms which, for some fixed data type (the integers for example), allow to simulate call by value while using call by name. J.L. Krivine showed that such operators can be typed, in the type system, using Gödel's translation from classical to intuitionistic logic ([8]).This paper studies the existence of storage operators which give a normal form as result (strong storage operators) for recursive and iterative representation of data in -calculus. We obtain the following result: We can find typed strong storage operators for the recursive representations of data type, but that is not the case for the iterative representations of an infinite data type.We give the proof of this result in the case of integers.     

Sémantique algébrique ďun système logique basé sur un ensemble ordonné fini

In order to modelize the reasoning of an intelligent agent represented by a poset T, H. Rasiowa introduced logic systems called “Approximation Logics”. In these systems a set of constants constitutes a fundamental tool. In this papers, we consider logic systems called L′_T without this kind of constants but limited to the case where T is a finite poset. We prove a weak deduction theorem. We introduce also an algebraic semantics using Hey ting algebra with operators. To prove the completeness theorem of the L′_T system with respect to the algebraic semantics, we use the method of H. Rasiowa and R. Sikorski for first order logic. In the propositional case, a corollary allows us to assert that it is decidable to know “if a propositional formula is valid”. We study also certain relations between the L′_T logic and the intuitionistic and classical logics.     

S-Storage Operators

In 1990, J. L. Krivine introduced the notion of storage operator to simulate, for Church integers, the “call by value” in a context of a “call by name” strategy. In the present paper we define for every λ-term S which realizes the successor function on Church integers the notion of S-storage operator. We prove that every storage operator is an S-storage operator. But the converse is not always true.     

Sémantique de type Kripke d'un système logique basé sur un ensemble ordonné fini

In order to modelize the reasoning of intelligent agents represented by a poset T, H. Rasiowa introduced logic systems called “Approximation Logics”. In these systems the use of a set of constants constitutes a fundamental tool. We have introduced in [8] a logic system called without this kind of constants but limited to the case that T is a finite poset. We have proved a completeness result for this system w.r.t. an algebraic semantics. We introduce in this paper a Kripke‐style semantics for a subsystem of for which there existes a deduction theorem. The set of “possible worldsr is enriched by a family of functions indexed by the elements of T and satisfying some conditions. We prove a completeness result for system with respect to this Kripke semantics and define a finite Kripke structure that characterizes the propositional fragment of logic . We introduce a reational semantics (found by E. Orlowska) which has the advantage to allow an interpretation of the propositionnal logic using only binary relations. We treat also the computational complexity of the satisfiability problem of the propositional fragment of logic .     

Statistical approximation properties of the Durrmeyer type q‐Bleimann,Butzer, and Hahn operators

In this paper, we introduce a Durrmeyer‐type generalization of q‐Bleimann, Butzer, and Hahn operators based on q‐integers and obtain statistical approximation properties of these operators with the help of the Korovkin type statistical approximation theorem. We also compute rates of statistical convergence of these q‐type operators by means of the modulus of continuity and Lipschitz‐type maximal function, respectively. Copyright © 2011 John Wiley & Sons, Ltd.     

Algebraic axiomatization of tense intuitionistic logic

We introduce two unary operators G and H on a relatively pseudocomplemented lattice which form an algebraic axiomatization of the tense quantifiers “it is always going to be the case that” and “it has always been the case that”. Their axiomatization is an extended version for the classical logic and it is in accordance with these operators on many-valued Łukasiewicz logic. Finally, we get a general construction of these tense operators on complete relatively pseudocomplemented lattice which is a power lattice via the so-called frame.     

<Emphasis Type="Italic">AF</Emphasis>-subalgebras of a <Emphasis Type="Italic">C*</Emphasis>-algebra generated by a mapping

In this paper we consider a C*-subalgebra of the algebra of all bounded operators B(l²(X)) on the Hilbert space l²(X)) with one generating element T _φ induced by a mapping φ of a set X into itself. We prove that such a C* -algebra has an AF-subalgebra and establish commutativity conditions for the latter. We prove that a C* -algebra generated by a mapping produces a dynamic system such that the corresponding group of automorphisms is invariant on elements of the AF- subalgebra.     

On the η‐function for bisingular pseudodifferential operators

In this work we consider the η‐invariant for pseudodifferential operators of tensor product type, also called bisingular pseudodifferential operators. We study complex powers of classical bisingular operators. We prove the trace property for the Wodzicki residue of bisingular operators and show how the residues of the η‐function can be expressed in terms of the Wodzicki trace of a projection operator. Then we calculate the K‐theory of the algebra of 0‐order (global) bisingular operators. With these preparations we establish the regularity properties of the η‐function at the origin for global bisingular operators which are self‐adjoint, elliptic and of positive orders.     

The Logic with Truth and Falsehood Operators from a Point of View of Universal Logic

The logic with independent truth and falsehood operators TFL is proposed. In TFL(→) standard truth-conditions for the implication are adopted. Nevertheless the laws of classical logic are not valid. In this language more then 10⁷ different binary connectives can be defined. So this logic can be treated as universal logic relatively to the class of sentential logics.     

(p,q)‐Generalization of Szász–Mirakyan operators

In this paper, we introduce new modifications of Szász–Mirakyan operators based on (p,q)‐integers. We first give a recurrence relation for the moments of new operators and present explicit formula for the moments and central moments up to order 4. Some approximation properties of new operators are explored: the uniform convergence over bounded and unbounded intervals is established, direct approximation properties of the operators in terms of the moduli of smoothness is obtained and Voronovskaya theorem is presented. For the particular case p = 1, the previous results for q‐Sz ász–Mirakyan operators are captured. Copyright © 2015 John Wiley & Sons, Ltd.     

An Extension Principle for Fuzzy Logics

Let S be a set, P(S) the class of all subsets of S and F(S) the class of all fuzzy subsets of S. In this paper an “extension principle” for closure operators and, in particular, for deduction systems is proposed and examined. Namely we propose a way to extend any closure operator J defined in P(S) into a fuzzy closure operator J* defined in F(S). This enables us to give the notion of canonical extension of a deduction system and to give interesting examples of fuzzy logics. In particular, the canonical extension of the classical propositional calculus is defined and it is showed its connection with possibility and necessity measures. Also, the canonical extension of first order logic enables us to extend some basic notions of programming logic, namely to define the fuzzy Herbrand models of a fuzzy program. Finally, we show that the extension principle enables us to obtain fuzzy logics related to fuzzy subalgebra theory and graded consequence relation theory. Mathematics Subject Classification : 03B52.     

Typed lambda-calculus in classical Zermelo-Frænkel set theory

system of simple types  , which uses the intuitionistic propositional calculus, with the only connective →. It is very important, because the well known Curry-Howard correspondence between proofs and programs was originally discovered with it, and because it enjoys the normalization property: every typed term is strongly normalizable. It was extended to second order intuitionistic logic, in 1970, by J.-Y. Girard [4], under the name of system F, still with the normalization property. More recently, in 1990, the Curry-Howard correspondence was extended to classical logic, following Felleisen and Griffin [6] who discovered that the law of Peirce corresponds to control instructions in functional programming languages. It is interesting to notice that, as early as 1972, Clint and Hoare [1] had made an analogous remark for the law of excluded middle and controlled jump instructions in imperative languages. There are now many type systems which are based on classical logic; among the best known are the system LC of J.-Y. Girard [5] and the λμ-calculus of M. Parigot [11]. We shall use below a system closely related to the latter, called the λ _c -calculus [8, 9]. Both systems use classical second order logic and have the normalization property. In the sequel, we shall extend the λ _c -calculus to the Zermelo-Fr?nkel set theory. The main problem is due to the axiom of extensionality. To overcome this difficulty, we first give the axioms of ZF in a suitable (equivalent) form, which we call ZF _ɛ . Received: 6 September 1999 / Published online: 25 January 2001     

Generalized <Emphasis Type="Italic">q</Emphasis>-Baskakov operators

In the present paper we propose a generalization of the Baskakov operators, based on q integers. We also estimate the rate of convergence in the weighted norm. In the last section, we study some shape preserving properties and the property of monotonicity of q-Baskakov operators.     

A Lyapunov Lemma for Elliptic Systems

We study a possible extension to the infinite-dimensional case of the classicalLyapunov lemma for matrices. More precisely, for a fixed elliptic system A ofdifferential operators of order m, we consider the operator equationTA + A ^* T = Q, where Q is any given classical pseudodifferential system oforder m, and T is sought as a classical pseudodifferential system of order0.     

The Fourth-order Bessel–type Differential Equation

The Bessel-type functions, structured as extensions of the classical Bessel functions, were defined by Everitt and Markett in 1994. These special functions are derived by linear combinations and limit processes from the classical orthogonal polynomials, classical Bessel functions and the Krall Jacobi-type and Laguerre-type orthogonal polynomials. These Bessel-type functions are solutions of higher-order linear differential equations, with a regular singularity at the origin and an irregular singularity at the point of infinity of the complex plane.

There is a Bessel-type differential equation for each even-order integer; the equation of order two is the classical Bessel differential equation. These even-order Bessel-type equations are not formal powers of the classical Bessel equation.

When the independent variable of these equations is restricted to the positive real axis of the plane they can be written in the Lagrange symmetric (formally self-adjoint) form of the Glazman–Naimark type, with real coefficients. Embedded in this form of the equation is a spectral parameter; this combination leads to the generation of self-adjoint operators in a weighted Hilbert function space. In the second-order case one of these associated operators has an eigenfunction expansion that leads to the Hankel integral transform.

This article is devoted to a study of the spectral theory of the Bessel-type differential equation of order four; considered on the positive real axis this equation has singularities at both end-points. In the associated Hilbert function space these singular end-points are classified, the minimal and maximal operators are defined and all associated self-adjoint operators are determined, including the Friedrichs self-adjoint operator. The spectral properties of these self-adjoint operators are given in explicit form.

From the properties of the domain of the maximal operator, in the associated Hilbert function space, it is possible to obtain a virial theorem for the fourth-order Bessel-type differential equation.

There are two solutions of this fourth-order equation that can be expressed in terms of classical Bessel functions of order zero and order one. However it appears that additional, independent solutions essentially involve new special functions not yet defined. The spectral properties of the self-adjoint operators suggest that there is an eigenfunction expansion similar to the Hankel transform, but details await a further study of the solutions of the differential equation.     

Dixmier's trace for boundary value problems

Let X be a smooth manifold with boundary of dimension n > 1. The operators of order −n and type zero in Boutet de Monvel's calculus form a subset of Dixmier's trace ideal for the Hilbert space of L ² sections in vector bundles E over X, F over ∂X. We show that, on these operators, Dixmier's trace can be computed in terms of the same expressions that determine the noncommutative residue. In particular it is independent of the averaging procedure. However, the noncommutative residue and Dixmier's trace are not multiples of each other unless the boundary is empty. As a corollary we show how to compute Dixmier's trace for parametrices or inverses of classical elliptic boundary value problems of the form Pu=f; Tu=0 with an elliptic differential operator P of order n in the interior and a trace operator T. In this particular situation, Dixmier's trace and the noncommutative residue do coincide up to a factor. Received: Received: 13 January 1998     

Explicit representation of membership in polynomial ideals

We introduce a new division formula on projective space which provides explicit solutions to various polynomial division problems with sharp degree estimates. We consider simple examples as the classical Macaulay theorem as well as a quite recent result by Hickel, related to the effective Nullstellensatz. We also obtain a related result that generalizes Max Noether’s classical AF + BG theorem.     

King type modification of Meyer-König and Zeller operators based on the -integers

In the present paper, introducing a King type modification of the Meyer-König and Zeller (MKZ) operators, we prove that the error estimation of these operators is better than the classical MKZ operators. Furthermore, a King type modification of the q-MKZ is also introduced and the rate of convergence of this modification is examined.     

Rédei-Funktionen für Zweierpotenzen

L. Rédei has introduced in 1946 a class of rational functions over finite fields of orderp ^t –p being an odd prime — and has proved some interesting results on permutations which are induced by these functions. Recently, similar results have been found for factor rings of the integers of orderp ^t ; moreover, these functions have been applied to construct public key cryptosystems. In this paper we consider functions of Rédei type over finite fields and factor rings of the integers of order 2 ^t . We show that most of the results for oddp also hold in this case.

     

Imbedding posets in the integers

An imbedding of a poset P in the integers is a one-to-one order presevring map from P into the integers. Such a map always exists when P is finite and, moreover, certain imbeddings of subsets of finite P can be extended to imbeddings of the whole of P. D. E. Daykin has asked when an imbedding in the integers of a finite subset of a countable poset can be extended to the whole poset. This paper answers Daykin's question and some related questions.