Related papers: Contraction-free proofs and finitary games for Lin…
Impartial subtraction games on the nonnegative integers have been studied by many and discussed in detail in for example the remarkable work Winning Ways by Conway, Berlekamp and Guy. We describe how comply variations of these games,…
This paper defines a new proof- and category-theoretic framework for classical linear logic that separates reasoning into one linear regime and two persistent regimes corresponding to ! and ?. The resulting linear/producer/consumer (LPC)…
Combinatory logic shows that bound variables can be eliminated without loss of expressiveness. It has applications both in the foundations of mathematics and in the implementation of functional programming languages. The original…
The framework of cyclic proof systems provides a reasonable proof system for logics with inductive definitions. It also offers an effective automated proof search procedure for such logics without finding induction hypotheses. Recent…
Defeasible logic is a rule-based nonmonotonic logic, with both strict and defeasible rules, and a priority relation on rules. We show that inference in the propositional form of the logic can be performed in linear time. This contrasts…
We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus for an impredicative logic -- in our case a sequent calculus for…
Cyclic proof theory breaks tradition by allowing certain infinite proofs: those that can be represented by a finite graph, while satisfying a soundness condition. We reconcile cyclic proofs with traditional finite proofs: we extend abstract…
In the folklore of linear logic, a common intuition is that the structure of finiteness spaces, introduced by Ehrhard, semantically reflects the strong normalization property of cut-elimination. We make this intuition formal in the context…
Nonlinear contraction theory is a comparatively recent dynamic control system design tool based on an exact differential analysis of convergence, in essence converting a nonlinear stability problem into a linear time-varying stability…
Relaxation theorems which apply to one, two and three-dimensional nonlinear elasticity are proved. We take into account the fact an infinite amount of energy is required to compress a finite line, surface or volume into zero line, surface…
Every finite group $G$ has a normal series each of whose factors is either a solvable group or a direct product of non-abelian simple groups. The minimum number of nonsolvable factors, attained on all possible such series in $G$, is called…
The takeoff point for this paper is the voluminous body of literature addressing recursive betting games with expected logarithmic growth of wealth being the performance criterion. Whereas almost all existing papers involve use of linear…
We study cutoff and lattice effects in the O(n) symmetric $\phi^4$ theory for a $d$-dimensional cubic geometry of size $L$ with periodic boundary conditions. In the large-N limit above $T_c$, we show that $\phi^4$ field theory at finite…
Client-server sessions are based on a variation of the traditional interpretation of linear logic propositions as session types in which non-linear channels (those regulating the interaction between a pool of clients and a single server)…
We continue our work on the model theory of free lattices, solving two of the main open problems from our first paper on the subject. Our main result is that the universal (existential) theory of infinite free lattices is decidable. Our…
We give a linear nested sequent calculus for the basic normal tense logic Kt. We show that the calculus enables backwards proof-search, counter-model construction and syntactic cut-elimination. Linear nested sequents thus provide the…
While one can in principle augment gravity theory with torsion, it is generally thought that any such torsion affects would be too small to be of consequence. Here we show that this cannot in general be the case. We show that the limit of…
It is usually accepted that General Relativity is the only consistent theory which can be obtained starting from the linear Fiertz-Pauli Lagrangian. It is the aim of the present paper to study whether, under certain requirements, a…
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…
Linear logic has provided new perspectives on proof-theory, denotational semantics and the study of programming languages. One of its main successes are proof-nets, canonical representations of proofs that lie at the intersection between…