Related papers: Failure of Normalization in Impredicative Type The…
In this paper we present a transformation of finite propositional default theories into so-called propositional argumentation systems. This transformation allows to characterize all notions of Reiter's default logic in the framework of…
If a mathematical theory contains incompatible postulates then it is likely that the theory will produce theorems or results that are contradictory. It will be shown that this is the case with Dirac field theory. An example of such a…
We describe a type system for the linear-algebraic lambda-calculus. The type system accounts for the part of the language emulating linear operators and vectors, i.e. it is able to statically describe the linear combinations of terms…
We investigate whether the equivalence theorem in f(R)-type gravity is valid also in quantum theory. It is shown that, if the canonical quantization is assumed, equivalence does not hold in quantum theory.
We introduce a universe of regular datatypes with variable binding information, for which we define generic formation and elimination (i.e. induction /recursion) operators. We then define a generic alpha-equivalence relation over the types…
General relativity required the abandonment of Euclidean geometry. Here we show that quantum theory requires the abandonment of classical logic. We show that the Hilbert space representation of quantum theory is logically inevitable. There…
We give a simple and elegant proof of the Equivalence Theorem, stating that two field theories related by nonlinear field transformations have the same S matrix. We are thus able to identify a subclass of nonrenormalizable field theories…
We prove normalization for MTT, a general multimodal dependent type theory capable of expressing modal type theories for guarded recursion, internalized parametricity, and various other prototypical modal situations. We prove that deciding…
We study a conservative extension of classical propositional logic distinguishing between four modes of statement: a proposition may be affirmed or denied, and it may be strong or classical. Proofs of strong propositions must be…
We construct a realizability model of linear dependent type theory from a linear combinatory algebra. Our model motivates a number of additions to the type theory. In particular, we add a universe with two decoding operations: one takes…
This paper studies models in which hypothesis tests have trivial power, that is, power smaller than size. This testing impossibility, or impossibility type A, arises when any alternative is not distinguishable from the null. We also study…
The famous contradiction of a bijection between a set and its power set is a consequence of the impredicative definition involved. This is shown by the fact that a simple mapping between equivalent sets does also fail to satisfy the…
This paper presents and extends our type theoretical framework for a compositional treatment of natural language semantics with some lexical features like coercions (e.g. of a town into a football club) and copredication (e.g. on a town as…
We consider the following conjecture: if X is a smooth projective variety over a field of characteristic zero, then there is a dense set of reductions X_s to positive characteristic such that the action of the Frobenius morphism on the top…
Following and generalizing unpublished work of Ange, we prove a generalized version of R\'emond's generalized Vojta inequality. This generalization can be applied to arbitrary products of irreducible positive-dimensional projective…
For those of us who generally live in the world of syntax, semantic proof techniques such as reducibility, realizability or logical relations seem somewhat magical despite -- or perhaps due to -- their seemingly unreasonable effectiveness.…
We consider the problem of birationally modifying a morphism of complete varieties to make it a morphism from a nonsingular variety to a normal variety. Our main result is to give a counterexample to this problem. This example also is a…
At the heart of intuitionistic type theory lies an intuitive semantics called the "meaning explanations"; crucially, when meaning explanations are taken as definitive for type theory, the core notion is no longer "proof" but "verification".…
Little effort has been devoted to studying generalised notions or models of (un)predictability, yet is an important concept throughout physics and plays a central role in quantum information theory, where key results rely on the supposed…
We consider the following conjecture: if X is a smooth projective variety over a field of characteristic zero, then there is a dense set of reductions X_s of X to positive characteristic such that the action of the Frobenius morphism on the…