Sciweavers

3571 search results - page 168 / 715
» Cohen and Set Theory
Sort
View
LOGCOM
2007
92views more  LOGCOM 2007»
15 years 6 months ago
Third-Order Computation and Bounded Arithmetic
Abstract. We describe a natural generalization of ordinary computation to a third-order setting and give a function calculus with nice properties and recursion-theoretic characteri...
Alan Skelley
APPML
2010
150views more  APPML 2010»
15 years 4 months ago
On some integral inequalities related to the Cauchy-Bunyakovsky-Schwarz inequality
Some new results that provide refinements and reverses of the Cauchy-Bunyakovsky-Schwarz (CBS) -inequality in the general setting of Measure Theory and under some boundedness condi...
N. S. Barnett, Sever Silvestru Dragomir, I. Gomm
JTAER
2008
200views more  JTAER 2008»
15 years 6 months ago
Exploring Relationships between Products Characteristics and B2C Interaction in Electronic Commerce
The main purpose of the paper is to explore and discuss the influence of product type on customer interaction in electronic commerce. We have conducted two qualitative case studie...
Karin Axelsson
ALDT
2009
Springer
144views Algorithms» more  ALDT 2009»
16 years 1 months ago
A Complete Conclusion-Based Procedure for Judgment Aggregation
Judgment aggregation is a formal theory reasoning about how a group of agents can aggregate individual judgments on connected propositions into a collective judgment on the same pr...
Gabriella Pigozzi, Marija Slavkovik, Leendert van ...
AML
2008
66views more  AML 2008»
15 years 6 months ago
Register computations on ordinals
We generalize ordinary register machines on natural numbers to machines whose registers contain arbitrary ordinals. Ordinal register machines are able to compute a recursive bounde...
Peter Koepke, Ryan Siders