In mathematical logic, a ground term of a formal system is a term that does not contain any variables at all, and a closed term is a term that has no free variables. In first-order logic all closed terms are ground terms, but in lambda calculus the closed term λ x. x (λ y. y) is not a ground term. Similarly, a ground formula is a formula that does not contain any variables, and a closed formula or sentence is a formula that has no free variables.
| Property | Value |
|---|
| dbpedia-owl:abstract
|
- In mathematical logic, a ground term of a formal system is a term that does not contain any variables at all, and a closed term is a term that has no free variables. In first-order logic all closed terms are ground terms, but in lambda calculus the closed term λ x. x (λ y. y) is not a ground term. Similarly, a ground formula is a formula that does not contain any variables, and a closed formula or sentence is a formula that has no free variables. In first-order logic with identity, the sentence <math>\forall</math> x (x=x) is not a ground formula. A ground expression is a ground term or ground formula.
- Considere uma cláusula obtida de uma fórmula sentencial do cálculo de predicados de primeira ordem na forma skolemizada: então uma expressão atômica obtida a partir de substituindo todas as variáveis por elementos do Universo de Herbrand de é chamada de átomo básico. O conjunto de todos os átomos que podem ser formados a partir de símbolos predicados de e termos a partir de é chamado de base de Herbrand.
|
| dbpedia-owl:wikiPageExternalLink
| |
| dcterms:subject
| |
| rdfs:comment
|
- Considere uma cláusula obtida de uma fórmula sentencial do cálculo de predicados de primeira ordem na forma skolemizada: então uma expressão atômica obtida a partir de substituindo todas as variáveis por elementos do Universo de Herbrand de é chamada de átomo básico. O conjunto de todos os átomos que podem ser formados a partir de símbolos predicados de e termos a partir de é chamado de base de Herbrand.
- In mathematical logic, a ground term of a formal system is a term that does not contain any variables at all, and a closed term is a term that has no free variables. In first-order logic all closed terms are ground terms, but in lambda calculus the closed term λ x. x (λ y. y) is not a ground term. Similarly, a ground formula is a formula that does not contain any variables, and a closed formula or sentence is a formula that has no free variables.
|
| rdfs:label
|
- Ground expression
- Átomo básico
|
| owl:sameAs
| |
| foaf:page
| |
| is dbpedia-owl:wikiPageRedirects
of | |
| is owl:sameAs
of | |
| is foaf:primaryTopic
of | |
