English
Related papers

Related papers: Unique Normal Forms in Infinitary Weakly Orthogona…

200 papers

We show that (local) confluence of terminating locally constrained rewrite systems is undecidable, even when the underlying theory is decidable. Several confluence criteria for logically constrained rewrite systems are known. These were…

Logic in Computer Science · Computer Science 2024-07-02 Jonas Schöpf , Fabian Mitterwallner , Aart Middeldorp

We consider a real two-fluid system of compressible viscous fluids with a common velocity field and algebraic closure for the pressure law. The constitutive relation involves densities of both fluids through an implicit function. The…

Analysis of PDEs · Mathematics 2026-02-24 Yang Li , Mária Lukáčová-Medvid'ová , Milan Pokorný , Ewelina Zatorska

The basic notions of category theory, such as limit, adjunction, and orthogonality, all involve assertions of the existence and uniqueness of certain arrows. Weak notions arise when one drops the uniqueness requirement and asks only for…

Category Theory · Mathematics 2012-05-25 Stephen Lack , Jiri Rosicky

We show how confluence criteria based on decreasing diagrams are generalized to ones composable with other criteria. For demonstration of the method, the confluence criteria of orthogonality, rule labeling, and critical pair systems for…

Logic in Computer Science · Computer Science 2024-08-07 Kiraku Shintani , Nao Hirokawa

We say that an infinite word w is weak abelian periodic if it can be factorized into finite words with the same frequencies of letters. In the paper we study properties of weak abelian periodicity, its relations with balance and frequency.…

Combinatorics · Mathematics 2013-02-19 Sergey Avgustinovich , Svetlana Puzynina

We introduce an operational rewriting-based semantics for strictly positive nested higher-order (co)inductive types. The semantics takes into account the "limits" of infinite reduction sequences. This may be seen as a refinement and…

Logic in Computer Science · Computer Science 2023-06-22 Łukasz Czajka

In this paper we propose and analyze a general arbitrarily high-order modified trapezoidal rule for a class of weakly singular integrals of the forms $I = \int_{\mathbb{R}^n}\phi(x)s(x)dx$ in $n$ dimensions, where $\phi\in…

Numerical Analysis · Mathematics 2022-08-23 Senbao Jiang , Xiaofan Li

We provide a systematic approach for deducing statistical limit laws via martingale-coboundary decomposition, for nonuniformly hyperbolic systems with slowly contracting and expanding directions. In particular, if the associated return time…

Dynamical Systems · Mathematics 2016-03-11 Ian Melbourne , Paulo Varandas

We show the existence and uniqueness as well as boundedness of weak solutions to linear elliptic equations with $L^2$-drifts of negative divergence and singular zero-order terms which are positive. Our main target is to show the…

Analysis of PDEs · Mathematics 2023-09-26 Haesung Lee

The notion of normal forms is ubiquitous in various equivalent transformations. Confluence (CR), one of the central properties of term rewriting systems (TRSs), concerns uniqueness of normal forms. Yet another such property, which is weaker…

Logic in Computer Science · Computer Science 2018-07-04 Takahito Aoto , Yoshihito Toyama

The (prefix-free) Kolmogorov complexity of a finite binary string is the length of the shortest description of the string. This gives rise to some `standard' lowness notions for reals: A is K-trivial if its initial segments have the lowest…

Logic · Mathematics 2014-10-15 Ian Herbert

It is conjectured that all decomposable (i.e. interior can be triangulated without adding new vertices) polyhedra with vertices in convex position are infinitesimally rigid and only recently has it been shown that this is indeed true under…

Differential Geometry · Mathematics 2024-04-29 Jilly Kevo

We extend the idea of weak measurements to the general case, provide a complete treatment and obtain results for both the regime when the pre-selected and post-selected states (PPS) are almost orthogonal and the regime when they are exactly…

Quantum Physics · Physics 2015-03-17 Shengjun Wu , Yang Li

Weakly recognizing morphisms from free semigroups onto finite semigroups are a classical way for defining the class of omega-regular languages, i.e., a set of infinite words is weakly recognizable by such a morphism if and only if it is…

Formal Languages and Automata Theory · Computer Science 2016-04-28 Lukas Fleischer , Manfred Kufleitner

We consider a class of dynamical systems, which we call weakly coarse expanding, which is a generalization to the postcritically infinite case of expanding Thurston maps as discussed by Bonk-Meyer and is closely related to coarse expanding…

Dynamical Systems · Mathematics 2022-11-29 Tushar Das , Feliks Przytycki , Giulio Tiozzo , Mariusz Urbanski , Anna Zdunik

Weak proregularity of an ideal in a commutative ring is a subtle generalization of the noetherian property of the ring. Weak proregularity is of special importance for the study of derived completion, and it occurs quite often in…

Commutative Algebra · Mathematics 2024-08-06 Amnon Yekutieli

We investigate properties of convergent and forward-closed string rewriting systems in the context of the syntactic criteria introduced in \cite{LynchMorawska} by Christopher Lynch and Barbara Morawska (we call these $LM$-Systems). Since a…

Logic in Computer Science · Computer Science 2016-06-02 Daniel S. Hono , Paliath Narendran , Rafael Veras

We introduce a class of finite tight frames called prime tight frames and prove some of their elementary properties. In particular, we show that any finite tight frame can be written as a union of prime tight frames. We then characterize…

Functional Analysis · Mathematics 2012-07-31 Jakob Lemvig , Christopher Miller , Kasso A. Okoudjou

Undecidability of various properties of first order term rewriting systems is well-known. An undecidable property can be classified by the complexity of the formula defining it. This gives rise to a hierarchy of distinct levels of…

Logic in Computer Science · Computer Science 2009-03-02 Joerg Endrullis , Herman Geuvers , Hans Zantema

Coherence theorems for covariant structures carried by a category have traditionally relied on the underlying term rewriting system of the structure being terminating and confluent. While this holds in a variety of cases, it is not a…

Category Theory · Mathematics 2007-05-31 Jonathan A. Cohen