메뉴 건너뛰기




Volumn 281, Issue 1-2, 2002, Pages 471-498

A uniform semantic proof for cut-elimination and completeness of various first and higher order logics

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; SEMANTICS; THEOREM PROVING;

EID: 0037014252     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00024-5     Document Type: Article
Times cited : (55)

References (40)
  • 16
    • 18944363457 scopus 로고    scopus 로고
    • Phase semantics for light linear logic
    • Theoretical Computer Science to appear. A prior version appeared in Proceedings of the International conference on the Mathematical Foundations of Programming Languages. The full-version is to appear in Theoretical Computer Science, Special Issue on Linear Logic. (2002), to appear
    • (1997) Electronic Notes in Theoretical Computer Science , vol.6
    • Kanovitch, M.1    Okada, M.2    Scedrov, A.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.