Related papers: A Constructive Examination of a Russell-style Rami…
We introduce a new model construction for Martin-L\"{o}f intensional type theory, which is sound and complete for the 1-truncated version of the theory. The model formally combines the syntactic model with a notion of realizability; it also…
The use of Extended Logics to replace ordinary second order definability in Kleene's {\em Ramified Analytical Hierarchy} is investigated. This mirrors a similar investigation of Kennedy, Magidor and V\"a\"an\"anen \cite{KeMaVa2016} where…
Shapiro's notations for natural numbers, and the associated desideratum of acceptability - the property of a notation that all recursive functions are computable in it - is well-known in philosophy of computing. Computable structure theory,…
The R-matrix formalism for the construction of integrable systems with infinitely many degrees of freedom is reviewed. Its application to Poisson, noncommutative and loop algebras as well as central extension procedure are presented. The…
We study the minimal number of ramified primes in Galois extensions of rational function fields over finite fields with prescribed finite Galois group. In particular, we obtain a general conjecture in analogy with the well studied case of…
We present a formalization of a version of Abadi and Plotkin's logic for parametricity for a polymorphic dual intuitionistic/linear type theory with fixed points, and show, following Plotkin's suggestions, that it can be used to define a…
We consider an infinite sequence of rooted trees naturally emerging in a number-theoretical context. We advance some ideas on its structure by discussing some elementary properties. Some of those properties are shown to be related to…
We present distributions of countable models and correspondent structural characteristics of complete theories with continuum many types: for prime models over finite sets relative to Rudin-Keisler preorders, for limit models over types and…
Tennenbaum's theorem states that the only countable model of Peano arithmetic (PA) with computable arithmetical operations is the standard model of natural numbers. In this paper, we use constructive type theory as a framework to revisit,…
This paper presents a theory of systemic undecidability, reframing incomputability as a structural property of systems rather than a localized feature of specific functions or problems. We define a notion of causal embedding and prove a…
Responsible use of Authorship Verification (AV) systems not only requires high accuracy but also interpretable solutions. More importantly, for systems to be used to make decisions with real-world consequences requires the model's…
The class of abelian $p$-groups are an example of some very interesting phenomena in computable structure theory. We will give an elementary first-order theory $T_p$ whose models are each bi-interpretable with the disjoint union of an…
We give a framework to produce constructible functions from natural functors between categories, without need of a morphism of moduli spaces to model the functor. We show using the Riemann-Hilbert correspondence that any natural (derived)…
In order to avoid well-know paradoxes associated with self-referential definitions, higher-order dependent type theories stratify the theory using a countably infinite hierarchy of universes (also known as sorts), Type$_0$ : Type$_1$ :…
We develop a novel formal theory of finite structures, based on a view of finite structures as a fundamental artifact of computing and programming, forming a common platform for computing both within particular finite structures, and in the…
We explore the relation between the positive dimensional irreducible components of the characteristic varieties of rank one local systems on a smooth surface and the associated (rational or irrational) pencils. Our study, which may viewed…
We present two Dialectica-like constructions for models of intensional Martin-L\"of type theory based on G\"odel's original Dialectica interpretation and the Diller-Nahm variant, bringing dependent types to categorical proof theory. We set…
We study randomness beyond $\Pi^1_1$-randomness and its Martin-L\"of type variant, introduced in \cite{MR2340241} and further studied in \cite{Continuous-higher-randomness}. The class given by the infinite time Turing machines (\ITTM s),…
We present a type theory combining both linearity and dependency by stratifying typing rules into a level for logics and a level for programs. The distinction between logics and programs decouples their semantics, allowing the type system…
We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve…