Hybrid terms and sentences (Q1313083): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4052071 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The undecidability of the second-order unification problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hypervarieties of a given type / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Completeness in the theory of types / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Unification in Boolean rings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bases for equational theories of semi-groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Clones of term functions of lattices and Abelian groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4285329 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hyperidentities and hypervarieties / rank | |||
Normal rank |
Latest revision as of 12:33, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Hybrid terms and sentences |
scientific article |
Statements
Hybrid terms and sentences (English)
0 references
3 November 1994
0 references
Terms are built up from variables and operation symbols, hyperterms from variables and hypervariables. If one admits operation symbols and hypervariables simultaneously in a language, then one gets hybrid terms. Therefore the concept of hybrid terms is a generalization of hyperterms. In our approach we restrict the hypervariables respectively hyperpredicate variables to a fixed type. By this restriction a lot of problems become solvable, a fact which can also be concluded from Henkin's work on completeness. Furthermore we restrict the function symbols which are called hypervariables to terms. These hybrid logics have not the expressive power of a general second order logic. Nevertheless, proofs may be shorter and axiom systems may become finite in a hybrid logic. In this paper we present completeness theorems for hybrid logics, discuss the problem of finite axiomatization and study term rewriting and unification for two examples. These two examples are the variety of distributive lattices and the variety of 2-groups.
0 references
hybrid identity
0 references
hyperterms
0 references
operation symbols
0 references
hypervariables
0 references
hybrid terms
0 references
hybrid logics
0 references
completeness
0 references
finite axiomatization
0 references
term rewriting
0 references
unification
0 references
variety of distributive lattices
0 references
variety of 2- groups
0 references