Modified realizability and predicate logic

Semantics of predicate formulas based on the notion of modified realizability for arithmetic formulas and interpretations of the language of arithmetic in all finite types are considered. For a number of natural constructive interpretations, the corresponding predicate logic of modified realizability is proved to be nonarithmetical. Translated fromMatematicheskie Zametki, Vol. 61, No. 2, pp. 259–269, February, 1997. This research was supported by the Russian Foundation for Basic Research under grant No. 95-01-00416 and by the International Science Foundation under grant No. NFQ000. Translated by V. N. Dubrovsky     

Symmetric nonnegative realizability via partitioned majorization

A sufficient condition for symmetric nonnegative realizability of a spectrum is given in terms of (weak) majorization of a partition of the negative eigenvalues by a selection of the positive eigenvalues. If there are more than two positive eigenvalues, an additional condition, besides majorization, is needed on the partition. This generalizes observations of Suleǐmanova and Loewy about the cases of one and two positive eigenvalues, respectively. It may be used to provide insight into realizability of 5-element spectra and beyond.     

From realizability to induction via dependent intersection

In this paper, it is shown that induction is derivable in a type-assignment formulation of the second-order dependent type theory $\lambda P2$, extended with the implicit product type of Miquel, dependent intersection type of Kopylov, and a built-in equality type. The crucial idea is to use dependent intersections to internalize a result of Leivant's showing that Church-encoded data may be seen as realizing their own type correctness statements, under the Curry–Howard isomorphism.     

Intuitionistic nonstandard bounded modified realisability and functional interpretation

We present a bounded modified realisability and a bounded functional interpretation of intuitionistic nonstandard arithmetic with nonstandard principles.The functional interpretation is the intuitionistic counterpart of Ferreira and Gaspar's functional interpretation and has similarities with Van den Berg, Briseid and Safarik's functional interpretation but replacing finiteness by majorisability.We give a threefold contribution: constructive content and proof-theoretical properties of nonstandard arithmetic; filling a gap in the literature; being in line with nonstandard methods to analyse compactness arguments.     

On the convergence of maximal monotone operators

We study the convergence of maximal monotone operators with the help of representations by convex functions. In particular, we prove the convergence of a sequence of sums of maximal monotone operators under a general qualification condition of the Attouch-Brezis type.

     

Sheaf toposes for realizability

We compare realizability models over partial combinatory algebras by embedding them into sheaf toposes. We then use the machinery of Grothendieck toposes and geometric morphisms to study the relationship between realizability models over different partial combinatory algebras. This research is part of the Logic of Types and Computation project at Carnegie Mellon University under the direction of Dana Scott.     

Proof-functional connectives and realizability

The meaning of a formula built out of proof-functional connectives depends in an essential way upon the intensional aspect of the proofs of the component subformulas. We study three such connectives, strong equivalence (where the two directions of the equivalence are established by mutually inverse maps), strong conjunction (where the two components of the conjunction are established by the same proof) and relevant implication (where the implication is established by an identity map). For each of these connectives we give a type assignment system, a realizability semantics, and a completeness theorem. This form of completeness implies the semantic completeness of the type assignment system.     

Hyperbolic positive mass theorem under modified energy condition

We provide two new positive mass theorems under respective modified energy conditions allowing T00 negative on some compact set for certain modified asymptotically hyperbolic manifolds. This work is analogous to Zhang’s previous result for modified asymptotically ?at initial data sets.     

MODIFIED APPROXIMATE PROXIMAL POINT ALGORITHMS FOR FINDING ROOTS OF MAXIMAL MONOTONE OPERATORS

§1　Introduction and preliminariesA set T Rn×Rnis called a monotone operator on Rn,if T has the property(x,y) ,(x′,y′)∈T 〈x -x′,y -y′〉≥0 ,where〈·,·〉denotes the inner product on Rn.T is maximal if(considered as a graph) itis not strictly contained in any other monotone operator on Rn.It is well known that thetheory of maximal monotone operators plays an important role in the study of convexprogramming and variational inequalities since itcan provide a powerful general framework…     

An axiomatization of the modified Banzhaf Coleman index

