Knowledge on Treelike Spaces

This paper presents a bimodal logic for reasoning about knowledge during knowledge acquisitions. One of the modalities represents (effort during) non-deterministic time and the other represents knowledge. The semantics of this logic are tree-like spaces which are a generalization of semantics used for modeling branching time and historical necessity. A finite system of axiom schemes is shown to be canonically complete for the formentioned spaces. A characterization of the satisfaction relation implies the small model property and decidability for this system.     

On the Algebraizability of Annotated Logics

Annotated logics were introduced by V.S. Subrahmanian as logical foundations for computer programming. One of the difficulties of these systems from the logical point of view is that they are not structural, i.e., their consequence relations are not closed under substitutions. In this paper we give systems of annotated logics that are equivalent to those of Subrahmanian in the sense that everything provable in one type of system has a translation that is provable in the other. Moreover these new systems are structural. We prove that these systems are weakly congruential, namely, they have an infinite system of congruence 1-formulas. Moreover, we prove that an annotated logic is algebraizable (i.e., it has a finite system of congruence formulas,) if and only if the lattice of annotation constants is finite.     

Characterizing Equivalential and Algebraizable Logics by the Leibniz Operator

In [14] we used the term finitely algebraizable for algebraizable logics in the sense of Blok and Pigozzi [2] and we introduced possibly infinitely algebraizable, for short, p.i.-algebraizable logics. In the present paper, we characterize the hierarchy of protoalgebraic, equivalential, finitely equivalential, p.i.-algebraizable, and finitely algebraizable logics by properties of the Leibniz operator. A Beth-style definability result yields that finitely equivalential and finitely algebraizable as well as equivalential and p.i.-algebraizable logics can be distinguished by injectivity of the Leibniz operator. Thus, from a characterization of equivalential logics we obtain a new short proof of the main result of [2] that a finitary logic is finitely algebraizable iff the Leibniz operator is injective and preserves unions of directed systems. It is generalized to nonfinitary logics. We characterize equivalential and, by adding injectivity, p.i.-algebraizable logics.     

The elimination of de re formulas

It is shown that de re formulas are eliminable in the modal logic S5 extended with the axiom scheme x x.     

康德哲学与广松涉"交互主体的共同主观性"理论

广松涉认为,对近代认识论基础的问题式及其构成机制和局限进行反思,首先需要将着眼点放在康德哲学的问题式及其构成机制上。康德哲学的总的问题式就是在以先验逻辑学为基础的逻辑学、认识论和本体论“三位一体”的哲学构架中,探讨人的认识以及纯粹理性的先天综合判断及其能力何以可能。这一问题式潜含着一个意义非常重大的认识论问题——即“主体际共同主观性”问题．需要我们认真地加以研究。     

Products of modal logics and tensor products of modal algebras

One of natural combinations of Kripke complete modal logics is the product, an operation that has been extensively investigated over the last 15 years. In this paper we consider its analogue for arbitrary modal logics: to this end, we use product-like constructions on general frames and modal algebras. This operation was first introduced by Y. Hasimoto in 2000; however, his paper remained unnoticed until recently. In the present paper we quote some important Hasimoto's results, and reconstruct the product operation in an algebraic setting: the Boolean part of the resulting modal algebra is exactly the tensor product of original algebras (regarded as Boolean rings). Also, we propose a filtration technique for Kripke models based on tensor products and obtain some decidability results.     

Global problems,globalization, and predictability

The term globalization is questioned in its validity and applicability to structures other than verbal. Globalization is a historical term which changes its meaning with time and culture. It is not only that its content changes but the validity of a globalization concept changes with the historical perspective. Morever, solution of global problems depends heavily on the correct analysis of the problem. Without such an analysis there is no possibility to find even an approximate solution. Hence, predictability is impossible. There is no trend which is sufficiently long to make any reliable prediction for global problems other than the most simple ones.     

A Model of Tolerance

According to the naive theory of vagueness, the vagueness of an expression consists in the existence of both positive and negative cases of application of the expression and in the non-existence of a sharp cut-off point between them. The sorites paradox shows the naive theory to be inconsistent in most logics proposed for a vague language. The paper explores the prospects of saving the naive theory by revising the logic in a novel way, placing principled restrictions on the transitivity of the consequence relation. A lattice-theoretical framework for a whole family of (zeroth-order) “tolerant logics” is proposed and developed. Particular care is devoted to the relation between the salient features of the formal apparatus and the informal logical and semantic notions they are supposed to model. A suitable non-transitive counterpart to classical logic is defined. Some of its properties are studied, and it is eventually shown how an appropriate regimentation of the naive theory of vagueness is consistent in such a logic.