{"id":"https://openalex.org/W1608111826","doi":"https://doi.org/10.2307/2586728","title":"Kolmogorov complexity and symmetric relational structures","display_name":"Kolmogorov complexity and symmetric relational structures","publication_year":1998,"publication_date":"1998-09-01","ids":{"openalex":"https://openalex.org/W1608111826","doi":"https://doi.org/10.2307/2586728","mag":"1608111826"},"language":"en","primary_location":{"id":"doi:10.2307/2586728","is_oa":true,"landing_page_url":"https://doi.org/10.2307/2586728","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/CE01C98B331A4E58FF0CF952DB7B0F1D/S0022481200014754a.pdf/div-class-title-kolmogorov-complexity-and-symmetric-relational-structures-div.pdf","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":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/CE01C98B331A4E58FF0CF952DB7B0F1D/S0022481200014754a.pdf/div-class-title-kolmogorov-complexity-and-symmetric-relational-structures-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041719495","display_name":"Willem L. Fouch\u00e9","orcid":"https://orcid.org/0000-0003-0445-4221"},"institutions":[{"id":"https://openalex.org/I69552723","display_name":"University of Pretoria","ror":"https://ror.org/00g0p6g84","country_code":"ZA","type":"education","lineage":["https://openalex.org/I69552723"]}],"countries":["ZA"],"is_corresponding":false,"raw_author_name":"W. L. Fouch\u00e9","raw_affiliation_strings":["Department of Mathematics and Applied Mathematics, University of Pretoria, 0002 Pretoria, South Africa E-mail:","Department of Mathematics and Applied Mathematics, University of Pretoria, 0002 Pretoria, South Africa E-mail: wlfouche@math.up.ac.za"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Applied Mathematics, University of Pretoria, 0002 Pretoria, South Africa E-mail:","institution_ids":["https://openalex.org/I69552723"]},{"raw_affiliation_string":"Department of Mathematics and Applied Mathematics, University of Pretoria, 0002 Pretoria, South Africa E-mail: wlfouche@math.up.ac.za","institution_ids":["https://openalex.org/I69552723"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048573563","display_name":"Petrus H. Potgieter","orcid":"https://orcid.org/0000-0003-1785-761X"},"institutions":[{"id":"https://openalex.org/I165390105","display_name":"University of South Africa","ror":"https://ror.org/048cwvf49","country_code":"ZA","type":"education","lineage":["https://openalex.org/I165390105"]},{"id":"https://openalex.org/I69552723","display_name":"University of Pretoria","ror":"https://ror.org/00g0p6g84","country_code":"ZA","type":"education","lineage":["https://openalex.org/I69552723"]}],"countries":["ZA"],"is_corresponding":false,"raw_author_name":"P. H. Potgieter","raw_affiliation_strings":["Department of Quantitative Management, University of South Africa, Po Box 392, 0003 Pretoria, South Africa E-mail:","Department of Quantitative Management, University of South Africa, Po Box 392, 0003 Pretoria, South Africa E-mail: potgiph@alpha.unisa.ac.za"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Quantitative Management, University of South Africa, Po Box 392, 0003 Pretoria, South Africa E-mail:","institution_ids":["https://openalex.org/I165390105","https://openalex.org/I69552723"]},{"raw_affiliation_string":"Department of Quantitative Management, University of South Africa, Po Box 392, 0003 Pretoria, South Africa E-mail: potgiph@alpha.unisa.ac.za","institution_ids":["https://openalex.org/I165390105"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9741,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.72525072,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"63","issue":"3","first_page":"1083","last_page":"1094"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998999834060669,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998999834060669,"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/T11567","display_name":"semigroups and automata theory","score":0.9843999743461609,"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/T13720","display_name":"Benford\u2019s Law and Fraud Detection","score":0.9740999937057495,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/kolmogorov-complexity","display_name":"Kolmogorov complexity","score":0.7872205376625061},{"id":"https://openalex.org/keywords/kolmogorov-structure-function","display_name":"Kolmogorov structure function","score":0.6760526895523071},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5764274001121521},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5082482695579529},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4524865448474884},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.39300617575645447},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3726414442062378},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.34546661376953125},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32001474499702454},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.1435737907886505}],"concepts":[{"id":"https://openalex.org/C2779341405","wikidata":"https://www.wikidata.org/wiki/Q1456811","display_name":"Kolmogorov complexity","level":2,"score":0.7872205376625061},{"id":"https://openalex.org/C15995199","wikidata":"https://www.wikidata.org/wiki/Q5805968","display_name":"Kolmogorov structure function","level":3,"score":0.6760526895523071},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5764274001121521},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5082482695579529},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4524865448474884},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39300617575645447},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3726414442062378},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.34546661376953125},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32001474499702454},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.1435737907886505}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.2307/2586728","is_oa":true,"landing_page_url":"https://doi.org/10.2307/2586728","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/CE01C98B331A4E58FF0CF952DB7B0F1D/S0022481200014754a.pdf/div-class-title-kolmogorov-complexity-and-symmetric-relational-structures-div.pdf","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"},{"id":"pmh:oai:CULeuclid:euclid.jsl/1183745582","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.jsl/1183745582","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.342.2977","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.2977","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/cs/0402034v1.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.2307/2586728","is_oa":true,"landing_page_url":"https://doi.org/10.2307/2586728","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/CE01C98B331A4E58FF0CF952DB7B0F1D/S0022481200014754a.pdf/div-class-title-kolmogorov-complexity-and-symmetric-relational-structures-div.pdf","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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1608111826.pdf","grobid_xml":"https://content.openalex.org/works/W1608111826.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W76753297","https://openalex.org/W83139932","https://openalex.org/W998536193","https://openalex.org/W1605337124","https://openalex.org/W1638203394","https://openalex.org/W2001132147","https://openalex.org/W2005097301","https://openalex.org/W2018883342","https://openalex.org/W2036883974","https://openalex.org/W2050228009","https://openalex.org/W2067580807","https://openalex.org/W2095689360","https://openalex.org/W2165105466","https://openalex.org/W2567782165","https://openalex.org/W2598159508","https://openalex.org/W2799061192","https://openalex.org/W4213328692"],"related_works":["https://openalex.org/W4246258635","https://openalex.org/W265666130","https://openalex.org/W636594073","https://openalex.org/W4360890123","https://openalex.org/W226726922","https://openalex.org/W4281775308","https://openalex.org/W2571335838","https://openalex.org/W2548376734","https://openalex.org/W3197899920","https://openalex.org/W2084660617"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"study":[2],"partitions":[3,15],"of":[4,7,9,28],"Fra\u00efss\u00e9":[5],"limits":[6],"classes":[8],"finite":[10],"relational":[11],"structures":[12],"where":[13],"the":[14,26],"are":[16,23],"encoded":[17],"by":[18],"infinite":[19],"binary":[20],"strings":[21],"which":[22],"random":[24],"in":[25],"sense":[27],"Kolmogorov-Chaitin.":[29]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}