A lower bound for the complexity of Craig's interpolants in sentinential logic.

Daniele Mundici

Archiv für mathematische Logik und Grundlagenforschung (1983)

  • Volume: 23, page 27-36
  • ISSN: 0003-9268

How to cite

top

Mundici, Daniele. "A lower bound for the complexity of Craig's interpolants in sentinential logic.." Archiv für mathematische Logik und Grundlagenforschung 23 (1983): 27-36. <http://eudml.org/doc/138004>.

@article{Mundici1983,
author = {Mundici, Daniele},
journal = {Archiv für mathematische Logik und Grundlagenforschung},
keywords = {complexity of boolean function; lower bound on complexity; Craig's interpolants; computation theory},
pages = {27-36},
title = {A lower bound for the complexity of Craig's interpolants in sentinential logic.},
url = {http://eudml.org/doc/138004},
volume = {23},
year = {1983},
}

TY - JOUR
AU - Mundici, Daniele
TI - A lower bound for the complexity of Craig's interpolants in sentinential logic.
JO - Archiv für mathematische Logik und Grundlagenforschung
PY - 1983
VL - 23
SP - 27
EP - 36
KW - complexity of boolean function; lower bound on complexity; Craig's interpolants; computation theory
UR - http://eudml.org/doc/138004
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.