Proceedings of the American Mathematical Society · 1979 · 83 citations · 4 references
ComputingComputer ScienceMathematicsLogicPredicate LogicProof ComplexityTheorem ProvingLower BoundsQuantifier Elimination
We give non Kalmar-elementary lower bounds on the elimination of quantifier inferences via Herbrand’s theorem.
4
Some classes of recursive functions
Andrzej Grzegorczyk · 1964 · 307 citations
An Abstract form of the church-rosser theorem. I
Roger Hindley · Journal of Symbolic Logic · 1969 · 36 citations
An Abstract form of the church-rosser theorem. I
R. Hindley · Journal of Symbolic Logic · 1970 · 27 citations · Full text