相关论文: Some results on combinators in the system TRC

We introduce a new class of extensions of terms that consists in navigation strategies and insertion of contexts. We introduce an operation of combination on this class which is associative, admits a neutral element and so that each…

In continuous first-order logic, the union of definable sets is definable but generally the intersection is not. This means that in any continuous theory, the collection of $\varnothing$-definable sets in one variable forms a…

In this paper, we study skew frame starters, which are strong frame starters that satisfy an additional "skew" property. We prove three new non-existence results for cyclic skew frame starters of certain types. We also construct several…

In this paper, we introduce the concept of a nested family of torsion pairs and will prove that this concept is strongly related to the existence of stratifying systems. Specifically, every stratifying system induces a nested family of…

A unified matrix-vector representation is developed of such solution concepts as the core, the uncovered, the uncaptured, the minimal weakly stable, the minimal undominated, the minimal dominant and the untrapped sets. We also propose…

We show that topological mixing, weak mixing and total transitivity are equivalent for coded systems. We provide an example of a mixing coded system which cannot be approximated by any increasing sequence of mixing shifts of finite type,…

In this paper we provide a unified combinatorial approach to establish a connection between Stirling permutations, cycle structures of permutations and perfect matchings. The main tool of our investigations is MY-sequences. In particular,…

We introduce a non-associative and non-commutative version of propositional intuitionistic linear logic, called propositional non-associative non-commutative intuitionistic linear logic (NACILL for short). We prove that NACILL and any of…

Mechanized verification of liveness properties for infinite programs with effects and nondeterminism is challenging. Existing temporal reasoning frameworks operate at the level of models such as traces and automata. Reasoning happens at a…

We explain how to deduce from recent results in the Minimal Model Program a general uniruledness theorem for base loci of adjoint divisors. We also show how to recover special cases by extending a technique introduced by Takayama.

We show that families of translation operators, where the translates grow exponentially fast, do not admit common hypercyclic functions. The result is close to be optimal.

We define triangulated factorization systems on triangulated categories, and prove that a suitable subclass thereof (the normal triangulated torsion theories) corresponds bijectively to $t$-structures on the same category. This result is…

Recently developed supersymmetric perturbation theory has been successfully employed to make a complete mathematical analysis the reason behind exact solvability of some non-central potentials. This investigation clarifies once more the…

Compositional verification algorithms are well-studied in the context of model checking. Properly selecting components for verification is important for efficiency, yet has received comparatively less attention. In this paper, we address…

We consider a logic used to describe sets of configurations of distributed systems, whose network topologies can be changed at runtime, by reconfiguration programs. The logic uses inductive definitions to describe networks with an unbounded…

The aim of this article is to generalize logics of formal inconsistency ($\textbf{LFI}$s) to systems dealing with the concept of incompatibility, expressed by means of a binary connective. The basic idea is that having two incompatible…

Subexponential logic is a variant of linear logic with a family of exponential connectives--called subexponentials--that are indexed and arranged in a pre-order. Each subexponential has or lacks associated structural properties of weakening…

We study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong…

In this paper, we develop a novel verification technique to reason about programs featuring concurrency, pointers and randomization. While the integration of concurrency and pointers is well studied, little is known about the combination of…

The superintegrability of a rational harmonic oscillator (non-central harmonic oscillator with rational ratio of frequencies) with non-linear "centrifugal" terms is studied. In the first part, the system is directly studied in the Euclidean…