130 research outputs found
Exhaustible sets in higher-type computation
We say that a set is exhaustible if it admits algorithmic universal
quantification for continuous predicates in finite time, and searchable if
there is an algorithm that, given any continuous predicate, either selects an
element for which the predicate holds or else tells there is no example. The
Cantor space of infinite sequences of binary digits is known to be searchable.
Searchable sets are exhaustible, and we show that the converse also holds for
sets of hereditarily total elements in the hierarchy of continuous functionals;
moreover, a selection functional can be constructed uniformly from a
quantification functional. We prove that searchable sets are closed under
intersections with decidable sets, and under the formation of computable images
and of finite and countably infinite products. This is related to the fact,
established here, that exhaustible sets are topologically compact. We obtain a
complete description of exhaustible total sets by developing a computational
version of a topological Arzela--Ascoli type characterization of compact
subsets of function spaces. We also show that, in the non-empty case, they are
precisely the computable images of the Cantor space. The emphasis of this paper
is on the theory of exhaustible and searchable sets, but we also briefly sketch
applications
Adelic line bundles over quasi-projective varieties
In this paper, we establish a theory of adelic line bundles over
quasi-projective varieties over finitely generated fields. Besides definitions
of adelic line bundles, we consider their intersection theory, volume theory,
and height theory, and apply these to study heights of algebraic points of
quasi-projective varieties.Comment: 224 page
Continuous R-valuations
We introduce continuous -valuations on directed-complete posets (dcpos,
for short), as a generalization of continuous valuations in domain theory, by
extending values of continuous valuations from reals to so-called Abelian
d-rags .
Like the valuation monad introduced by Jones and Plotkin, we
show that the construction of continuous -valuations extends to a strong
monad on the category of dcpos and Scott-continuous maps.
Additionally, and as in recent work by the two authors and C. Th\'eron, and by
the second author, B. Lindenhovius, M. Mislove and V. Zamdzhiev, we show that
we can extract a commutative monad out of it, whose elements
we call minimal -valuations.
We also show that continuous -valuations have close connections to
measures when is taken to be , the interval
domain of the extended nonnegative reals: (1) On every coherent topological
space, every non-zero, bounded -smooth measure (defined on the
Borel -algebra), canonically determines a continuous
-valuation; and (2) such a continuous
-valuation is the most precise (in a certain
sense) continuous -valuation that approximates
, when the support of is a compact Hausdorff subspace of a
second-countable stably compact topological space. This in particular applies
to Lebesgue measure on the unit interval. As a result, the Lebesgue measure can
be identified as a continuous -valuation.
Additionally, we show that the latter is minimal
Revisiting the Althusser/E. P. Thompson-Controversy: Towards a Marxist theory of communication
This essay revisits the controversy between Louis Althusser’s Marxist structuralism and Edward P. Thompson’s Marxist humanism. It draws conclusions from this controversy for the foundations of the Marxist theory of communication. The controversy’s key disagreements concern the questions of how the economic and the non-economic (the base/superstructure problem), as well as structures and agency are related. Whereas Althusser focuses on articulation and over-determination, Thompson stresses the role of experience in society in general, and class societies in particular. This essay reflects on how both these approaches relate to the role of communication in society and capitalism. Communication is a process in which humans produce and reproduce social relations in manners that mediate not just understanding the world and other humans, but also the dialectic of structure and agency and the dialectic of society’s realms. For a Marxist theory of society, also the forgotten meaning of communication as commoning is of crucial importance
Effective lambda-models vs recursively enumerable lambda-theories
A longstanding open problem is whether there exists a non syntactical model
of the untyped lambda-calculus whose theory is exactly the least lambda-theory
(l-beta). In this paper we investigate the more general question of whether the
equational/order theory of a model of the (untyped) lambda-calculus can be
recursively enumerable (r.e. for brevity). We introduce a notion of effective
model of lambda-calculus calculus, which covers in particular all the models
individually introduced in the literature. We prove that the order theory of an
effective model is never r.e.; from this it follows that its equational theory
cannot be l-beta or l-beta-eta. We then show that no effective model living in
the stable or strongly stable semantics has an r.e. equational theory.
Concerning Scott's semantics, we investigate the class of graph models and
prove that no order theory of a graph model can be r.e., and that there exists
an effective graph model whose equational/order theory is minimum among all
theories of graph models. Finally, we show that the class of graph models
enjoys a kind of downwards Lowenheim-Skolem theorem.Comment: 34
PCF extended with real numbers: a domain-theoretic approach to higher-order exact real number computation
We develop a theory of higher-order exact real number computation based on Scott domain theory. Our main object of investigation is a higher-order functional programming language, Real PCF, which is an extension of PCF with a data type for real numbers and constants for primitive real functions. Real PCF has both operational and denotational semantics, related by a computational adequacy property.
In the standard interpretation of Real PCF, types are interpreted as continuous Scott domains. We refer to the domains in the universe of discourse of Real PCF induced by the standard interpretation of types as the real numbers type hierarchy. Sequences are functions defined on natural numbers, and predicates are truth-valued functions. Thus, in the real numbers types hierarchy we have real numbers, functions between real numbers, predicates defined on real numbers, sequences of real numbers, sequences of sequences of real numbers, sequences of functions, functionals mapping sequences to numbers (such as limiting operators), functionals mapping functions to numbers (such as integration and supremum operators), functionals mapping predicates to truth-values (such as existential and universal quantification operators), and so on.
As it is well-known, the notion of computability on a domain depends on the choice of an effective presentation. We say that an effective presentation of the real numbers type hierarchy is sound if all Real PCF definable elements and functions are computable with respect to it. The idea is that Real PCF has an effective operational semantics, and therefore the definable elements and functions should be regarded as concretely computable. We then show that there is a unique sound effective presentation of the real numbers type hierarchy, up to equivalence with respect to the induced notion of computability. We can thus say that there is an absolute notion of computability for the real numbers type hierarchy.
All computable elements and all computable first-order functions in the real numbers type hierarchy are Real PCF definable. However, as it is the case for PCF, some higher-order computable functions, including an existential quantifier, fail to be definable. If a constant for the existential quantifier (or, equivalently, a computable supremum operator) is added, the computational adequacy property remains true, and Real PCF becomes a computationally complete programming language, in the sense that all computable functions of all orders become definable.
We introduce induction principles and recursion schemes for the real numbers domain, which are formally similar to the so-called Peano axioms for natural numbers. These principles and schemes abstractly characterize the real numbers domain up to isomorphism, in the same way as the so-called Peano axioms for natural numbers characterize the natural numbers. On the practical side, they allow us to derive recursive definitions of real functions, which immediately give rise to correct Real PCF programs (by an application of computational adequacy). Also, these principles form the core of the proof of absoluteness of the standard effective presentation of the real numbers type hierarchy, and of the proof of computational completeness of Real PCF.
Finally, results on integration in Real PCF consisting of joint work with Abbas Edalat are included
Althusser and Education
Louis Althusser's thinking laid the groundwork for critical educational theory, yet it is often misunderstood in critical pedagogy, sociology of education, and related fields. In this open access book, David I. Backer reexamines Althusser’s educational theory, specifically the claim that education is the most powerful ideological state apparatus in modern capitalist societies. He then presents this theory’s flawed reception in critical educational research and draws out a lost tradition of educational thinking it inspired with important applications to race, gender, ideology, and the concept of social structure in education. Correcting the record about Althusser’s thinking in the traditional narrative of critical educational research becomes an opportunity to revisit fundamental questions for thinking about school in its social context. For students and researchers of education, critical theory, sociology of education, and critical pedagogy, this book will be a resource for rethinking the social foundations of education, both as a field and as a set of theoretical frameworks for educational research. The eBook editions of this book are available open access under a CC BY-NC-ND 3.0 licence on bloomsburycollections.com
- …