Related papers: Rich doctrines and Henkin's Theorem
We establish effective versions of Oppenheim's conjecture for generic inhomogeneous quadratic forms. We prove such results for fixed shift vectors and generic quadratic forms. When the shift is rational we prove a counting result which…
I outline a new theory of truth that resolves the classical and constructive versions of the liar paradox. The theory features a provably consistent axiomatization of a global self-applicative truth predicate. Truth is defined using…
Classical logic predicts that everything (thus nothing useful at all) follows from inconsistency. A paraconsistent logic is a logic where an inconsistency does not lead to such an explosion, and since in practice consistency is difficult to…
We show that the following two theories are equiconsistent: (T) ZFC, CH and "There is a dense ideal on the first uncountable cardinal such that if j is the generic embedding associated with it then its restriction on ordinals is independent…
In the theory of complex valued functions of a complex variable arguably the first striking theorem is that pointwise differentiability implies $C^{\infty}$ regularity. As mentioned in Ahlfors's standard textbook there have been a number of…
G\"odel's second incompleteness theorem is standardly understood as showing that no sufficiently strong, consistent theory of arithmetic can prove its own consistency, a result typically interpreted against a model-theoretic background in…
Representation theorems relate seemingly complex objects to concrete, more tractable ones. In this paper, we take advantage of the abstraction power of category theory and provide a general representation theorem for a wide class of…
The use of equilibrium models in economics springs from the desire for parsimonious models of economic phenomena that take human reasoning into account. This approach has been the cornerstone of modern economic theory. We explain why this…
Injectivity of objects with respect to a set $\ch$ of morphisms is an important concept of algebra, model theory and homotopy theory. Here we study the logic of injectivity consequences of $\ch$, by which we understand morphisms $h$ such…
Exponentiable functors between quantaloid-enriched categories are characterized in elementary terms. The proof goes as follows: the elementary conditions on a given functor translate into existence statements for certain adjoints that obey…
We prove a Model Existence Theorem for a fully infinitary logic for metric structures. This result is based on a generalization of the notions of approximate formulas and approximate truth in normed structures introduced by Henson and…
Deep neural networks come in many sizes and architectures. The choice of architecture, in conjunction with the dataset and learning algorithm, is commonly understood to affect the learned neural representations. Yet, recent results have…
We seek to find normative criteria of adequacy for nonmonotonic logic similar to the criterion of validity for deductive logic. Rather than stipulating that the conclusion of an inference be true in all models in which the premises are…
We define the notion of sheaf in the context of doctrines. We prove the associate sheaf functor theorem. We show that grothendieck toposes and toposes obtained by the tripos to topos construction are instances of categories of sheaves for a…
We introduce the subject of modal model theory, where one studies a mathematical structure within a class of similar structures under an extension concept that gives rise to mathematically natural notions of possibility and necessity. A…
We develop a theory for describing composite objects in physics. These can be static objects, such as tables, or things that happen in spacetime (such as a region of spacetime with fields on it regarded as being composed of smaller such…
We consider the problem of characterizing isomorphisms of types, or, equivalently, constructive cardinality of sets, in the simultaneous presence of disjoint unions, Cartesian products, and exponentials. Mostly relying on results about…
The purpose of this article is to formulate a number of probabilistic hidden-variable theorems, to provide proofs in some cases, and counterexamples to some conjectured relationships. The first theorem is the fundamental one. It asserts the…
We propose FC, a new logic on words that combines finite model theory with the theory of concatenation - a first-order logic that is based on word equations. Like the theory of concatenation, FC is built around word equations; in contrast…
We describe the layer of quantifier alternation depth at most one of the quantifier completion of a Boolean doctrine over a small category. This amounts to a doctrinal version of Herbrand's theorem for formulas with quantifier alternation…