Sequential Calculus for a First Order Infinitary Temporal Logic (Q3751561)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3987255
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sequential Calculus for a First Order Infinitary Temporal Logic |
scientific article; zbMATH DE number 3987255 |
Statements
Sequential Calculus for a First Order Infinitary Temporal Logic (English)
0 references
1987
0 references
concurrent programs
0 references
Kröger's logic
0 references
cut elimination
0 references
completeness
0 references
0.8407055735588074
0 references
0.8374664783477783
0 references
0.8247738480567932
0 references
0.8175118565559387
0 references
Temporal logic provides a logical framework to analyse and prove important properties of programs. However, its mathematical structure has not been developed enough. In this paper we shall give several sequential calculi associated to Kröger's logic which are infinitary first order temporal logics. We have already dealt with a Gentzen style sequential calculus \(LT_{\omega}\) for which we gave a sketch of a proof of the Hauptsatz (cut elimination theorem) and some applications of it, e.g., interpolation theorem and definability theorem. In {\S} 1 we define the language and other syntactical properties for \(LT_{\omega}\) and prove the completeness and cut elimination theorems for it. In {\S} 2 we introduce several systems associated to Kröger's logic with or without Barcan formula and we discuss relations between these systems. Related results have been obtained in earlier papers by the author [Inf. Process. Lett. 11, 204-210 (1980; Zbl 0469.68040); Z. Math. Logik Grundlagen Math. 28, 173-180 (1982; Zbl 0511.03006); Lect. Notes Comput. Sci. 148, 156-165 (1983; Zbl 0523.68009)].
0 references