On intuitionistic modal and tense logics and their classical companion logics: Topological semantics and bisimulations

We take the well-known intuitionistic modal logic of Fischer Servi with semantics in bi-relational Kripke frames, and give the natural extension to topological Kripke frames. Fischer Servi’s two interaction conditions relating the intuitionistic pre-order (or partial-order) with the modal accessibility relation generalize to the requirement that the relation and its inverse be lower semi-continuous with respect to the topology. We then investigate the notion of topological bisimulation relations between topological Kripke frames, as introduced by Aiello and van Benthem, and show that their topology-preserving conditions are equivalent to the properties that the inverse relation and the relation are lower semi-continuous with respect to the topologies on the two models. The first main result is that this notion of topological bisimulation yields semantic preservation w.r.t. topological Kripke models for both intuitionistic tense logics, and for their classical companion multi-modal logics in the setting of the Gödel translation. After giving canonical topological Kripke models for the Hilbert-style axiomatizations of the Fischer Servi logic and its classical companion logic, we use the canonical model in a second main result to characterize a Hennessy–Milner class of topological models between any pair of which there is a maximal topological bisimulation that preserve the intuitionistic semantics.     

Carnap,Goguen, and the Hyperontologies: Logical Pluralism and Heterogeneous Structuring in Ontology Design

This paper addresses questions of universality related to ontological engineering, namely aims at substantiating (negative) answers to the following three basic questions: (i) Is there a ‘universal ontology’?, (ii) Is there a ‘universal formal ontology language’?, and (iii) Is there a universally applicable ‘mode of reasoning’ for formal ontologies? To support our answers in a principled way, we present a general framework for the design of formal ontologies resting on two main principles: firstly, we endorse Rudolf Carnap’s principle of logical tolerance by giving central stage to the concept of logical heterogeneity, i.e. the use of a plurality of logical languages within one ontology design. Secondly, to structure and combine heterogeneous ontologies in a semantically well-founded way, we base our work on abstract model theory in the form of institutional semantics, as forcefully put forward by Joseph Goguen and Rod Burstall. In particular, we employ the structuring mechanisms of the heterogeneous algebraic specification language HetCasl for defining a general concept of heterogeneous, distributed, highly modular and structured ontologies, called hyperontologies. Moreover, we distinguish, on a structural and semantic level, several different kinds of combining and aligning heterogeneous ontologies, namely integration, connection, and refinement. We show how the notion of heterogeneous refinement can be used to provide both a general notion of sub-ontology as well as a notion of heterogeneous equivalence of ontologies, and finally sketch how different modes of reasoning over ontologies are related to these different structuring aspects.     

Weak Clarke epiderivative in set-valued optimization

A new notion of weak Clarke epiderivative for a set-valued map is introduced using the concept of Clarke tangent cone. The existence, characterization and properties of weak Clarke epiderivative are then studied. Finally optimality criteria are established for a constrained set-valued optimization problem in terms of weak Clarke epiderivative.     

Fundamental groups of compact manifolds and symmetric geometry of noncompact type

We introduce the notion of geometrical engagement for actions of semisimple Lie groups and their lattices as a concept closely related to Zimmer's topological engagement condition. Our notion is a geometrical criterion in the sense that it makes use of Riemannian distances. However, it can be used together with the foliated harmonic map techniques introduced in [8] to establish foliated geometric superrigidity results for both actions and geometric objects. In particular, we improve the applications of the main theorem in [9] to consider nonpositively curved compact manifolds (not necessarily with strictly negative curvature). We also establish topological restrictions for Riemannian manifolds whose universal cover have a suitable symmetric de Rham factor (Theorem B), as well as geometric obstructions for nonpositively curved compact manifolds to have fundamental groups isomorphic to certain groups build out of cocompact lattices in higher rank simple Lie groups (Corollary 4.5). Received: October 22, 1997     

Power contexts and their concept lattices

We introduce a framework for the study of formal contexts and their lattices induced by the additional structure of self-relations on top of the traditional incidence relation. The induced contexts use subsets as objects and attributes, hence the name power context and power concept. Six types of new incidence relations are introduced by taking into account all possible combinations of universal and existential quantifiers as well as the order of the quantifications in constructing the lifted power contexts. The structure of the power concept lattice is investigated through projection mappings from the baseline objects and attributes to those of the power context, respectively. We introduce the notions of extensional consistency and intensional consistency, corresponding to the topological notions of continuity in the analogous setting when concepts are viewed as closed sets. We establish Galois connections for these notions of consistency. We further introduce the notion of faithfulness for the first type of lifted incidence relation based on the fact that it can be equivalently characterized by a concept-faithful morphism. We also present conditions under which the power concept lattice serves as a factor lattice of the base concept lattice.     

Emergence and collapse of money through reciprocity

