Focusing Strategies in the Sequent Calculus of Synthetic Connectives
نویسنده
چکیده
It is well-known that focusing striates a sequent derivation into phases of like polarity where each phase can be seen as inferring a synthetic connective. We present a sequent calculus of synthetic connectives based on neutral proof patterns, which are a syntactic normal form for such connectives. Different focusing strategies arise from different polarisations and arrangements of synthetic inference rules, which are shown to be complete by synthetic rule permutations. A simple generic cut-elimination procedure for synthetic connectives respects both the ordinary focusing and the maximally multi-focusing strategies, answering the open question of cut-admissibility for maximally multi-focused proofs.
منابع مشابه
A neutral presentation of synthetic connectives as proof patterns
It is well-known that focusing striates a sequent derivation into phases of like polarity where each phase can be seen as inferring a synthetic connective. The calculus of synthetic connectives can be given a uniform presentation by means of neutral proof patterns, with dual polarised interpretations. Permutations of synthetic inferences can be explained by local conditions on proof patterns. P...
متن کاملTowards a Cut-free Sequent Calculus for Boolean BI
The logic of bunched implications (BI) of O’Hearn and Pym [5] is a substructural logic which freely combines additive connectives ⊃ , ∧, ∨ from propositional logic and multiplicative connectives −?, ? from linear logic. Because of its concise yet rich representation of states of resources, BI is regarded as a logic suitable for reasoning about resources. For example, by building a model for BI ...
متن کاملAn Adjunction-Theoretic Foundation for Proof Search in Intuitionistic First-Order Categorical Logic Programming
In this thesis we compose a proof-theoretic approach to logic programming with a category-theoretic approach to proof theory. This allows us to present the computation mechanisms of several systems of logic programming as proof search strategies within an intuitionistic first-order sequent calculus with logic variables and to analyze aspects of their behavior algebraically. Beginning from the b...
متن کاملFocused and Synthetic Nested Sequents
Focusing is a general technique for transforming a sequent proof system into one with a syntactic separation of non-deterministic choices without sacrificing completeness. This not only improves proof search, but also has the representational benefit of distilling sequent proofs into synthetic normal forms. We show how to apply the focusing technique to nested sequent calculi, a generalization ...
متن کاملCategorical proof theory of classical propositional calculus
We investigate semantics for classical proof based on the sequent calculus. We show that the propositional connectives are not quite well-behaved from a traditional categorical perspective, and give a more refined, but necessarily complex, analysis of how connectives may be characterised abstractly. Finally we explain the consequences of insisting on more familiar categorical behaviour.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008