Sciweavers

1322 search results - page 62 / 265
» Unsound Theorem Proving
Sort
View
CORR
2010
Springer
107views Education» more  CORR 2010»
13 years 7 months ago
A tight quantitative version of Arrow's impossibility theorem
The well-known Impossibility Theorem of Arrow asserts that any Generalized Social Welfare Function (GSWF) with at least three alternatives, which satisfies Independence of Irrelev...
Nathan Keller
DCG
2000
76views more  DCG 2000»
13 years 7 months ago
A Central Limit Theorem for Convex Chains in the Square
Points P1, . . . , Pn in the unit square define a convex n-chain if they are below y = x and, together with P0 = (0, 0) and Pn+1 = (1, 1), they are in convex position. Under unifo...
Imre Bárány, Günter Rote, Willi...
JAR
2010
160views more  JAR 2010»
13 years 6 months ago
MetiTarski: An Automatic Theorem Prover for Real-Valued Special Functions
Many theorems involving special functions such as ln, exp and sin can be proved automatically by MetiTarski: a resolution theorem prover modified to call a decision procedure for ...
Behzad Akbarpour, Lawrence C. Paulson
ACSD
2001
IEEE
134views Hardware» more  ACSD 2001»
13 years 11 months ago
Embedding Imperative Synchronous Languages in Interactive Theorem Provers
We present a new way to define the semantics of imperative synchronous languages by means of separating the control and the data flow. The control flow is defined by predicates th...
Klaus Schneider
GC
2007
Springer
13 years 7 months ago
An Ore-type analogue of the Sauer-Spencer Theorem
Two graphs G1 and G2 of order n pack if there exist injective mappings of their vertex sets into [n], such that the images of the edge sets do not intersect. Sauer and Spencer prov...
Alexandr V. Kostochka, Gexin Yu