2019/09/30 by Paul J. Voda, Voda, Paul J., Ján Komara +1
Computer Science · #03B10 #Computability, Logic, AI Algorithms #F.4.1 #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO) #Logic, programming, and type systems #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1909.13514
openalex publication_date 2019/09/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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. This is an important problem in logic, specifically in the complexity of proofs. In computer science, specifically in automated theorem proving, one hopes for an algorithm which avoids the guesses of existential substitution axioms involved in proving a theorem. Herbrand's theorem forms the very basis of automated theorem proving where for a given number n we would like to have an algorithm which finds the terms in the n disjunctions of matrices solely from the shape of the matrix. The main result of this paper is that both problems have negative solutions.