A logic‐mathematical point of view of the truth: Reality,perception, and language

In this article, the authors propose a theory of the truth value of propositions from a logic‐mathematical point of view. The work that the authors present is an attempt to address this question from an epistemological, linguistic, and logical‐mathematical point of view. What is it to exist and how do we define existence? The main objective of this work is an approach to the first of these questions. We leave a more thorough treatment of the problem of existence for future works. © 2014 Wiley Periodicals, Inc. Complexity 20: 58–67, 2015     

Fuzzy sets: A topos-logical point of view

Bénabou deduction-categories are defined, with a set of additional assumptions that define categories with formal finite limits (resp. formal regular categories, formal logoi, formal topoi). They are shown to be generalized structures in which higher-order many-sorted languages can be realized. The corresponding Gentzen-type higher-order calculus of sequents is explicited and the soundness theorem is formulated. A construction is given, which associates to each deduction category with formal properties a real category with the corresponding real properties, in a universal way. The corresponding sounddess and completeness properties are formulated for the real categories thus obtained. Fuzzy sets, as generalized by Goguen are introduced, considered as the objects of a category Fuz(H), which turns out to be the real category associated to a very simple formal topos, and thus to be itself a topos: furthermore this is proved to be a Grothendieck topos which is a strictly full epireflective subcategory of Higgs' category of ‘H-valued sets’. Topoi are proposed as generalized fuzzy sets, and deductio0-categories as generalized² fuzzy sets. Some related topics such as Arbib-Manes fuzzy theories, probability, many-valued and fuzzy logics, intensional logic are very briefly touched upon.     

One complex variable from the several variables point of view

We discuss basic properties of holomorphic functions of one complex variable from the point of view of the theory of several complex variables.     

And/or trees: A local limit point of view

We present here a new and universal approach for the study of random and/or trees, unifying in one framework many different models, including some novel ones not yet understood in the literature. An and/or tree is a Boolean expression represented in (one of) its tree shapes. Fix an integer k, take a sequence of random (rooted) trees of increasing size, say , and label each of these random trees uniformly at random in order to get a random Boolean expression on k variables. We prove that, under rather weak local conditions on the sequence of random trees , the distribution induced on Boolean functions by this procedure converges as n tends to infinity. In particular, we characterize two different behaviors of this limit distribution depending on the shape of the local limit of : a degenerate case when the local limit has no leaves; and a non‐degenerate case, which we are able to describe in more details under stronger conditions. In this latter case, we provide a relationship between the probability of a given Boolean function and its complexity. The examples covered by this unified framework include trees that interpolate between models with logarithmic typical distances (such as random binary search trees) and other ones with square root typical distances (such as conditioned Galton–Watson trees).     

A dual view of equilibrium problems

The aim of this paper is to introduce and study a dual problem associated to a generalized equilibrium problem (GEP). We show that the solutions of (GEP) and its dual are strictly related to the saddle points of an associated Lagrangian function, and, under some suitable conditions, to the solutions of a family of parametric optimization problems and their dual problems. Our results allow us to show that well-known concepts and results from duality theory of some important particular cases of (GEP) like variational inequalities and optimization problems can be recovered.     

A non-linear version of Hunt-Lion's theorem from the point of view of T-accretivity

In the classical topological context, Dellacherie [10] has given a non-linear version of Hunt's theorem characterizing the proper kernels verifying the complete maximum principle as those closing a submarkovian resolvent. In this paper we study the relation between this non-linear version of Hunt's theorem and T-accretivity.     

Non-parametric vs parametric forecasting in time series: A computational point of view

The finite sample behaviour of non-parametric predictors is considered for time series. Among other results, it is shown by simulation arguments that such predictors compare favourably with predictors based on parametric models in the spirit of the usual Box-Jenkins approach.     

A systematization of the saddle point method. Application to the Airy and Hankel functions