In this paper we provide a characterization for the modified Banzhaf-Coleman indexes by employing some amalgamation axioms as Lehrer (1988) did for the Banzhaf-Coleman indexes. Final version: June 2001     

Unavoidable sequences in constructive analysis

Five recursively axiomatizable theories extending Kleene's intuitionistic theory FIM of numbers and numbertheoretic (choice) sequences are introduced and shown to be consistent, by a modified relative realizability interpretation which verifies that every sequence classically defined by a Π¹₁ formula is unavoidable (cannot fail to exist) and that no sequence can fail to be classically Δ¹₁. The analytical form of Markov's Principle fails under the interpretation. The notion of strongly inadmissible rule of inference is introduced, with examples (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

The realizability of local loop spaces as manifolds

As an extension of earlier work, we show that every P-local loop space, where P is a set of primes, is homotopy equivalent to the P-localization of a compact, smooth, parallelizable manifold. A similar result is also proved for P-complete loop spaces. Received: February 2006     

Region configurations for realizability of lattice Piecewise-Linear models

Continuous Piecewise-Linear (PWL) functions can be represented by a scheme that selects adequately the linear components of the function without considering explicitly the boundaries. The representation method based on the Lattice Theory, that we call the lattice PWL model, is a form that fits that scheme. In this paper, two domain partitions are proposed that give rise to region configurations practically meaningful for the realizability of lattice models. In one of those partitions, each region is uniquely determined by one of the linear function. The other region configuration is derived from the rearrangement in ascending order of the linear components. Both configurations are discussed and connected with the domain partition generated by the set of boundaries, frequently considered when dealing with PWL functions. The realization method of lattice models is adapted to the three region configurations, comparing the efficiency of the resulting versions.     

Modified equation for adaptive monotone difference schemes and its convergent analysis

A modified parabolic equation for adaptive monotone difference schemes based on equal-arclength mesh, applied to the linear convection equation, is derived and its convergence analysis shows that solutions of the modified equation approach a discontinuous (piecewise smooth) solution of the linear convection equation at order one rate in the -norm. It is well known that solutions of the monotone schemes with uniform meshes and their modified equation approach the same discontinuous solution at a half-order rate in the -norm. Therefore, the convergence analysis for the modified equation provided in this work demonstrates theoretically that the monotone schemes with adaptive grids can improve the solution accuracy. Numerical experiments also confirm the theoretical conclusions.

     

上半空间中修改的Poisson积分和Green位势的例外集

本文刻画了修改的Poisson积分和的Green位势在上半空间中的例外集.所得结论推广了关于解析函数、调和函数和超调和函数增长性质的已有结果.     

Generalizing realizability and Heyting models for constructive set theory

This article presents a common generalization of the two main methods for obtaining class models of constructive set theory. Heyting models are a generalization of the Boolean models for classical set theory which are a variant of forcing, while realizability is a decidedly constructive method that has first been developed for number theory by Kleene and was later very fruitfully adapted to constructive set theory. In order to achieve the generalization, a new kind of structure (applicative topologies) is introduced, which contains both elements of formal topology and applicative structures. This approach not only deepens the understanding of class models and leads to more efficiency in proofs about these kinds of models, but also makes it possible to prove new results about the two special cases that were not known before and to construct new models.     

CTE method and exact solutions for modified Boussinesq system

In this paper, the truncated Painlevé analysis and the consistent tanh expansion method are developed for the modified Boussinesq system, and new exact solutions such as the single‐soliton, the two‐soliton, the rational solutions, and the explicit interaction solutions among a soliton and the cnoidal periodic waves are obtained. Copyright © 2016 John Wiley & Sons, Ltd.     

一类基于有界算子合成的模糊关系方程

讨论模糊关系的有界和 -有界积合成的基本性质。对于论域 U上的一个自反和有界传递的模糊关系 R,证明它是一个预序关系。得到关于有界算子的模糊线性方程有解的充要条件及解的递归结构。在此基础上给出有限论域上的模糊关系方程 A·X=B的求解方法     

关于修正的Baskakov算子的Stechin-Marchaud型不等式

利用K-泛函研究了修正的Baskakov型算子的Stechin-Marchaud型不等式,由此不等式,我们得到了关于ω2φλ的逆结果.