Сибирский федеральный университет

Тип публикации: доклад, тезисы доклада, статья из сборника материалов конференций

Конференция: Workshop on Computer Science Logic, at the Annual Conference of the European-Association-for-Computer-Science-Logic (CSL 94); KAZIMIERZ, POLAND; KAZIMIERZ, POLAND

Год издания: 1995

Ключевые слова: Formal logic, Reconfigurable hardware, Semantics, Finite model property, Inference rules, Modal logic, Computer circuits

Аннотация: The aim of the current paper is to provide a complete semantics description for modal logics with finite model property which preserve all admissible in S4 inference rules, with the intention of meeting some of the needs of computer science. It is shown a modal logic lambda with fmp above S4 preserves all admissible for S4 inference rules iff lambda has so-called co-cover property. In turned out there are continuously many logics of this kind. Using mentioned above semantics criterion we give some precise description of all tabular logics preserving admissible for S4 rules.

Журнал: COMPUTER SCIENCE LOGIC

Выпуск журнала: Vol. 933

Номера страниц: 512-526

ISSN журнала: 03029743

Место издания: BERLIN

Издатель: SPRINGER-VERLAG BERLIN

• Rybakov V.V. (Mathematics Department, Krasnoyarsk State University, av. Svobodnyi 79, Krasnoyarsk, Russian Federation)

• Web of Science Core Collection
• Scopus
• Ядро РИНЦ (eLIBRARY.RU)