Diamond formulas: A fragment of dynamic logic with recursively enumerable validity problem (Q3734374)
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 3966038
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Diamond formulas: A fragment of dynamic logic with recursively enumerable validity problem |
scientific article; zbMATH DE number 3966038 |
Statements
Diamond formulas: A fragment of dynamic logic with recursively enumerable validity problem (English)
0 references
1984
0 references
regular programs
0 references
complete proof system for diamond formulas
0 references
recursive set of axioms
0 references
box formulas
0 references
0.7482620477676392
0 references
0.7385643124580383
0 references
