Toward a semantic general theory of everything

The notion of a universal semantic cognitive map is introduced as a general indexing space for semantics, useful to reduce semantic relations to geometric and topological relations. As a first step in designing the concept, the notion of semantics is operationalized in terms of human subjective experience and is related to the concept of spatial position. Then synonymy and antonymy are introduced in geometrical terms. Further analysis building on previous studies of the authors indicates that the universal semantic cognitive map should be locally low‐dimensional. This essay ends with a proposal to develop a metric system for subjective experiences based on the outlined approach. We conclude that a computationally defined universal semantic cognitive map is a necessary tool for the emerging new science of the mind: a scientific paradigm that includes subjective experience as an object of study. © 2009 Wiley Periodicals, Inc. Complexity, 2010     

Twofold fuzzy sets and rough sets—Some issues in knowledge representation

This paper deals with the representation of sets where the membership of some elements may be ill-known rather than just a matter of degree as in a fuzzy set. The notion of a twofold fuzzy set is introduced when the relevant information for determining the membership status is incomplete. A twofold fuzzy set is made of a nested pair of fuzzy sets: the one which gathers the elements which more or less necessarily belong and the one which gathers the elements which more or less possibly belong. Twofold fuzzy sets are compared from a frontal and from a semantical point of view with other proposals and particularly with the notion of a rough set recently introduced by Pawlak. Set operations of twofold fuzzy sets are discussed and the cardinality of a twofold fuzzy set is defined. Twofold fuzzy relations are also introduced. Finally, various applications of twofold fuzzy sets in knowledge representation are briefly discussed.     

Factoring and weighting approaches to status scores and clique identification

The intent of this paper is to provide a definition of a socioraetric clique in the language of graph theory. This problem is viewed from two perspectives: maintaining fidelity to the intuitive notion of a clique; and providing adequate computational mechanics for large bodies of data. Luce's (1950) concept of an n‐clique is used, but further qualifications are added. Two statistics or measures with associated probability distributions are defined for testing the adequacy of a subgraph which qualifies according to the definition.     

A theorical point of view of reality,perception, and language

It is possible to view the relations between mathematics and natural language from different aspects. This relation between mathematics and language is not based on just one aspect. In this article, the authors address the role of the Subject facing Reality through language. Perception is defined and a mathematical theory of the perceptual field is proposed. The distinction between purely expressive language and purely informative language is considered false, because the subject is expressed in the communication of a message, and conversely, in purely expressive language, as in an exclamation, there is some information. To study the relation between language and reality, the function of ostensibility is defined and propositions are divided into ostensives and estimatives. © 2013 Wiley Periodicals, Inc. Complexity 20: 27–37, 2014     

Cardy algebras and sewing constraints,II

This is the part II of a two-part work started in [18]. In part I, Cardy algebras were studied, a notion which arises from the classification of genus-0, 1 open–closed rational conformal field theories. In this part, we prove that a Cardy algebra also satisfies the higher genus factorisation and modular-invariance properties formulated in [7] in terms of the notion of a solution to the sewing constraints. We present the proof by showing that the latter notion, which is defined as a monoidal natural transformation, can be expressed in terms of generators and relations, which correspond exactly to the defining data and axioms of a Cardy algebra.     

Two‐sided error proximity oblivious testing

Loosely speaking, a proximity‐oblivious (property) tester is a randomized algorithm that makes a constant number of queries to a tested object and distinguishes objects that have a predetermined property from those that lack it. Specifically, for some threshold probability c, objects having the property are accepted with probability at least c, whereas objects that are ‐far from having the property are accepted with probability at most , where F: (0,1] → (0,1] is some fixed monotone function. (We stress that, in contrast to standard testers, a proximity‐oblivious tester is not given the proximity parameter.) The foregoing notion, introduced by Goldreich and Ron (STOC 2009), was originally defined with respect to c = 1, which corresponds to one‐sided error (proximity‐oblivious) testing. Here we study the two‐sided error version of proximity‐oblivious testers; that is, the (general) case of arbitrary c ? (0,1]. We show that, in many natural cases, two‐sided error proximity‐oblivious testers are more powerful than one‐sided error proximity‐oblivious testers; that is, many natural properties that have no one‐sided error proximity‐oblivious testers do have a two‐sided error proximity‐oblivious tester. © 2014 Wiley Periodicals, Inc. Random Struct. Alg., 48, 341–383, 2016     

