Balbiani, Philippe
and Tinchev, Tinko
Undecidable problems for modal definability.
(2017)
Journal of Logic and Computation, 27 (3). 901-920. ISSN 0955-792X
|
(Document in English)
PDF (Author's version) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 337kB |
Official URL: https://doi.org/10.1093/logcom/exv094
Abstract
The core of our article is the computability of the problem of deciding the modal definability of first-order sentences with respect to classes of frames. It gives a new proof of Chagrova's Theorem telling that, with respect to the class of all frames, the problem of deciding the modal definability of first-order sentences is undecidable. It also gives the proofs of new variants of Chagrova's Theorem
| Item Type: | Article |
|---|---|
| Additional Information: | Thanks to Oxford Academic. The original PDF can be found at Journal of Logic and Computation (ISSN 0955-792X) website: https://academic.oup.com/logcom/article/27/3/901/2917863 |
| HAL Id: | hal-01740019 |
| Audience (journal): | International peer-reviewed journal |
| Uncontrolled Keywords: | |
| Institution: | French research institutions > Centre National de la Recherche Scientifique - CNRS (FRANCE) Université de Toulouse > Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE) Other partners > Sofia University St. Kliment Ohridski (BULGARIA) Université de Toulouse > Université Toulouse III - Paul Sabatier - UT3 (FRANCE) Université de Toulouse > Université Toulouse - Jean Jaurès - UT2J (FRANCE) Université de Toulouse > Université Toulouse 1 Capitole - UT1 (FRANCE) |
| Laboratory name: | |
| Statistics: | download |
| Deposited On: | 12 Mar 2018 14:14 |
Repository Staff Only: item control page
