Sciweavers

344 search results - page 22 / 69
» Some Theorems We Should Prove
Sort
View
CADE
2005
Springer
14 years 7 months ago
A Proof-Producing Decision Procedure for Real Arithmetic
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
Sean McLaughlin, John Harrison
TACAS
2009
Springer
128views Algorithms» more  TACAS 2009»
14 years 2 months ago
All-Termination(T)
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
Panagiotis Manolios, Aaron Turon
SIAMMA
2011
70views more  SIAMMA 2011»
13 years 2 months ago
Global Smooth Solutions of Euler Equations for Van der Waals Gases
We prove global in time existence of solutions of the Euler compressible equations for a Van der Waals gas when the density is small enough in Hm , for m large enough. To do so, w...
Magali Lécureux-Mercier
JELIA
2004
Springer
14 years 22 days ago
Knowledge-Theoretic Properties of Strategic Voting
Abstract. Results in social choice theory such as the Arrow and GibbardSatterthwaite theorems constrain the existence of rational collective decision making procedures in groups of...
Samir Chopra, Eric Pacuit, Rohit Parikh
JCT
2010
110views more  JCT 2010»
13 years 5 months ago
Pancyclicity of Hamiltonian and highly connected graphs
A graph G on n vertices is Hamiltonian if it contains a cycle of length n and pancyclic if it contains cycles of length for all 3 ≤ ≤ n. Write α(G) for the independence numbe...
Peter Keevash, Benny Sudakov