Functional constructions between reaction systems and propositional logic




Arto Salomaa

PublisherWORLD SCIENTIFIC PUBL CO PTE LTD

2013

International Journal of Foundations of Computer Science

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE

INT J FOUND COMPUT S

1

24

1

147

159

13

0129-0541

DOIhttps://doi.org/10.1142/S0129054113500044



We investigate formal properties, mainly issues connected with propositional logic, of reaction systems introduced by Ehrenfeucht and Rozenberg. We are concerned only with the most simple variant of the systems. Basic properties of propositional formulas are expressed in terms of reaction systems. This leads to NP-completeness (resp. co-NP-completeness) of many problems concerning reaction systems. Among such problems are: (i) deciding whether the function defined by the system is total, (ii) determining the inverse of the function, (iii) deciding whether state sequences always end with a loop. Propositional formulas with monotonic truth-functions yield a particularly simple representation in terms of reaction systems.




Last updated on 2024-26-11 at 19:42