Decidability and undecidability results for propositional schemata (Q2996912)
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 5883657
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decidability and undecidability results for propositional schemata |
scientific article; zbMATH DE number 5883657 |
Statements
Decidability and Undecidability Results for Propositional Schemata (English)
0 references
4 May 2011
0 references
propositional formula schemata
0 references
iterations
0 references
tableau proofs
0 references
coding of Post correspondence problem
0 references
0.8795210123062134
0 references
0.8732558488845825
0 references
0.8409837484359741
0 references
0.8371143341064453
0 references
0.8298720121383667
0 references
