Related papers: Inner Models from Extended Logics: Part 2
Explainability has been a challenge in AI for as long as AI has existed. With the recently increased use of AI in society, it has become more important than ever that AI systems would be able to explain the reasoning behind their results…
Generalizing some earlier techniques due to the second author, we show that Menas' theorem which states that the least cardinal kappa which is a measurable limit of supercompact or strongly compact cardinals is strongly compact but not…
Nonmonotonic logics are usually characterized by the presence of some notion of 'conditional' that fails monotonicity. Research on nonmonotonic logics is therefore largely concerned with the defeasibility of argument forms and the…
Permutations can be viewed as pairs of linear orders, or more formally as models over a signature consisting of two binary relation symbols. This approach was adopted by Albert, Bouvel and F\'eray, who studied the expressibility of…
New invariants for 2-dimensional cell complexes are defined, which can be interpreted as curvature bounds. These invariants are proved to be rational and computable in a companion article. This document is a survey that collects theorems…
The equivariant coarse index is well-understood and widely used for actions by discrete groups. We extend the definition of this index to general locally compact groups. We use a suitable notion of admissible modules over $C^*$-algebras of…
In this paper, we extend the control contraction metrics (CCM) approach, which was originally proposed for the universal tracking control of nonlinear systems, to those that evolves on Lie groups. Our idea is to view the manifold as a…
We compute Benois $\mathscr{L}$-invariants of weight $1$ cuspforms and of their adjoint representations and show how this extends Gross' $p$-adic regulator to Artin motives which are not critical in the sense of Deligne. Benois'…
Explainable AI (XAI) has a counterpart in analytical modeling which we refer to as model explainability. We tackle the issue of model explainability in the context of prediction models. We analyze a dataset of loans from a credit card…
In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…
Despite significant efforts towards extending the AGM paradigm of belief change beyond finitary logics, the computational aspects of AGM have remained almost untouched. We investigate the computability of AGM contraction on non-finitary…
In open-ended environments, autonomous learning agents must set their own goals and build their own curriculum through an intrinsically motivated exploration. They may consider a large diversity of goals, aiming to discover what is…
We study two extensions of FO2[<], first-order logic interpreted in finite words, in which formulas are restricted to use only two variables. We adjoin to this language two-variable atomic formulas that say, "the letter $a$ appears between…
We look at consciousness through the lens of Theoretical Computer Science, a branch of mathematics that studies computation under resource limitations, distinguishing functions that are efficiently computable from those that are not. From…
Active inference is a mathematical framework that originated in computational neuroscience. Recently, it has been demonstrated as a promising approach for constructing goal-driven behavior in robotics. Specifically, the active inference…
Let A be a commutative ring with 1/2 in A. In this paper, we define new characteristic classes for finitely generated projective A-modules V provided with a non degenerate quadratic form. These classes belong to the usual K-theory of A.…
Modal logics are widely used in computer science. The complexity of their satisfiability problems has been an active field of research since the 1970s. We prove that even very "simple" modal logics can be undecidable: We show that there is…
A new axiom is proposed, the Ground Axiom, asserting that the universe is not a nontrivial set forcing extension of any inner model. The Ground Axiom is first-order expressible, and any model of ZFC has a class forcing extension which…
We provide a complete system of analytic invariants for unfoldings of non-linearizable resonant complex analytic diffeomorphisms as well as its geometrical interpretation. In order to fulfill this goal we develop an extension of the Fatou…
We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…