Worms,gaps, and hydras

We define a direct translation from finite rooted trees to finite natural functions which shows that the Worm Principle introduced by Lev Beklemishev is equivalent to a very slight variant of the well‐known Kirby‐Paris' Hydra Game. We further show that the elements in a reduction sequence of the Worm Principle determine a bad sequence in the well‐quasi‐ordering of finite sequences of natural numbers with respect to Friedman's gapembeddability. A characterization of gap‐embeddability in terms of provability logic due to Lev Beklemishev is also presented. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

最佳通用逻辑门ULG.2 的应用研究

本文在作者以前研究的基础上,进一步研究最佳通用逻辑门ULG.2的应用,提出了用ULG.2组成的一些脉冲电路。     

Strategies and simulations in a semantic framework

By means of several examples of structural operational semantics for a variety of languages, we justify the importance and interest of using the notions of strategies and simulations in the semantic framework provided by rewriting logic and implemented in the Maude metalanguage. On the one hand, we describe a basic strategy language for Maude and show its application to CCS, the ambient calculus, and the parallel functional language Eden. On the other hand, we show how the concept of stuttering simulation can be used inside Maude to show that a stack machine correctly implements the operational semantics of a simple functional language.     

Modal Aggregation and the Theory of Paraconsistent Filters

This paper articulates the structure of a two species of weakly aggregative necessity in a common idiom, neighbourhood semantics, using the notion of a k-filter of propositions. A k-filter on a non-empty set I is a collection of subsets of I which (i) contains I, (ii) is closed under supersets on I, and (iii) contains ∪{X_i ≤ X_j : 0 ≤ i < j ≤ k} whenever it contains the subsets X₀,…, X_k. The mathematical content of the proof that weakly aggregative modal logic is complete relative to k-ary frame theory, the standard semantic idiom for weakly aggregative modal logic (see [1]) is presented in language-independent terms as a representation theorem for k-filters: every non-trivial k-filter is included in the union of ≤ k non-trivial filters. The elementary theory of k-filters is developed and then applied in the form of an ultrafilter extension result for k-ary frame theory. Mathematics Subject Classification: 03B45.     

A learning process for fuzzy control rules using genetic algorithms

The purpose of this paper is to present a genetic learning process for learning fuzzy control rules from examples. It is developed in three stages: the first one is a fuzzy rule genetic generating process based on a rule learning iterative approach, the second one combines two kinds of rules, experts rules if there are and the previously generated fuzzy control rules, removing the redundant fuzzy rules, and the thrid one is a tuning process for adjusting the membership functions of the fuzzy rules. The three components of the learning process are developed formulating suitable genetic algorithms.     

Application of fuzzy control to a road tunnel ventilation system

This paper deals with the serious problems of ventilation system in a large road tunnel. Higher visibility and lower concentration of carbon monoxide are the key issues concerning the ventilation system. Prior to designing the fuzzy control model, a configuration layout of the ventilation system including sensing, control and traffic prediction as well is conceptually constructed. Based on the layout that offers assignments of sensors and control elements, a fuzzy logic control model is developed. Membership functions of sensor errors and control increments are physically submitted in order to set up the fuzzy logic rules. Timing and spacing filtering in terms of weighting approaches is employed in the fuzzy logic rules. A dynamic equation describing the concentration of air pollution is also given so as to cooperate with the fuzzy logic rules and to play roles in the computer simulation. The result of computer simulation involving five cases indicates that a multi-level scheme is able to solve the engineering problems.     

A note on Grzegorczyk's logic

Grzegorczyk's modal logic (Grz) corresponds to the class of upwards well‐founded partially ordered Kripke frames, however all known proofs of this fact utilize some form of the Axiom of Choice; G. Boolos asked in [1], whether it is provable in plain ZF. We answer his question negatively: Grz corresponds (in ZF) to a class of frames, which does not provably coincide with upwards well‐founded posets in ZF alone. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A secondary semantics for Second Order Intuitionistic Propositional Logic

In this paper we propose a Kripke‐style semantics for second order intuitionistic propositional logic and we provide a semantical proof of the disjunction and the explicit definability property. Moreover, we provide a tableau calculus which is sound and complete with respect to such a semantics. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Perfect MV-algebras and their Logic

In this paper, after recounting the basic properties of perfect MV-algebras, we explore the role of such algebras in localization issues. Further, we analyze some logics that are based on Łukasiewicz connectives and are complete with respect to linearly ordered perfect MV-algebras.      

Pr值逻辑函数相关免疫的等价判别条件

本文首先基于环Zpr中的元的padic分解并结合概率论的思想,给出了pr值随机变量的分解性质及pr值随机变量独立性的等价描述,然后在对pr值逻辑函数及其变元都进行padic分解的基础上,直接通过p值逻辑函数的Chrestenson谱给出了padic分解意义下pr值逻辑函数k阶相关免疫的线性组合引理和谱判别定理.