Springer Nature
theorem
course
theory
rules
716-720
system
paper
chapters
Zermelo set theory
false
In this paper we describe a sequent calculus-based theorem prover called −5. The underlying logic of & is that of Zermelo set theory. In addition to the usual rules of first-order sequent based systems, the logic contains inference rules to handle set abstraction terms, including the ability to unify formulae involving such terms, and the ability to introduce new abstraction terms as instantiations. & also has novel derived rules and heuristics for making choices in the course of the proof of a theorem.
set theory
ability
deduction
choice
terms
natural deduction
heuristics
abstraction terms
proof
2022-08-04T17:16
1992-01-01
addition
logic
instantiation
sequents
usual rules
underlying logic
&: Automated natural deduction
such terms
https://doi.org/10.1007/3-540-55602-8_210
formula
https://scigraph.springernature.com/explorer/license/
chapter
1992
inference rules
Springer Nature - SN SciGraph project
Electrical and Electronic Engineering
CTA, INCORPORATED, 6116 Executive Blvd, 20852, Rockville, Maryland
CTA, INCORPORATED, 6116 Executive Blvd, 20852, Rockville, Maryland
pub.1005028390
dimensions_id
Engineering
Deepak
Kapur
Andrew S.
Merrill
Sidney C.
Bailin
Barker-Plummer
Dave
Swarthmore, College, 19081, Swarthmore, PA
Swarthmore, College, 19081, Swarthmore, PA
10.1007/3-540-55602-8_210
doi
978-3-540-47252-0
978-3-540-55602-2
Automated Deduction—CADE-11