Predicate abstraction
id:
predicate-abstraction-287-18302107
title:
Predicate abstraction
text:
In logic, predicate abstraction is the result of creating a predicate from a formula. If Q is any formula then the predicate abstract formed from that sentence is (λx.Q), where λ is an abstraction operator and in which every occurrence of x that is free in Q is bound by λ in (λx.Q). The resultant predicate (λx.Q) is a monadic predicate capable of taking a term t as argument as in (λx.Q)(t), which says that the object denoted by 't' has the property of being such that Q. The law of abstraction st
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Predicate_abstraction
date created:
date modified:
2023-09-29T14:18:30Z
main entity:
{"identifier":"Q7239630","url":"https://www.wikidata.org/entity/Q7239630"}
image:
fields total:
13
integrity:
13