Diferencia entre revisiones de «Forma normal prenexa»

[[Gödel]]'s proof of his [[Gödel's completeness theorem|completeness theorem]] for [[first-order logic]] presupposes that all formulae have been recast in prenex normal form.

 

*[[Herbrandization]]

*[[Skolemization]]

*[[Arithmetical hierarchy]]

 

{{listaref}}

 

* {{Obra citada | last1=Hinman | first1=P. | title=Fundamentals of Mathematical Logic | publisher=[[A K Peters]] | isbn=978-1-56881-262-5 | year=2005}}