In this paper we discuss that monetary exchange emerges in a reciprocal system which consists of donations and returns. Agents reciprocate goods alternately without bilateral agreement in the system, that is constructed not from the viewpoint of the recipient, but from the one of the reciprocator. Moreover, reciprocity is regarded as interaction with incomplete identification consisting of the alternate procedure of constructing a map from coarse-grained data by a contraction mapping and of applying the map to fine-grained data. We show that reciprocity gives rise to the monetary exchange which implies globality without the concept of metric space or global semantics. It seems that interaction with incomplete identification does not carry the notion of globality. On the contrary, in our model globality paradoxically occurs from the accumulation of indefinite incomplete identification.     

Distributive-Lattice Semantics of Sequent Calculi with Structural Rules

The goal of the paper is to develop a universal semantic approach to derivable rules of propositional multiple-conclusion sequent calculi with structural rules, which explicitly involve not only atomic formulas, treated as metavariables for formulas, but also formula set variables (viz., metavariables for finite sets of formulas), upon the basis of the conception of model introduced in (Fuzzy Sets Syst 121(3):27–37, 2001). One of the main results of the paper is that any regular sequent calculus with structural rules has such class of sequent models (called its semantics) that a rule is derivable in the calculus iff it is sound with respect to each model of the semantics. We then show how semantics of admissible rules of such calculi can be found with using a method of free models. Next, our universal approach is applied to sequent calculi for many-valued logics with equality determinant. Finally, we exemplify this application by studying sequent calculi for some of such logics.      

超拟群的模糊正则关系

Regular relations play in hyperquasigroups theory a role analogous to congruences in semigroup theory.The aim of this paper is to introduce the concept of regular relations on hyperquasigroups and to investigate some related properties.Further,the notion of fuzzy regular relations on hyperquasigroups is introduced and some characterizations are discussed.     

Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation

We prove the correctness of an algorithm for normalizing untyped combinator terms by evaluation. The algorithm is written in the functional programming language Haskell, and we prove that it lazily computes the combinatory Böhm tree of the term. The notion of combinatory Böhm tree is analogous to the usual notion of Böhm tree for the untyped lambda calculus. It is defined operationally by repeated head reduction of terms to head normal forms. We use formal neighbourhoods to characterize finite, partial information about data, and define a Böhm tree as a filter of such formal neighbourhoods. We also define formal topology style denotational semantics of a fragment of Haskell following Martin-Löf, and let each closed program denote a filter of formal neighbourhoods. We prove that the denotation of the output of our algorithm is the Böhm tree of the input term. The key construction in the proof is a “glueing” relation between terms and semantic neighbourhoods which is defined by induction on the latter. This relation is related to the glueing relation which was earlier used for proving the correctness of normalization by evaluation algorithm for typed combinatory logic.     

Generalized energy-time uncertainty relation

Starting with the Schrödinger universal uncertainty relations for arbitrary observables, we propose a generalization of the time uncertainty concept introduced by Mandelshtam and Tamm making it invariant with respect to the choice of observables and free of singularities. We show that for coherent states, the quantity introduced can be interpreted as the variance of the inverse effective frequency of the microsystem. This allows treating the generalized energy-time uncertainty relations similarly to the energy-inverse temperature uncertainty relations in statistical thermodynamics.     

Evidence and plausibility in neighborhood structures

The intuitive notion of evidence has both semantic and syntactic features. In this paper, we develop an evidence logic for epistemic agents faced with possibly contradictory evidence from different sources. The logic is based on a neighborhood semantics, where a neighborhood N indicates that the agent has reason to believe that the true state of the world lies in N. Further notions of relative plausibility between worlds and beliefs based on the latter ordering are then defined in terms of this evidence structure, yielding our intended models for evidence-based beliefs. In addition, we also consider a second more general flavor, where belief and plausibility are modeled using additional primitive relations, and we prove a representation theorem showing that each such general model is a p-morphic image of an intended one. This semantics invites a number of natural special cases, depending on how uniform we make the evidence sets, and how coherent their total structure. We give a structural study of the resulting ‘uniform’ and ‘flat’ models. Our main result are sound and complete axiomatizations for the logics of all four major model classes with respect to the modal language of evidence, belief and safe belief. We conclude with an outlook toward logics for the dynamics of changing evidence, and the resulting language extensions and connections with logics of plausibility change.     

完全相容稳定模糊谓词转换器

谓词转换器语义是用程序验证技术来定义程序语言的一种方式.为描述程序的语义,在稳定模糊谓词的基础上建立完全相容稳定模糊谓词转换器,讨论完全相容稳定模糊谓词转换器的拓扑语义. 同时给出它与状态转换器之间的一个保序关系,说明完全相容稳定模糊谓词转换器一定是状态转换器.     

Contingent epiderivatives and set-valued optimization

In this paper we introduce the concept of the contingent epiderivative for a set-valued map which modifies a notion introduced by Aubin [2] as upper contingent derivative. It is shown that this kind of a derivative has important properties and is one possible generalization of directional derivatives in the single-valued convex case. For optimization problems with a set-valued objective function optimality conditions based on the concept of the contingent epiderivative are proved which are necessary and sufficient under suitable assumptions.     

A construction of sound semantic linguistic scales using 4-tuple representation of term semantics

Data semantics plays a fundamental role in computer science, in general, and in computing with words, in particular. The semantics of words arises as a sophisticated problem, since words being actually vague linguistic terms are pieces of information characterized by impreciseness, incompleteness, uncertainty and/or vagueness. The qualitative semantics and the quantitative semantics are two aspects of vague linguistic information, which are closely related. However, the qualitative semantics of linguistic terms, and even the qualitative semantics of the symbolic approaches, seem to be not elaborated on directly in the literature. In this study, we propose an interpretation of the inherent order-based semantics of terms through their qualitative semantics modeled by hedge algebra structures. The quantitative semantics of terms are developed based on the quantification of hedge algebras. With this explicit approach, we propose two concepts of assessment scales to address decision problems: linguistic scales used for representing expert linguistic assessments and semantic linguistic scales based on 4-tuple linguistic representation model, which forms a formalized structure useful for computing with words. An example of a simple multi-criteria decision problem is examined by running a comparative study. We also analyze the main advantages of the proposed approach.     

Categorical Generalization of a Universal Domain

J. Adámek defined SC categories as a categorical generalization of Scott domains. Namely, an SC category is finitely accessible, has an initial object and is boundedly cocomplete (each diagram with a compatible cocone has a colimit). SC categories are proved to serve well as a basis for the computer language semantics.The purpose of this paper is to generalize the concept of a universal Scott domain to a universal SC category. We axiomatize properties of subcategories of finitely presentable objects of SC categories (generalizing thus semilattices of compact elements of Scott domains). The categories arising are called FCC (finitely consistently cocomplete) categories. It is shown that there exists a universal FCC category, i.e., such that every FCC category may be FCC embedded into it. The result is an application of a general procedure introduced 30 years ago by V. Trnková.     

A semantic hierarchy for intuitionistic logic

Brouwer’s views on the foundations of mathematics have inspired the study of intuitionistic logic, including the study of the intuitionistic propositional calculus and its extensions. The theory of these systems has become an independent branch of logic with connections to lattice theory, topology, modal logic, and other areas. This paper aims to present a modern account of semantics for intuitionistic propositional systems. The guiding idea is that of a hierarchy of semantics, organized by increasing generality: from the least general Kripke semantics on through Beth semantics, topological semantics, Dragalin semantics, and finally to the most general algebraic semantics. While the Kripke, topological, and algebraic semantics have been extensively studied, the Beth and Dragalin semantics have received less attention. We bring Beth and Dragalin semantics to the fore, relating them to the concept of a nucleus from pointfree topology, which provides a unifying perspective on the semantic hierarchy.     

Qualia Qua Qualitons: Mental Qualities as Abstract Particulars

In this paper we advocate the thesis that qualia are tropes (or qualitons), and not (universal) properties. The main advantage of the thesis is that we can accept both the Wittgensteinian and Sellarsian assault on the given and the claim that only subjective and private states can do justice to the qualitative character of experience. We hint that if we take qualia to be tropes, we dissolve the problem of inverted qualia. We develop an account of sensory concept acquisition that takes the presence of qualia as an enabling condition for learning. We argue that qualia taken to be qualitons are part of our mechanism of sensory concept acquisition.     

Local equivalence relations

In this paper, we investigate the concept of local equivalence relation, a notion suggested by Grothendieck. A local equivalence relation on a topological space X is a global section of the sheaf of germs of equivalence relations on X. We investigate the extent to which a local equivalence relation can be described by a global one and analogously when can a global equivalence relation be recovered from its associated local one. We also look at the notion of a fiber map, which sheds further light on these concepts. A motivating example is that of a foliation on a manifold.     

Similarity of L-fuzzy Relations Based on L-topologies Induced by L-fuzzy Rough Approximation Operators

This paper proposes similarity of L-fuzzy relations based on L-topologies induced by L-fuzzy rough approximation operators. First, the notion L-fuzzy rough set is generalized and the relationship between generalized L-fuzzy rough sets and L-topologies on an arbitrary universe is investigated. It shows that Alexandrov L-topologies can be induced by L-fuzzy relations without any preconditions. Second, the concept of similarity of L-fuzzy relations is introduced and variations of an L-fuzzy relation are investigated. Third, algebraic structures on similarity of L-fuzzy relations are obtained. Finally, we prove that the subset of the transitive L-fuzzy relations similar to a fixed L-fuzzy relation is a complete distributive lattice.