Merging fragments of classical logic

2017/06/27 by Caleiro, Carlos, Marcelino, Sérgio, Marcos, João
#03B05 (Primary) #03B20 #03C05 (Secondary) #F.4.1 #FOS: Computer and information sciences #FOS: Mathematics #I.2.3 #Logic (math.LO) #Logic in Computer Science (cs.LO)

paper · doi:10.48550/arxiv.1706.08689

Abstract

We investigate the possibility of extending the non-functionally complete logic of a collection of Boolean connectives by the addition of further Boolean connectives that make the resulting set of connectives functionally complete. More precisely, we will be interested in checking whether an axiomatization for Classical Propositional Logic may be produced by merging Hilbert-style calculi for two disjoint incomplete fragments of it. We will prove that the answer to that problem is a negative one, unless one of the components includes only top-like connectives.

Related

• Combining fragments of classical logic: When are interaction principles\n needed?
• An unexpected Boolean connective
• The interdefinability of expansions of Belnap-Dunn logic
• Axiomatization of Boolean Connexive Logics with syncategorematic negation and modalities
• Modelling of logical systems by means of their fragments