3,396 research outputs found
Independence in computable algebra
We give a sufficient condition for an algebraic structure to have a
computable presentation with a computable basis and a computable presentation
with no computable basis. We apply the condition to differentially closed, real
closed, and difference closed fields with the relevant notions of independence.
To cover these classes of structures we introduce a new technique of safe
extensions that was not necessary for the previously known results of this
kind. We will then apply our techniques to derive new corollaries on the number
of computable presentations of these structures. The condition also implies
classical and new results on vector spaces, algebraically closed fields,
torsion-free abelian groups and Archimedean ordered abelian groups.Comment: 24 page
Classical Control, Quantum Circuits and Linear Logic in Enriched Category Theory
We describe categorical models of a circuit-based (quantum) functional
programming language. We show that enriched categories play a crucial role.
Following earlier work on QWire by Paykin et al., we consider both a simple
first-order linear language for circuits, and a more powerful host language,
such that the circuit language is embedded inside the host language. Our
categorical semantics for the host language is standard, and involves cartesian
closed categories and monads. We interpret the circuit language not in an
ordinary category, but in a category that is enriched in the host category. We
show that this structure is also related to linear/non-linear models. As an
extended example, we recall an earlier result that the category of W*-algebras
is dcpo-enriched, and we use this model to extend the circuit language with
some recursive types
Generic Trace Semantics via Coinduction
Trace semantics has been defined for various kinds of state-based systems,
notably with different forms of branching such as non-determinism vs.
probability. In this paper we claim to identify one underlying mathematical
structure behind these "trace semantics," namely coinduction in a Kleisli
category. This claim is based on our technical result that, under a suitably
order-enriched setting, a final coalgebra in a Kleisli category is given by an
initial algebra in the category Sets. Formerly the theory of coalgebras has
been employed mostly in Sets where coinduction yields a finer process semantics
of bisimilarity. Therefore this paper extends the application field of
coalgebras, providing a new instance of the principle "process semantics via
coinduction."Comment: To appear in Logical Methods in Computer Science. 36 page
Inversion, Iteration, and the Art of Dual Wielding
The humble ("dagger") is used to denote two different operations in
category theory: Taking the adjoint of a morphism (in dagger categories) and
finding the least fixed point of a functional (in categories enriched in
domains). While these two operations are usually considered separately from one
another, the emergence of reversible notions of computation shows the need to
consider how the two ought to interact. In the present paper, we wield both of
these daggers at once and consider dagger categories enriched in domains. We
develop a notion of a monotone dagger structure as a dagger structure that is
well behaved with respect to the enrichment, and show that such a structure
leads to pleasant inversion properties of the fixed points that arise as a
result. Notably, such a structure guarantees the existence of fixed point
adjoints, which we show are intimately related to the conjugates arising from a
canonical involutive monoidal structure in the enrichment. Finally, we relate
the results to applications in the design and semantics of reversible
programming languages.Comment: Accepted for RC 201
First steps in synthetic guarded domain theory: step-indexing in the topos of trees
We present the topos S of trees as a model of guarded recursion. We study the
internal dependently-typed higher-order logic of S and show that S models two
modal operators, on predicates and types, which serve as guards in recursive
definitions of terms, predicates, and types. In particular, we show how to
solve recursive type equations involving dependent types. We propose that the
internal logic of S provides the right setting for the synthetic construction
of abstract versions of step-indexed models of programming languages and
program logics. As an example, we show how to construct a model of a
programming language with higher-order store and recursive types entirely
inside the internal logic of S. Moreover, we give an axiomatic categorical
treatment of models of synthetic guarded domain theory and prove that, for any
complete Heyting algebra A with a well-founded basis, the topos of sheaves over
A forms a model of synthetic guarded domain theory, generalizing the results
for S
On a question of Abraham Robinson's
In this note we give a negative answer to Abraham Robinson's question whether
a finitely generated extension of an undecidable field is always undecidable.
We construct 'natural' undecidable fields of transcendence degree 1 over Q all
of whose proper finite extensions are decidable. We also construct undecidable
algebraic extensions of Q that allow decidable finite extensions
- …