{"id":"https://openalex.org/W7168373595","doi":"https://doi.org/10.4230/lipics.fscd.2026.18","title":"Ground Stratified Inductive Definitions","display_name":"Ground Stratified Inductive Definitions","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7168373595","doi":"https://doi.org/10.4230/lipics.fscd.2026.18"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26368","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2026.18","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol378-fscd2026/LIPIcs.FSCD.2026.18/LIPIcs.FSCD.2026.18.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol378-fscd2026/LIPIcs.FSCD.2026.18/LIPIcs.FSCD.2026.18.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5140849586","display_name":"Nathan Guermond","orcid":"https://orcid.org/0009-0005-0169-8142"},"institutions":[{"id":"https://openalex.org/I4210101327","display_name":"Twin Cities Orthopedics","ror":"https://ror.org/01en4s460","country_code":"US","type":"healthcare","lineage":["https://openalex.org/I4210101327"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guermond, Nathan","raw_affiliation_strings":["University of Minnesota Twin-Cities, USA"],"raw_orcid":"https://orcid.org/0009-0005-0169-8142","affiliations":[{"raw_affiliation_string":"University of Minnesota Twin-Cities, USA","institution_ids":["https://openalex.org/I4210101327"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5140832769","display_name":"Gopalan Nadathur","orcid":"https://orcid.org/0000-0001-8456-3369"},"institutions":[{"id":"https://openalex.org/I4210101327","display_name":"Twin Cities Orthopedics","ror":"https://ror.org/01en4s460","country_code":"US","type":"healthcare","lineage":["https://openalex.org/I4210101327"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nadathur, Gopalan","raw_affiliation_strings":["University of Minnesota Twin-Cities, USA"],"raw_orcid":"https://orcid.org/0000-0001-8456-3369","affiliations":[{"raw_affiliation_string":"University of Minnesota Twin-Cities, USA","institution_ids":["https://openalex.org/I4210101327"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210101327"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.87124576,"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":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.6722999811172485,"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/T10126","display_name":"Logic, programming, and type systems","score":0.6722999811172485,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.2815999984741211,"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/T10258","display_name":"Philosophy and Theoretical Science","score":0.008500000461935997,"subfield":{"id":"https://openalex.org/subfields/3205","display_name":"Experimental and Cognitive Psychology"},"field":{"id":"https://openalex.org/fields/32","display_name":"Psychology"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.6273000240325928},{"id":"https://openalex.org/keywords/predicate-variable","display_name":"Predicate variable","score":0.5248000025749207},{"id":"https://openalex.org/keywords/predicate-logic","display_name":"Predicate logic","score":0.4871000051498413},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.4162999987602234},{"id":"https://openalex.org/keywords/predicate-transformer-semantics","display_name":"Predicate transformer semantics","score":0.4018999934196472},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.39489999413490295},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.35600000619888306},{"id":"https://openalex.org/keywords/first-order-logic","display_name":"First-order logic","score":0.35580000281333923},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.3425000011920929}],"concepts":[{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.6273000240325928},{"id":"https://openalex.org/C73314972","wikidata":"https://www.wikidata.org/wiki/Q10531432","display_name":"Predicate variable","level":5,"score":0.5248000025749207},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49900001287460327},{"id":"https://openalex.org/C19689857","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"Predicate logic","level":3,"score":0.4871000051498413},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.4162999987602234},{"id":"https://openalex.org/C30128091","wikidata":"https://www.wikidata.org/wiki/Q291929","display_name":"Predicate transformer semantics","level":4,"score":0.4018999934196472},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.39489999413490295},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36730000376701355},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36649999022483826},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.35600000619888306},{"id":"https://openalex.org/C100481476","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"First-order logic","level":2,"score":0.35580000281333923},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3425000011920929},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.33629998564720154},{"id":"https://openalex.org/C28077239","wikidata":"https://www.wikidata.org/wiki/Q841728","display_name":"Linear logic","level":2,"score":0.32420000433921814},{"id":"https://openalex.org/C527412718","wikidata":"https://www.wikidata.org/wiki/Q855395","display_name":"Interpretation (philosophy)","level":2,"score":0.32190001010894775},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.3163999915122986},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.3151000142097473},{"id":"https://openalex.org/C34849589","wikidata":"https://www.wikidata.org/wiki/Q4345785","display_name":"Atomic sentence","level":3,"score":0.31310001015663147},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30489999055862427},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29840001463890076},{"id":"https://openalex.org/C2780432614","wikidata":"https://www.wikidata.org/wiki/Q864213","display_name":"Conservative extension","level":2,"score":0.28700000047683716},{"id":"https://openalex.org/C192943249","wikidata":"https://www.wikidata.org/wiki/Q1893382","display_name":"Stratification (seeds)","level":5,"score":0.2842000126838684},{"id":"https://openalex.org/C2039508","wikidata":"https://www.wikidata.org/wiki/Q7239631","display_name":"Predicate functor logic","level":5,"score":0.2809000015258789},{"id":"https://openalex.org/C134752490","wikidata":"https://www.wikidata.org/wiki/Q374182","display_name":"Logical consequence","level":2,"score":0.2791000008583069},{"id":"https://openalex.org/C32241873","wikidata":"https://www.wikidata.org/wiki/Q236975","display_name":"Classical logic","level":2,"score":0.2718999981880188},{"id":"https://openalex.org/C2987642246","wikidata":"https://www.wikidata.org/wiki/Q5452196","display_name":"First order","level":2,"score":0.2709999978542328},{"id":"https://openalex.org/C178421362","wikidata":"https://www.wikidata.org/wiki/Q176786","display_name":"Intuitionistic logic","level":3,"score":0.25999999046325684},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.2500999867916107}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26368","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2026.18","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol378-fscd2026/LIPIcs.FSCD.2026.18/LIPIcs.FSCD.2026.18.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"pmh:doi:10.4230/lipics.fscd.2026.18","is_oa":true,"landing_page_url":"http://etda.libraries.psu.edu/theses/approved/WorldWideIndex/ETD-479/","pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},{"id":"doi:10.4230/lipics.fscd.2026.18","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.fscd.2026.18","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26368","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2026.18","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol378-fscd2026/LIPIcs.FSCD.2026.18/LIPIcs.FSCD.2026.18.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7168373595.pdf","grobid_xml":"https://content.openalex.org/works/W7168373595.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Logics":[0],"of":[1,60,118,148,163,176],"definitions":[2,10,56,91,138],"extend":[3],"first":[4],"order":[5,42],"intuitionistic":[6],"logic":[7,179],"with":[8,76],"fixed-point":[9,107,170],"which":[11,64,201],"associate":[12],"formulas":[13,19],"to":[14,33,45,72,124,157,166],"atomic":[15],"predicates.":[16],"These":[17],"associated":[18],"must":[20,69,153],"be":[21,34,70,103,155,158],"constrained":[22],"for":[23,98,134,195],"consistency.":[24,99],"In":[25],"the":[26,41,49,65,116,143,146,149,161,174,177,196,202],"original":[27],"formulation,":[28],"predicate":[29,66,150,204],"symbols":[30],"were":[31,43],"required":[32],"ordered":[35],"and":[36,92,180],"only":[37],"predicates":[38],"lower":[39],"in":[40,48,63,151,200],"allowed":[44,71],"appear":[46,73],"negatively":[47],"defining":[50],"formula.":[51],"This":[52],"constraint":[53,84],"renders":[54],"ineligible":[55],"such":[57,90,125],"as":[58],"those":[59],"logical":[61],"relations":[62],"being":[67],"defined":[68,207],"negatively,":[74],"albeit":[75],"smaller":[77],"arguments.":[78,212],"Tiu":[79],"has":[80,93],"formalized":[81],"a":[82,105,110,126,130,168,191],"weaker":[83],"called":[85],"ground":[86,135],"stratification":[87],"that":[88,95,139,145,189],"permits":[89],"shown":[94],"it":[96],"suffices":[97],"Definitions":[100],"can":[101],"also":[102],"given":[104],"least":[106,169],"interpretation":[108],"via":[109,186],"special":[111],"induction":[112,132],"rule.":[113],"We":[114,128,172],"address":[115],"question":[117,152],"whether":[119],"Tiu\u2019s":[120],"relaxation":[121],"carries":[122],"over":[123],"treatment.":[127],"propose":[129],"new":[131,184],"rule":[133],"stratified":[136,159],"inductive":[137],"takes":[140],"into":[141],"account":[142],"fact":[144],"definition":[147],"itself":[154],"considered":[156],"by":[160,208],"complexity":[162],"its":[164,183,211],"arguments":[165],"obtain":[167],"interpretation.":[171],"establish":[173],"consistency":[175],"resulting":[178],"we":[181],"illustrate":[182],"capabilities":[185],"an":[187],"example":[188],"encodes":[190],"strong":[192],"normalizability":[193],"proof":[194],"simply":[197],"typed":[198],"\u03bb-calculus":[199],"reducibility":[203],"is":[205],"inductively":[206],"recursion":[209],"on":[210]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-16T00:00:00"}