Best solving modal equations (Q1971794)
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 1423280
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Best solving modal equations |
scientific article; zbMATH DE number 1423280 |
Statements
Best solving modal equations (English)
0 references
6 December 2000
0 references
Classical propositional calculus enjoys the following property: for every formula \(A\), if there is a substitution \(\sigma\), such that \(\sigma(A)\) is provable, then there is ``the best'' substitution with this property. But for other logical calculi, for some modal calculi in particular, this property is not valid. However in many systems, like K4, S4, S4Grz, GL, etc., there are finitely many ``best substitutions'' for any formula admitting at least a unifier. In other words if an equation is solvable in the free algebra, then there are finitely many ``best solutions''. The author shows that such solutions can be effectively computed.
0 references
modal logic
0 references
\(E\)-unification
0 references
equations in free algebras
0 references
0 references
0.81893706
0 references
0.81621253
0 references
0 references
0 references
0.79193324
0 references
