This thesis is intended t0 help develop the theory 0f coalgebras by, Hrst, taking classic theorems in the theory 0f universal algebras amd dualizing them and, second, developing an interna] 10gic for categories 0f coalgebras. We begin with an introduction t0 the categorical approach t0 algebras and the dual 110tion 0f coalgebras. Following this, we discuss (c0)a,lg€bra.s for 2. (c0)monad and develop 2. theory 0f regular subcoalgebras which will be used in the interna] logic. We also prove that categories 0f (...) coalgebras are completc, under reasonably weak conditions, and simultaneously prove the wellknown dual result for categories 0f algebras. We dose the second chapter with 2. discussion 0f bisimulations in which we introduce a weaker 110tion 0f bisimulaticn than is current in the literature, but which is w€H—b€ha.v€d and reduces t0 the standard defmition under the assumption 0f choice. (shrink)

This work is a step toward the development of a logic for types and computation that includes not only the usual spaces of mathematics and constructions, but also spaces from logic and domain theory. Using realizability, we investigate a configuration of three toposes that we regard as describing a notion of relative computability. Attention is focussed on a certain local map of toposes, which we first study axiomatically, and then by deriving a modal calculus as its internal logic. The resulting (...) framework is intended as a setting for the logical and categorical study of relative computability. (shrink)

The well known Wiener-Kuratowski explicit definition of the ordered pair, which sets ⟨x, y⟩ = {{x}, {x, y}}, works well in many set theories but fails for those with classes which cannot be members of singletons. With the aid of the Axiom of Foundation, we propose a recursive definition of ordered pair which addresses this shortcoming and also naturally generalizes to ordered tuples of greater lenght. There are many advantages to the new definition, for it allows for uniform definitions working (...) equally well in a wide range of models for set theories. In ZFC and closely related theories, the of an ordered pair of two infinite sets under the new definition turns out to be equal to the maximum of the ranks of the sets. (shrink)

A somewhat fictionalized account of several interpretations of implication is presented together with comparisons between classical, modal, tense, and intuitionistic logics.

Starting from a generalization of the standard axioms for a monoid we present a stepwise development of various, mutually equivalent foundational axiom systems for category theory. Our axiom sets have been formalized in the Isabelle/HOL interactive proof assistant, and this formalization utilizes a semantically correct embedding of free logic in classical higher-order logic. The modeling and formal analysis of our axiom sets has been significantly supported by series of experiments with automated reasoning tools integrated with Isabelle/HOL. We also address the (...) relation of our axiom systems to alternative proposals from the literature, including an axiom set proposed by Freyd and Scedrov for which we reveal a technical issue (when encoded in free logic where free variables range over defined and undefined objects): either all operations, e.g. morphism composition, are total or their axiom system is inconsistent. The repair for this problem is quite straightforward, however. (shrink)

Say that space is ‘gunky’ if every part of space has a proper part. Traditional theories of gunk, dating back to the work of Whitehead in the early part of last century, modeled space in the Boolean algebra of regular closed subsets of Euclidean space. More recently a complaint was brought against that tradition in Arntzenius and Russell : Lebesgue measure is not even finitely additive over the algebra, and there is no countably additive measure on the algebra. Arntzenius advocated (...) modeling gunk in measure algebras instead—in particular, in the algebra of Borel subsets of Euclidean space, modulo sets of Lebesgue measure zero. But while this algebra carries a natural, countably additive measure, it has some unattractive topological features. In this paper, we show how to construct a model of gunk that has both nice rudimentary measure-theoretic and topological properties. We then show that in modeling gunk in this way we can distinguish between finite dimensions, and that nothing in lost in terms of our ability to identify points as locations in space. (shrink)