A Complete Axiomatic Characterization of First-Order Temporal Logic of Linear Time
暂无分享,去创建一个
[1] Fred Kröger,et al. On Temporal Program Verification Rules , 1985, RAIRO Theor. Informatics Appl..
[2] Bogdan S. Chlebus. Completeness Proofs for Some Logics of Programs , 1982, Math. Log. Q..
[3] Andrzej Szalas. Algorithmic logic with recursive functions , 1981, Fundam. Informaticae.
[4] Fred Kröger. A Generalized Nexttime Operator in Temporal Logic , 1984, J. Comput. Syst. Sci..
[5] Andrzej Salwicki,et al. Algorithmic Logic , 1987 .
[6] A. Szałas. Concerning the Semantic Consequence Relation in First-Order Temporal Logic , 1986, Theoretical Computer Science.
[7] Fred Kröger,et al. A Uniform Logical Basis for the Description, Specification and Verification of Programs , 1977, Formal Description of Programming Concepts.
[8] Andrzej Szalas,et al. Incompleteness of First-Order Temporal Logic with Until , 1988, Theor. Comput. Sci..
[9] Zohar Manna,et al. Verification of concurrent programs, Part I: The temporal framework , 1981 .
[10] Andrzej Szalas,et al. Arithmetical Axiomatization of First-Order Temporal Logic , 1987, Inf. Process. Lett..
[11] Grazyna Mirkowska,et al. Algorithmic logic with nondeterministic programs , 1980, Fundam. Informaticae.
[12] R. Goodstein. Boolean algebra , 1963 .
[13] Fred Krögr. Temporal Logic Of Programs , 1987 .
[14] Andrzej Szałas. Towards the Temporal Approach to Abstract Data Types , 1988 .
[15] Zohar Manna,et al. Verification of Concurrent Programs: Temporal Proof Principles , 1981, Logic of Programs.
[16] R. Sikorski,et al. The mathematics of metamathematics , 1963 .