Stochastic integration,trace and the skeleton of wiener functionals

It is shown that the notion of trace induced by a given complete orthonormal system relates the Skorohod integral with a corresponding Ogawa‐type integral evaluated with respect to the same orthonormal systems. Similarly the multiple Wiener‐Ito integral is shown to be related to a multiple Ogawa‐type integral induced by a complete orthonormal system via the Hu‐Meyer formula with suitably defined multiple traces. The notion of skeleton of a Wiener functional relative to a given orthonormal system is defined and yields what seems to be a “natural” extension of Wiener functionals to the Cameron Martin space and the Wiener processes with a different scale.     

(α,β)-fuzzy Subalgebras of Q-algebras

In this note by two relations belonging to (∈) and quasi-coincidence (q) between fuzzy points and fuzzy sets,the notion of (α,β)-fuzzy Q-algebras,the level Q-subalgebra is introduced where α,β are any two of {∈,q,∈∨q,∈∧q} with α≠∈∧q.Then we state and prove some theorems which determine the relationship between these notions and Q-subalgebras.The images and inverse images of (α,β)-fuzzy Q-subalgebras are defined,and how the homomorphic images and inverse images of (α,β)-fuzzy Q-subalgebra becomes (α,β)-fuzzy Q-algebras are studied.     

A Note on Exponential Stability for Evolutionary Equations.

