Sciweavers

425 search results - page 14 / 85
» The TPS Theorem Proving System
Sort
View
ECCC
2006
93views more  ECCC 2006»
14 years 9 months ago
On the Deduction Theorem and Complete Disjoint NP-Pairs
In this paper we ask the question whether the extended Frege proof system EF satisfies a weak version of the deduction theorem. We prove that if this is the case, then complete dis...
Olaf Beyersdorff
APAL
2008
95views more  APAL 2008»
14 years 9 months ago
The associated sheaf functor theorem in algebraic set theory
Abstract. We prove a version of the associated sheaf functor theorem in Algebraic Set Theory. The proof is established working within a Heyting pretopos equipped with a system of s...
Nicola Gambino
CORR
2010
Springer
84views Education» more  CORR 2010»
14 years 7 months ago
Rewriting and Well-Definedness within a Proof System
Term rewriting has a significant presence in various areas, not least in automated theorem proving where it is used as a proof technique. Many theorem provers employ specialised p...
Issam Maamria, Michael Butler
FS
2006
82views more  FS 2006»
14 years 9 months ago
A super-replication theorem in Kabanov's model of transaction costs
We prove a general version of the super-replication theorem, which applies to Kabanov's model of foreign exchange markets under proportional transaction costs. The market is ...
Luciano Campi, Walter Schachermayer
STACS
2010
Springer
15 years 4 months ago
Revisiting the Rice Theorem of Cellular Automata
Abstract. A cellular automaton is a parallel synchronous computing model, which consists in a juxtaposition of finite automata whose state evolves according to that of their neigh...
Pierre Guillon, Gaétan Richard