Abstract
This paper discusses modal labelled deduction from the perspective offered by hybrid languages. In essence, hybrid languages are modal languages in which the apparatus of labelled deduction is fully integrated into the object language. Hybrid languages enable us to define proof systems which in an obvious sense internalize labelled deduction, and when this is done, we shall find that labelling discipline emerges as logic. I show that this logical (or declarative) perspective on labelling discipline can be “lifted” to a full first-order discipline over labels, and conclude with some general remarks on hybridizationKeywordsModal LogicObject LanguageProof TheorySequent CalculusModal LanguageThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