An abstract notion of exponential stability within the framework of evolutionary equations is provided. Sufficient conditions for the exponential stability are given in terms of the so-called material-law operator, which is defined via an operator-valued analytic function. (© 2014 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

The utility of nonequilibrium statistical mechanics,specifically transport theory,for modeling cohort data

This article introduces a new case‐based density approach to modeling big data longitudinally, which uses ordinary differential equations and the linear advection partial differential equations (PDE) to treat macroscopic, dynamical change as a transport issue of aggregate cases across continuous time. The novelty of this approach comes from its unique data‐driven treatment of cases: which are K dimensional vectors; where the velocity vector for each case is computed according to its particular measurements on some set of empirically defined social, psychological, or biological variables. The three main strengths of this approach are its ability to: (1) translate the data driven, nonlinear trajectories of microscopic constituents (cases) into the linear movement of macroscopic trajectories, which take the form of densities; (2) detect the presence of multiple, complex steady state behaviors, including sinks, spiraling sources, saddles, periodic orbits, and attractor points; and (3) predict the motion of novel cases and time instances. To demonstrate the utility of this approach, we used it to model a recognized cohort dynamic: the longitudinal relationship between a country's per capita gross domestic product (GDP) and its longevity rates. Data for the model came from the widely used Gapminder dataset. Empirical results, including the strength of the model's fit and the novelty of its results (particularly on a topic of such extensive study) support the utility of our new approach. © 2014 Wiley Periodicals, Inc. Complexity 20: 45–57, 2015     

关于BL-代数的模糊滤子与模糊理想

在BL-代数中引入模糊超滤子和模糊固执滤子的概念,证明了如下条件对于BL-代数的非常数模糊滤子f来说是等价的:(1)f是布尔的和素的,(2)f是蕴涵的和素的,(3)f是超的,(4)f是固执的。应用模糊正蕴涵滤子给出G-代数的若干特征性质。提出BL-代数模糊理想的概念,给出一些重要例子,并通过例子说明在BL-代数中模糊理想一般不能由模糊滤子导出。同时,从模糊理想出发构造了商BL-代数,并建立了相应的同态基本定理。最后,研究了BL-代数的几类模糊理想及其相互关系,给出模糊布尔理想、模糊素理想、模糊超理想的特征性质。     

Boundary Relations, Unitary Colligations, and Functional Models

Recently a new notion, the so-called boundary relation, has been introduced involving an analytic object, the so-called Weyl family. Weyl families and boundary relations establish a link between the class of Nevanlinna families and unitary relations acting from one Kreĭn space, a basic (state) space, to another Kreĭn space, a parameter space where the Nevanlinna family or Weyl family is acting. Nevanlinna families are a natural generalization of the class of operator-valued Nevanlinna functions and they are closely connected with the class of operator-valued Schur functions. This paper establishes the connection between boundary relations and their Weyl families on the one hand, and unitary colligations and their transfer functions on the other hand. From this connection there are various advances which will benefit the investigations on both sides, including operator theoretic as well as analytic aspects. As one of the main consequences a functional model for Nevanlinna families is obtained from a variant of the functional model of L. de Branges and J. Rovnyak for Schur functions. Here the model space is a reproducing kernel Hilbert space in which multiplication by the independent variable defines a closed simple symmetric operator. This operator gives rise to a boundary relation such that the given Nevanlinna family is realized as the corresponding Weyl family. Received: January 21, 2008., Revised: March 31, 2008.     

Kolmogorov complexity and set theoretical representations of integers

We reconsider some classical natural semantics of integers (namely iterators of functions, cardinals of sets, index of equivalence relations) in the perspective of Kolmogorov complexity. To each such semantics one can attach a simple representation of integers that we suitably effectivize in order to develop an associated Kolmogorov theory. Such effectivizations are particular instances of a general notion of “self‐enumerated system” that we introduce in this paper. Our main result asserts that, with such effectivizations, Kolmogorov theory allows to quantitatively distinguish the underlying semantics. We characterize the families obtained by such effectivizations and prove that the associated Kolmogorov complexities constitute a hierarchy which coincides with that of Kolmogorov complexities defined via jump oracles and/or infinite computations (cf. [6]). This contrasts with the well‐known fact that usual Kolmogorov complexity does not depend (up to a constant) on the chosen arithmetic representation of integers, let it be in any base n ≥ 2 or in unary. Also, in a conceptual point of view, our result can be seen as a mean to measure the degree of abstraction of these diverse semantics. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Pseudospectra of isospectrally reduced matrices

An isospectral matrix reduction is a procedure that reduces the size of a matrix while maintaining its eigenvalues up to a known set. As to not violate the fundamental theorem of algebra, the reduced matrices have rational functions as entries. Because isospectral reductions can preserve the spectrum of a matrix, they are fundamentally different from say the restriction of a matrix to an invariant subspace. We show that the notion of pseudospectrum can be extended to a wide class of matrices with rational function entries and that the pseudospectrum of such matrices shrinks with isospectral reductions. Hence, the eigenvalues of a reduced matrix are more robust to entry‐wise perturbations than the eigenvalues of the original matrix. Moreover, the isospectral reductions considered here are more general than those considered elsewhere. We also introduce the notion of an inverse pseudospectrum (or pseudoresonances), which indicates how stable the poles of a rational function valued matrix are to entry‐wise perturbations. Illustrations of these concepts are given for mass‐spring networks. Copyright © 2014 John Wiley & Sons, Ltd.     

A definition of spectrum for differential equations on finite time

Hyperbolicity of an autonomous rest point is characterised by its linearization not having eigenvalues on the imaginary axis. More generally, hyperbolicity of any solution which exists for all times can be defined by means of Lyapunov exponents or exponential dichotomies. We go one step further and introduce a meaningful notion of hyperbolicity for linear systems which are defined for finite time only, i.e. on a compact time interval. Hyperbolicity now describes the transient dynamics on that interval. In this framework, we provide a definition of finite-time spectrum, study its relations with classical concepts, and prove an analogue of the Sacker-Sell spectral theorem: For a d-dimensional system the spectrum is non-empty and consists of at most d disjoint (and often compact) intervals. An example illustrates that the corresponding spectral manifolds may not be unique, which in turn leads to several challenging questions.     

A Brauerian representation of split preorders

Split preorders are preordering relations on a domain whose composition is defined in a particular way by splitting the domain into two disjoint subsets. These relations and the associated composition arise in categorial proof theory in connection with coherence theorems. Here split preorders are represented isomorphically in the category whose arrows are binary relations and whose composition is defined in the usual way. This representation is related to a classical result of representation theory due to Richard Brauer. (© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Sur certaines conditions de chaines ascendantes dans les groupes abeliens et les modules sans torsion

Because of a previous result on factorable Z-modul ([8],[9]) we study the links between the two following propeties for a torsion-free A-module M: in M every properly ascending chain of cyclic submodules is finite, or, M is a factorable module.

Then, we apply the notion of homogeneity, defined by G. Kolettis ([7]) and we see the relations between A-factorabmodules and homogeneous-type 0-modules. We get results for hom geneous groups of type 0 (or factorable groups).

At last, we look at ascending chain conditions concerning the n-generator submodules of a module.