{"id":"https://openalex.org/W1964290203","doi":"https://doi.org/10.1305/ndjfl/1093891002","title":"On generating the finitely satisfiable formulas.","display_name":"On generating the finitely satisfiable formulas.","publication_year":1973,"publication_date":"1973-07-01","ids":{"openalex":"https://openalex.org/W1964290203","doi":"https://doi.org/10.1305/ndjfl/1093891002","mag":"1964290203"},"language":"en","primary_location":{"id":"doi:10.1305/ndjfl/1093891002","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093891002","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-14/issue-3/On-generating-the-finitely-satisfiable-formulas/10.1305/ndjfl/1093891002.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-14/issue-3/On-generating-the-finitely-satisfiable-formulas/10.1305/ndjfl/1093891002.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041520428","display_name":"Arthur M. Bullock","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Arthur M. Bullock","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5041294923","display_name":"Hubert H. Schneider","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hubert H. Schneider","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5041520428"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.09755476,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"14","issue":"3","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11727","display_name":"Advanced Algebra and Logic","score":0.6578999757766724,"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"}},"topics":[{"id":"https://openalex.org/T11727","display_name":"Advanced Algebra and Logic","score":0.6578999757766724,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.5921000242233276,"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/mathematics","display_name":"Mathematics","score":0.5033597350120544},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.399058997631073}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5033597350120544},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.399058997631073}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1305/ndjfl/1093891002","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093891002","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-14/issue-3/On-generating-the-finitely-satisfiable-formulas/10.1305/ndjfl/1093891002.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/1093891002","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.ndjfl/1093891002","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/1093891002","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093891002","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-14/issue-3/On-generating-the-finitely-satisfiable-formulas/10.1305/ndjfl/1093891002.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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1964290203.pdf","grobid_xml":"https://content.openalex.org/works/W1964290203.grobid-xml"},"referenced_works_count":2,"referenced_works":["https://openalex.org/W1809048060","https://openalex.org/W4244028915"],"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/W1587224694","https://openalex.org/W2911598644","https://openalex.org/W2042127053"],"abstract_inverted_index":{"Results":[0],"by":[1,58],"B.":[2],"Trahtenbrot":[3],"[4]":[4],"and":[5,68],"Th.":[6],"Hailperin":[7],"In":[8],"this":[9],"paper":[10,84],"we":[11,70],"shall":[12,71],"present":[13],"a":[14,37],"system":[15,35],"1":[16],"which":[17,25],"generates":[18],"all":[19,53],"formulas":[20,51,74,88],"of":[21,39,60,63,75,89],"first-order":[22,77,90],"predicate":[23,78,91],"logic":[24,79,92],"are":[26,52],"satisfiable":[27,50],"in":[28,44,66],"some":[29],"non-empty":[30],"finite":[31,42],"individual":[32],"domain.":[33],"The":[34],"forms":[36],"kind":[38],"calculus":[40],"for":[41],"satisfiability":[43],"the":[45,48,76],"sense":[46],"that":[47],"finitely":[49],"obtainable":[54],"from":[55],"certain":[56],"\"axioms\"":[57],"means":[59],"several":[61],"\"rules":[62],"inference.\"":[64],"As":[65],"[3]":[67],"[4],":[69],"consider":[72],"only":[73],"without":[80],"identity.":[81,94],"A":[82],"forthcoming":[83],"will":[85],"deal":[86],"with":[87,93]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}