Related papers: Proof-theoretic methods in quantifier-free definab…
Both propositional dependence logic and inquisitive logic are expressively complete. As a consequence, every formula with intuitionistic disjunction or intuitionistic implication can be translated equivalently into a formula in the language…
To ensure decidability and consistency of its type theory, a proof assistant should only accept terminating recursive functions and productive corecursive functions. Most proof assistants enforce this through syntactic conditions, which can…
Generalised quantifiers, which include Henkin's branching quantifiers, have been introduced by Mostowski and Lindstr\"om and developed as a substantial topic application of logic, especially model theory, to linguistics with work by…
In this note, two generalized corollaries to the LaSalle-Yoshizawa Theorem are presented for nonautonomous systems described by nonlinear differential equations with discontinuous right-hand sides. Lyapunov-based analysis methods are…
A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…
The main objective of this paper is to propose a definition of non-connective K-theory for a wide class of relative exact categories which, in general, do not satisfy the factorization axiom and confirm that it agrees with the…
In this paper, we introduce Linear Logic with a nondeterministic facility, which has a self-dual additive connective. In the system the proof net technology is available in a natural way. The important point is that nondeterminism in the…
This work deals with the definability problem by quantifier-free first-order formulas over a finite algebraic structure. We show the problem to be coNP-complete and present two decision algorithms based on a semantical characterization of…
The notion of a non-deterministic logical matrix (where connectives are interpreted as multi-functions) extends the traditional semantics for propositional logics based on logical matrices (where connectives are interpreted as functions).…
Possibilistic conditional independence is investigated: we propose a definition of this notion similar to the one used in probability theory. The links between independence and non-interactivity are investigated, and properties of these…
It is proved that if $T$ is a $\Sigma_{n+1}$ Definable theory which is $\Sigma_n$-sound and extends $PA$, then $T$ can not prove the sentence $\Sigma_n-sound(T)$ that expresses the $\Sigma_n$-soundness of $T$. Optimality of this result is…
In this paper we prove that no consistent finitely axiomatized theory one-dimensionally interprets its own extension with predicative comprehension. This constitutes a result with the flavor of the Second Incompleteness Theorem whose…
We develop a theory of adjunctions in semigroup categories, i.e. monoidal categories without a unit object. We show that a rigid semigroup category is promonoidal, and thus one can naturally adjoin a unit object to it. This extends the…
In proof-theoretic semantics, model-theoretic validity is replaced by proof-theoretic validity. Validity of formulae is defined inductively from a base giving the validity of atoms using inductive clauses derived from proof-theoretic rules.…
Let $\mathfrak M=(M,\mathcal X)$ be a model of $\mathsf{RCA}_0+\text{$\Sigma^0_2$-bounding}$ in which $\Sigma^0_2(A)$-induction fails for some $A\in\mathcal X$. We show that (i) if $\mathfrak M$ is a model of the combinatorial principle…
The present paper consists of two parts. In the first part, we prove a noncommutative analogue of the Riesz(-Markov-Kakutani) theorem on representation of functionals on an algebra of continuous functions by regular measures on the…
We construct cubic scalar field theory on $\lambda$-Minkowski space by combining the Batalin-Vilkovisky formalism with harmonic analysis, and produce two inequivalent noncommutative quantum field theories. The braided theory is based on a…
This is the second in a series of papers extending Martin-L\"{o}f's meaning explanation of dependent type theory to account for higher-dimensional types. We build on the cubical realizability framework for simple types developed in Part I,…
A theory T is tight if different deductively closed extensions of T (in the same language) cannot be bi-interpretable. Many well-studied foundational theories are tight, including PA [Visser2006], ZF, Z2, and KM [enayat2017]. In this…
On the perturbatively non-renormalizable and non-perturbatively finite examples (delta-function type potential in non-relativistic quantum mechanics and the mathematical model of the propagator by Redmond and Uretsky in quantum field…