English
Related papers

Related papers: A Kripke Semantics for Hajek's BL

200 papers

The present paper investigates proof-theoretical and algebraic properties for the probability logic FP(L,L), meant for reasoning on the uncertainty of Lukasiewicz events. Methodologically speaking, we will consider a translation function…

Logic · Mathematics 2023-03-14 Tommaso Flaminio , Sara Ugolini

Bayesian reasoning plays a significant role both in human rationality and in machine learning. In this paper, we introduce transfinite modal logic, which combines modal logic with ordinal arithmetic, in order to formalize Bayesian reasoning…

Artificial Intelligence · Computer Science 2022-04-08 Xinyu Wang

We contribute the first denotational semantics of polymorphic dependent type theory extended by an equational theory for general (higher-order) reference types and recursive types, based on a combination of guarded recursion and…

Programming Languages · Computer Science 2023-04-13 Jonathan Sterling , Daniel Gratzer , Lars Birkedal

We give an analysis and generalizations of some long-established constructive completeness results in terms of categorical logic and pre-sheaf and sheaf semantics. The purpose is in no small part conceptual and organizational: from a few…

Logic · Mathematics 2017-09-19 Henrik Forssell , Christian Espíndola

For any ordinal \Lambda, we can define a polymodal logic GLP(\Lambda), with a modality [\xi] for each \xi<\Lambda. These represent provability predicates of increasing strength. Although GLP(\Lambda) has no Kripke models, Ignatiev showed…

Logic · Mathematics 2012-04-24 David Fernández-Duque , Joost J. Joosten

The paper presents a solution to the long-standing question about the decidability of the two-variable fragment of the superintuitionistic predicate logic $\mathbf{QLC}$ defined by the class of linear Kripke frames, which is also the…

Logic · Mathematics 2025-10-06 Mikhail Rybakov

This paper presents a new system of logic, LF, that is intended to be used as the foundation of the formalization of science. That is, deductive validity according to LF is to be used as the criterion for assessing what follows from the…

Logic · Mathematics 2024-01-23 Zachary Goodsell , Juhani Yli-Vakkuri

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…

Logic in Computer Science · Computer Science 2011-03-02 Zoran Majkic

We present a logic for reasoning about graded inequalities which generalizes the ordinary inequational logic used in universal algebra. The logic deals with atomic predicate formulas of the form of inequalities between terms and formalizes…

Logic in Computer Science · Computer Science 2015-03-24 Vilem Vychodil

Modal inclusion logic is the extension of basic modal logic with inclusion atoms, and its semantics is defined on Kripke models with teams. A team of a Kripke model is just a subset of its domain. In this paper we give a complete…

Logic in Computer Science · Computer Science 2015-09-25 Lauri Hella , Johanna Stumpf

In this paper, once recalled some properties of CMV-algebras, we introduce an expansion of the one-variable fragment of Lukasiewicz propositional logic whose algebraic semantics is the variety of CMV-algebras.

Logic · Mathematics 2011-09-21 Antonio Di Nola , Brunella Gerla , Ciro Russo

This paper is an appendix to the paper "Cut-free Calculi and Relational Semantics for Temporal STIT logics" by Berkel and Lyon, 2019. It provides the completeness proof for the basic STIT logic Ldm (relative to irreflexive, temporal Kripke…

Logic in Computer Science · Computer Science 2019-02-19 Kees van Berkel , Tim Lyon

We introduce hybrid algebras as algebraic semantics for hybrid languages with nominals and, possibly, the satisfaction operator. We establish a duality between hybrid algebras and the descriptive two-sorted general frames of Ten Cate. We…

Logic · Mathematics 2016-04-26 Willem Conradie , Claudette Robinson

We apply domino problems to give short proofs for some known theorems for the classical predicate logic and to obtain lower bounds for complexity of modal predicate logics defined by Noetherian orders as Kripke frames.

Logic · Mathematics 2023-06-27 M. Rybakov , D. Serova

We study the computational complexity of the parsing problem of a variant of Lambek Categorial Grammar that we call {\em semidirectional}. In semidirectional Lambek calculus $\SDL$ there is an additional non-directional abstraction rule…

cmp-lg · Computer Science 2008-02-03 Jochen Doerre

In this article, we define general normal forms for any logic that has propositional part and whose non-propositional connectives distribute over the finite disjunctions. We do not require the non-propositional connectives to be closed on…

Logic · Mathematics 2018-07-02 Mohamed Khaled

This paper provides a model theoretic semantics to feature terms augmented with set descriptions. We provide constraints to specify HPSG style set descriptions, fixed cardinality set descriptions, set-membership constraints, restricted…

cmp-lg · Computer Science 2008-02-03 Suresh Manandhar

We show that intuitionistic propositional logic is \emph{Carnap categorical}: the only interpretation of the connectives consistent with the intuitionistic consequence relation is the standard interpretation. This holds relative to the most…

Logic · Mathematics 2022-12-27 Haotian Tong , Dag Westerståhl

Continuing to pursue a research direction that we already explored in connection with G\"odel-Dummett logic and Ruspini partitions, we show here that {\L}ukasiewicz logic is able to express the notion of pseudo-triangular basis of fuzzy…

Logic in Computer Science · Computer Science 2013-11-26 Pietro Codara , Ottavio M. D'Antona , Vincenzo Marra

In this paper, we study Cyclic Henkin Logic CHL, a logic that can be described as provability logic without the third L\"ob condition, to wit, that provable implies provably provable (aka principle 4). The logic CHL does have full modalised…

Logic · Mathematics 2021-01-28 Albert Visser