Related papers: Finite Kripke models and provability interpretatio…
We propose a new definition of the representation theorem for many-valued logics, with modal operators as well, and define the stronger relationship between algebraic models of a given logic and relational structures used to define the…
We describe and prove correctness of two practical algorithms for finding indecomposable summands of finitely generated modules over a finitely generated k-algebra R. The first algorithm applies in the (multi)graded case, which enables the…
This article describes an evaluation of Automated Theorem Proving (ATP) systems on problems taken from the QMLTP library of first-order modal logic problems. Principally, the problems are translated to both typed first-order and…
We give a calculus for reasoning about the first-order fragment of classical logic that is adequate for giving the truth conditions of intuitionistic Kripke frames, and outline a proof-theoretic soundness and completeness proof, which we…
In this paper, we introduce a foundation for computable model theory of rational Pavelka logic (an extension of {\L}ukasiewicz logic) and continuous logic, and prove effective versions of some theorems in model theory. We show how to reduce…
For a countable-state Markov decision process we introduce an embedding which produces a finite-state Markov decision process. The finite-state embedded process has the same optimal cost, and moreover, it has the same dynamics as the…
We present a categorical theory of the composition methods in finite model theory -- a key technique enabling modular reasoning about complex structures by building them out of simpler components. The crucial results required by the…
We consider probabilistic topic models and more recent word embedding techniques from a perspective of learning hidden semantic representations. Inspired by a striking similarity of the two approaches, we merge them and learn probabilistic…
In this paper, we introduce $\textit{partial}$ dependency modality $\mathcal{D}$ into epistemic logic so as to reason about $\textit{partial}$ dependency relationship in Kripke models. The resulted dependence epistemic logic possesses…
In this work, we present a logical formalism for reasoning about quantum systems in finite dimension. Contrary to the usual approach in quantum logic, our formalism is based classical first-order logic, which allows us to use the tools of…
We investigate the structure and representation theory of finite-dimensional $\mathbb{Z}$-graded Lie algebras, including the corresponding root systems and Verma, irreducible, and Harish-Chandra modules. This extends the familiar theory for…
In this paper we prove soundness and completeness of some epistemic extensions of G\"odel fuzzy logic, based on Kripke models in which both propositions at each state and accessibility relations take values in [0,1]. We adopt belief as our…
The interpretation of propositional dynamic logic (PDL) through Kripke models requires the relations constituting the interpreting Kripke model to closely observe the syntax of the modal operators. This poses a significant challenge for an…
In this work we study the decidability of a class of global modal logics arising from Kripke frames evaluated over certain residuated lattices, known in the literature as modal many-valued logics. We exhibit a large family of these modal…
Crispin Wright in his 1982 paper argues for strict finitism, a constructive standpoint that is more restrictive than intuitionism. In its appendix, he proposes models of strict finitistic arithmetic. They are tree-like structures, formed in…
In this paper, we introduce a translation that combines the $j$-translation with Kripke forcing in the internal logic of an elementary topos. First, we show that our translation is sound for intuitionistic first-order logic and Heyting…
The theory of finitely supported algebraic structures is related to Pitts theory of nominal sets (by equipping finitely supported sets with finitely supported internal algebraic laws). It represents a reformulation of Zermelo Fraenkel set…
We investigate the end extendibility of models of arithmetic with restricted elementarity. By utilizing the restricted ultrapower construction in the second-order context, for each $n\in\mathbb{N}$ and any countable model of…
Formal reasoning about inductively defined relations and structures is widely recognized not only for its mathematical interest but also for its importance in computer science, and has applications in verifying properties of programs and…
We propose an epistemic approach to formalizing statistical properties of machine learning. Specifically, we introduce a formal model for supervised learning based on a Kripke model where each possible world corresponds to a possible…