We consider propositional discrete linear time temporal logic with future and past operators of time. For each formula ϕ of this logic, we present Gentzen-type sequent calculus Gr(ϕ) with a restricted cut rule. We sketch a proof of the soundness and the completeness of the sequent calculi presented. The completeness is proved via construction of a canonical model.Pateikiami Gentzeno tipo sekvenciniai skaičiavimai teiginių tiesinio laiko logikai su ateities ir praeities laiko operatoriais. Šiuose skaičiavimuose pjūvio formulės priklauso baigtinei formulių aibei. Įrodomas šių skaičiavimų korektiškumas ir pilnumas
In this work, the notion of provability for first order linear temporal logic over finite time struc...
AbstractThe first-order temporal logics with □ and ○ of time structures isomorphic to ω (discrete li...
The aim of the present paper was to go deeper into the logics of time. By the formula of the classic...
We consider combinations of nine propositional multi-modal logics with propositional discrete linear...
Various types of calculi (Hilbert, Gentzen sequent, resolution calculi, tableaux) for propositional ...
A labeled sequent calculus LSC for propositional linear discrete time logic PLTL is introduced. Its ...
A labelled sequent calculus is proposed for Priorean linear time logic, the rules of which reflect a...
In this paper, some loop-check free saturation-like decision procedure is proposed for propositional...
A sequent calculus with Kripke semantics internalization for a propositional temporal logic with tim...
AbstractIt is known that linear-time temporal logic (LTL), which is an extension of classical logic,...
AbstractAs shown in (Szalas, 1986, 1986, 1987) there is no finitistic and complete axiomatization of...
We investigate logical consequence in temporal logics in terms of logical consecutions. i.e., infere...
Two sequent calculi for temporal logic of knowledge are presented: one containing invariant-like rul...
In this paper, we present sequent calculus for linear temporal logic. This sequent calculus uses eff...
We study logical inference in terms of admissible consecutions (admissible inference rules) for the...
In this work, the notion of provability for first order linear temporal logic over finite time struc...
AbstractThe first-order temporal logics with □ and ○ of time structures isomorphic to ω (discrete li...
The aim of the present paper was to go deeper into the logics of time. By the formula of the classic...
We consider combinations of nine propositional multi-modal logics with propositional discrete linear...
Various types of calculi (Hilbert, Gentzen sequent, resolution calculi, tableaux) for propositional ...
A labeled sequent calculus LSC for propositional linear discrete time logic PLTL is introduced. Its ...
A labelled sequent calculus is proposed for Priorean linear time logic, the rules of which reflect a...
In this paper, some loop-check free saturation-like decision procedure is proposed for propositional...
A sequent calculus with Kripke semantics internalization for a propositional temporal logic with tim...
AbstractIt is known that linear-time temporal logic (LTL), which is an extension of classical logic,...
AbstractAs shown in (Szalas, 1986, 1986, 1987) there is no finitistic and complete axiomatization of...
We investigate logical consequence in temporal logics in terms of logical consecutions. i.e., infere...
Two sequent calculi for temporal logic of knowledge are presented: one containing invariant-like rul...
In this paper, we present sequent calculus for linear temporal logic. This sequent calculus uses eff...
We study logical inference in terms of admissible consecutions (admissible inference rules) for the...
In this work, the notion of provability for first order linear temporal logic over finite time struc...
AbstractThe first-order temporal logics with □ and ○ of time structures isomorphic to ω (discrete li...
The aim of the present paper was to go deeper into the logics of time. By the formula of the classic...