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

We prove a new theorem of Tverberg type which confirms the conjecture of Blagojevic, Frick, and Ziegler about the existence of "balanced Tverberg partitions" (Conjecture 6.6 in, Tverberg plus constraints, Bull. London Math. Soc., 46 (2014)…

This paper will develop a single framework for unifying, simplifying and extending our prior results about axiom systems that retain a partial knowledge of their own consistency, via an axiomatic declaration of self-consistency. Its perhaps…

We present CLTLB(D), an extension of PLTLB (PLTL with both past and future operators) augmented with atomic formulae built over a constraint system D. Even for decidable constraint systems, satisfiability and Model Checking problem of such…

In this work we study line arrangements consisting in lines passing through three non-aligned points. We call them triangular arrangements. We prove that any combinatorics of a triangular arrangement is always realized by a…

We give different proofs and prove new results on the non complete solvability of some systems of complex first order p.d.e.'s, especially related to the analysis on CR manifolds.

We give combinatorial proofs of several recent results due to Merca on the sum of different parts congruent to $r$ modulo $m$ in all partitions of $n$. The proofs make use of some well known involutions from the literature and some new…

We explore various combinatorial problems mostly borrowed from physics, that share the property of being continuously or discretely integrable, a feature that guarantees the existence of conservation laws that often make the problems…

We present a unifying framework for type systems for process calculi. The core of the system provides an accurate correspondence between essentially functional processes and linear logic proofs; fragments of this system correspond to…

Higher-order unification has been shown to be undecidable. Miller discovered the pattern fragment and subsequently showed that higher-order pattern unification is decidable and has most general unifiers. We extend the algorithm to…

These notes derive a number of technical results on nonlinear contraction theory, a comparatively recent tool for system stability analysis. In particular, they provide new results on the preservation of contraction through system…

Non-classical negations may fail to be contradictory-forming operators in more than one way, and they often fail also to respect fundamental meta-logical properties such as the replacement property. Such drawbacks are witnessed by intricate…

We study the guarded negation fragment of transitive closure logic (GNTC). We show that the satisfiability problem for GNTC is 2ExpTime-complete, by establishing the following reductions: (i) a polynomial-time reduction from the…

We prove new existence and nonexistence results for modular Golomb rulers in this paper. We completely determine which modular Golomb rulers of order $k$ exist, for all $k\leq 11$, and we present a general existence result that holds for…

Tractability results for the model checking problem of logics yield powerful algorithmic meta theorems of the form: Every computational problem expressible in a logic $L$ can be solved efficiently on every class $\mathscr{C}$ of structures…

In this paper, we give a new axioms system based on nonseparable flats with their ranks to define a matroid. We deduce a polynomial time algorithm for deciding if a given matroid (respectively, arbitrary structure) is an uniform matroid.…

Equilibrium logic is an approach to nonmonotonic reasoning that extends the stable-model and answer-set semantics for logic programs. In particular, it includes the general case of nested logic programs, where arbitrary Boolean combinations…

Developing a system of parallel non-linear iterations, we establish the consistency of $\mathfrak{b}<\mathfrak{s}<\mathfrak{d}<\mathfrak{c}$ where $\mathfrak{b}, \mathfrak{d}, \mathfrak{c}$ are arbitrary subject to the known ZFC…

We present a systematic framework for noncommutative (NC) QFT within the new concept of relativistic invariance based on the notion of twisted Poincar\'e symmetry (with all 10 generators), as proposed in ref. [7]. This allows to formulate…

Admissible rules are shown to be conservatively preserved by the meet-combination of a wide class of logics. A basis is obtained for the resulting logic from bases given for the component logics. Structural completeness and decidability of…

We provide here a comprehensive proof that the so-called Labyrinth chaos systems, a member of the Thomas-R\"ossler (TR) class of systems do not admit a Hamiltonian; yet they admit a vector potential. The proof starts from the general case…