%0 Conference Proceedings
%T Preservative Translations between Logical Systems
%+ Key Laboratory of Intelligent Information Processing, Institute of Computing Technology
%+ Graduate University of Chinese [Beijing] (UCAS)
%+ School of Computer Science and Information Engineering
%A Shen, Yuming
%A Ma, Yue
%A Cao, Cungen
%A Sui, Yuefei
%A Wang, Ju
%< avec comité de lecture
%( IFIP Advances in Information and Communication Technology
%B 6th IFIP TC 12 International Conference on Intelligent Information Processing (IIP)
%C Manchester, United Kingdom
%Y Zhongzhi Shi; Sunil Vadera; Agnar Aamodt; David Leake
%I Springer
%3 Intelligent Information Processing V
%V AICT-340
%P 55-63
%8 2010-10-13
%D 2010
%R 10.1007/978-3-642-16327-2_10
%K Translation
%K Faithfulness
%K Fullness
%K Preservative translation
%Z Computer Science [cs]/Digital Libraries [cs.DL]Conference papers
%X 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.
%G English
%2 https://inria.hal.science/hal-01060356/document
%2 https://inria.hal.science/hal-01060356/file/Preservative%20translations%20between%20logical%20systems.pdf
%L hal-01060356
%U https://inria.hal.science/hal-01060356
%~ IFIP
%~ IFIP-AICT
%~ IFIP-AICT-340
%~ IFIP-TC
%~ IFIP-TC12
%~ CAMPUS-AAR
%~ AAI
%~ IFIP-IIP