Related papers: G-dinaturality
It is shown how the canonical symmetry is used to look for the hierarchy of the Hamiltonian operators relevant to the system under consideration. It appears that only the invariance condition can be used to solve the problem.
Let $H$ be a separable complex Hilbert space. Denote by ${\mathcal G}_{\infty}(H)$ the Grassmannian consisting of closed linear subspaces with infinite dimension and codimension. This Grassmannian is partially ordered by the inclusion…
Argumentation is a non-monotonic process. This reflects the fact that argumentation involves uncertain information, and so new information can cause a change in the conclusions drawn. However, the base logic does not need to be…
In the style of Lindstr\"om's theorem for classical first-order logic, this article characterizes propositional bi-intuitionistic logic as the maximal (with respect to expressive power) abstract logic satisfying a certain form of…
Nonmonotonic logics are usually characterized by the presence of some notion of 'conditional' that fails monotonicity. Research on nonmonotonic logics is therefore largely concerned with the defeasibility of argument forms and the…
Ontologies formalise how the concepts from a given domain are interrelated. Despite their clear potential as a backbone for explainable AI, existing ontologies tend to be highly incomplete, which acts as a significant barrier to their more…
In [5], P. Lecomte conjectured the existence of a natural and conformally invariant quantization. In [7], we gave a proof of this theorem thanks to the theory of Cartan connections. In this paper, we give an explicit formula for the natural…
Although conventional logical systems based on logical calculi have been successfully used in mathematics and beyond, they have definite limitations that restrict their application in many cases. For instance, the principal condition for…
The propositional logic is generalized on the real numbers field. The logical analog of the Bernoulli independent tests scheme is constructed. The variant of the nonstandard analysis is adopted for the definition of the logical function,…
An irreducible canonical approach to reducible second-class constraints is given. The procedure is illustrated on gauge-fixed two-forms.
Our understanding about things is conceptual. By stating that we reason about objects, it is in fact not the objects but concepts referring to them that we manipulate. Now, so long just as we acknowledge infinitely extending notions such as…
Just as conventional functional programs may be understood as proofs in an intuitionistic logic, so quantum processes can also be viewed as proofs in a suitable logic. We describe such a logic, the logic of compact closed categories and…
The well-known gyrokinetic problem regards the perturbative expansion related to the dynamics of a charged particle subject to fast gyration motion due to the presence of a strong magnetic field. Although a variety of approaches have been…
We give an overview of some conceptual difficulties, sometimes called paradoxes, that have puzzled for years the physical interpetation of classical canonical gravity and, by extension, the canonical formulation of generally covariant…
The logic of bunched implication BI provides a framework for reasoning about resource composition and forms the basis for an assertion language of separation logic which is used to reason about software programs. Propositional BI is…
We develop a second-order extension of intuitionistic modal logic, allowing quantification over propositions, both syntactically and semantically. A key feature of second-order logic is its capacity to define positive connectives from the…
In one dimension, the theory of the $G$-normal distribution is well-developed, and many results from the classical setting have a nonlinear counterpart. Significant challenges remain in multiple dimensions, and some of what has already been…
Three elementary canonical transformations are shown both to have quantum implementations as finite transformations and to generate, classically and infinitesimally, the full canonical algebra. A general canonical transformation can, in…
Infinitary and cyclic proof systems are proof systems for logical formulas with fixed-point operators or inductive definitions. A cyclic proof system is a restriction of the corresponding infinitary proof system. Hence, these proof systems…
In the context of natural deduction for propositional classical logic, with classicality given by the inference rule reductio ad absurdum, we investigate the De Morgan translation of disjunction in terms of negation and conjunction. Once…