TY - JOUR
T1 - Combining Temporal Logic Systems
AU - Finger, Marcelo
AU - Gabbay, Dov
PY - 1996
Y1 - 1996
N2 - This paper investigates modular combinations of temporal logic systems. Four combination methods are described and studied with respect to the transfer of logical properties from the component one-dimensional temporal logics to the resulting combined two-dimensional temporal logic. Three basic logical properties are analyzed, namely soundness, completeness, and decidability. Each combination method comprises three sub methods that combine the languages, the inference systems, and the semantics of two one-dimensional temporal logic systems, generating families of two-dimensional temporal languages with varying expressivity and varying degrees of transfer of logical properties. The temporalization method and the independent combination method are shown to transfer all three basic logical properties. The method of full join of logic systems generates a considerably more expressive language but fails to transfer completeness and decidability in several cases. So a weaker method of restricted join is proposed and shown to transfer all three basic logical properties.
AB - This paper investigates modular combinations of temporal logic systems. Four combination methods are described and studied with respect to the transfer of logical properties from the component one-dimensional temporal logics to the resulting combined two-dimensional temporal logic. Three basic logical properties are analyzed, namely soundness, completeness, and decidability. Each combination method comprises three sub methods that combine the languages, the inference systems, and the semantics of two one-dimensional temporal logic systems, generating families of two-dimensional temporal languages with varying expressivity and varying degrees of transfer of logical properties. The temporalization method and the independent combination method are shown to transfer all three basic logical properties. The method of full join of logic systems generates a considerably more expressive language but fails to transfer completeness and decidability in several cases. So a weaker method of restricted join is proposed and shown to transfer all three basic logical properties.
UR - http://www.scopus.com/inward/record.url?scp=84958987237&partnerID=8YFLogxK
U2 - 10.1305/ndjfl/1040046087
DO - 10.1305/ndjfl/1040046087
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:84958987237
SN - 0029-4527
VL - 37
SP - 204
EP - 232
JO - Notre Dame Journal of Formal Logic
JF - Notre Dame Journal of Formal Logic
IS - 2
ER -