This data structure matches exactly the history in a backwards proof search in an ordinary sequent calculus, a fact we will heavily use in what follows.
Nov 22, 2015 · We propose a notion of focusing for nested sequent calculi for modal logics which brings down the complexity of proof search to that of the corresponding ...
Nov 21, 2024 · We propose a notion of focusing for nested sequent calculi for modal logics which brings down the complexity of proof search to that of the ...
Proving com- pleteness for such systems is most commonly done by what might be called a systematic backward proof search. One starts with the desired goal and ...
Nov 22, 2015 · We propose a notion of focusing for nested sequent calculi for modal logics which brings down the complexity of proof search to that of the ...
In this paper, we introduce nested sequent calculi for propositional standpoint logics---proof ... proof-search in a nested sequent calculus on the colored input.
People also search for
This shows that nested sequent calculi are not only a proof theoretical tool, but they can be the basis of efficient theorem proving for conditional logics. 50.
We propose a new sequent calculus for bi-intuitionistic logic which sits somewhere between display calculi and traditional sequent calculi by using nested ...
Proof Search in Nested Sequent Calculi · List of references · Publications that cite this publication.
Such algorithms implement exhaustive and terminating root-first proof search for the formula in the calculus. If a proof is found the formula is valid.