Pages that link to "Item:Q647339"
From MaRDI portal
The following pages link to Proof complexity of propositional default logic (Q647339):
Displayed 4 items.
- Restricted default theories: expressive power and outlier detection tasks (Q483301) (← links)
- Proof complexity of modal resolution (Q832717) (← links)
- Proof Complexity of Non-classical Logics (Q5894972) (← links)
- Sequent-type rejection systems for finite-valued non-deterministic logics (Q6080581) (← links)