Completeness of two systems of illative combinatory logic for first-order propositional and predicate calculus

Illative combinatory logic consists of the theory of combinators or lambda calculus extended by extra constants (and corresponding axioms and rules) intended to capture inference. The paper considers 4 systems of illative combinatory logic that are sound for first-order propositional and predicate calculus. The interpretation from ordinary logic into the illative systems can be done in two ways: following the propositions-as-types paradigm, in which derivations become combinators, or in a more direct way, in which derivations are not translated. Both translations are closely related in a canonical way. In a preceding paper, Barendregt, Bunder and Dekkers, 1993, we proved completeness of the two direct translations. In the present paper we prove completeness of the two indirect translations by showing that the corresponding illative systems are conservative over the two systems for the direct translations. In another version, DBB (1997), we shall give a more direct completeness proof. These papers fulfill the program of Church and Curry to base logic on a consistent system of -terms or combinators. Hitherto this program had failed because systems of ICL were either too weak (to provide a sound interpretation) or too strong (sometimes even inconsistent). Received: February 15, 1996     

半序积空间中新的不动点定理

使用半序理论,h-序差和变距离函数的性质,在半序积Banach空间上讨论了一类没有凹凸性的单调算子,得出新的不动点存在唯一性结果,推广了文献中相关的不动点定理.     

A theory of rules for enumerated classes of functions

We define an applicative theoryCL ₂ similar to combinatory logic which can be interpreted in classes of functions possessing an enumerating function. In contrast to the models of classical combinatory logic, it is not necessarily assumed that the enumerating function itself belongs to that function class. Thereby we get a variety of possible models including e. g. the classes of primitive recursive, recursive, elementary, polynomial-time comptable of ₀-recursive functions.We show that inCL ₂ a major part of the metatheory of enumerated classes of functions can be developed. Namely, a kind of -abstraction can be defined and abstract versions of theS _n ^m - and (Primitive) Recursion Theorems are proved. Thereby, a closer analysis of the phenomenon of the different recursion theorems is achieved.A theory closely related toCL ₂ can be used to replace the applicative part of Feferman's theories for explicit mathematics. So this work can be seen as an answer to Feferman's question to formulate a theory for explicit mathematics in which operations can be interpreted as primitive recursive or even more feasible ones.Finally it is shown that the proof-theoretical strength of various theoreies for explicit mathematics is preserved when replacing the applicative part of the theories by our theory together with an operation for primitive recursion.     

Generalized cyclic contractions in partially ordered metric spaces

Abkar and Gabeleh in (J. Optim. Theory. Appl. doi:10.1007/s10957-011-9818-2) proved some theorems which ensure the existence and convergence of fixed points, as well as best proximity points for cyclic mappings in ordered metric spaces. In this paper we extend these results to generalized cyclic contractions and obtain some new results on the existence and convergence of fixed points for weakly contractive mappings, as well as on best proximity points for cyclic ??-contraction mappings in partially ordered metric spaces.     

Existence results for operator equations in abstract spaces and an application

In this paper we apply the recursion method presented in (Heikkilä and Lakshmikantham, 1994) to derive fixed point theorems and existence results for operator equations in partially ordered sets. The obtained results, combined with related results of (Heikkilä, 2002) are then applied to operator equations in ordered Hilbert spaces and to a functional elliptic boundary value problem.     

Monotone generalized contractions in partially ordered probabilistic metric spaces

In this paper, a concept of monotone generalized contraction in partially ordered probabilistic metric spaces is introduced and some fixed and common fixed point theorems are proved. Presented theorems extend the results in partially ordered metric spaces of Nieto and Rodriguez-Lopez [Contractive mapping theorems in partially ordered sets and applications to ordinary differential equations, Order 22 (2005) 223-239; Existence and uniqueness of fixed point in partially ordered sets and applications to ordinary differential equations, Acta Math. Sin. (Engl. Ser.) 23 (2007) 2205-2212], Ran and Reurings [A fixed point theorem in partially ordered sets and some applications to matrix equations, Proc. Amer. Math. Soc. 132 (2004) 1435-1443] to a more general class of contractive type mappings in partially ordered probabilistic metric spaces and include several recent developments.     

