首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Herbrand's theorem as higher order recursion
Institution:1. Institute for Logic, Language and Computation, University of Amsterdam, PO Box 94242, 1090 GE Amsterdam, The Netherlands;2. Department of Philosophy, Linguistics and Theory of Science, University of Gothenburg, Box 200, 405 30 Göteborg, Sweden;3. Institut für Diskrete Mathematik und Geometrie, TU Wien, Wiedner Hauptstraße 8–10, 1040 Wien, Austria
Abstract:
Keywords:Classical sequent calculus  Herbrand's theorem  Cut elimination  Higher order recursion schemes  Computational content
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号