. . . . . "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 . . . . . . . . . . "15282871"^^ . . . . . . . . . . . . . . "19374"^^ . . . . . . . . . . . . . . . . . . . . . "L\u00F3gica do functor predicado"@pt . . . . "Predicate functor logic"@en . . . . . . . . . . . . . . . . "Em l\u00F3gica matem\u00E1tica, predicado functor l\u00F3gica (PFL) \u00E9 uma das v\u00E1rias maneiras de expressar o que a l\u00F3gica de primeira ordem (tamb\u00E9m conhecida como l\u00F3gica de predicado) puramente alg\u00E9brica significa, por exemplo, sem vari\u00E1veis quantific\u00E1veis. PFL emprega um pequeno n\u00FAmero de corpos finitos, dispositivos de chamada de predicado ficheiro (ou modificadores de predicado) que operam em termos de rendimento termos. PFL \u00E9 principalmente a inven\u00E7\u00E3o do l\u00F3gico e filosofo Willard Quine."@pt . . . . . . . . . . . . . . . . . . . . . . "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 . . . "1106029080"^^ . . . . . . . . . . . . . . . . . . . . . . . . . . "Em l\u00F3gica matem\u00E1tica, predicado functor l\u00F3gica (PFL) \u00E9 uma das v\u00E1rias maneiras de expressar o que a l\u00F3gica de primeira ordem (tamb\u00E9m conhecida como l\u00F3gica de predicado) puramente alg\u00E9brica significa, por exemplo, sem vari\u00E1veis quantific\u00E1veis. PFL emprega um pequeno n\u00FAmero de corpos finitos, dispositivos de chamada de predicado ficheiro (ou modificadores de predicado) que operam em termos de rendimento termos. PFL \u00E9 principalmente a inven\u00E7\u00E3o do l\u00F3gico e filosofo Willard Quine."@pt . . . . .