{"id":"https://openalex.org/W6889841564","doi":"https://doi.org/10.26204/kluedo/9049","title":"Ramsey Quantifiers in First-Order Logic","display_name":"Ramsey Quantifiers in First-Order Logic","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W6889841564","doi":"https://doi.org/10.26204/kluedo/9049"},"language":"en","primary_location":{"id":"pmh:oai:kluedo.ub.rptu.de:9049","doi":null,"is_oa":true,"landing_page_url":"https://kluedo.ub.rptu.de/frontdoor/index/index/docId/9049","pdf_url":"https://kluedo.ub.rptu.de/files/9049/PhD-Thesis-Pascal-Bergstraesser.pdf","source":{"id":"https://openalex.org/S4306402046","display_name":"Publication Server of Kaiserslautern University of Technology (Kaiserslautern University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I153267046","host_organization_name":"University of Kaiserslautern","host_organization_lineage":["https://openalex.org/I153267046"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"doctoralthesis"},"volume":null,"type":"dissertation","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://kluedo.ub.rptu.de/files/9049/PhD-Thesis-Pascal-Bergstraesser.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021279817","display_name":"Pascal Bergstr\u00e4\u00dfer","orcid":"https://orcid.org/0000-0002-4681-2149","observed_orcids":["https://orcid.org/0000-0002-4681-2149"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Bergstr\u00e4\u00dfer, Pascal","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-4681-2149","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5021279817"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"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/T10142","display_name":"Formal Methods in Verification","score":0.8568999767303467,"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/T10142","display_name":"Formal Methods in Verification","score":0.8568999767303467,"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.11680000275373459,"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.01720000058412552,"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/infinite-state-systems","display_name":"infinite-state systems","score":0.6150000095367432},{"id":"https://openalex.org/keywords/liveness-detection","display_name":"liveness detection","score":0.9879999756813049},{"id":"https://openalex.org/keywords/automatic-structures","display_name":"automatic structures","score":0.75},{"id":"https://openalex.org/keywords/linear-arithmetic","display_name":"linear arithmetic","score":0.843999981880188},{"id":"https://openalex.org/keywords/quantifier-elimination","display_name":"quantifier elimination","score":0.859000027179718},{"id":"https://openalex.org/keywords/smt-solvers","display_name":"SMT solvers","score":0.8980000019073486},{"id":"https://openalex.org/keywords/one-counter-automata","display_name":"one-counter automata","score":0.9269999861717224},{"id":"https://openalex.org/keywords/vector-addition-systems-with-states","display_name":"vector addition systems with states","score":0.9300000071525574},{"id":"https://openalex.org/keywords/regular-languages","display_name":"regular languages","score":0.6110000014305115},{"id":"https://openalex.org/keywords/decidability","display_name":"decidability","score":0.4009999930858612}],"concepts":[{"id":"https://openalex.org/C15569618","wikidata":"https://www.wikidata.org/wiki/Q3561421","display_name":"Liveness","level":2,"score":0.8517000079154968},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5785999894142151},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5676000118255615},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.5453000068664551},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.503600001335144},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.45680001378059387},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.4275999963283539},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.4174000024795532},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4124999940395355},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4117000102996826},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.40220001339912415},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3882000148296356},{"id":"https://openalex.org/C2780654840","wikidata":"https://www.wikidata.org/wiki/Q333341","display_name":"Abstract interpretation","level":2,"score":0.38429999351501465},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3465000092983246},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.3456000089645386},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3400000035762787},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.33559998869895935},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.31189998984336853},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.3116999864578247},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.31150001287460327},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3100999891757965},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.30889999866485596},{"id":"https://openalex.org/C2778523021","wikidata":"https://www.wikidata.org/wiki/Q5532504","display_name":"Quantifier (linguistics)","level":2,"score":0.3077000081539154},{"id":"https://openalex.org/C33054407","wikidata":"https://www.wikidata.org/wiki/Q6504747","display_name":"Software verification","level":5,"score":0.3057999908924103},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.3034000098705292},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.3012000024318695},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.2953000068664551},{"id":"https://openalex.org/C159718280","wikidata":"https://www.wikidata.org/wiki/Q5526353","display_name":"Gas meter prover","level":3,"score":0.2840999960899353},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.2800000011920929},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.27970001101493835},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.27880001068115234},{"id":"https://openalex.org/C32278780","wikidata":"https://www.wikidata.org/wiki/Q1849020","display_name":"Quantifier elimination","level":2,"score":0.275299996137619},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.26930001378059387},{"id":"https://openalex.org/C195344581","wikidata":"https://www.wikidata.org/wiki/Q2555318","display_name":"Automated reasoning","level":2,"score":0.2671000063419342},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.25529998540878296},{"id":"https://openalex.org/C202973057","wikidata":"https://www.wikidata.org/wiki/Q7380130","display_name":"Runtime verification","level":3,"score":0.2549000084400177},{"id":"https://openalex.org/C28077239","wikidata":"https://www.wikidata.org/wiki/Q841728","display_name":"Linear logic","level":2,"score":0.2533000111579895}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:kluedo.ub.rptu.de:9049","doi":null,"is_oa":true,"landing_page_url":"https://kluedo.ub.rptu.de/frontdoor/index/index/docId/9049","pdf_url":"https://kluedo.ub.rptu.de/files/9049/PhD-Thesis-Pascal-Bergstraesser.pdf","source":{"id":"https://openalex.org/S4306402046","display_name":"Publication Server of Kaiserslautern University of Technology (Kaiserslautern University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I153267046","host_organization_name":"University of Kaiserslautern","host_organization_lineage":["https://openalex.org/I153267046"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"doctoralthesis"},{"id":"doi:10.26204/kluedo/9049","doi":"https://doi.org/10.26204/kluedo/9049","is_oa":true,"landing_page_url":"https://doi.org/10.26204/kluedo/9049","pdf_url":null,"source":{"id":"https://openalex.org/S7407052988","display_name":"Technische Universit\u00e4t Kaiserslautern","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"thesis"}],"best_oa_location":{"id":"pmh:oai:kluedo.ub.rptu.de:9049","doi":null,"is_oa":true,"landing_page_url":"https://kluedo.ub.rptu.de/frontdoor/index/index/docId/9049","pdf_url":"https://kluedo.ub.rptu.de/files/9049/PhD-Thesis-Pascal-Bergstraesser.pdf","source":{"id":"https://openalex.org/S4306402046","display_name":"Publication Server of Kaiserslautern University of Technology (Kaiserslautern University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I153267046","host_organization_name":"University of Kaiserslautern","host_organization_lineage":["https://openalex.org/I153267046"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"doctoralthesis"},"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W6889841564.pdf","grobid_xml":"https://content.openalex.org/works/W6889841564.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"verification":[1,52,70,78,88,250],"of":[2,14,38,71,110,121,145,235,255,303,318,351,378,381],"software":[3],"correctness":[4],"is":[5,53,68,142,177,183,309,372],"becoming":[6],"increasingly":[7],"important":[8],"due":[9],"to":[10,46,82,314],"the":[11,69,119,125,143,181,208,221,233,301,349],"widespread":[12],"use":[13,234],"computers,":[15],"particularly":[16],"in":[17,65,124,131,159,190,202,217,227,335,348,354],"safety-critical":[18],"environments.":[19],"Many":[20],"complex":[21],"systems":[22,49,288],"(such":[23],"as":[24,47],"those":[25],"involving":[26],"numeric":[27],"data":[28],"types,":[29],"recursion,":[30],"or":[31,179],"multithreading)":[32],"naturally":[33],"exhibit":[34],"an":[35,54,241],"unbounded":[36],"number":[37],"program":[39],"states":[40],"(a.k.a.":[41],"configurations).":[42],"These":[43],"are":[44,105,152,198],"referred":[45],"infinite-state":[48,256],"and":[50,73,150,224,275,291,340],"their":[51,225],"active":[55],"research":[56],"area":[57],"with":[58,268,289],"numerous":[59],"unresolved":[60],"problems.":[61],"A":[62],"key":[63],"focus":[64],"this":[66],"field":[67],"safety":[72,77],"liveness":[74,87,103,249,277],"properties.":[75],"While":[76],"can":[79,156,211],"be":[80,157,212,333],"reduced":[81],"reachability":[83,267],"via":[84],"finite":[85,376],"paths,":[86],"involves":[89],"reasoning":[90],"about":[91],"infinite":[92,122],"executions,":[93],"making":[94],"it":[95],"considerably":[96],"more":[97,191],"challenging.":[98],"Most":[99],"approaches":[100],"for":[101,107,248,265,278,331],"checking":[102,304,364],"properties":[104],"devised":[106],"specific":[108,192],"classes":[109],"systems.":[111,257],"We":[112,135,185,205,343,358],"study":[113,187],"so-called":[114],"Ramsey":[115,154,188,209],"quantifiers,":[116],"which":[117,141],"state":[118],"existence":[120],"cliques":[123],"graph":[126],"defined":[127],"by":[128],"a":[129,167,172,245,252,295,306,315,324,361,366,375],"formula,":[130],"various":[132],"first-order":[133,146],"theories.":[134,193],"show":[136,206],"that":[137,207],"over":[138,196,220,272],"automatic":[139],"structures,":[140],"class":[144],"structures":[147],"whose":[148],"domain":[149],"relations":[151,164,274],"regular,":[153],"quantifiers":[155,189],"evaluated":[158],"logarithmic":[160],"space.":[161],"For":[162,258],"tree-regular":[163],"we":[165,243,260,299],"give":[166],"polynomial-time":[168],"evaluation":[169],"algorithm":[170],"if":[171,180],"deterministic":[173],"bottom-up":[174],"tree":[175],"automaton":[176],"provided":[178],"relation":[182,367],"transitive.":[184],"furthermore":[186],"Linear":[194],"arithmetics":[195],"integers/reals":[197],"prominent":[199],"theories":[200],"featured":[201],"SMT":[203,238],"solvers.":[204,239],"quantifier":[210,341],"eliminated":[213],"from":[214],"existential":[215],"formulas":[216,353],"linear":[218,276,355],"arithmetic":[219],"integers,":[222],"reals,":[223],"mixture":[226],"polynomial":[228],"time.":[229],"This":[230],"directly":[231],"enables":[232],"highly":[236],"optimized":[237],"As":[240,294],"application,":[242,298],"provide":[244],"general":[246],"framework":[247],"across":[251],"wide":[253],"range":[254],"example,":[259,332],"prove":[261,344],"precise":[262,345],"complexity":[263,346],"results":[264,347],"recurrent":[266],"generalized":[269],"B\u00fcchi":[270],"condition":[271],"(tree-)regular":[273,382],"succinct":[279],"one-counter":[280],"automata,":[281],"reversal-bounded":[282],"counter":[283],"machines,":[284],"continuous":[285],"vector":[286],"addition":[287],"states,":[290],"Parikh":[292],"automata.":[293],"second":[296],"major":[297],"identify":[300],"problem":[302],"whether":[305,365],"given":[307],"formula":[308],"monadically":[310],"decomposable,":[311],"i.e.":[312,374],"equivalent":[313],"Boolean":[316],"combination":[317],"formulas,":[319],"each":[320],"depending":[321],"only":[322],"on":[323,368],"single":[325],"free":[326],"variable.":[327],"Monadic":[328],"decompositions":[329],"can,":[330],"used":[334],"constraint":[336],"databases,":[337],"string":[338],"analysis,":[339],"elimination.":[342],"case":[350],"quantifier-free":[352],"integer/real":[356],"arithmetic.":[357],"additionally":[359],"explore":[360],"related":[362],"problem:":[363],"words":[369],"(resp.":[370],"trees)":[371],"(tree-)recognizable,":[373],"union":[377],"Cartesian":[379],"products":[380],"languages.":[383]},"counts_by_year":[],"updated_date":"2026-10-12T09:40:04.860316","created_date":"2025-10-10T00:00:00"}