{"id":"https://openalex.org/W2044741118","doi":"https://doi.org/10.1305/ndjfl/1093956751","title":"Nueva demostracion de la completicidad funcional del calculo proposicional bivalente (A new proof of the functional completeness of the two-valued propositional calculus)","display_name":"Nueva demostracion de la completicidad funcional del calculo proposicional bivalente (A new proof of the functional completeness of the two-valued propositional calculus)","publication_year":1961,"publication_date":"1961-01-01","ids":{"openalex":"https://openalex.org/W2044741118","doi":"https://doi.org/10.1305/ndjfl/1093956751","mag":"2044741118"},"language":"es","primary_location":{"id":"doi:10.1305/ndjfl/1093956751","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093956751","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-2/issue-1/Nueva-demostracion-de-la-completicidad-funcional-del-calculo-proposicional-bivalente/10.1305/ndjfl/1093956751.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-2/issue-1/Nueva-demostracion-de-la-completicidad-funcional-del-calculo-proposicional-bivalente/10.1305/ndjfl/1093956751.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050888128","display_name":"Luis E. Sanchis","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Luis Elpidio Sanchis","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5050888128"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07769812,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":"1","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.9894000291824341,"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.9894000291824341,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9876000285148621,"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/T10142","display_name":"Formal Methods in Verification","score":0.963699996471405,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.7395864725112915},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5156890153884888},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.506261944770813},{"id":"https://openalex.org/keywords/propositional-calculus","display_name":"Propositional calculus","score":0.41085508465766907},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.30425137281417847},{"id":"https://openalex.org/keywords/medicine","display_name":"Medicine","score":0.04621928930282593}],"concepts":[{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.7395864725112915},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5156890153884888},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.506261944770813},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.41085508465766907},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.30425137281417847},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.04621928930282593},{"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/C199343813","wikidata":"https://www.wikidata.org/wiki/Q12128","display_name":"Dentistry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1305/ndjfl/1093956751","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093956751","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-2/issue-1/Nueva-demostracion-de-la-completicidad-funcional-del-calculo-proposicional-bivalente/10.1305/ndjfl/1093956751.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/1093956751","is_oa":false,"landing_page_url":"https://projecteuclid.org/euclid.ndjfl/1093956751","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"}],"best_oa_location":{"id":"doi:10.1305/ndjfl/1093956751","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093956751","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-2/issue-1/Nueva-demostracion-de-la-completicidad-funcional-del-calculo-proposicional-bivalente/10.1305/ndjfl/1093956751.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":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.6200000047683716}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2044741118.pdf","grobid_xml":"https://content.openalex.org/works/W2044741118.grobid-xml"},"referenced_works_count":1,"referenced_works":["https://openalex.org/W2320524668"],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W4376122595","https://openalex.org/W2073983920","https://openalex.org/W2485140362"],"abstract_inverted_index":{"1.":[0],"Intro":[1],"due":[2],"cidn.":[3],"Por":[4],"completicidad":[5],"funcional":[6],"del":[7,112,133,167],"calculo":[8,134,168],"proposition":[9],"al":[10],"bivalente":[11],"entendemos":[12],"la":[13,75,78,93,110,120,131,141,160,187,203],"posibilidad":[14],"de":[15,22,28,32,60,77,98,102,122,143,159,174,182,188,208],"expresar":[16],"en":[17,40,68,72,81,115,130,138,185,198,205],"el":[18,43],"mismo,":[19],"por":[20,96],"medio":[21,97],"implicacin":[23],"y":[24,104,135,177],"negacin,":[25],"toda":[26],"funcin":[27],"verdad;":[29],"se":[30,70,83,163,195],"trata":[31],"un":[33,65,87,99],"resultado":[34],"bien":[35,56,109,153,193],"conocido":[36],"que":[37,53,154,191,206],"permite":[38],"estudiar":[39],"forma":[41,73,204],"sistematica":[42],"mismo":[44],"problema":[45],"con":[46,147],"relacin":[47],"a":[48,85,216],"otros":[49],"conectivos.":[50],"La":[51],"demostracin":[52],"ofrecemos":[54],"si":[55,192],"no":[57,194],"difiere":[58],"esencialmente":[59],"las":[61,125,179],"conocidas":[62],"1":[63],"ofrece":[64],"cierto":[66,116],"interes":[67],"cuanto":[69],"utiliza":[71],"especial":[74,186],"tecnica":[76],"lgica":[79,94,161],"combinatoria:":[80],"realidad":[82],"llega":[84],"construir":[86],"sistema":[88,113],"simblico":[89],"perfectamente":[90],"adecuado":[91],"para":[92],"proposicional":[95],"numero":[100],"finito":[101],"constantes":[103],"sin":[105,128],"utilizar":[106],"variables.":[107,148],"Si":[108],"definicin":[111],"es":[114],"sentido":[117],"arbitraria,":[118],"tiene":[119],"ventaja":[121],"excluir":[123],"totalmente":[124],"expresiones":[126],"formales":[127],"significacin":[129],"interpretacin":[132,170],"ademas":[136],"refleja":[137],"otro":[139],"nivel":[140],"estructura":[142],"los":[144],"sistemas":[145],"formulados":[146],"Cabe":[149],"sealar":[150],"t":[151],"am":[152],"extendiendo":[155],"algunas":[156],"nociones":[157,180],"tpicas":[158],"combinatoria":[162],"logra":[164],"integrar":[165],"dentro":[166],"su":[169,213],"semantica":[171],"permitiendo":[172],"definir":[173],"manera":[175],"simple":[176],"directa":[178],"propias":[181],"esta":[183],"lgica,":[184],"tautologa,":[189],"tarea":[190],"ha":[196,207],"tocado":[197],"este":[199],"trabajo":[200],"resulta":[201],"evidente":[202],"ser":[209],"orientada,":[210],"asi":[211],"como":[212],"posible":[214],"extension":[215],"calculos":[217],"polivalentes.":[218]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}