Incompleteness of a first-order gödel logic and some temporal logics of programs (original) (raw)

Free PDF

Completeness of a first-order temporal logic with time-gaps

1996

The first-order temporal logics with�� and�� of time structures isomorphic to �� (discrete linear time) and trees of ��-segments (linear time with branching gaps) and some of its fragments are compared: the first is not recursively axiomatizable. For the second, a cut-free complete sequent calculus is given, and from this, a resolution system is derived by the method of Maslov.

Free PDF

Decidable fragment of first-order temporal logics

Annals of Pure and Applied Logic, 2000

In this paper, we introduce a new fragment of the first-order temporal language, called the monodic fragment, in which all formulas beginning with a temporal operator (Since or Until) have at most one free variable. We show that the satisfiability problem for monodic formulas in various linear time structures can be reduced to the satisfiability problem for a certain fragment

Free PDF

Minimal Systems of Temporal Logic

Axioms

The article discusses minimal temporal logic systems built on the basis of classical logic as well as intuitionistic logic. The constructions of these systems are discussed as well as their basic properties. The K t system was discussed as the minimal temporal logic system built based on classical logic, while the IK t system and its modification were discussed as the minimal temporal logic system built based on intuitionistic logic.

Free PDF

Incompleteness of a first-order gödel logic and some temporal logics of programs (original) (raw)

Free related PDFsRelated papers