PBINT, a logic for modelling search problems involving arithmetic (Q4933335)
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: PBINT, a logic for modelling search problems involving arithmetic |
scientific article; zbMATH DE number 5798925
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | PBINT, a logic for modelling search problems involving arithmetic |
scientific article; zbMATH DE number 5798925 |
Statements
PBINT, A Logic for Modelling Search Problems Involving Arithmetic (English)
0 references
12 October 2010
0 references
0.6880553960800171
0 references
0.6794459223747253
0 references
0.6767107248306274
0 references
0.6700811386108398
0 references
