{"headerData":{"lastRefreshDate":"14 Apr 2026"},"publicationOverview":{"publication":{"id":"2615857E-7B2D-4271-BF26-7093DD1E5B06","resourceUrl":"http://gtr.ukri.org/api/publication/overview?outcomeid=doi_53cfccfccaa45b08&projectref=#grantRef#","outcomeId":"doi_53cfccfccaa45b08","title":"Computer Science Logic","parentPublicationTitle":null,"authors":[{"id":"1d8174f90b7c69a060912af027e0ba0b","resourceUrl":"http://gtr.ukri.org/api/person/1d8174f90b7c69a060912af027e0ba0b","firstName":null,"otherNames":"Aehlig K","surname":null,"email":null,"orcidId":null,"displayName":"Aehlig K","fullName":"Aehlig K"}],"date":1167609600000,"digitalPublicationUrl":"http://dx.doi.org/10.1007/978-3-540-74915-8_38","pubMedId":null,"pubMedUrl":null,"isbn":"978-3-540-74914-1","issn":null,"publicationUrl":"http://dx.doi.org/10.1007/978-3-540-74915-8_38","abstractText":null,"volume":null,"issue":null,"totalPages":null,"edition":null,"chapterNumber":null,"chapterTitle":"Propositional Logic for Circuit Classes","pageRef":"512-526","series":null,"type":"Book Chapter","firstAuthorName":"Aehlig K","grantRef":null},"projects":[{"id":"FAA6356E-3A5D-47E2-957B-77F72CDFD335","resourceUrl":"http://gtr.ukri.org/projects?ref=EP/D03809X/1","title":"Abstract Measures of Low-Level Computational Complexity","status":null,"grantReference":"EP/D03809X/1","grantCategory":"Research Grant","abstractText":null,"potentialImpactText":null,"fund":{"valuePounds":124992,"start":null,"end":null,"funder":{"id":"798CB33D-C79E-4578-83F2-72606407192C","resourceUrl":"http://gtr.ukri.org/api/organisation/798CB33D-C79E-4578-83F2-72606407192C","name":"EPSRC"},"type":"INCOME_ACTUAL"},"output":null,"publications":null,"identifiers":null,"technicalSummary":null,"projectHierarchy":null,"studentshipHierarchy":null,"healthCategories":[],"researchActivities":[],"researchSubjects":[],"researchTopics":[],"rcukProgrammes":[],"hasClassifications":false}],"abstractSnippet":null}}