摘要:

A complete axiomatic system CTLrpis introduced for a temporal logic for finitely branching ω+-trees in a language extended with so called reference pointers. Syntactic and semantic interpretations are constructed for the branching time computation tree logic CTL* into CTLrp. In particular, that yields a complete axiomatization for the translations of all valid CTL*-formulae. Thus, the temporal logic with reference pointers is brought forward as a simpler (with no path quantifiers), but in a way more expressive medium for reasoning about branching time.

ISSN:1166-3081    

DOI:10.1080/11663081.2000.10510998

出版商:Taylor & Francis Group    

年代:2000

数据来源: Taylor

摘要:

Most theorem provers for Classical Logic transform the input formula into a particular normal form. This tranformation is done before the execution of the algorithm (Resolution and Dissolution) or it is integrated into the deductive algorithm (Tableaux).

ISSN:1166-3081    

DOI:10.1080/11663081.2000.10510999

出版商:Taylor & Francis Group    

年代:2000

数据来源: Taylor

摘要:

Two objects o1, o2of an information system are said to be complementary with respect to attribute a if α(o1) = -α(o2), where α(o) is the set of values of attribute a assigned to o. They are said to be complementary with respect to a set of attributes A if they are complementary with respect to each attribute α ε A. A multi-modal logical language for reasoning about complementarity relations is presented, with modalities [A] and ⟨A⟩ parameterised by subsets of a given setATTRof attributes. Two complete deduction system for the language are presented: a Rasiowa-Sikorski style system using signed formulae, and an equivalent sequent calculus system in Gentzen style complete for theories.

ISSN:1166-3081    

DOI:10.1080/11663081.2000.10511000

出版商:Taylor & Francis Group    

年代:2000

数据来源: Taylor

摘要:

As is well-known, a classical representation theorem of the theory of cylindric algebras is: Aε IGwsaif and only ifA ε SNrαCAα+ε.The part “only if” is trivial. Regarding to the other part“A ε SNrαCAα+εthen Aε IGwsα“the following question arises: is it possible to replace the class CA in the hypothesis Aε SNrαCAα+εby a larger class so that the theorem still holds. Such a larger class Kαβis defined. The class Kαβis the best possible, in a sense to be made precise. Representability of set algebras is investigated, too.

ISSN:1166-3081    

DOI:10.1080/11663081.2000.10511001

出版商:Taylor & Francis Group    

年代:2000

数据来源: Taylor

摘要:

The present paper offers a new approach to non-monotonic logics and their reconstruction in terms of inconsistency-adaptive logics. By applying a special technique, universally quantified formulas are assigned instances that, given the paraconsistent framework, do not cause triviality even if they conflict with knowledge deriving from other sources. From the special instances, the usual instances may be derived conditionally, viz. provided they are not contradicted by statements derived with a higher preference ranking.

ISSN:1166-3081    

DOI:10.1080/11663081.2000.10511002

出版商:Taylor & Francis Group    

年代:2000

数据来源: Taylor

摘要:

We consider in this work the problem of iterated belief revision. We propose a family of belief revision operators called revision with memory operators and we give a logical (both syntactical and semantical) characterization of these operators. They obey what we call the principle of strong primacy of update: when one revises his beliefs by a new evidence, then all possible worlds that satisfy this new evidence become more reliable than those that do not. We show that those operators have a satisfying behaviour concerning the iteration of the revision process. Then we provide four particular operators of this family.

ISSN:1166-3081    

DOI:10.1080/11663081.2000.10511003

出版商:Taylor & Francis Group    

年代:2000

数据来源: Taylor

摘要:

We1study unification of formulas in modal logics and consider logics which are equivalent w.r.t. unification of formulas. A criteria is given for equivalence w.r.t. unification via existence or persistent formulas. A complete syntactic description of all formulas which are non-unifiable in wide classes of modal logics is given. Passive inference rules are considered, it is shown that in any modal logic over D4 there is a finite basis for passive rules.

ISSN:1166-3081    

DOI:10.1080/11663081.2000.10511004

出版商:Taylor & Francis Group    

年代:2000

数据来源: Taylor

ISSN:1166-3081    

DOI:10.1080/11663081.2000.10511005

出版商:Taylor & Francis Group    

年代:2000

数据来源: Taylor

ISSN:1166-3081    

DOI:10.1080/11663081.2000.10510997

出版商:Taylor & Francis Group    

年代:2000

数据来源: Taylor