关于BCI逻辑的一种偏序代数

通常,人们认为Kiyoshi Iséki在20世纪60年代引入的BCI-代数是组合逻辑中BCI逻辑的代数对等物。然而这种广为人知的断言却是有问题的,因为BCI逻辑关于BCI代数是不完备的。在本文中,我们引入一种称为MPE的偏序代数。在MPE中的每个不等式对应BCI逻辑中的一个重言式且反之亦然,从而MPE代数是与BCI逻辑完备的代数类。     

Fixed Points in Tense Models

We study into definability of least fixed points in tense logic. It is proved that least fixed points of tense positive -operators are definable in transitive linear models. Examples are furnished showing that the least fixed points of tense positive operators may fail to be definable in the class of finite linearly ordered models, and the class of finite strictly linearly ordered models. Moreover, in dealing with the modal case, we point out examples of the non-definable inflationary points in the model classes mentioned.     

Unique Common Fixed Points for Two Weakly C~*-contractive Mappings on Partially Ordered 2-metric Spaces

In this paper, we give existence theorems of common fixed points for two mappings with a weakly C?-contractive condition on partially ordered 2-metric spaces and give a sufficient condition under which there exists a unique common fixed point.     

A coupled best approximations theorem in normed spaces

We prove a coupled best approximations theorem in normed spaces. Also, we derive the results on coupled coincidence points and coupled fixed points, which were introduced by Lakshmikantham and ?iri? [V. Lakshmikantham, LJ. ?iri?, Coupled fixed point theorems for nonlinear contractions in partially ordered metric spaces, Nonlinear Anal. TMA, 70 (2009) 4341-4349].     

Common coupled fixed points of generalized contractive mappings in partially ordered metric spaces

In this paper, we introduce the concept of a $w^{*}$ -compatible mappings to obtain coupled coincidence point and coupled common fixed points of nonlinear contractive mappings in partially ordered metric spaces. Our results generalize, extend, unify, enrich and complement various comparable results in the existing literature.     

On improper integrals and differential equations in ordered Banach spaces

In this paper we study the existence of improper integrals of vector-valued mappings. The so obtained results combined with fixed point results in partially ordered functions spaces are then applied to derive existence and comparison results for least and greatest solutions of initial- and boundary-value problems in ordered Banach spaces. The considered problems can be singular, functional, nonlocal, implicit and discontinuous. Concrete examples are also solved.     

Definability of Least Fixed Points

Least fixed points of modal logic are studied. We introduce a class of Kripke models and prove that least fixed points of positive operators are definable in these. The class is widest of the known ones in which least fixed points of positive operators are definable.     

A Discontinuous Colombeau Differential Calculus

Starting from the Colombeau Generalized Functions, the sharp topologies and the notion of generalized points, we introduce a new kind of differential calculus (for functions between totally disconnected spaces). We also define here the notions of holomorphic generalized functions (in this new framework) and generalized manifold. Finally we give an answer to a question raised in [6].Research partially supported by CNPq (Proc 300652/95-0).     

Robust Bayesian analysis in partially ordered plausibility calculi

In Robust Bayesian analysis one attempts to avoid the ‘Dogma of Precision’ in Bayesian analysis by entertaining a set of probability distributions instead of exactly one. The algebraic approach to plausibility calculi is inspired by Cox's and Jaynes' analyses of plausibility assessment as a logic of uncertainty. In the algebraic approach one is not so much interested in different ways to prove that precise Bayesian probability is inevitable but rather in how different sets of assumptions are reflected in the resulting plausibility calculus. It has repeatedly been pointed out that a partially ordered plausibility domain is more appropriate than a totally ordered one, but it has not yet been completely resolved exactly what such domains can look like. One such domain is the natural robust Bayesian representation, an indexed family of probabilities.We show that every plausibility calculus embeddable in a partially ordered ring is equivalent to a subring of a product of ordered fields, i.e., the robust Bayesian representation is universal under our assumptions, if extended rather than standard probability is used.We also show that this representation has at least the same expressiveness as coherent sets of desirable gambles with real valued payoffs, for a finite universe.     

