相关论文: G-dinaturality

A method for the nonintrusive and structure-preserving model reduction of canonical and noncanonical Hamiltonian systems is presented. Based on the idea of operator inference, this technique is provably convergent and reduces to a…

Isomorphism between formulae is defined with respect to categories formalizing equality of deductions in classical propositional logic and in the multiplicative fragment of classical linear propositional logic caught by proof nets. This…

Any set of truth-functional connectives has sequent calculus rules that can be generated systematically from the truth tables of the connectives. Such a sequent calculus gives rise to a multi-conclusion natural deduction system and to a…

An irreducible canonical approach to second-class constraints reducible of an arbitrary order is given. This method generalizes our previous results from [Europhys. Lett. 50 (2000) 169, J. Phys. A: Math. Theor. 40 (2007) 14537] for first-…

Logical bilateralism challenges traditional concepts of logic by treating assertion and denial as independent yet opposed acts. While initially devised to justify classical logic, its constructive variants show that both acts admit…

This paper develops an algorithmic-based approach for proving inductive properties of propositional sequent systems such as admissibility, invertibility, cut-elimination, and identity expansion. Although undecidable in general, these…

We develop a new setting for the exponential principle in the context of multisort species, where indecomposable objects are generated intrinsically instead of being given in advance. Our approach uses the language of functors and natural…

Abduction is a fundamental and important form of non-monotonic reasoning. Given a knowledge base explaining how the world behaves it aims at finding an explanation for some observed manifestation. In this paper we focus on propositional…

We introduce Craig interpolation and related notions such as uniform interpolation, Beth definability, and theory decomposition in classical propositional logic. We present four approaches to computing interpolants: via quantifier…

We give two examples of categorical axioms asserting that a canonically defined natural transformation is invertible where the invertibility of any natural transformation implies that the canonical one is invertible. The first example is…

A direct reformulation of the Hamiltonian formalism in terms of the intrinsic geometry of infinitely prolonged differential equations is obtained. Concepts of spatial equation and spatial-gauge symmetry of a Lagrangian system of equations…

A concept of "guessability" is defined for sets of sequences of naturals. Eventually, these sets are thoroughly characterized. To do this, a nonstandard logic is developed, a logic containing symbols for the ellipsis as well as for…

We present a propositional logic with fundamental probabilistic semantics, in which each formula is given a real measure in the interval $[0,1]$ that represents its degree of truth. This semantics replaces the binarity of classical logic,…

The general uncertainty principle applied to gravity can be implemented as a set of modified Poisson brackets in the canonical formalism. As such, the theory is not canonical and the resulting equations of motion do not lead to a covariant…

Using arbitrary symplectic structures and parametrization invariant actions, we develop a formalism, based on Dirac's quantization procedure, that allows us to consider theories with both space-space as well as space-time noncommutativity.…

This paper presents a theory of systemic undecidability, reframing incomputability as a structural property of systems rather than a localized feature of specific functions or problems. We define a notion of causal embedding and prove a…

A detailed exposition of foundations of a logic-algebraic model for reasoning with knowledge bases specified by propositional (Boolean) logic is presented. The model is conceived from the logical translation of usual derivatives on…

We introduce dicodensity monads: a generalisation of pointwise codensity monads generated by functors to monads generated by mixed-variant bifunctors. Our construction is based on the notion of strong dinaturality (also known as Barr…

We present a comprehensive programme analysing the decomposition of proof systems for non-classical logics into proof systems for other logics, especially classical logic, using an algebra of constraints. That is, one recovers a proof…

Conformal and disformal transformations are now being very intensively studied in the context of various modified gravity theories. In particular, some special classes of them can be used for constructing Mimetic Dark Matter models.…