Algebra of constructions. I. The word problem for partial algebras (Q1107515)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4064958
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algebra of constructions. I. The word problem for partial algebras |
scientific article; zbMATH DE number 4064958 |
Statements
Algebra of constructions. I. The word problem for partial algebras (English)
0 references
1987
0 references
The paper presents an algebraic approach to abstract computing systems based on the lambda-calculus and cartesian closed categories. First, axioms of cartesian closed categories are formalized using the language of partial equational logic. Then, constructions of certain categories from words are presented, where partial operations are computable functions. A general formulation of the word problem for a theory in partial equational logic is provided, and the notions of a normal system and an algebra of constructions are defined. Decidability of the word problem for cartesian closed categories is proven in a new way, based on a construction of a normal system which is a recursive partial algebra as a free model of the theory of cartesian closed categories.
0 references
algebraic approach to abstract computing systems
0 references
lambda-calculus
0 references
cartesian closed categories
0 references
partial equational logic
0 references
word problem
0 references
normal system
0 references
algebra of constructions
0 references
recursive partial algebra
0 references
0.773841142654419
0 references
0.7702956199645996
0 references
