Preservative Translations between Logical Systems
Abstract
This paper investigates a subclass of translations between logical systems, called the preservative translations, which preserve the satisfiability and the unsatisfiability of formulas. The definition of preservative translation is given and connections between the preservative translation and other definitions of translations in the literature are discussed. Some properties of logical systems, such as the compactness and the decidability, which are characterized by the existence of preservative translations between logical systems are also studied.
Domains
Digital Libraries [cs.DL]
Fichier principal
Preservative translations between logical systems.pdf (151.04 Ko)
Télécharger le fichier
| Origin | Files produced by the author(s) |
|---|
Loading...
