Related papers: Faithful Semitoric Systems
We prove that every quasi-projective semi log canonical pair has a quasi-log structure with several good properties. It implies that various vanishing theorems, torsion-free theorem, and the cone and contraction theorem hold for semi log…
We present a logical framework that enables us to define a formal theory of computational trust in which this notion is analysed in terms of epistemic attitudes towards the possible objects of trust and in relation to existing evidence in…
We suggest a construction that, given a trajectorial diffeomorphism between two Hamiltonian systems, produces integrals of them. As the main example we treat geodesic equivalence of metrics. We show that the existence of a non-trivially…
In this paper we study quasi-linear system of partial differential equations which describes the existence of the polynomial in momenta first integral of the integrable geodesic flow on 2-torus. We proved in [3] that this is a…
We describe rings over which every right module is almost injective. We give a description of rings over which every simple module is a almost projective.
A correspondence between 1) rank 2 completely integrable systems of Jacobians of algebraic curves and 2) (holomorphically) symplectic surfaces was established in a previous paper by the first author. A more general abelian variety that…
We explain how to incorporate the action of local integrals of motion into the fermionic basis for the sine-Gordon model and its UV CFT. The examples up to the level 4 are presented. Numerical computation support the results. Possible…
We construct a family of canonical connections and surrounding basic theory for almost complex manifolds that are equipped with an affine connection. This framework provides a uniform approach to treating a range of geometries. In…
The integration of reasoning and computation services across system and language boundaries is a challenging problem of computer science. In this paper, we use integration for the scenario where we have two systems that we integrate by…
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…
This article will be a continuation of our research into self-justifying systems. It will introduce several new theorems and their applications. (One of these results will transform our previous infinite-sized self-verifying formalisms into…
We introduce a flexible class of well-quasi-orderings (WQOs) on words that generalizes the ordering of (not necessarily contiguous) subwords. Each such WQO induces a class of piecewise testable languages (PTLs) as Boolean combinations of…
Numerical semigroups have been extensively studied throughout the literature, and many of their invariants have been characterized. In this work, we generalize some of the most important results about symmetry, pseudo-symmetry, or…
Valuation based systems verifying an idempotent property are studied. A partial order is defined between the valuations giving them a lattice structure. Then, two different strategies are introduced to represent valuations: as infimum of…
Generalizing supertropical algebras, we present a "layered" structure, "sorted" by a semiring which permits varying ghost layers, and indicate how it is more amenable than the "standard" supertropical construction in factorizations of…
Argumentation is one of the most popular approaches of defining a~non-monotonic formalism and several argumentation based semantics were proposed for defeasible logic programs. Recently, a new approach based on notions of conflict…
A class of left-invariant second order reversible systems with functional parameter is introduced which exhibits the phenomenon of robust integrability: an open and dense subset of the phase space is filled with invariant tori carrying…
This paper outlines a general formal framework for reasoning systems, intended to support future analysis of inference architectures across domains. We model reasoning systems as structured tuples comprising phenomena, explanation space,…
We describe several views of the semantics of a simple programming language as formal documents in the calculus of inductive constructions that can be verified by the Coq proof system. Covered aspects are natural semantics, denotational…
Parabolic almost conformally symplectic structures were introduced in the first part of this series of articles as a class of geometric structures which have an underlying almost conformally symplectic structure. If this underlying…