| inria-00371959, version 2 |
| arXiv:0904.0071 |
|
|
| See detailed view | BibTeX EndNote TEI RefWorks |
|
|
|||||||||
| We introduce a notion of Kripke model for classical logic for which we constructively prove soundness and cut-free completeness. We discuss the novelty of the notion and its potential applications. |
|
|
|
|
|
|
|
|
| 1: | Preuves, Programmes et Systèmes (PPS) |
| CNRS : UMR7126 – Université Paris-Diderot - Paris VII | |
| 2: | PI.R2 (INRIA Paris - Rocquencourt) |
| INRIA – Université Paris-Diderot - Paris VII – CNRS : UMR7126 | |
| 3: | Laboratoire d'informatique de l'école polytechnique (LIX) |
| CNRS : UMR7161 – Polytechnique - X | |
| 4: | Research On Software Analysis for Error-free Computing (ROSAEC) |
| Seoul National University |
|
|
|
|
|
|
|
|
| Domain | : | Mathematics/Logic |
| Kripke model – classical logic – sequent calculus – lambda mu calculus – classical realizability – normalization by evaluation |
| Available versions: | v1 (2009-04-01) | v2 (2009-10-12) |
| inria-00371959, version 2 | |
| http://hal.inria.fr/inria-00371959/en/ | |
| oai:hal.inria.fr:inria-00371959_v2 | |
| From: Danko Ilik | |
| Submitted on: Monday, 12 October 2009 10:00:08 | |
| Updated on: Monday, 12 October 2009 11:59:59 | |