WIL SHORT PAPERS AND ABSTRACTS: KEYWORD INDEX
| A | |
| automated reasoning | |
| Automatic Verification | |
| C | |
| classical linear logic | |
| Computability | |
| constraints | |
| constructivism | |
| Curry-Howard correspondence | |
| D | |
| deadlock-freedom | |
| DFA | |
| F | |
| FOL | |
| Free choice sequences | |
| G | |
| Geometry | |
| H | |
| higher-order logic | |
| I | |
| induction | |
| infinitary and cyclic systems | |
| internal and external calculi | |
| Intuitionistic mathematics | |
| Intuitionistic modal logic | |
| L | |
| Labelled sequents | |
| labelled systems | |
| LTLf | |
| M | |
| Mechanized proofs | |
| Meta-theory | |
| Modal logics | |
| MSO | |
| N | |
| nested systems | |
| Nuprl | |
| P | |
| pi-caclulus | |
| priorities | |
| Projective plane | |
| Proof theory | |
| Q | |
| qualitative spatial reasoning | |
| R | |
| Resolution | |
| S | |
| SAT | |
| sequent calculus | |
| session types | |
| systematicity | |
| T | |
| topologicai logics | |
| Transitive closure logic | |
| type theory | |
| U | |
| unification problem | |