首页> 外文OA文献 >Theorem Proving for Classical Logic with Partial Functions by Reduction to Kleene Logic

【2h】

Theorem Proving for Classical Logic with Partial Functions by Reduction to Kleene Logic

机译：用Kleene逻辑简化证明具有部分函数的经典逻辑的定理

页面导航

著录项
引文网络
相似文献
相关主题

著录项

作者
Hans De Nivelle; Instytut Informatyki;
展开▼
作者单位

展开▼
年度 2014
总页数
原文格式 PDF
正文语种
中图分类

相似文献

外文文献
中文文献
专利

1. Theorem proving for classical logic with partial functions by reduction to Kleene logic [J] . de Nivelle Hans Journal of logic and computation . 2017,第2期

机译：通过简化为Kleene逻辑证明具有部分函数的古典逻辑的定理
2. Revising basic theorem proving algorithms to cope with the logic of partial functions [J] . Cliff B. Jones, Matthew J. Lovert, L. Jason Steggles Science of Computer Programming . 2014,第pta2期

机译：修改基本定理证明算法以应对部分函数的逻辑
3. Connection-Based Theorem Proving in Classical and Non-Classical Logics [J] . Christoph Kreitz, Jens Otten Journal of Universal Computer Science . 1999,第3期

机译：古典和非古典逻辑中基于连接的定理证明
4. Representation theorems and theorem proving in non-classical logics [C] . Sofronie-Stokkermans, V. . 1999

机译：非经典逻辑中的表示定理和定理证明
5. Automated theorem proving by translation to description logic. [D] . Arhami, Negin. 2015

机译：通过翻译成描述逻辑来自动证明定理。
6. A RET-supported logic gate combinatorial library to enable modeling and implementation of intelligent logic functions [O] . Ru-Ru Gao, Shuo Shi, Ying Zhu, 2016

机译：RET支持的逻辑门组合库可实现智能逻辑功能的建模和实现
7. lolliCoP - A Linear Logic Implementation of a Lean Connection-Method Theorem Prover for First-Order Classical Logic [O] . Joshua S. Hodas, Naoyuki Tamura 2001

机译：lolliCoP-一阶经典逻辑的精益连接方法定理证明的线性逻辑实现
8. Revising Basic Theorem Proving Algorithms to Cope withrnthe Logic of Partial Functions [R] . 2014

机译：修正基本定理证明算法以处理部分函数的逻辑

Theorem Proving for Classical Logic with Partial Functions by Reduction to Kleene Logic

著录项

引文网络

相似文献

相关主题

期刊订阅