Decidability Preservation and Complexity Bounds for Combined Logics
Transfer theorems for combined logics provide essential tools and insight for reasoning about complex logical systems. In this paper, we present the first sufficient criterion <i>(contextual extensibility</i>) for decidability to be preserved through combination of propositional logics, and we study...
שמור ב:
| Principais autores: | , |
|---|---|
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
MDPI AG
2022-09-01
|
| סדרה: | Mathematics |
| נושאים: | |
| גישה מקוונת: | https://www.mdpi.com/2227-7390/10/19/3481 |
| תגים: |
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|