{"title":"概念索引","authors":"Stefan Gandler","doi":"10.1163/9789004284685_026","DOIUrl":null,"url":null,"abstract":"A absolutely free extension constructor, 263 abstract algebraic institution, 218 fully algebra, 344 model, for FPL, 371 model specification, 336 theory, 227 reduction system, 69 abstraction condition, 218 data, 8, 325 rule, 56 abstractor implementation, see behavioural implementation adjoint left, 147 right, 152 adjunction, 151 admissible rule, 54 admitting amalgamation, 202 initial models, 219 method of diagrams, 217 model expansion, 193, 251 reachable initial models, 219 algebra, 3, 20 as model of program module, 7 of software system, ix, 3 Boolean, 46 compatible, 330 for FPL, 367 continuous, 92 equational logic for, 169 derived, 36 error, 80 fully abstract, 344 Heyting, 73 higher-order, 91 initial, 59 isomorphic, 24 many-sorted, 3, 20 order-sorted, 87 partial, 11, 83 homomorphism, see weak homomorphism product, 22 quotient, 26 reachable, 21 reduct, 34 w.r.t. derived signature morphism, 37 semi-computable, 71 term, 27 universal, x, xi word, see term algebra see also model algebraic signature, 19 morphism, 33 specification, xi, 1 theory, 104 α-conversion, 281 amalgamated union constructor, 270 of constructors, 270, 365 for FPL, 373","PeriodicalId":339046,"journal":{"name":"Moses Dobruska and the Invention of Social Philosophy","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Index of Concepts\",\"authors\":\"Stefan Gandler\",\"doi\":\"10.1163/9789004284685_026\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A absolutely free extension constructor, 263 abstract algebraic institution, 218 fully algebra, 344 model, for FPL, 371 model specification, 336 theory, 227 reduction system, 69 abstraction condition, 218 data, 8, 325 rule, 56 abstractor implementation, see behavioural implementation adjoint left, 147 right, 152 adjunction, 151 admissible rule, 54 admitting amalgamation, 202 initial models, 219 method of diagrams, 217 model expansion, 193, 251 reachable initial models, 219 algebra, 3, 20 as model of program module, 7 of software system, ix, 3 Boolean, 46 compatible, 330 for FPL, 367 continuous, 92 equational logic for, 169 derived, 36 error, 80 fully abstract, 344 Heyting, 73 higher-order, 91 initial, 59 isomorphic, 24 many-sorted, 3, 20 order-sorted, 87 partial, 11, 83 homomorphism, see weak homomorphism product, 22 quotient, 26 reachable, 21 reduct, 34 w.r.t. derived signature morphism, 37 semi-computable, 71 term, 27 universal, x, xi word, see term algebra see also model algebraic signature, 19 morphism, 33 specification, xi, 1 theory, 104 α-conversion, 281 amalgamated union constructor, 270 of constructors, 270, 365 for FPL, 373\",\"PeriodicalId\":339046,\"journal\":{\"name\":\"Moses Dobruska and the Invention of Social Philosophy\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-01-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Moses Dobruska and the Invention of Social Philosophy\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1163/9789004284685_026\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Moses Dobruska and the Invention of Social Philosophy","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1163/9789004284685_026","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Index of Concepts
A absolutely free extension constructor, 263 abstract algebraic institution, 218 fully algebra, 344 model, for FPL, 371 model specification, 336 theory, 227 reduction system, 69 abstraction condition, 218 data, 8, 325 rule, 56 abstractor implementation, see behavioural implementation adjoint left, 147 right, 152 adjunction, 151 admissible rule, 54 admitting amalgamation, 202 initial models, 219 method of diagrams, 217 model expansion, 193, 251 reachable initial models, 219 algebra, 3, 20 as model of program module, 7 of software system, ix, 3 Boolean, 46 compatible, 330 for FPL, 367 continuous, 92 equational logic for, 169 derived, 36 error, 80 fully abstract, 344 Heyting, 73 higher-order, 91 initial, 59 isomorphic, 24 many-sorted, 3, 20 order-sorted, 87 partial, 11, 83 homomorphism, see weak homomorphism product, 22 quotient, 26 reachable, 21 reduct, 34 w.r.t. derived signature morphism, 37 semi-computable, 71 term, 27 universal, x, xi word, see term algebra see also model algebraic signature, 19 morphism, 33 specification, xi, 1 theory, 104 α-conversion, 281 amalgamated union constructor, 270 of constructors, 270, 365 for FPL, 373