Related papers: Correspondence Theory for Many-valued Modal Logic
This paper is about Kripke structures that are inside a relational database and queried with a modal language. At first the modal language that is used is introduced, followed by a definition of the database and relational algebra. Based on…
Ordinary and transfinite recursion and induction and ZF set theory are used to construct from a fully interpreted object language and from an extra formula a new language. It is fully interpreted under a suitably defined interpretation.…
We present a system to translate natural language sentences to formulas in a formal or a knowledge representation language. Our system uses two inverse lambda-calculus operators and using them can take as input the semantic representation…
To each quantum system, described by a von Neumann algebra of physical quantities, we associate a complete bi-Heyting algebra. The elements of this algebra represent contextualised propositions about the values of the physical quantities of…
The Langlands correspondence for complex curves is traditionally formulated in terms of sheaves rather than functions. Recently, Langlands asked whether it is possible to construct a function-theoretic version. In this paper we use the…
We propose a modal study of the notion of bisimulation. Our contribution is threefold. First, we extend the basic modal language with a new modality $\nbi$, whose intended meaning is universal quantification over all states that are…
The Hermite interpolation formulas are based on the interpretation of interpolation nodes as roots of suitable polynomials. Therefore, such formulas belong to the class of algebraic interpolations. The article considers a multidimensional…
We study abstract intermediate justification logics, that is arbitrary intermediate propositional logics extended with a subset of specific axioms of (classical) justification logics. For these, we introduce various semantics by combining…
We continue to develop a research line initiated in \cite{wollic22}, studying I/O logic from an algebraic approach based on subordination algebras. We introduce the classes of slanted (co-)Heyting algebras as equivalent presentations of…
In this paper, we deal with the problem of putting together modal worlds that operate in different logic systems. When evaluating a modal sentence $\Box \varphi$, we argue that it is not sufficient to inspect the truth of $\varphi$ in…
In this paper, we obtain an explicit formula for the theta correspondence of unipotent principal-series representations between an even orthogonal and a symplectic group or between general linear groups over a finite field. The formula is…
Based on the Bohr's correspondence principle it is shown that relativistic mechanics and quantum mechanics may be considered as generalizations of classical mechanics. A comparative description of relativistic and classical mechanics is…
Matching natural language sentences is central for many applications such as information retrieval and question answering. Existing deep models rely on a single sentence representation or multiple granularity representations for matching.…
In the paper, the question whether truth values can be assigned to the propositions before their verification is discussed. To answer this question, a notion of a propositionally noncontextual theory is introduced that in order to explain…
We consider categories of equivariant mixed Tate motives, where equivariant is understood in the sense of Borel. We give the two usual definitions of equivariant motives, via the simplicial Borel construction and via algebraic…
We show that the holographic Complexity = Volume proposal satisfies a very general notion of Momentum/Complexity correspondence (PC), based on the Momentum Constraint of General Relativity. It relates the rate of complexity variation with…
This paper presents an overview of close parallels that exist between the theory of positive operator-valued measures (POVMs) associated with a separable Hilbert space and the theory of frames on that space, including its most important…
We show that any multiple-valued function can be represented by a linear lambda term typed in a second-order polymorphic type system, using two distinct styles. The first is a circuit style, which mimics combinational circuits in switching…
We study the space of generalized translation invariant valuations on a finite-dimensional vector space and construct a partial convolution which extends the convolution of smooth translation invariant valuations. Our main theorem is that…
Sahlqvist formulas are a syntactically specified class of modal formulas proposed by Hendrik Sahlqvist in 1975. They are important because of their first-order definability and canonicity, and hence axiomatize complete modal logics. The…