{"id":"https://openalex.org/W1530683985","doi":"https://doi.org/10.26686/ajl.v8i0.1812","title":"Boolean Conservative Extension Results for some Modal Relevant Logics","display_name":"Boolean Conservative Extension Results for some Modal Relevant Logics","publication_year":2010,"publication_date":"2010-09-22","ids":{"openalex":"https://openalex.org/W1530683985","doi":"https://doi.org/10.26686/ajl.v8i0.1812","mag":"1530683985"},"language":"en","primary_location":{"id":"doi:10.26686/ajl.v8i0.1812","is_oa":true,"landing_page_url":"https://doi.org/10.26686/ajl.v8i0.1812","pdf_url":"https://ojs.victoria.ac.nz/ajl/article/download/1812/1662","source":{"id":"https://openalex.org/S2765067559","display_name":"The Australasian Journal of Logic","issn_l":"1448-5052","issn":["1448-5052"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Australasian Journal of Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://ojs.victoria.ac.nz/ajl/article/download/1812/1662","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041213077","display_name":"Edwin Mares","orcid":"https://orcid.org/0000-0002-7899-1727"},"institutions":[{"id":"https://openalex.org/I41156924","display_name":"Victoria University of Wellington","ror":"https://ror.org/0040r6f76","country_code":"NZ","type":"education","lineage":["https://openalex.org/I41156924"]}],"countries":["NZ"],"is_corresponding":false,"raw_author_name":"Edwin D. Mares","raw_affiliation_strings":["Philosophy Programme and Centre for Logic, Language, and Computation, Victoria University of Wellington"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Philosophy Programme and Centre for Logic, Language, and Computation, Victoria University of Wellington","institution_ids":["https://openalex.org/I41156924"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002528469","display_name":"Koji Tanaka","orcid":"https://orcid.org/0000-0003-4747-3457"},"institutions":[{"id":"https://openalex.org/I154130895","display_name":"University of Auckland","ror":"https://ror.org/03b94tp07","country_code":"NZ","type":"education","lineage":["https://openalex.org/I154130895"]}],"countries":["NZ"],"is_corresponding":false,"raw_author_name":"Koji Tanaka","raw_affiliation_strings":["Philosophy Department, University of Auckland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Philosophy Department, University of Auckland","institution_ids":["https://openalex.org/I154130895"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.06541651,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":"8","issue":null,"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.9987000226974487,"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.9987000226974487,"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.9979000091552734,"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.9830999970436096,"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/negation","display_name":"Negation","score":0.8794934749603271},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.817310631275177},{"id":"https://openalex.org/keywords/modal","display_name":"Modal","score":0.7763156890869141},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5498695969581604},{"id":"https://openalex.org/keywords/modal-logic","display_name":"Modal logic","score":0.5083958506584167},{"id":"https://openalex.org/keywords/normal-modal-logic","display_name":"Normal modal logic","score":0.47797176241874695},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.38059213757514954},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36157673597335815},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.25378552079200745},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.14229437708854675}],"concepts":[{"id":"https://openalex.org/C2185349","wikidata":"https://www.wikidata.org/wiki/Q190558","display_name":"Negation","level":2,"score":0.8794934749603271},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.817310631275177},{"id":"https://openalex.org/C71139939","wikidata":"https://www.wikidata.org/wiki/Q910194","display_name":"Modal","level":2,"score":0.7763156890869141},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5498695969581604},{"id":"https://openalex.org/C27508121","wikidata":"https://www.wikidata.org/wiki/Q210841","display_name":"Modal logic","level":3,"score":0.5083958506584167},{"id":"https://openalex.org/C114092440","wikidata":"https://www.wikidata.org/wiki/Q840226","display_name":"Normal modal logic","level":4,"score":0.47797176241874695},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.38059213757514954},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36157673597335815},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.25378552079200745},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.14229437708854675},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C188027245","wikidata":"https://www.wikidata.org/wiki/Q750446","display_name":"Polymer chemistry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.26686/ajl.v8i0.1812","is_oa":true,"landing_page_url":"https://doi.org/10.26686/ajl.v8i0.1812","pdf_url":"https://ojs.victoria.ac.nz/ajl/article/download/1812/1662","source":{"id":"https://openalex.org/S2765067559","display_name":"The Australasian Journal of Logic","issn_l":"1448-5052","issn":["1448-5052"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Australasian Journal of Logic","raw_type":"journal-article"},{"id":"pmh:oai:ojs.victoria.ac.nz:article/1812","is_oa":false,"landing_page_url":"https://ojs.victoria.ac.nz/ajl/article/view/1812","pdf_url":null,"source":{"id":"https://openalex.org/S4306400695","display_name":"Australasian Association of Logic and the Centre for Logic, Language and Computation at Victoria University. - The Australasian Journal of Logic","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"1448-5052","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.174.6598","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.174.6598","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.philosophy.unimelb.edu.au/ajl/2010/2010_3.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.26686/ajl.v8i0.1812","is_oa":true,"landing_page_url":"https://doi.org/10.26686/ajl.v8i0.1812","pdf_url":"https://ojs.victoria.ac.nz/ajl/article/download/1812/1662","source":{"id":"https://openalex.org/S2765067559","display_name":"The Australasian Journal of Logic","issn_l":"1448-5052","issn":["1448-5052"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Australasian Journal of Logic","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.4699999988079071,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1530683985.pdf","grobid_xml":"https://content.openalex.org/works/W1530683985.grobid-xml"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W1969421328","https://openalex.org/W2002732107","https://openalex.org/W2002791110","https://openalex.org/W2014646251","https://openalex.org/W2034678120","https://openalex.org/W2058110538","https://openalex.org/W2082707306","https://openalex.org/W2084557622","https://openalex.org/W2107737957","https://openalex.org/W2162300758","https://openalex.org/W3128976560","https://openalex.org/W3196634150"],"related_works":["https://openalex.org/W4318188140","https://openalex.org/W2101793126","https://openalex.org/W3016746667","https://openalex.org/W1537541219","https://openalex.org/W1530784265","https://openalex.org/W1587059467","https://openalex.org/W2795425183","https://openalex.org/W4310201982","https://openalex.org/W119381390","https://openalex.org/W2028144918"],"abstract_inverted_index":{"This":[0],"paper":[1],"shows":[2],"that":[3],"a":[4],"collection":[5],"of":[6,16],"modal":[7],"relevant":[8],"logics":[9],"are":[10],"conservatively":[11],"extended":[12],"by":[13],"the":[14],"addition":[15],"Boolean":[17],"negation.":[18]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}