| 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 |
https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-24/issue-2/An-axiomatization-of-predicate-functor-logic/10.1305/ndjfl/1093870313.full http://stp.ling.uu.se/~matsd/pub/pfl.ps |
| dbo:wikiPageID |
15282871 (xsd:integer) |
| dbo:wikiPageLength |
19374 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID |
1106029080 (xsd:integer) |
| dbo:wikiPageWikiLink |
dbr:Cartesian_product dbr:Predicate_logic dbr:Rudolf_Carnap dbr:Modal_logic dbr:Model_theory dbr:Metamathematics dbr:Sheffer_stroke dbr:Jean_Van_Heijenoort dbr:Boolean_algebra_(logic) dbr:Algorithm dbr:Paul_Bernays dbr:Paul_Halmos dbr:Peano_arithmetic dbr:Relation_(mathematics) dbr:Cylindric_algebra dbr:Universal_quantifier dbr:Quantification_(logic) dbr:Combinatory_logic dbr:Material_conditional dbr:Mathematical_logic dbr:Negation dbr:Moses_Schönfinkel dbr:Symmetric dbr:Logic dbr:Logical_NOR dbr:Logical_conjunction dbr:Completeness_(logic) dbr:Functional_completeness dbr:Propositional_logic dbr:Axiomatic_set_theory dbr:Transitive_relation dbr:Truth_value dbr:Domain_of_a_function dbr:Abstraction dbr:Alfred_Tarski dbr:Algebraic_logic dbr:American_Mathematical_Society dbr:Dana_Scott dbr:First-order_logic dbr:Paradox dbr:Logical_connective dbr:Natural_deduction dbr:Free_variable dbr:Robert_Feys dbr:Quantifier_(logic) dbr:Range_of_a_function dbr:Relation_algebra dbr:Gödel's_incompleteness_theorem dbr:Haskell_Curry dbr:Atomic_formula dbc:Predicate_logic dbr:Tautology_(logic) dbr:Term_(logic) dbc:Algebraic_logic dbr:Lambda_calculus dbr:Superscript dbr:Syntax dbr:Term_logic dbr:ZFC dbr:Modus_ponens dbr:Disjunctive_normal_form dbc:Mathematical_axioms dbr:Philosophy dbr:Group_theory dbr:Identity_(mathematics) dbr:Natural_number dbr:Reflexive_relation dbr:Sentential_logic dbr:Set_theory dbr:Semantics dbr:Sentence_(mathematical_logic) dbr:Undecidable_problem dbr:Universe_of_discourse dbr:S5_(modal_logic) dbr:Philosopher dbr:Polyadic_algebra dbr:Rules_of_passage_(logic) dbr:Steven_Kuhn dbr:Boolean_variable dbr:Foundation_of_mathematics dbr:Willard_Quine dbr:Consistency_proof dbr:Higher_order_function dbr:N-tuple dbr:Combinator dbr:Monadic_predicate_logic dbr:Curry_paradox dbr:Existential_quantifier dbr:Logical_AND dbr:Logical_OR dbr:Frederick_Fitch |
| dbp:wikiPageUsesTemplate |
dbt:Cn dbt:Math dbt:Mvar dbt:Ordered_list dbt:Reflist dbt:Short_description |
| dcterms:subject |
dbc:Predicate_logic dbc:Algebraic_logic dbc:Mathematical_axioms |
| gold:hypernym |
dbr:Ways |
| rdf:type |
yago:WikicatMathematicalAxioms yago:Abstraction100002137 yago:AuditoryCommunication107109019 yago:Communication100033020 yago:Maxim107152948 yago:Saying107151380 yago:Speech107109196 |
| 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 |
freebase:Predicate functor logic yago-res:Predicate functor logic wikidata:Predicate functor logic dbpedia-pt:Predicate functor logic https://global.dbpedia.org/id/4tjS2 |
| prov:wasDerivedFrom |
wikipedia-en:Predicate_functor_logic?oldid=1106029080&ns=0 |
| foaf:isPrimaryTopicOf |
wikipedia-en:Predicate_functor_logic |
| is dbo:notableIdea of |
dbr:Willard_Van_Orman_Quine |
| is dbo:wikiPageDisambiguates of |
dbr:Functor_(disambiguation) |
| is dbo:wikiPageRedirects of |
dbr:Predicate_functor dbr:Predicate_modifier |
| is dbo:wikiPageWikiLink of |
dbr:Combinatory_logic dbr:Skolem_normal_form dbr:Functor_(disambiguation) dbr:Willard_Van_Orman_Quine dbr:Algebraic_logic dbr:First-order_logic dbr:Predicate_(mathematical_logic) dbr:Relation_algebra dbr:Abstract_algebraic_logic dbr:Herbrandization dbr:Predicate_functor dbr:Predicate_modifier |
| is foaf:primaryTopic of |
wikipedia-en:Predicate_functor_logic |