UNIVERSAL ALGEBRA IN HIGHER TYPES

被引：37

作者：

MEINKE, K ^{[1
]}

机构：

[1] SWISS FED INST TECHNOL, MATH FORSCHUNGSINST, CH-8092 ZURICH, SWITZERLAND

来源：

THEORETICAL COMPUTER SCIENCE | 1992年 / 100卷 / 02期

关键词：

Automata Theory - Finite Automata - Computer Metatheory - Applications - Mathematical Techniques - Algebra;

D O I：

10.1016/0304-3975(92)90310-C

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We develop the elementary theory of higher-order universal algebra using the nonstandard approach to finite type theory introduced by Henkin. Basic results include: existence theorems for free and initial higher type algebras, a complete higher type equational calculus, and characterisation theorems for higher type equational and Horn classes.

引用

页码：385 / 417

页数：33

共 29 条

[1]

Barwise J., 1985, MODEL THEORETIC LOGI

[2] On the structure of abstract algebras [J].

Birkhoff, G .

PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1935, 31 :433-454

[3]

BROY M, 1987, LOGIC PROGRAMMING CA

[4]

BURSTALL RM, 1980, 1980 C REC LISP C, P136

[5]

Chang Chen-Chung, 1990, MODEL THEORY

[6]

FEFERMAN S, 1977, HDB MATH LOGIC

[7]

GANDY RO, 1977, LOGIC C 76

[8]

Goguen J. A., 1982, SIGPLAN Notices, V17, P9, DOI 10.1145/947886.947887

[9]

GORDON M, 1986, FORMAL ASPECTS VLSI

[10]

Harper Robert, 1986, STANDARD ML

← 1 2 3 →