Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,160,427 papers from all fields of science
Search
Sign In
Create Free Account
Herbrandization
Known as:
Herbrand normal form
, Herbrandized form
The Herbrandization of a logical formula (named after Jacques Herbrand) is a construction that is dual to the Skolemization of a formula. Thoralf…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
DPLL algorithm
Davis–Putnam algorithm
First-order logic
Predicate functor logic
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Remarks on Herbrand Analyses
U. Kohlenbach
2012
Corpus ID: 18276651
We show that for theories T + with function parameters, in general (1) T + ` A , A =⇒ / T + ` A (even if A does not contain…
Expand
2010
2010
Herbrand consistency of some arithmetical theories
Saeed Salehi
Journal of Symbolic Logic (JSL)
2010
Corpus ID: 14933971
Abstract Gödel's second incompleteness theorem is proved for Herbrand consistency of some arithmetical theories with bounded…
Expand
2007
2007
Acknowledgements: the Ideas and Comments Of
M. Beeson
,
Jussi Ketonen
2007
Corpus ID: 12763169
16 negative occurrences of various connectives and quantiiers. Herbrandization will always work for a class of formulas that does…
Expand
2006
2006
Model-Baded Abduction via Dual Resolution
F. Soler-Toscano
,
Ángel Nepomuceno-Fernández
,
A. Aliseda-Llera
Logic Journal of the IGPL
2006
Corpus ID: 14032534
This papers presents δ-resolution, a dual resolution calculus. It is based on standard resolution, and uses appropriate formulae…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE