38,513 research outputs found
A Universal Approach to Self-Referential Paradoxes, Incompleteness and Fixed Points
Following F. William Lawvere, we show that many self-referential paradoxes,
incompleteness theorems and fixed point theorems fall out of the same simple
scheme. We demonstrate these similarities by showing how this simple scheme
encompasses the semantic paradoxes, and how they arise as diagonal arguments
and fixed point theorems in logic, computability theory, complexity theory and
formal language theory
Automatic estimation of flux distributions of astrophysical source populations
In astrophysics a common goal is to infer the flux distribution of
populations of scientifically interesting objects such as pulsars or
supernovae. In practice, inference for the flux distribution is often conducted
using the cumulative distribution of the number of sources detected at a given
sensitivity. The resulting "-" relationship can be used to
compare and evaluate theoretical models for source populations and their
evolution. Under restrictive assumptions the relationship should be linear. In
practice, however, when simple theoretical models fail, it is common for
astrophysicists to use prespecified piecewise linear models. This paper
proposes a methodology for estimating both the number and locations of
"breakpoints" in astrophysical source populations that extends beyond existing
work in this field. An important component of the proposed methodology is a new
interwoven EM algorithm that computes parameter estimates. It is shown that in
simple settings such estimates are asymptotically consistent despite the
complex nature of the parameter space. Through simulation studies it is
demonstrated that the proposed methodology is capable of accurately detecting
structural breaks in a variety of parameter configurations. This paper
concludes with an application of our methodology to the Chandra Deep Field
North (CDFN) data set.Comment: Published in at http://dx.doi.org/10.1214/14-AOAS750 the Annals of
Applied Statistics (http://www.imstat.org/aoas/) by the Institute of
Mathematical Statistics (http://www.imstat.org
Complete Additivity and Modal Incompleteness
In this paper, we tell a story about incompleteness in modal logic. The story
weaves together a paper of van Benthem, `Syntactic aspects of modal
incompleteness theorems,' and a longstanding open question: whether every
normal modal logic can be characterized by a class of completely additive modal
algebras, or as we call them, V-BAOs. Using a first-order reformulation of the
property of complete additivity, we prove that the modal logic that starred in
van Benthem's paper resolves the open question in the negative. In addition,
for the case of bimodal logic, we show that there is a naturally occurring
logic that is incomplete with respect to V-BAOs, namely the provability logic
GLB. We also show that even logics that are unsound with respect to such
algebras do not have to be more complex than the classical propositional
calculus. On the other hand, we observe that it is undecidable whether a
syntactically defined logic is V-complete. After these results, we generalize
the Blok Dichotomy to degrees of V-incompleteness. In the end, we return to van
Benthem's theme of syntactic aspects of modal incompleteness
An Integrated First-Order Theory of Points and Intervals over Linear Orders (Part II)
There are two natural and well-studied approaches to temporal ontology and
reasoning: point-based and interval-based. Usually, interval-based temporal
reasoning deals with points as a particular case of duration-less intervals. A
recent result by Balbiani, Goranko, and Sciavicco presented an explicit
two-sorted point-interval temporal framework in which time instants (points)
and time periods (intervals) are considered on a par, allowing the perspective
to shift between these within the formal discourse. We consider here two-sorted
first-order languages based on the same principle, and therefore including
relations, as first studied by Reich, among others, between points, between
intervals, and inter-sort. We give complete classifications of its
sub-languages in terms of relative expressive power, thus determining how many,
and which, are the intrinsically different extensions of two-sorted first-order
logic with one or more such relations. This approach roots out the classical
problem of whether or not points should be included in a interval-based
semantics. In this Part II, we deal with the cases of all dense and the case of
all unbounded linearly ordered sets.Comment: This is Part II of the paper `An Integrated First-Order Theory of
Points and Intervals over Linear Orders' arXiv:1805.08425v2. Therefore the
introduction, preliminaries and conclusions of the two papers are the same.
This version implements a few minor corrections and an update to the
affiliation of the second autho
Kolmogorov Complexity in perspective. Part I: Information Theory and Randomnes
We survey diverse approaches to the notion of information: from Shannon
entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov
complexity are presented: randomness and classification. The survey is divided
in two parts in the same volume. Part I is dedicated to information theory and
the mathematical formalization of randomness based on Kolmogorov complexity.
This last application goes back to the 60's and 70's with the work of
Martin-L\"of, Schnorr, Chaitin, Levin, and has gained new impetus in the last
years.Comment: 40 page
Reasons and Means to Model Preferences as Incomplete
Literature involving preferences of artificial agents or human beings often
assume their preferences can be represented using a complete transitive binary
relation. Much has been written however on different models of preferences. We
review some of the reasons that have been put forward to justify more complex
modeling, and review some of the techniques that have been proposed to obtain
models of such preferences
- …