{"id":"https://openalex.org/W6889357285","doi":"https://doi.org/10.25596/jalc-1999-229","title":"An Automata Theoretic Decidability Proof for First-Order Theory of \u27e8\u2115,","display_name":"An Automata Theoretic Decidability Proof for First-Order Theory of \u27e8\u2115,","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W6889357285","doi":"https://doi.org/10.25596/jalc-1999-229"},"language":"en","primary_location":{"id":"doi:10.25596/jalc-1999-229","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-1999-229","pdf_url":null,"source":{"id":"https://openalex.org/S7407052944","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","issn_l":null,"issn":[],"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.25596/jalc-1999-229","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Maes, Arnaud","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Maes, Arnaud","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.43481738,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.7921000123023987,"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/T11567","display_name":"semigroups and automata theory","score":0.7921000123023987,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.08560000360012054,"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/T10142","display_name":"Formal Methods in Verification","score":0.04960000142455101,"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/decidability","display_name":"Decidability","score":0.8877000212669373},{"id":"https://openalex.org/keywords/morphism","display_name":"Morphism","score":0.6789000034332275},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.5795000195503235},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4810999929904938},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.45249998569488525},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.4250999987125397},{"id":"https://openalex.org/keywords/model-theory","display_name":"Model theory","score":0.4025999903678894},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.35580000281333923}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8877000212669373},{"id":"https://openalex.org/C137212723","wikidata":"https://www.wikidata.org/wiki/Q1948412","display_name":"Morphism","level":2,"score":0.6789000034332275},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6771000027656555},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.5795000195503235},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5139999985694885},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4810999929904938},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.45249998569488525},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.4250999987125397},{"id":"https://openalex.org/C47030870","wikidata":"https://www.wikidata.org/wiki/Q467606","display_name":"Model theory","level":2,"score":0.4025999903678894},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.35580000281333923},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.3517000079154968},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3495999872684479},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.3278999924659729},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.29809999465942383},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.29159998893737793},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.29089999198913574},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.27469998598098755},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.26759999990463257},{"id":"https://openalex.org/C203264685","wikidata":"https://www.wikidata.org/wiki/Q2328174","display_name":"Atomic formula","level":2,"score":0.258899986743927},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.2558000087738037},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.251800000667572},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.25049999356269836}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.25596/jalc-1999-229","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-1999-229","pdf_url":null,"source":{"id":"https://openalex.org/S7407052944","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","issn_l":null,"issn":[],"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.25596/jalc-1999-229","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-1999-229","pdf_url":null,"source":{"id":"https://openalex.org/S7407052944","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","issn_l":null,"issn":[],"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,18],"show":[1],"connections":[2,21],"between":[3],"morphisms":[4],"on":[5,9],"words":[6],"and":[7,13],"pictures":[8],"a":[10,28],"finite":[11,14],"alphabet":[12],"deterministic":[15],"incomplete":[16],"automata.":[17],"use":[19],"these":[20],"to":[22],"re-prove,":[23],"in":[24],"terms":[25],"of":[26,35],"automata,":[27],"decidability":[29],"result":[30],"about":[31],"the":[32,36],"first-order":[33],"theory":[34],"structures":[37],"$\\langle":[38],"\\mathbb{N},\\lt,P\\rangle$":[39],"for":[40],"multi-ary":[41],"morphic":[42],"predicates":[43],"$P$.":[44]},"counts_by_year":[],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}