Sciweavers

Share
SIGECOM
2011
ACM
220views ECommerce» more  SIGECOM 2011»
8 years 6 months ago
Multilateral matching
We introduce a matching model in which agents engage in joint ventures via multilateral contracts. This approach allows us to consider production complementarities previously outs...
John William Hatfield, Scott Duke Kominers
TFS
2008
109views more  TFS 2008»
9 years 2 months ago
Comments on "Fuzzy Probabilistic Approximation Spaces and Their Information Measures"
Some errors in our original paper in defining relative reduct with information measures are pointed out in this paper. It is shown that in our original work, Theorems 10 and 19 hol...
Qinghua Hu, Zongxia Xie, Daren Yu
MLQ
1998
126views more  MLQ 1998»
9 years 3 months ago
Reverse Mathematics and Recursive Graph Theory
We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theor...
William I. Gasarch, Jeffry L. Hirst
EJC
2002
9 years 3 months ago
On the Natural Imprint Function of a Graph
A subgraph H of a graph G is gated if for every x V(G) there exists a vertex u in H such that dG (x, v) = dG (x, u) + d G (u, v) for any v V(H). The gated amalgam of graphs G 1 an...
Bostjan Bresar
ARSCOM
2004
75views more  ARSCOM 2004»
9 years 3 months ago
On Theorems Equivalent with Kotzig's Result on Graphs with Unique 1-Factors
We show that several known theorems on graphs and digraphs are equivalent. The list of equivalent theorems include Kotzig's result on graphs with unique 1-factors, a lemma by...
Stefan Szeider
CJ
2006
78views more  CJ 2006»
9 years 3 months ago
A Very Mathematical Dilemma
Mathematics is facing a dilemma at its heart: the nature of mathematical proof. We have known since Church and Turing independently showed that mathematical provability was undeci...
Alan Bundy
CCA
2009
Springer
9 years 7 months ago
Effective Choice and Boundedness Principles in Computable Analysis
Abstract. In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can...
Vasco Brattka, Guido Gherardi
FSTTCS
1994
Springer
9 years 8 months ago
My Favorite Ten Complexity Theorems of the Past Decade
We review the past ten years in computational complexity theory by focusing on ten theorems that the author enjoyed the most. We use each of the theorems as a springboard to discus...
Lance Fortnow
MKM
2005
Springer
9 years 9 months ago
A Proof-Theoretic Approach to Hierarchical Math Library Organization
Abstract. The relationship between theorems and lemmas in mathematical reasoning is often vague. No system exists that formalizes the structure of theorems in a mathematical librar...
Kamal Aboul-Hosn, Terese Andersen
TARK
2007
Springer
9 years 10 months ago
Theorems and unawareness
This paper provides a set-theoretic model of knowledge and unawareness, in which reasoning through theorems is employed. A new property called Awareness Leads to Knowledge shows t...
Spyros Galanis
books