Abstract | ||
---|---|---|
We compare fork arrow logic, an extension of arrow logic, and its natural first-order counterpart (the correspondence language)
and show that both have the same expressive power. Arrow logic is a modal logic for reasoning about arrow structures, its
expressive power is limited to a bounded fragment of first-order logic. Fork arrow logic is obtained by adding to arrow logic
the fork modality (related to parallelism and synchronization). As a result, fork arrow logic attains the expressive power
of its first-order correspondence language, so both can express the same input–output behavior of processes. |
Year | DOI | Venue |
---|---|---|
2007 | 10.1007/s10992-006-9043-x | J. Philosophical Logic |
Keywords | Field | DocType |
standard translation,modal logic,relation algebra,expressive power,fork algebra,arrow logic,input output,first order logic,philosophy,first order | Computational logic,Algorithm,Multimodal logic,Philosophy of logic,Many-valued logic,Predicate logic,Higher-order logic,Intermediate logic,Mathematics,Dynamic logic (modal logic) | Journal |
Volume | Issue | ISSN |
36 | 5 | 1573-0433 |
Citations | PageRank | References |
1 | 0.37 | 3 |
Authors | ||
5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Paulo A. S. Veloso | 1 | 226 | 183.55 |
Renata P. de Freitas | 2 | 38 | 5.53 |
Petrucio Viana | 3 | 35 | 4.85 |
Mario R. F. Benevides | 4 | 143 | 23.75 |
Sheila R. M. Veloso | 5 | 74 | 14.47 |