Sciweavers

17 search results - page 1 / 4
» On Herbrand's Theorem
Sort
View
LCC
1994
209views Algorithms» more  LCC 1994»
13 years 9 months ago
On Herbrand's Theorem
We firstly survey several forms of Herbrand's theorem. What is commonly called "Herbrand's theorem" in many textbooks is actually a very simple form of Herbrand...
Samuel R. Buss
CSL
2001
Springer
13 years 9 months ago
On a Generalisation of Herbrand's Theorem
In this paper we investigate the purely logical rule of term induction, i.e. induction deriving numerals instead of arbitrary terms. In this system it is not possible to bound the ...
Matthias Baaz, Georg Moser
CIE
2008
Springer
13 years 7 months ago
Herbrand Theorems and Skolemization for Prenex Fuzzy Logics
Approximate Herbrand theorems are established for first-order fuzzy logics based on continuous t-norms, and used to provide proof-theoretic proofs of Skolemization for their Prenex...
Matthias Baaz, George Metcalfe
APAL
2002
105views more  APAL 2002»
13 years 5 months ago
Saturated models of universal theories
A notion called Herbrand saturation is shown to provide the modeltheoretic analogue of a proof-theoretic method, Herbrand analysis, yielding uniform model-theoretic proofs of a nu...
Jeremy Avigad
LOGCOM
2010
104views more  LOGCOM 2010»
13 years 3 months ago
Herbrand's Theorem, Skolemization and Proof Systems for First-Order Lukasiewicz Logic
Abstract. An approximate Herbrand theorem is established for firstorder infinite-valued Lukasiewicz Logic and used to obtain a proof-theoretic proof of Skolemization. These resul...
Matthias Baaz, George Metcalfe