@prefix owl: . @prefix dbpedia: . dbpedia:Ground_expression owl:sameAs . @prefix foaf: . @prefix ns3: . dbpedia:Ground_expression foaf:page ns3:Ground_expression . @prefix dbpprop: . dbpedia:Ground_expression dbpprop:reference . @prefix rdfs: . dbpedia:Ground_expression rdfs:label "Alapkifejez\u00E9s"@hu , "Ground expression"@en , "\u00C1tomo b\u00E1sico"@pt ; dbpprop: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 \u03BB x. x (\u03BB 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."@en , "Alapkifejez\u00E9snek a matematikai logik\u00E1ban egy logikai nyelv azon kifejez\u00E9seit (termjeit \u00E9s formul\u00E1it) nevezz\u00FCk, melyek nem tartalmaznak logikai v\u00E1ltoz\u00F3kat. A fogalom els\u0151sorban az els\u0151rend\u0171 nyelvek elm\u00E9let\u00E9ben fordul el\u0151 (a nulladrend\u0171 nyelvek formul\u00E1i alapb\u00F3l nem tartalmaznak logikai v\u00E1ltoz\u00F3kat, mivel maguk a nulladrend\u0171 nyelvek sem tartalmaz ilyeneket). Megjegyezz\u00FCk, hogy az elnevez\u00E9s f\u00E9lre\u00E9rthet\u0151, mert \u201Ekifejez\u00E9sen\u201D sokak \u00E1ltal elfogadott sz\u00F3haszn\u00E1lat szerint csak a nyelv termeit szoktuk \u00E9rteni, a formul\u00E1kat nem; holott az alapkifejez\u00E9sekbe a formul\u00E1k egy r\u00E9sz\u00E9t (az \u00FAn. alapformul\u00E1kat) is bele\u00E9rtj\u00FCk. Szeml\u00E9letesen e fogalmat valahogy \u00FAgy k\u00E9pzelhetj\u00FCk el, hogy az alapkifejez\u00E9sek \u00EDrj\u00E1k le a \u201Ekonkr\u00E9t\u201D, a \u201Er\u00F6gz\u00EDtett\u201D objektumokat \u00E9s a r\u00F3luk sz\u00F3l\u00F3 (igaz vagy hamis) \u00E1ll\u00EDt\u00E1sokat a nyelvben, m\u00EDg a t\u00F6bbi, nem-alapkifejez\u00E9s ink\u00E1bb valami \u00E1ltal\u00E1noss\u00E1got vagy hat\u00E1rozatlanul eld\u00F6nthet\u0151 \u00E1ll\u00EDt\u00E1st \u00EDr le. De hangs\u00FAlyozzuk, ez csak egy nem prec\u00EDz, k\u00F6znapi, elmos\u00F3dott interpret\u00E1l\u00E1sa a fogalomnak. A pontosabb \u00E9s form\u00E1lis defin\u00EDci\u00F3t l\u00E1sd lentebb."@hu , "ent\u00E3o uma express\u00E3o at\u00F4mica obtida a partir de <math>S</math> substituindo todas as vari\u00E1veis por elementos do Universo de Herbrand <math>H</math> de <math>S</math> \u00E9 chamada de \u00E1tomo b\u00E1sico. O conjunto de todos os \u00E1tomos que podem ser formados a partir de s\u00EDmbolos predicados de <math>S</math> e termos a partir de <math>H</math> \u00E9 chamado de Base de Herbrand."@pt ; rdfs:comment "ent\u00E3o uma express\u00E3o at\u00F4mica obtida a partir de <math>S</math> substituindo todas as vari\u00E1veis por elementos do Universo de Herbrand <math>H</math> de <math>S</math> \u00E9 chamada de \u00E1tomo b\u00E1sico. O conjunto de todos os \u00E1tomos que podem ser formados a partir de s\u00EDmbolos predicados de <math>S</math> e termos a partir de <math>H</math> \u00E9 chamado de Base de Herbrand."@pt , "Alapkifejez\u00E9snek a matematikai logik\u00E1ban egy logikai nyelv azon kifejez\u00E9seit (termjeit \u00E9s formul\u00E1it) nevezz\u00FCk, melyek nem tartalmaznak logikai v\u00E1ltoz\u00F3kat. A fogalom els\u0151sorban az els\u0151rend\u0171 nyelvek elm\u00E9let\u00E9ben fordul el\u0151 (a nulladrend\u0171 nyelvek formul\u00E1i alapb\u00F3l nem tartalmaznak logikai v\u00E1ltoz\u00F3kat, mivel maguk a nulladrend\u0171 nyelvek sem tartalmaz ilyeneket)."@hu , "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 \u03BB x. x (\u03BB 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."@en . @prefix skos: . @prefix ns7: . dbpedia:Ground_expression skos:subject ns7:Mathematical_logic . @prefix ns8: . dbpedia:Ground_expression dbpprop:hasPhotoCollection ns8:Ground_expression . dbpedia:Closed_term dbpprop:redirect dbpedia:Ground_expression . dbpedia:Ground_atom dbpprop:redirect dbpedia:Ground_expression . dbpedia:Ground_sentence dbpprop:redirect dbpedia:Ground_expression . dbpedia:Ground_term dbpprop:redirect dbpedia:Ground_expression . dbpedia:Ground_predicate dbpprop:redirect dbpedia:Ground_expression . dbpedia:Ground_clause dbpprop:redirect dbpedia:Ground_expression .