Related papers: Class-Forcing in Class Theory
In recent times, reinforcement learning has produced baffling results when it comes to performing control tasks with highly non-linear systems. The impressive results always outweigh the potential vulnerabilities or uncertainties associated…
We present a framework for model theoretic forcing in a non-first-order context, and present some applications of this framework to Banach space theory.
We propose a variation of the notion of Segre class, by forcing a naive `inclusion-exclusion' principle to hold. The resulting class is computationally tractable, and is closely related to Chern-Schwartz-MacPherson classes. We deduce…
A folk theorem says higher order arithmetic has the proof theoretic strength of set theory with limited power set. This paper makes the theorem precise in terms of several axiom system based on ZF.
We present a novel treatment of set theory in a four-valued paraconsistent and paracomplete logic, i.e., a logic in which propositions can be both true and false, and neither true nor false. Our approach is a significant departure from…
Proper learning refers to the setting in which learners must emit predictors in the underlying hypothesis class $H$, and often leads to learners with simple algorithmic forms (e.g. empirical risk minimization (ERM), structural risk…
Let $\Lambda$ be an Artin algebra. In 2014, T. Adachi, O. Iyama and I. Reiten proved that the torsion funtorially finite classes in $\mathrm{mod}\,(\Lambda)$ can be described by the $\tau$-tilting theory. The aim of this paper is to…
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…
In this paper we prove that the maximum principle in forcing is equivalent to the axiom of choice. The maximum principle is the property of forcing: p ||- exists x theta(x) iff for some name tau p ||- theta(tau). We also look at three…
Classification theory of elementary classes deals with first order (elementary) classes of structures (i.e. fixing a set T of first order sentences, we investigate the class of models of T with the elementary submodel notion). It tries to…
We investigate the effects of various forcings on several forms of the Halpern-L\"auchli Theorem. For inaccessible $\kappa$, we show they are preserved by forcings of size less than $\kappa$. Combining this with work of Zhang in…
We determine the modal logic of fixed-point models of truth and their axiomatizations by Solomon Feferman via Solovay-style completeness results. Given a fixed-point model $\mathcal{M}$, or an axiomatization $S$ thereof, we find a modal…
We extend the formal framework of classifier models used in the legal domain. While the existing classifier framework characterises cases solely through the facts involved, legal reasoning fundamentally relies on both facts and rules,…
We present new induction principles for the syntax of dependent type theories, which we call relative induction principles. The result of the induction principle relative to a functor F into the syntax is stable over the codomain of F. We…
In the last few years appeared pedagogical propositional natural deduction systems. In these systems, one must satisfy the pedagogical constraint: the user must give an example of any introduced notion. First we expose the reasons of such a…
Recent work has unveiled a theory for reasoning about the decisions made by binary classifiers: a classifier describes a Boolean function, and the reasons behind an instance being classified as positive are the prime-implicants of the…
It is known that one can construct non-parametric functions by assuming classical axioms. Our work is a converse to that: we prove classical axioms in dependent type theory assuming specific instances of non-parametricity. We also address…
We study a class of theories in which space-time is treated classically, while interacting with quantum fields. These circumvent various no-go theorems and the pathologies of semi-classical gravity, by being linear in the density matrix and…
In this paper, we shall prove the Chung-Feller Theorem in several ways. We provide an inductive proof, bijective proof, and proofs using generating functions, and the Cycle Lemma of Dvoretzky and Motzkin.
The ability of a model to learn continually can be empirically assessed in different continual learning scenarios. Each scenario defines the constraints and the opportunities of the learning environment. Here, we challenge the current trend…