Semantic Scholar uses AI to extract papers important to this topic.
We consider cut-elimination in the sequent calculus for classical
first-order logic. It is well known that this system, in its… Expand Let R be a local ring, and let M and N be finitely generated R-modules such that M has finite complete intersection dimension. In… Expand Abstract Herbrand’s theorem is one of the most fundamental results about first-order logic. In the context of proof analysis… Expand We give some lectures on the work on formal logic of Jacques Herbrand, and sketch his life and his influence on automated theorem… Expand This is a slightly enhanced version of the acceptance speech given by the author after receiving the Herbrand Award at the 19th… Expand An atomic representation of a Herbrand model (ARM) is a finite set of (not necessarily ground) atoms over a given Herbrand… Expand The Robbins problem was solved in October 1996  by the equational theorem prover EQP . Although the solution was automatic… Expand The paper describes a case study that explores the idea of building a planner with a neat semantics of the plans it produces, by… Expand For a wide class of programming languages P and expressive interpretations I, we show that there exist sound and relatively… Expand These two books are best considered as companion volumes. They both treat the decision problem for formulas of first order logic… Expand