摘要:

A propositional temporal logic is introduced whose operators quantify over intervals of a reference time line. The intervals are specified symbolically, for example ‘next week's weekend’. The specification language for the intervals takes into account all the features of real calendar systems. A simple statement which can be expressed in this language is for example: ‘yesterday I worked for eight hours with one hour lunch break at noon’. Calendar Logic can be translated into propositional logic. Satisfiability is therefore decidable. Since the translation is exponential, a tableau decision procedure for checking decidability is presented as an alternative.

ISSN:1166-3081    

DOI:10.1080/11663081.1998.10510948

出版商:Taylor & Francis Group    

年代:1998

数据来源: Taylor

摘要:

We consider the question of the complete axiomatization of a relative modal logic with composition and intersection.

ISSN:1166-3081    

DOI:10.1080/11663081.1998.10510949

出版商:Taylor & Francis Group    

年代:1998

数据来源: Taylor

摘要:

The concept of paraconsistent logical consequence is usually negatively defined as a validity semantics in which not every sentences is deducible or in which inferential explosion does not occur. Paraconsistency has been negatively characterized in this way because paraconsistent logics have been designed specifically to avoid the trivialization of deductive inference entailed by the classical paradoxes of material implication for applications in a system that tolerates syntactical contradictions. The effect of the negative characterization of paraconsistency has been to encourage an unsystematic development of distinct versions of paraconsistent logic. It has also contributed to a restricted overview of the full range of paraconsistent formalisms. After reviewing a standard negative characterization of paraconsistency and commenting on its limitations, I propose a positive characterization that makes possible a constructivistic description of the complete spectrum of distinct families of paraconsistent logics, and the description of a new type of maximally relevant paraconsistency, which I argue compares favorably with previously identified categories of paraconsistent logics.

ISSN:1166-3081    

DOI:10.1080/11663081.1998.10510950

出版商:Taylor & Francis Group    

年代:1998

数据来源: Taylor

摘要:

We show that there is a polynomial over the rational number field corresponding to each propositional formula in a given many-valued logic. To decide whether a propositional formula can be deduced from a finite set of such formulas (deduction problem), we only need to decide whether a polynomial vanishes on an algebraic variety. By using Wu's method, an algorithm for this problem is presented.

ISSN:1166-3081    

DOI:10.1080/11663081.1998.10510951

出版商:Taylor & Francis Group    

年代:1998

数据来源: Taylor

ISSN:1166-3081    

DOI:10.1080/11663081.1998.10510952

出版商:Taylor & Francis Group    

年代:1998

数据来源: Taylor

ISSN:1166-3081    

DOI:10.1080/11663081.1998.10510953

出版商:Taylor & Francis Group    

年代:1998

数据来源: Taylor

ISSN:1166-3081    

DOI:10.1080/11663081.1998.10510947

出版商:Taylor & Francis Group    

年代:1998

数据来源: Taylor