An Entity of Type: WikicatMathematicalAxioms, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In mathematical logic, predicate functor logic (PFL) is one of several ways to express first-order logic (also known as predicate logic) by purely algebraic means, i.e., without quantified variables. PFL employs a small number of algebraic devices called predicate functors (or predicate modifiers) that operate on terms to yield terms. PFL is mostly the invention of the logician and philosopher Willard Quine.

Property Value
dbo:abstract
  • In mathematical logic, predicate functor logic (PFL) is one of several ways to express first-order logic (also known as predicate logic) by purely algebraic means, i.e., without quantified variables. PFL employs a small number of algebraic devices called predicate functors (or predicate modifiers) that operate on terms to yield terms. PFL is mostly the invention of the logician and philosopher Willard Quine. (en)
  • Em lógica matemática, predicado functor lógica (PFL) é uma das várias maneiras de expressar o que a lógica de primeira ordem (também conhecida como lógica de predicado) puramente algébrica significa, por exemplo, sem variáveis quantificáveis. PFL emprega um pequeno número de corpos finitos, dispositivos de chamada de predicado ficheiro (ou modificadores de predicado) que operam em termos de rendimento termos. PFL é principalmente a invenção do lógico e filosofo Willard Quine. (pt)
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 15282871 (xsd:integer)
dbo:wikiPageLength
  • 19374 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1106029080 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dct:subject
gold:hypernym
rdf:type
rdfs:comment
  • In mathematical logic, predicate functor logic (PFL) is one of several ways to express first-order logic (also known as predicate logic) by purely algebraic means, i.e., without quantified variables. PFL employs a small number of algebraic devices called predicate functors (or predicate modifiers) that operate on terms to yield terms. PFL is mostly the invention of the logician and philosopher Willard Quine. (en)
  • Em lógica matemática, predicado functor lógica (PFL) é uma das várias maneiras de expressar o que a lógica de primeira ordem (também conhecida como lógica de predicado) puramente algébrica significa, por exemplo, sem variáveis quantificáveis. PFL emprega um pequeno número de corpos finitos, dispositivos de chamada de predicado ficheiro (ou modificadores de predicado) que operam em termos de rendimento termos. PFL é principalmente a invenção do lógico e filosofo Willard Quine. (pt)
rdfs:label
  • Predicate functor logic (en)
  • Lógica do functor predicado (pt)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:notableIdea of
is dbo:wikiPageDisambiguates of
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License