An increasing amount of twenty-first century metaphysics is couched in explicitly hyperintensional terms. A prerequisite of hyperintensional metaphysics is that reality itself be hyperintensional: at the metaphysical level, propositions, properties, operators, and other elements of the type hierarchy, must be more fine-grained than functions from possible worlds to extensions. In this paper I develop, in the setting of type theory, a general framework for reasoning about the granularity of propositions and properties. The theory takes as primitive the notion of a (...) substitution on a proposition (property, etc.) and, among other things, uses this idea to elucidate a number of theoretically important distinctions. A class of structures are identified which can be used to model a wide range of positions about the granularity of reality; certain of these structures are seen to receive a natural treatment in the category of M-sets. (shrink)

In view of an enhancement of our implementation on the computer, we explore the possibility of an algorithmic optimization of the various proof-theoretic techniques employed by Kohlenbach for the synthesis of new effective uniform bounds out of established qualitative proofs in Numerical Functional Analysis. Concretely, we prove that the method of “colouring” some of the quantifiers as “non-computational” extends well to ε-arithmetization, elimination-of-extensionality and model-interpretation.

This is a study of the relative interpretability of the axiom of extensionality in the positive set theory. This work has to be considered in the line of works of R. O. Gandy, D. Scott and R. Hinnion who have studied the relative interpretability of the axiom of extensionality in set theories of Zermelo and Zermelo-Fraenkel.

In the present paper we use the theory of exact completions to study categorical properties of small setoids in Martin-Löf type theory and, more generally, of models of the Constructive Elementary Theory of the Category of Sets, in terms of properties of their subcategories of choice objects. Because of these intended applications, we deal with categories that lack equalisers and just have weak ones, but whose objects can be regarded as collections of global elements. In this context, we study the (...) internal logic of the categories involved, and employ this analysis to give a sufficient condition for the local cartesian closure of an exact completion. Finally, we apply this result to show when an exact completion produces a model of CETCS. (shrink)

A weak form of intuitionistic set theory WST lacking the axiom of extensionality is introduced. While WST is too weak to support the derivation of the law of excluded middle from the axiom of choice, we show that bee.ng up WST with moderate extensionality principles or quotient sets enables the derivation to go through.

Given classical (2 valued) structures and and a homomorphism h of onto , it is shown how to construct a (non-degenerate) 3-valued counterpart of . Classical sentences that are true in are non-false in . Applications to number theory and type theory (with axiom of infinity) produce finite 3-valued models in which all classically true sentences of these theories are non-false. Connections to relevant logic give absolute consistency proofs for versions of these theories formulated in relevant logic (the proof for (...) number theory was obtained earlier by R. K. Meyer and suggested the present abstract development). (shrink)