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 条

[11]

HATCHER WS, 1982, LOGICAL F MATH

[12]

Henkin Leon, 1950, J SYMBOLIC LOGIC, V15, P81

[13]

Jech T., 1978, SET THEORY

[14]

Kreisel G., 1967, ELEMENTS MATH LOGIC

[15]

MAIBAUM TSE, 1980, J COMPUTER INFORMATI, V9, P31

[16]

Mal'cev AI, 1973, ALGEBRAIC SYSTEMS, DOI 10.1515/9783112611227

[17]

MALCOLM WG, 1973, P LOND MATH SOC, V27, P617

[18]

MEINKE K, 1988, LECT NOTES COMPUT SC, V335, P163

[19]

MEINKE K, 1990, HDB LOGIC COMPUTER S

[20]

MILLER DA, 1986, MSCIS8617 U PENNS DE

← 1 2 3 →