{"id":"https://openalex.org/W2031622757","doi":"https://doi.org/10.2307/2272265","title":"Weak liberated versions of <i>T</i> and <i>S</i>4","display_name":"Weak liberated versions of <i>T</i> and <i>S</i>4","publication_year":1975,"publication_date":"1975-03-01","ids":{"openalex":"https://openalex.org/W2031622757","doi":"https://doi.org/10.2307/2272265","mag":"2031622757"},"language":"en","primary_location":{"id":"doi:10.2307/2272265","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2272265","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Symbolic Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5104060065","display_name":"Charles G. Morgan","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":"Charles G. Morgan","raw_affiliation_strings":["University of Alberta, Edmonton, Canada","University of Alberta"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Alberta, Edmonton, Canada","institution_ids":["https://openalex.org/I154425047"]},{"raw_affiliation_string":"University of Alberta","institution_ids":["https://openalex.org/I154425047"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5104060065"],"corresponding_institution_ids":["https://openalex.org/I154425047"],"apc_list":null,"apc_paid":null,"fwci":5.6003,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.95006107,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":"40","issue":"1","first_page":"25","last_page":"30"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10034","display_name":"Syntax, Semantics, Linguistic Variation","score":0.9717000126838684,"subfield":{"id":"https://openalex.org/subfields/1203","display_name":"Language and Linguistics"},"field":{"id":"https://openalex.org/fields/12","display_name":"Arts and Humanities"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10034","display_name":"Syntax, Semantics, Linguistic Variation","score":0.9717000126838684,"subfield":{"id":"https://openalex.org/subfields/1203","display_name":"Language and Linguistics"},"field":{"id":"https://openalex.org/fields/12","display_name":"Arts and Humanities"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.963699996471405,"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.9498999714851379,"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/possible-world","display_name":"Possible world","score":0.7902329564094543},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.7215826511383057},{"id":"https://openalex.org/keywords/reflexivity","display_name":"Reflexivity","score":0.7055180072784424},{"id":"https://openalex.org/keywords/modal","display_name":"Modal","score":0.6928849220275879},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.6228809952735901},{"id":"https://openalex.org/keywords/independence","display_name":"Independence (probability theory)","score":0.5819646716117859},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.483534574508667},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45133334398269653},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.4428901672363281},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3722444474697113},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32768720388412476},{"id":"https://openalex.org/keywords/epistemology","display_name":"Epistemology","score":0.2669476866722107},{"id":"https://openalex.org/keywords/philosophy","display_name":"Philosophy","score":0.18498021364212036},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.17940357327461243},{"id":"https://openalex.org/keywords/sociology","display_name":"Sociology","score":0.1215391755104065},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.05803656578063965},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.05673420429229736}],"concepts":[{"id":"https://openalex.org/C136172866","wikidata":"https://www.wikidata.org/wiki/Q1088088","display_name":"Possible world","level":2,"score":0.7902329564094543},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.7215826511383057},{"id":"https://openalex.org/C13200473","wikidata":"https://www.wikidata.org/wiki/Q2747831","display_name":"Reflexivity","level":2,"score":0.7055180072784424},{"id":"https://openalex.org/C71139939","wikidata":"https://www.wikidata.org/wiki/Q910194","display_name":"Modal","level":2,"score":0.6928849220275879},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.6228809952735901},{"id":"https://openalex.org/C35651441","wikidata":"https://www.wikidata.org/wiki/Q625303","display_name":"Independence (probability theory)","level":2,"score":0.5819646716117859},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.483534574508667},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45133334398269653},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.4428901672363281},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3722444474697113},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32768720388412476},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.2669476866722107},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.18498021364212036},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.17940357327461243},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.1215391755104065},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.05803656578063965},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.05673420429229736},{"id":"https://openalex.org/C36289849","wikidata":"https://www.wikidata.org/wiki/Q34749","display_name":"Social science","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"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":1,"locations":[{"id":"doi:10.2307/2272265","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2272265","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Symbolic Logic","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.5400000214576721,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2005669541","https://openalex.org/W2144347980","https://openalex.org/W2163751633"],"related_works":["https://openalex.org/W4293241344","https://openalex.org/W2361927408","https://openalex.org/W3216203496","https://openalex.org/W3215481272","https://openalex.org/W3217021367","https://openalex.org/W1534228546","https://openalex.org/W4235632596","https://openalex.org/W2018512069","https://openalex.org/W4388256352","https://openalex.org/W2185432772"],"abstract_inverted_index":{"Abstract":[0],"The":[1,42,59],"usual":[2],"semantics":[3,60],"for":[4],"the":[5,17,51,64,70],"modal":[6,31],"systems":[7,32,43],"T":[8,55],",":[9],"S":[10,13,57],"4,":[11],"and":[12,56,69,85],"5":[14],"assumes":[15],"that":[16],"set":[18],"of":[19,29,54,66,82],"possible":[20,67],"worlds":[21,74],"contains":[22],"at":[23],"least":[24],"one":[25],"member.":[26],"Recently":[27],"versions":[28,53],"these":[30],"have":[33],"been":[34],"developed":[35],"in":[36],"which":[37],"this":[38],"assumption":[39],"is":[40,75],"dropped.":[41],"discussed":[44],"here":[45],"are":[46,88],"obtained":[47],"by":[48],"slightly":[49],"weakening":[50],"liberated":[52],"4.":[58],"does":[61],"not":[62],"assume":[63],"existence":[65],"worlds,":[68],"accessibility":[71],"relation":[72],"between":[73],"only":[76],"required":[77],"to":[78],"be":[79],"quasi-reflexive":[80],"instead":[81],"reflexive.":[83],"Completeness":[84],"independence":[86],"results":[87],"established.":[89]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}