A complete axiomatic characterization of first-order temporal logic of linear time (Q1102941): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(87)90129-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2074329619 / rank | |||
Normal rank | |||
Revision as of 19:05, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A complete axiomatic characterization of first-order temporal logic of linear time |
scientific article |
Statements
A complete axiomatic characterization of first-order temporal logic of linear time (English)
0 references
1987
0 references
This paper deals with the theory of first order temporal logic of linear and discrete time (FOTLL), with the ``atnext'' operator A instead of the ``until'' operator U. An infinitary, sound and complete proof system for FOTLL is given (it is known that no such finitary system could exist). The proof method is based on Q-filters (adopted from algorithmic logic). It is also proved that any syntactically consistent temporal theory has a model. An example of the use of an infinitary proof rule in proving correctness of a concurrent version of Quicksort is provided.
0 references
concurrent programs
0 references
first order temporal logic of linear and discrete time
0 references
correctness of a concurrent version of Quicksort
0 references
