A uniform semantic proof for cut-elimination and completeness of various first and higher order logics
- 3 June 2002
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 281 (1-2) , 471-498
- https://doi.org/10.1016/s0304-3975(02)00024-5
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- The finite model property for various fragments of intuitionistic linear logicThe Journal of Symbolic Logic, 1999
- The finite model property for various fragments of linear logicThe Journal of Symbolic Logic, 1997
- Pretopologies and completeness proofsThe Journal of Symbolic Logic, 1995
- From proof nets to interaction netsPublished by Cambridge University Press (CUP) ,1995
- Linear Logic: its syntax and semanticsPublished by Cambridge University Press (CUP) ,1995
- Non‐commutative intuitionistic linear logicMathematical Logic Quarterly, 1990
- Logics without the contraction ruleThe Journal of Symbolic Logic, 1985
- Hauptsatz for higher order logicThe Journal of Symbolic Logic, 1968
- Intensional interpretations of functionals of finite type IThe Journal of Symbolic Logic, 1967
- A nonconstructive proof of Gentzen’s Hauptsatz for second order predicate logicBulletin of the American Mathematical Society, 1966