Complexity and nicety of fluted logic (Q1612689)
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: Complexity and nicety of fluted logic |
scientific article; zbMATH DE number 1788481
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity and nicety of fluted logic |
scientific article; zbMATH DE number 1788481 |
Statements
Complexity and nicety of fluted logic (English)
0 references
26 August 2002
0 references
Fluted logic (FL) is a fragment of first-order logic in which variables play no essential role. The author shows that FL has the exponential-model property and that its satisfiability problem is NEXPTIME-complete. In addition, the author shows that FL has the interpolation property and that a consistent fluted sententence \(\phi\) is universal if and only if the models of \(\phi\) are closed under taking submodels.
0 references
fluted logic
0 references
first-order fragment
0 references
complexity
0 references
interpolation property
0 references
model preservation property
0 references
