Related papers: Tableau systems for some Ivlev-like (quantified) m…
Interval temporal logics provide a general framework for temporal reasoning about interval structures over linearly ordered domains, where intervals are taken as the primitive ontological entities. In this paper, we identify all fragments…
The importance of intuitionistic temporal logics in Computer Science and Artificial Intelligence has become increasingly clear in the last few years. From the proof-theory point of view, intuitionistic temporal logics have made it possible…
Although neural module networks have an architectural bias towards compositionality, they require gold standard layouts to generalize systematically in practice. When instead learning layouts and modules jointly, compositionality does not…
Generalized topological spaces are not necessarily closed under finite intersections. Moreover, the whole universe does not need to be open. We use modified version of this framework to establish certain models for non-normal modal logics.…
We discuss a family of Hamiltonians given by particular rational extensions of the singular oscillator in two-dimensions. The wave functions of these Hamiltonians can be expressed in terms of products of Laguerre and exceptional Jacobi…
This book introduces a temporal type theory, the first of its kind as far as we know. It is based on a standard core, and as such it can be formalized in a proof assistant such as Coq or Lean by adding a number of axioms. Well-known…
The work of M. S. Liv\v{s}ic and his collaborators in operator theory associates to a system of commuting nonselfadjoint operators an algebraic curve. Guided by the notion of rational transformation of algebraic curves, we define the notion…
We present a novel investigation into the consistency operator ($\circ$), traditionally associated with paraconsistent logics, as a means of capturing non-normal modal classicalities within the Kripke framework. By semantically…
We present the logic iJT4, which is an explicit version of intuitionistic S4 and establish soundness and completeness with respect to modular models.
Standpoint logics offer unified modal logic-based formalisms for representing multiple heterogeneous viewpoints. At the same time, many non-monotonic reasoning frameworks can be naturally captured using modal logics, in particular using the…
This work establishes a rigorous theoretical foundation for analyzing deep learning systems by leveraging Infinite Time Turing Machines (ITTMs), which extend classical computation into transfinite ordinal steps. Using ITTMs, we reinterpret…
We propose a new type of reduction for integrable systems of coupled matrix PDEs; this reduction equates one matrix variable with the transposition of another multiplied by an antisymmetric constant matrix. Via this reduction, we obtain a…
In this project, a rather complete proof-theoretical formalization of Lambek Calculus (non-associative with arbitrary extensions) has been ported from Coq proof assistent to HOL4 theorem prover, with some improvements and new theorems.…
In arXiv:1604.08705 we introduced the propositional modal logic $\textbf{TSC}$ (which stands for Turing Schmerl Calculus) which adequately describes the provable interrelations between different kinds of Turing progressions. In…
Traditional neural networks have an impressive classification performance, but what they learn cannot be inspected, verified or extracted. Neural Logic Networks on the other hand have an interpretable structure that enables them to learn a…
The paper studies problems of satisfiability, decidability and admissibility of inference rules, conceptions of knowledge and agent's knowledge in non-transitive temporal linear logic LTL(Past,m). We find algorithms solving mentioned…
We develop a theory of modulus sheaves with transfers, which generalizes Voevodsky's theory of sheaves with transfers. This paper and its sequel are foundational for the theory of motives with modulus, which is developed in [KMSY20].
Glivenko's theorem states that a formula is derivable in classical propositional logic $\mathrm{CL}$ iff under the double negation it is derivable in intuitionistic propositional logic $\mathrm{IL}$: $\mathrm{CL}\vdash\varphi$ iff…
Studies of modular linear differential equations (MLDE) for the classification of rational CFT characters have been limited to the case where the coefficient functions (in monic form) have no poles, or poles at special points of moduli…
We introduce a cohomology theory of grading-restricted vertex algebras. To construct the {\it correct} cohomologies, we consider linear maps from tensor powers of a grading-restricted vertex algebra to "rational functions valued in the…