A result of suzuki type in partial G-metric spaces

Recently, Suzuki [T. Suzuki, A generalized Banach contraction principle that characterizes metric completeness, Proc. Amer. Math. Soc. 136 (2008), 1861-1869] proved a fixed point theorem that is a generalization of the Banach contraction principle and characterizes the metric completeness. Paesano and Vetro [D. Paesano and P. Vetro, Suzuki's type characterizations of completeness for partial metric spaces and fixed points for partially ordered metric spaces, Topology Appl., 159 (2012), 911-920] proved an analogous fixed point result for a self-mapping on a partial metric space that characterizes the partial metric 0-completeness. In this article, we introduce the notion of partial G-metric spaces and prove a result of Suzuki type in the setting of partial G-metric spaces. We deduce also a result of common fixed point.     

Nielsen fixed point theory for partially ordered sets

In this paper, we introduce a Nielsen type number for any selfmap f of a partially ordered set of spaces. This Nielsen theory relates to various existing Nielsen type fixed point theories for different settings such as maps of pairs of spaces, maps of triads, fibre preserving maps, equivariant maps and iterates of maps, by exploring their underlying poset structures.     

Fixed point theorems for generalized contractions in partially ordered metric spaces with semi-monotone metric

In this paper, we study the existence and uniqueness of (coupled) fixed points for mixed monotone mappings in partially ordered metric spaces with semi-monotone metric. As an application, we prove the existence and uniqueness of the solution for a first-order differential equation with periodic boundary conditions.     

Reverse mathematics and order theoretic fixed point theorems

The theory of countable partially ordered sets (posets) is developed within a weak subsystem of second order arithmetic. We within \(\mathsf {RCA_0}\) give definitions of notions of the countable order theory and present some statements of countable lattices equivalent to arithmetical comprehension axiom over \(\mathsf {RCA_0}\). Then we within \(\mathsf {RCA_0}\) give proofs of Knaster–Tarski fixed point theorem, Tarski–Kantorovitch fixed point theorem, Bourbaki–Witt fixed point theorem, and Abian–Brown maximal fixed point theorem for countable lattices or posets. We also give Reverse Mathematics results of the fixed point theory of countable posets; Abian–Brown least fixed point theorem, Davis’ converse for countable lattices, Markowski’s converse for countable posets, and arithmetical comprehension axiom are pairwise equivalent over \(\mathsf {RCA_0}\). Here the converses state that some fixed point properties characterize the completeness of the underlying spaces.     

Quantum B-algebras

The concept of quantale was created in 1984 to develop a framework for non-commutative spaces and quantum mechanics with a view toward non-commutative logic. The logic of quantales and its algebraic semantics manifests itself in a class of partially ordered algebras with a pair of implicational operations recently introduced as quantum B-algebras. Implicational algebras like pseudo-effect algebras, generalized BL- or MV-algebras, partially ordered groups, pseudo-BCK algebras, residuated posets, cone algebras, etc., are quantum B-algebras, and every quantum B-algebra can be recovered from its spectrum which is a quantale. By a two-fold application of the functor “spectrum”, it is shown that quantum B-algebras have a completion which is again a quantale. Every quantale Q is a quantum B-algebra, and its spectrum is a bigger quantale which repairs the deficiency of the inverse residuals of Q. The connected components of a quantum B-algebra are shown to be a group, a fact that applies to normal quantum B-algebras arising in algebraic number theory, as well as to pseudo-BCI algebras and quantum BL-algebras. The logic of quantum B-algebras is shown to be complete.