The standard saddle point method of asymptotic expansions of integrals requires to show the existence of the steepest descent paths of the phase function and the computation of the coefficients of the expansion from a function implicitly defined by solving an inversion problem. This means that the method is not systematic because the steepest descent paths depend on the phase function on hand and there is not a general and explicit formula for the coefficients of the expansion (like in Watson's Lemma for example). We propose a more systematic variant of the method in which the computation of the steepest descent paths is trivial and almost universal: it only depends on the location and the order of the saddle points of the phase function. Moreover, this variant of the method generates an asymptotic expansion given in terms of a generalized (and universal) asymptotic sequence that avoids the computation of the standard coefficients, giving an explicit and systematic formula for the expansion that may be easily implemented on a symbolic manipulation program. As an illustrative example, the well-known asymptotic expansion of the Airy function is rederived almost trivially using this method. New asymptotic expansions of the Hankel function Hn(z) for large n and z are given as non-trivial examples.     

Congruences and ideals on Boolean modules: a heterogeneous point of view

Definitions for heterogeneous congruences and heterogeneous ideals on a Boolean module $\mathcal {M}$ are given and the respective lattices $\mathrm{Cong}\mathcal {M}$ and $\mathrm{Ide}\mathcal {M}$ are presented. A characterization of the simple bijective Boolean modules is achieved differing from that given by Brink in a homogeneous approach. We construct the smallest and the greatest modular congruence having the same Boolean part. The same is established for modular ideals. The notions of kernel of a modular congruence and the congruence induced by a modular ideal are introduced to describe an isomorphism between $\mathrm{Cong}\mathcal {M}$ and $\mathrm{Ide}\mathcal {M}$. This isomorphism leads us to conclude that the class of the Boolean module is ideal determined.     

A comparison between the material point method and the finite element method in view of extrusion problems

An appropriate method for the simulation of continuous forming processes is the material point method (MPM) [1],[2] which combines the viewpoints of fluid dynamics and solid mechanics. The MPM and related methods [3] are derived from the particle‐in‐cell methods [4]. Bodies are discretised by Lagragian particles with pointwise mass distributions. The differential equations in their weak form are solved on temporary meshes built of standard finite elements. At the end of each time step the particle positions are updated and the mesh is replaced by a new mesh with a regular shape. The state variables at the nodes of the new mesh are extracted from the state variables at the particles by a transfer algorithm. When particles pass element boundaries, numerical difficulties might be observed. These are eliminated by a smooth approximation of nodal data from material point data. The modified MPM has been implemented together with the FEM in one programme because the similarities of the methods outbalance the differences. On the basis of numerical examples the results of both methods are compared. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Contractive multifunctions, fixed point inclusions and iterated multifunction systems

We study the properties of multifunction operators that are contractive in the Covitz-Nadler sense. In this situation, such operators T possess fixed points satisfying the relation x∈Tx. We introduce an iterative method involving projections that guarantees convergence from any starting point x₀∈X to a point x∈XT, the set of all fixed points of a multifunction operator T. We also prove a continuity result for fixed point sets XT as well as a “generalized collage theorem” for contractive multifunctions. These results can then be used to solve inverse problems involving contractive multifunctions. Two applications of contractive multifunctions are introduced: (i) integral inclusions and (ii) iterated multifunction systems.     

A ruled residue theorem for function fields of conics

The ruled residue theorem characterises residue field extensions for valuations on a rational function field. Under the assumption that the characteristic of the residue field is different from 2 this theorem is extended here to function fields of conics. The main result is that there is at most one extension of a valuation on the base field to the function field of a conic for which the residue field extension is transcendental but not ruled. Furthermore the situation when this valuation is present is characterised.     

Elements of Prescribed Order,Prescribed Traces and Systems of Rational Functions Over Finite Fields

Let k 1 and be a system of rational functions forming a strongly linearly independent set over a finite field . Let be arbitrarily prescribed elements. We prove that for all sufficiently large extensions , there is an element of prescribed order such that is the relative trace map from onto We give some applications to BCH codes, finite field arithmetic and ordered orthogonal arrays. We also solve a question of Helleseth et~al. (Hypercubic 4 and 5-designs from Double-Error-Correcting codes, Des. Codes. Cryptgr. 28(2003). pp. 265–282) completely.classification 11T30, 11G20, 05B15     

Random point fields associated with certain Fredholm determinants I: fermion, Poisson and boson point processes

We introduce certain classes of random point fields, including fermion and boson point processes, which are associated with Fredholm determinants of certain integral operators and study some of their basic properties: limit theorems, correlation functions, Palm measures etc. Also we propose a conjecture on an α-analogue of the determinant and permanent.     

A ruled residue theorem for function fields of elliptic curves

It is shown that a valuation of residue characteristic different from 2 and 3 on a field E has at most one extension to the function field of an elliptic curve over E, for which the residue field extension is transcendental but not ruled. The cases where such an extension is present are characterised.     

A global Implicit Function Theorem without initial point and its applications to control of non-affine systems of high dimensions

Control system design for non-affine systems is a difficult problem because of the lack of mathematical tools. The key to the problem is solving for an implicit function but the known results for implicit functions are not applicable for higher dimensional systems except for single-input and single-output systems. In this paper, a new version of a global implicit function theorem in higher dimension is presented and proved. This result can be applied to show the controllability of a class of non-affine multi-input and multi-output (MIMO) system so that approximation based control system design can be applied with ease.     

函数域Fq(T,lDl+d)的基本单位

设Fq(T)=k, p是Fq的特征, l是奇素数, (Z/lZ)*= q ,M=Dl+d,d=ld0, Fq*, d0,D是Fq［T］中首一多项式, D 1,d0|Dl-1, M是l-幂自由的,记=(lM-D)l d,K为K=k(lM)的基本单位, K<0, 我们有结果: =Kpilj, j 0,1, 0 i e, 其中e是l的p-adic表示中p的最高幂次数.