| http://dbpedia.org/ontology/abstract
|
In logic, predicate abstraction is the res … In logic, predicate abstraction is the result of creating a predicate from a sentence. If Q is any formula then the predicate abstract formed from that sentence is (λy.Q), where λ is an abstraction operator and in which every occurrence of y occurs bound by λ in (λy.Q). The resultant predicate (λx.Q(x)) is a monadic predicate capable of taking a term t as argument as in (λx.Q(x))(t), which says that the object denoted by 't' has the property of being such that Q. The law of abstraction states ( λx.Q(x) )(t) ≡ Q(t/x) where Q(t/x) is the result of replacing all free occurrences of x in Q by t. This law is shown to fail in general in at least two cases: (i) when t is irreferential and (ii) when Q contains modal operators. In modal logic the "de re / de dicto distinction" is stated as 1. (DE DICTO): 2. (DE RE): . In (1) the modal operator applies to the formula A(t) and the term t is within the scope of the modal operator. In (2) t is not within the scope of the modal operator.ot within the scope of the modal operator.
|
| http://dbpedia.org/ontology/wikiPageID
|
3206883
|
| http://dbpedia.org/ontology/wikiPageLength
|
1435
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1007340581
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Category:Modal_logic +
, http://dbpedia.org/resource/Abstraction_operator +
, http://dbpedia.org/resource/Sentence_%28linguistics%29 +
, http://dbpedia.org/resource/Category:Philosophical_logic +
, http://dbpedia.org/resource/Predicate_%28logic%29 +
, http://dbpedia.org/resource/Springer_Science%2BBusiness_Media +
, http://dbpedia.org/resource/Modal_operator +
, http://dbpedia.org/resource/Logic +
, http://dbpedia.org/resource/Modal_logic +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Semantics-stub +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Modal_logic +
, http://dbpedia.org/resource/Category:Philosophical_logic +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Predicate_abstraction?oldid=1007340581&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Predicate_abstraction +
|
| owl:sameAs |
https://global.dbpedia.org/id/4tSP1 +
, http://dbpedia.org/resource/Predicate_abstraction +
, http://www.wikidata.org/entity/Q7239630 +
, http://rdf.freebase.com/ns/m.08z9vn +
|
| rdfs:comment |
In logic, predicate abstraction is the res … In logic, predicate abstraction is the result of creating a predicate from a sentence. If Q is any formula then the predicate abstract formed from that sentence is (λy.Q), where λ is an abstraction operator and in which every occurrence of y occurs bound by λ in (λy.Q). The resultant predicate (λx.Q(x)) is a monadic predicate capable of taking a term t as argument as in (λx.Q(x))(t), which says that the object denoted by 't' has the property of being such that Q. In modal logic the "de re / de dicto distinction" is stated as 1. (DE DICTO): 2. (DE RE): . is stated as 1. (DE DICTO): 2. (DE RE): .
|
| rdfs:label |
Predicate abstraction
|
