{"id":"https://openalex.org/W2004924271","doi":"https://doi.org/10.1305/ndjfl/1093635508","title":"Post's functional completeness theorem.","display_name":"Post's functional completeness theorem.","publication_year":1990,"publication_date":"1990-06-01","ids":{"openalex":"https://openalex.org/W2004924271","doi":"https://doi.org/10.1305/ndjfl/1093635508","mag":"2004924271"},"language":"en","primary_location":{"id":"doi:10.1305/ndjfl/1093635508","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093635508","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-31/issue-3/Posts-functional-completeness-theorem/10.1305/ndjfl/1093635508.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-31/issue-3/Posts-functional-completeness-theorem/10.1305/ndjfl/1093635508.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012663066","display_name":"Norman M. Martin","orcid":null},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Norman M. Martin","raw_affiliation_strings":["Department of Philosophy Department of Philosophy University of Alberta","University of Texas Edmonton, Alberta Austin, Texas 78712 Canada T6G 2E5"],"affiliations":[{"raw_affiliation_string":"Department of Philosophy Department of Philosophy University of Alberta","institution_ids":[]},{"raw_affiliation_string":"University of Texas Edmonton, Alberta Austin, Texas 78712 Canada T6G 2E5","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006576404","display_name":"Francis Jeffry Pelletier","orcid":"https://orcid.org/0000-0002-3399-2718"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Francis Jeffry Pelletier","raw_affiliation_strings":["Department of Philosophy Department of Philosophy University of Alberta","University of Texas Edmonton, Alberta Austin, Texas 78712 Canada T6G 2E5"],"affiliations":[{"raw_affiliation_string":"Department of Philosophy Department of Philosophy University of Alberta","institution_ids":[]},{"raw_affiliation_string":"University of Texas Edmonton, Alberta Austin, Texas 78712 Canada T6G 2E5","institution_ids":["https://openalex.org/I154425047"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5012663066"],"corresponding_institution_ids":["https://openalex.org/I154425047"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":17,"citation_normalized_percentile":{"value":0.1263828,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"31","issue":"3","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11727","display_name":"Advanced Algebra and Logic","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.66391921043396},{"id":"https://openalex.org/keywords/truth-table","display_name":"Truth table","score":0.6358431577682495},{"id":"https://openalex.org/keywords/truth-function","display_name":"Truth function","score":0.6235870718955994},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4681204855442047},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.4436293840408325},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.41633540391921997},{"id":"https://openalex.org/keywords/logical-connective","display_name":"Logical connective","score":0.4149356484413147},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34162840247154236},{"id":"https://openalex.org/keywords/propositional-calculus","display_name":"Propositional calculus","score":0.21543651819229126},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.11817494034767151}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.66391921043396},{"id":"https://openalex.org/C56949724","wikidata":"https://www.wikidata.org/wiki/Q219079","display_name":"Truth table","level":2,"score":0.6358431577682495},{"id":"https://openalex.org/C37754750","wikidata":"https://www.wikidata.org/wiki/Q913874","display_name":"Truth function","level":3,"score":0.6235870718955994},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4681204855442047},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.4436293840408325},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.41633540391921997},{"id":"https://openalex.org/C194989596","wikidata":"https://www.wikidata.org/wiki/Q211790","display_name":"Logical connective","level":2,"score":0.4149356484413147},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34162840247154236},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.21543651819229126},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.11817494034767151},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1305/ndjfl/1093635508","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093635508","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-31/issue-3/Posts-functional-completeness-theorem/10.1305/ndjfl/1093635508.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},{"id":"pmh:oai:CULeuclid:euclid.ndjfl/1093635508","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.ndjfl/1093635508","pdf_url":null,"source":{"id":"https://openalex.org/S4306400787","display_name":"Project Euclid (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.124.5422","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.124.5422","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.sfu.ca/~jeffpell/Phil467/PostPellMartin.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.89.2460","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.89.2460","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.sfu.ca/~jeffpell/papers/PostPellMartin.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1305/ndjfl/1093635508","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093635508","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-31/issue-3/Posts-functional-completeness-theorem/10.1305/ndjfl/1093635508.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.41999998688697815,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2004924271.pdf","grobid_xml":"https://content.openalex.org/works/W2004924271.grobid-xml"},"referenced_works_count":5,"referenced_works":["https://openalex.org/W268959080","https://openalex.org/W1510453926","https://openalex.org/W1589711670","https://openalex.org/W1982070750","https://openalex.org/W2041833446"],"related_works":["https://openalex.org/W2022239108","https://openalex.org/W2361375926","https://openalex.org/W2380533324","https://openalex.org/W1504036030","https://openalex.org/W2348695264","https://openalex.org/W2341651163","https://openalex.org/W2376788341","https://openalex.org/W4313642989","https://openalex.org/W2384278060","https://openalex.org/W2392011758"],"abstract_inverted_index":{"The":[0,58],"paper":[1],"provides":[2],"a":[3,7,76,92],"new":[4],"proof,":[5],"in":[6,62],"style":[8],"accessible":[9],"to":[10,40,46,49],"modern":[11],"logicians":[12],"and":[13,28,73],"teachers":[14],"of":[15,18,35,64,78,86],"elementary":[16],"logic,":[17],"Post's":[19,23],"Functional":[20],"Completeness":[21],"Theorem.":[22],"Theorem":[24],"states":[25],"the":[26,87],"necessary":[27],"sufficient":[29],"conditions":[30],"for":[31,84],"an":[32,68],"arbitrary":[33,69],"set":[34,77],"(2-valued)":[36,52],"truth":[37,53,56],"functional":[38],"connectives":[39,79],"be":[41,47],"expressively":[42,81],"complete,":[43],"that":[44,67,75,94,96],"is,":[45],"able":[48],"express":[50],"every":[51],"function":[54],"or":[55],"table.":[57],"theorem":[59],"is":[60,80,91],"stated":[61],"terms":[63],"five":[65,88],"properties":[66,89],"connective":[70,93],"may":[71],"have,":[72],"claims":[74],"complete":[82],"iff":[83],"each":[85],"there":[90],"lacks":[95],"property.":[97]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}