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

Lorentz and CPT symmetry have been tested at high precision in numerous experiments. A general theoretical framework incorporating possible Lorentz and CPT violation in an extension of the standard model of particle physics has been…

Traces and their extension called combined traces (comtraces) are two formal models used in the analysis and verification of concurrent systems. Both models are based on concepts originating in the theory of formal languages, and they are…

This paper continues the author's previous study \cite{Kura20}, showing that several weak principles inspired by non-normal modal logic suffice to derive various refined forms of the second incompleteness theorem. Among the main results of…

Hybrid logic with binders is an expressive specification language. Its satisfiability problem is undecidable in general. If frames are restricted to N or general linear orders, then satisfiability is known to be decidable, but of…

We propose two new dependent type systems. The first, is a dependent graded/linear type system where a graded dependent type system is connected via modal operators to a linear type system in the style of Linear/Non-linear logic. We then…

We prove the complete intersection theorem and complete nontrivial-intersection theorem for systems of set partitions

Non-classical logics are used in a wide spectrum of disciplines, including artificial intelligence, computer science, mathematics, and philosophy. The de-facto standard infrastructure for automated theorem proving, the TPTP World, currently…

We explain some fundamental differences between the theories of mixed Hodge modules and mixed twistor modules (including the difference in weight system on the nearby cycle functor) which do not seem to be clarified explicitly in the…

We replace our earlier condition that physical states of the superstring have non-negative grading by the requirement that they are analytic in a new real commuting constant t which we associate with the central charge of the underlying…

We study the categorical framework for the computation of persistent homology, without reliance on a particular computational algorithm. The computation of persistent homology is commonly summarized as a matrix theorem, which we call the…

This paper is devoted to the study of the family of morphisms of vector bundle, defined by the systems equivalence to linear differential equations. It is proved, that the specified families of the morphisms of vector bundle is not…

I introduce an approach for automated reasoning in first order set theories that are not finitely axiomatizable, such as $ZFC$, and describe its implementation alongside the automated theorem proving software E. I then compare the results…

For a reduced hyperplane arrangement we prove the analytic Twisted Logarithmic Comparison Theorem, subject to mild combinatorial arithmetic conditions on the weights defining the twist. This gives a quasi-isomorphism between the twisted…

By using computer assistance, we prove that the fundamental group of the complement of a real complexified line arrangement is not determined by its intersection lattice, providing a counter-example for a problem of Falk and Randell. We…

Test response compaction for integrated circuits (ICs) with scan-based design-for-testability (DFT) support in the presence of unknown logic values (Xs) is investigated from a combinatorial viewpoint. The theoretical foundations of X-codes,…

The paper is devoted to modal properties of the ternary strict betweenness relation as used in the development of various systems of geometry. We show that such a relation is non-definable in a basic similarity type with a binary operator…

We introduce the notion of a combinatorial inverse system in non-commutative variables. We present two important examples, some conjectures and results. These conjectures and results were suggested and supported by computer investigations.

We derive new bounds of the remainder in a combinatorial central limit theorem without assumptions on independence and existence of moments of summands. For independent random variables our theorems imply Esseen and Berry-Esseen type…

The notion of a non-deterministic logical matrix (where connectives are interpreted as multi-functions) extends the traditional semantics for propositional logics based on logical matrices (where connectives are interpreted as functions).…

Networks of coupled LC oscillators that do not share a common ground node are studied. Both resistive coupling and inductive coupling are considered. For networks under resistive coupling, it is shown that the oscillator-coupler…