Talk:Ground expression
| This is the talk page for discussing improvements to the Ground expression article. This is not a forum for general discussion of the article's subject. |
Article policies
|
| Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL |
 | This article is rated Stub-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
Should be merged with the Sentence (mathematical logic) article[edit]
Sentence and ground formula are terms that mean the same thing. It would also help clarify this section of the Well-formed-formula article. Luot (talk) 20:15, 15 December 2014 (UTC)
Reference Forbidden[edit]
http://web.engr.oregonstate.edu/~afern/classes/cs532/notes/fo-ss.pdf is returning 403 Forbidden. Does anyone know of an updated version of this page, or a replacement? --Hyper Anthony (talk) 19:34, 25 September 2012 (UTC)
Conflicting definitions of "ground expression"[edit]
"The semantics of predicate logic as a programming language" says ""An expression (term, literal, clause, set of clauses) is ground if it contains no variables" and "Stanford's Herbrand Semantics" says "An expression is ground if and only if it contains no variables." These apparently contradict the article's statement, "ground term of a formal system is a term that does not contain any free variables." More directly in contradiction is the Herbrand Semantics statement "For example, the sentence p(a) is ground, whereas the sentence ∀x.p(x) is not." whereas the article states "the sentence ∀x (x=x) is a ground formula." Jim Bowery (talk) 16:48, 14 June 2019 (UTC)