Related papers: Decidability of Existence and Construction of a Co…
An integral formula is developed which applies to an essentially arbitrary function. An application is made to the Riemann zeta function.
We consider contests with a large set (continuum) of participants and axiomatize contest success functions that arise when performance is composed of both effort and a random element, and when winners are those whose performance exceeds a…
This article discusses the possibility of predicting human behavior in a mechanism. Such a mechanism will have certain properties, which are defined and discussed here. Here it is shown that, unfortunately, certain property combinations are…
We prove that if two additive functions (from a certain class) take large values with roughly the same probability then they must be identical. This is a consequence of a structure theorem making clear the inter-relation between the…
When given a class of functions and a finite collection of sets, one might be interested whether the class in question contains any function whose domain is a subset of the union of the sets of the given collection and whose restrictions to…
We prove that a function definable with parameters in an o-minimal structure is bounded away from infinity as its argument goes to infinity by a function definable without parameters, and that this new function can be chosen independently…
Every orthonomic system of partial differential equations is known to possess a finite number of integrability conditions sufficient to ensure the validity of all. Herewith we offer an efficient algorithm to construct a sufficient set of…
The concept of efficiency plays a prominent role in the formal solution of decision problems that involve incomparable alternatives. This paper develops necessary and sufficient conditions for the efficient points in a sum of sets of…
We know extensions of first order logic by quantifiers of the kind "there are uncountable many ...", "most ..." with new axioms and appropriate semantics. Related are operations such as "set of x, such that ...", Hilbert's…
Traditional mathematical notation can lead to confusion. Expressions that appear to define composite functions sometimes do not. A particular example with engineering applications is studied in detail.
In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…
We provide a necessary and sufficient condition for rationalizable implementation of social choice functions, i.e., we offer a complete answer regarding what social choice functions can be rationalizably implemented.
This paper examines the concept of a combination rule for belief functions. It is shown that two fairly simple and apparently reasonable assumptions determine Dempster's rule, giving a new justification for it.
We present a necessary and sufficient condition for the topological equivalence of a continuous function on a plane to a projection onto one of coordinates.
We present an adequacy theorem for a concurrent extension of probabilistic GCL. The underlying denotational semantics is based on the so-called mixed powerdomains, which combine non-determinism with probabilistic behaviour. The theorem…
Targeting to use contract-based design for the specification and refinement of extra-functional properties, this research abstract suggests to use type constraints and dependent types to ensure correct and consistent top-down decomposition…
The purpose of this paper is to clarify the relationship between various conditions implying essential undecidability: our main result is that there exists a theory $T$ in which all partially recursive functions are representable, yet $T$…
We formulate some problems and conjectures about semigroups of rational functions under composition. The considered problems arise in different contexts, but most of them are united by a certain relationship to the concept of amenability.
Override and update are natural constructions for combining partial functions, which arise in various program specification contexts. We use an unexpected connection with combinatorial geometry to provide a complete finite system of…
The main purpose of this note is to provide a topological approach to defining additive functions on Riemannian co-compact normal coverings.