QR Code

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Carlos Caleiro, Sérgio Marcelino
Format: Artigo
Language:Inglês
Published: MDPI AG 2022-09-01
Series:Mathematics
Subjects:
Online Access:https://www.mdpi.com/2227-7390/10/19/3481
Tags: Add Tag
No Tags, Be the first to tag this record!