Herbrand Proofs and Expansion Proofs as Decomposed Proofs
Herbrand Proofs and Expansion Proofs as Decomposed Proofs
复制标题
Herbrand 证明和扩展证明作为分解证明
DOI:
10.1093/logcom/exaa052
复制
发表时间:
2020
影响因子:
0.7
通讯作者:
Ralph B
中科院分区:
文献类型:
--
作者:
Ralph B
The reduction of undecidable first-order logic to decidable propositional logic via Herbrand’s theorem has long been of interest to theoretical computer science, with the notion of a Herbrand proof motivating the definition of expansion proofs. In this paper we construct simple deep inference systems for first-order logic, both with and without cut, such that ‘decomposed’ proofs—proofs where the contractive and non-contractive behaviour of the proof is separated—in each system correspond to either expansion proofs or Herbrand proofs. Translations between proofs in this system, expansion proofs and Herbrand proofs are given, retaining much of the structure in each direction.
登录
查看更多内容
影响因子:
1.3
作者:
R. Statman
通讯作者:
R. Statman
DOI:
10.1007/978-3-319-72056-2_18
发表时间:
2018
期刊:
arXiv: Logic
影响因子:
--
作者:
B. Ralph
通讯作者:
B. Ralph
DOI:
--
发表时间:
1999
期刊:
TOCL
影响因子:
--
作者:
Alessio Guglielmi
通讯作者:
Alessio Guglielmi
DOI:
--
发表时间:
1987
期刊:
Studia Logica: An International Journal for Symbolic Logic
影响因子:
--
作者:
D. Miller
通讯作者:
D. Miller
DOI:
10.1007/3-540-60178-3_85
发表时间:
1994-10
期刊:
--
影响因子:
--
作者:
S. Buss
通讯作者:
S. Buss