On complexity of problem of satisfiability for systems of countable-valued functional equations (Q905075)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On complexity of problem of satisfiability for systems of countable-valued functional equations |
scientific article; zbMATH DE number 6530118
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On complexity of problem of satisfiability for systems of countable-valued functional equations |
scientific article; zbMATH DE number 6530118 |
Statements
On complexity of problem of satisfiability for systems of countable-valued functional equations (English)
0 references
14 January 2016
0 references
The authors prove that the problem of satisfiability for the system of functional equations over the set \(\{ p\}\) belongs to the class \(\prod_1 \) of Kleene-Mostowski arithmetical hierarchy. As a result, they show that the set of all satisfiable systems of functional equations over \(\{ p\}\) is an \(m\)-complete set in the class \(\prod_1 \) of the Kleene-Mostowski hierarchy.
0 references
system of functional equations
0 references
countable-valued logic
0 references
problem of satisfiability
0 references
Kleene-Mostowski arithmetical hierarchy
0 references
0 references
0.8598968386650085
0 references
0.8192762732505798
0 references
0.7442057132720947
0 references
0.743050754070282
0 references
