相关论文: G-dinaturality
The theories defined by Lagrangians containing second time derivative are considered. It is shown that if the second derivatives enter only the terms multiplied by coupling constant one can consistently define the perturbative sector via…
Cut-elimination is the bedrock of proof theory with a multitude of applications from computational interpretations to proof analysis. It is also the starting point for important meta-theoretical investigations including decidability,…
G\"odel's Dialectica interpretation was designed to obtain a relative consistency proof for Heyting arithmetic, to be used in conjunction with the double negation interpretation to obtain the consistency of Peano arithmetic. In recent…
Making a linguistic theory is like making a programming language: one typically devises a type system to delineate the acceptable utterances and a denotational semantics to explain observations on their behavior. Via this connection, the…
We extend Robins' theory of causal inference for complex longitudinal data to the case of continuously varying as opposed to discrete covariates and treatments. In particular we establish versions of the key results of the discrete theory:…
We study how to infer new choices from previous choices in a conservative manner. To make such inferences, we use the theory of choice functions: a unifying mathematical framework for conservative decision making that allows one to impose…
The Dirac method of canonical quantization of theories with second class constraints has to be modified if the constraints depend on time explicitly. A solution of the problem was given by Gitman and Tyutin. In the present work we propose…
We generalise the termination method of higher-order polynomial interpretations to a setting with impredicative polymorphism. Instead of using weakly monotonic functionals, we interpret terms in a suitable extension of System F-omega. This…
This paper presents a way of formalising definite descriptions with a binary quantifier $\iota$, where $\iota x[F, G]$ is read as `The $F$ is $G$'. Introduction and elimination rules for $\iota$ in a system of intuitionist negative free…
We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is…
In the literature, the existence of Darboux polynomials and additional polynomial first integrals has been considered in the case of Hamiltonian systems. In this article such problem is formulated in the more general framework of Poisson…
The limiting transitions between different types of quantizations are studied by the deformation theory methods. We prove that for the first order coboundary deformation (g,g*_1 + x g*_2) of a Lie bialgebra (g,g*) one can always get the…
Sub-sub-intuitionistic logic is obtained from intuitionistic logic by weakening the implication and removing distributivity. It can alternatively be viewed as conditional weak positive logic. We provide semantics for sub-sub-intuitionistic…
Category theory gives a mathematical characterization of naturality but not of canonicity. The purpose of this paper is to develop the logical theory of canonical maps based on the broader demonstration that the dual notions of elements &…
This paper describes a formalism that subsumes Peterson's intermediate quantifier syllogistic system, and extends the ideas by van Eijck on Aristotle's logic. Syllogisms are expressed in a concise form making use of and extending the…
We resurrect a standard construction of analytical mechanics dating from the last century. The technique allows one to pass from any dynamical system whose first order evolution equations are known, and whose bracket algebra is not…
The hidden-variable question is whether or not various properties --- randomness or correlation, for example --- that are observed in the outcomes of an experiment can be explained via introduction of extra (hidden) variables which are…
A covariant quantization method for physical systems with reducible constraints is presented.
We consider extensions of the language of Peano arithmetic by transfinitely iterated truth definitions satisfying uniform Tarskian biconditionals. Without further axioms, such theories are known to be conservative extensions of the original…
Reachability Logic is a formalism that can be used, among others, for expressing partial-correctness properties of transition systems. In this paper we present three proof systems for this formalism, all of which are sound and complete and…