Sequent Computer Systems
Results: 4
# | Item |
---|---|
1![]() | Unbounded Proof-Length Speed-up in Deduction Modulo Guillaume Burel1 1 Universit´e Henri Poincar´e & LORIA2Add to Reading ListSource URL: www.ensiie.frLanguage: English - Date: 2015-01-06 05:30:45 |
2![]() | Differential Dynamic Logic for Verifying Parametric Hybrid Systems Andr´e Platzer1,2 1 University 2 CarnegieAdd to Reading ListSource URL: symbolaris.comLanguage: English - Date: 2014-08-04 10:08:58 |
3![]() | EN Case No COMP/M.1643 IBM / SEQUENT Only the English text is available and authentic.Add to Reading ListSource URL: ec.europa.euLanguage: English - Date: 2008-12-04 08:47:59 |
4![]() | ON THE PROOF COMPLEXITY OF DEEP INFERENCE PAOLA BRUSCOLI AND ALESSIO GUGLIELMI ABSTRACT. We obtain two results about the proof complexity of deep inference: 1) deep-inference proof systems are as powerful as Frege ones,Add to Reading ListSource URL: cs.bath.ac.ukLanguage: English - Date: 2009-04-19 15:07:07 |