{"id":{"repo_id":"penn","oai_identifier":"oai:repository.upenn.edu:20.500.14332/60270"},"canonical_url":"https://search.dev.ndltd.org/etd/penn/oai:repository.upenn.edu:20.500.14332/60270","repository":{"repo_id":"penn","name":"University of Pennsylvania","base_url":"https://repository.upenn.edu/server/oai/request"},"display":{"title":"Subexponentials in Nonassociative Lambek Calculus","abstract":"We focus on a family on noncommutative nonassociative substructural logics enriched with subexponentials, unary modalities licensing local application of structural rules. Primarily, we prove upper and lower bounds on complexity of provability in a broad class of these logics. To uniformly frame these results, we present two sets of rules, one intuitionistic and one classical, with the intention of capturing a broad subset of existing logics as fragments. We also prove equivalences of these systems in natural settings.","abstract_html":"We focus on a family on noncommutative nonassociative substructural logics enriched with subexponentials, unary modalities licensing local application of structural rules. Primarily, we prove upper and lower bounds on complexity of provability in a broad class of these logics. To uniformly frame these results, we present two sets of rules, one intuitionistic and one classical, with the intention of capturing a broad subset of existing logics as fragments. We also prove equivalences of these systems in natural settings.","abstract_has_math":false,"creators":["Blaisdell, Eben"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":["Scedrov, Andre"],"committee_chairs":[],"committee_members":[],"year":2024,"date_issued":"2024","date_published":"2024","updated_at":"2026-07-24T03:45:15Z","subjects":["Mathematics"],"languages":["en"],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://repository.upenn.edu/handle/20.500.14332/60270","outbound_label":"Repository record","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Scedrov, Andre"]},{"key":"dc:creator","label":"Author","values":["Blaisdell, Eben"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2024-06-18T14:32:07Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2024-06-18T14:32:07Z"]},{"key":"dc:date.issued","label":"Date","values":["2024"]},{"key":"dc:type","label":"Dc Type","values":["Dissertation/Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://repository.upenn.edu/handle/20.500.14332/60270"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["We focus on a family on noncommutative nonassociative substructural logics enriched with subexponentials, unary modalities licensing local application of structural rules. Primarily, we prove upper and lower bounds on complexity of provability in a broad class of these logics. To uniformly frame these results, we present two sets of rules, one intuitionistic and one classical, with the intention of capturing a broad subset of existing logics as fragments. We also prove equivalences of these systems in natural settings."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Doctor of Philosophy (PhD)"]},{"key":"dc:title","label":"Title","values":["Subexponentials in Nonassociative Lambek Calculus"]}]}],"canonical_facts":{"dc:contributor.advisor":["Scedrov, Andre"],"dc:creator":["Blaisdell, Eben"],"dc:date.accessioned":["2024-06-18T14:32:07Z"],"dc:date.available":["2024-06-18T14:32:07Z"],"dc:date.issued":["2024"],"dc:description.abstract":["We focus on a family on noncommutative nonassociative substructural logics enriched with subexponentials, unary modalities licensing local application of structural rules. Primarily, we prove upper and lower bounds on complexity of provability in a broad class of these logics. To uniformly frame these results, we present two sets of rules, one intuitionistic and one classical, with the intention of capturing a broad subset of existing logics as fragments. We also prove equivalences of these systems in natural settings."],"dc:description.degree":["Doctor of Philosophy (PhD)"],"dc:identifier.uri":["https://repository.upenn.edu/handle/20.500.14332/60270"],"dc:language.iso":["en"],"dc:subject":["Mathematics"],"dc:title":["Subexponentials in Nonassociative Lambek Calculus"],"dc:type":["Dissertation/Thesis"]},"updated_at":"2026-07-24T03:45:15Z"}