On Herbrand Skeletons

30 Sep 2019 Voda Paul J. Komara Ján

Herbrand's theorem plays an important role both in proof theory and in computer science. Given a Herbrand skeleton, which is basically a number specifying the count of disjunctions of the matrix, we would like to get a computable bound on the size of terms which make the disjunction into a quasitautology... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • LOGIC
  • LOGIC IN COMPUTER SCIENCE