On the Correspondence between Display Postulates and Deep Inference in Nested Sequent Calculi for Tense Logics
We consider two styles of proof calculi for a family of tense logics, presented in a formalism based on nested sequents. A nested sequent can be seen as a tree of traditional single-sided sequents. Our first style of calculi is what we call "shallow calculi", where inference rules are only applied a...
Sábháilte in:
| Príomhchruthaitheoirí: | , , |
|---|---|
| Formáid: | Artigo |
| Teanga: | Inglês |
| Foilsithe / Cruthaithe: |
Logical Methods in Computer Science e.V.
2011-05-01
|
| Sraith: | Logical Methods in Computer Science |
| Ábhair: | |
| Rochtain ar líne: | https://lmcs.episciences.org/971/pdf |
| Clibeanna: |
Níl clibeanna ann, Bí ar an gcéad duine le clib a chur leis an taifead seo!
|