Abstract

I argue that the two-dimensional hyperintensions of epistemic topic-sensitive two-dimensional truthmaker semantics provide a compelling solution to the access problem. I countenance an abstraction principle for two-dimensional hyperintensions based on Voevodsky's Univalence Axiom and function type equivalence in Homotopy Type Theory. The truth of my first-order abstraction principle for two-dimensional hyperintensions is grounded in its being possibly recursively enumerable i.e. Turing computable and the Turing machine being physically implementable. I apply, further, modal rationalism in modal epistemology to solve the access problem. Epistemic possibility and hyperintensionality, i.e. conceivability, can be a guide to metaphysical possibility and hyperintensionality, when (i) epistemic worlds or epistemic hyperintensional states are interpreted as being centered metaphysical worlds or hyperintensional states, i.e. indexed to an agent, when (ii) the epistemic (hyper-)intensions and metaphysical (hyper-)intensions for a sentence coincide, i.e. the hyperintension has the same value irrespective of whether the worlds in the argument of the functions are considered as epistemic or metaphysical, and when (iii) sentences are said to consist in super-rigid expressions, i.e. rigid expressions in all epistemic worlds or states and in all metaphysical worlds or states. I argue that (i) and (ii) obtain in the case of the access problem.