Related papers: Interpretations of Linear Orderings in Presburger …
In the rapidly growing literature on explanation algorithms, it often remains unclear what precisely these algorithms are for and how they should be used. In this position paper, we argue for a novel and pragmatic perspective: Explainable…
The realization problem asks which algebras can be realized as the cohomology of spaces. We study this problem in the context of the orders in a graded rational exterior algebra on three generators. An order is a subring whose underlying…
In healthcare there is a pursuit for employing interpretable algorithms to assist healthcare professionals in several decision scenarios. Following the Predictive, Descriptive and Relevant (PDR) framework, the definition of interpretable…
We study the finite satisfiability problem for the two-variable fragment of first-order logic extended with counting quantifiers (C2) and interpreted over linearly ordered structures. We show that the problem is undecidable in the case of…
We calculate the possible Scott ranks of countable models of Peano arithmetic. We show that no non-standard model can have Scott rank less than $\omega$ and that non-standard models of true arithmetic must have Scott rank greater than…
We study transformational program logics for correctness and incorrectness that we extend to explicitly handle both termination and nontermination. We show that the logics are abstract interpretations of the right image transformer for a…
Probabilistic omega-automata are variants of nondeterministic automata for infinite words where all choices are resolved by probabilistic distributions. Acceptance of an infinite input word can be defined in different ways: by requiring…
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,…
In Chapter 3 of his Notes on constructive mathematics, Martin-L{\"o}f describes recursively constructed ordinals. He gives a constructively acceptable version of Kleene's computable ordinals. In fact, the Turing definition of computable…
We prove a cell decomposition theorem for Presburger sets and introduce a dimension theory for Z-groups with the Presburger structure. Using the cell decomposition theorem we obtain a full classification of Presburger sets up to definable…
We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…
Developing a suggestion by Russell, Prawitz showed how the usual natural deduction inference rules for disjunction, conjunction and absurdity can be derived using those for implication and the second order quantifier in propositional…
This work presents a new classifier that is specifically designed to be fully interpretable. This technique determines the probability of a class outcome, based directly on probability assignments measured from the training data. The…
For a real number $x$ and set of natural numbers $A$, define $x \ast A := \{ x a \bmod 1: a\in A\}\subseteq [0,1).$ We consider relationships between $x$, $A$, and the order-type of $x\ast A$. For example, for every irrational $x$ and…
In this paper, we explore connections between interpretable machine learning and learning theory through the lens of local approximation explanations. First, we tackle the traditional problem of performance generalization and bound the…
In this paper, we investigate the expressive power and the algorithmic properties of weighted expressions, which define functions from finite words to integers. First, we consider a slight extension of an expression formalism, introduced by…
This thesis studies arithmetic of linear algebraic groups. It involves studying the properties of linear algebraic groups defined over global fields, local fields and finite fields, or more generally the study of the linear algebraic groups…
Predictive coding has emerged as an influential normative model of neural computation, with numerous extensions and applications. As such, much effort has been put into mapping PC faithfully onto the cortex, but there are issues that remain…
We introduce the notion of pointwise coverage to measure the explainability properties of machine learning classifiers. An explanation for a prediction is a definably simple region of the feature space sharing the same label as the…
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,…